/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/toy.cil.c


--------------------------------------------------------------------------------


This is Ultimate 0.1.24-6598664
[2019-11-23 22:49:24,433 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-11-23 22:49:24,436 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-11-23 22:49:24,455 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-11-23 22:49:24,455 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-11-23 22:49:24,457 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-11-23 22:49:24,459 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-11-23 22:49:24,471 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-11-23 22:49:24,473 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-11-23 22:49:24,473 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-11-23 22:49:24,474 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-11-23 22:49:24,476 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-11-23 22:49:24,476 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-11-23 22:49:24,477 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-11-23 22:49:24,478 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-11-23 22:49:24,479 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-11-23 22:49:24,480 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-11-23 22:49:24,481 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-11-23 22:49:24,482 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-11-23 22:49:24,484 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-11-23 22:49:24,485 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-11-23 22:49:24,487 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-11-23 22:49:24,488 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-11-23 22:49:24,488 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-11-23 22:49:24,492 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-11-23 22:49:24,492 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-11-23 22:49:24,492 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-11-23 22:49:24,493 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-11-23 22:49:24,493 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-11-23 22:49:24,494 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-11-23 22:49:24,495 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-11-23 22:49:24,495 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-11-23 22:49:24,496 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-11-23 22:49:24,497 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-11-23 22:49:24,498 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-11-23 22:49:24,498 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-11-23 22:49:24,499 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-11-23 22:49:24,499 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-11-23 22:49:24,499 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-11-23 22:49:24,500 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-11-23 22:49:24,503 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-11-23 22:49:24,504 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-11-23 22:49:24,523 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-11-23 22:49:24,523 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-11-23 22:49:24,525 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-11-23 22:49:24,526 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2019-11-23 22:49:24,526 INFO  L138        SettingsManager]:  * Use SBE=true
[2019-11-23 22:49:24,526 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-11-23 22:49:24,526 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-11-23 22:49:24,526 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2019-11-23 22:49:24,527 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-11-23 22:49:24,527 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-11-23 22:49:24,528 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-11-23 22:49:24,528 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-11-23 22:49:24,529 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-11-23 22:49:24,529 INFO  L138        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2019-11-23 22:49:24,529 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-11-23 22:49:24,529 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-11-23 22:49:24,530 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2019-11-23 22:49:24,530 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-11-23 22:49:24,530 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-11-23 22:49:24,530 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2019-11-23 22:49:24,531 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2019-11-23 22:49:24,531 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2019-11-23 22:49:24,531 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-11-23 22:49:24,531 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-11-23 22:49:24,531 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-11-23 22:49:24,532 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-11-23 22:49:24,532 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2019-11-23 22:49:24,532 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-11-23 22:49:24,532 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-11-23 22:49:24,532 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2019-11-23 22:49:24,800 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-11-23 22:49:24,814 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-11-23 22:49:24,817 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-11-23 22:49:24,819 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-11-23 22:49:24,819 INFO  L275        PluginConnector]: CDTParser initialized
[2019-11-23 22:49:24,820 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/toy.cil.c
[2019-11-23 22:49:24,899 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a061a4fb8/5edaa44de9eb4df0a14e2df562d79ab1/FLAG4d6015413
[2019-11-23 22:49:25,385 INFO  L306              CDTParser]: Found 1 translation units.
[2019-11-23 22:49:25,386 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/toy.cil.c
[2019-11-23 22:49:25,397 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a061a4fb8/5edaa44de9eb4df0a14e2df562d79ab1/FLAG4d6015413
[2019-11-23 22:49:25,791 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a061a4fb8/5edaa44de9eb4df0a14e2df562d79ab1
[2019-11-23 22:49:25,802 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-11-23 22:49:25,803 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2019-11-23 22:49:25,804 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-11-23 22:49:25,805 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-11-23 22:49:25,808 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-11-23 22:49:25,809 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:49:25" (1/1) ...
[2019-11-23 22:49:25,812 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21bcc01e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:25, skipping insertion in model container
[2019-11-23 22:49:25,813 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:49:25" (1/1) ...
[2019-11-23 22:49:25,821 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2019-11-23 22:49:25,863 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2019-11-23 22:49:26,141 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-11-23 22:49:26,147 INFO  L203         MainTranslator]: Completed pre-run
[2019-11-23 22:49:26,288 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-11-23 22:49:26,310 INFO  L208         MainTranslator]: Completed translation
[2019-11-23 22:49:26,310 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:26 WrapperNode
[2019-11-23 22:49:26,311 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-11-23 22:49:26,311 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2019-11-23 22:49:26,312 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2019-11-23 22:49:26,312 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2019-11-23 22:49:26,320 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:26" (1/1) ...
[2019-11-23 22:49:26,331 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:26" (1/1) ...
[2019-11-23 22:49:26,365 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2019-11-23 22:49:26,365 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-11-23 22:49:26,365 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-11-23 22:49:26,365 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-11-23 22:49:26,373 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:26" (1/1) ...
[2019-11-23 22:49:26,373 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:26" (1/1) ...
[2019-11-23 22:49:26,376 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:26" (1/1) ...
[2019-11-23 22:49:26,377 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:26" (1/1) ...
[2019-11-23 22:49:26,383 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:26" (1/1) ...
[2019-11-23 22:49:26,397 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:26" (1/1) ...
[2019-11-23 22:49:26,402 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:26" (1/1) ...
[2019-11-23 22:49:26,407 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-11-23 22:49:26,407 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-11-23 22:49:26,407 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-11-23 22:49:26,408 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-11-23 22:49:26,408 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:26" (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-11-23 22:49:26,491 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-11-23 22:49:26,491 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-11-23 22:49:27,201 INFO  L279             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-11-23 22:49:27,202 INFO  L284             CfgBuilder]: Removed 26 assume(true) statements.
[2019-11-23 22:49:27,204 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:49:27 BoogieIcfgContainer
[2019-11-23 22:49:27,204 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-11-23 22:49:27,205 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-11-23 22:49:27,205 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-11-23 22:49:27,210 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-11-23 22:49:27,211 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:49:25" (1/3) ...
[2019-11-23 22:49:27,212 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677b2cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:49:27, skipping insertion in model container
[2019-11-23 22:49:27,212 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:26" (2/3) ...
[2019-11-23 22:49:27,213 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677b2cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:49:27, skipping insertion in model container
[2019-11-23 22:49:27,214 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:49:27" (3/3) ...
[2019-11-23 22:49:27,215 INFO  L109   eAbstractionObserver]: Analyzing ICFG toy.cil.c
[2019-11-23 22:49:27,226 INFO  L153   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-11-23 22:49:27,235 INFO  L165   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-11-23 22:49:27,247 INFO  L249      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-11-23 22:49:27,288 INFO  L373      AbstractCegarLoop]: Interprodecural is true
[2019-11-23 22:49:27,289 INFO  L374      AbstractCegarLoop]: Hoare is true
[2019-11-23 22:49:27,289 INFO  L375      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-11-23 22:49:27,289 INFO  L376      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-11-23 22:49:27,289 INFO  L377      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-11-23 22:49:27,290 INFO  L378      AbstractCegarLoop]: Difference is false
[2019-11-23 22:49:27,291 INFO  L379      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-11-23 22:49:27,291 INFO  L383      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-11-23 22:49:27,319 INFO  L276                IsEmpty]: Start isEmpty. Operand 126 states.
[2019-11-23 22:49:27,328 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2019-11-23 22:49:27,329 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:27,330 INFO  L410         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]
[2019-11-23 22:49:27,330 INFO  L410      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:27,335 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:27,335 INFO  L82        PathProgramCache]: Analyzing trace with hash -895776564, now seen corresponding path program 1 times
[2019-11-23 22:49:27,342 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:27,342 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697718734]
[2019-11-23 22:49:27,343 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:27,437 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:27,526 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 22:49:27,526 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697718734]
[2019-11-23 22:49:27,527 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:27,528 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:27,530 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039584906]
[2019-11-23 22:49:27,538 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:27,538 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:27,551 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:27,552 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:27,554 INFO  L87              Difference]: Start difference. First operand 126 states. Second operand 3 states.
[2019-11-23 22:49:27,639 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:27,639 INFO  L93              Difference]: Finished difference Result 244 states and 453 transitions.
[2019-11-23 22:49:27,640 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:27,641 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 36
[2019-11-23 22:49:27,642 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:27,660 INFO  L225             Difference]: With dead ends: 244
[2019-11-23 22:49:27,660 INFO  L226             Difference]: Without dead ends: 122
[2019-11-23 22:49:27,668 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:27,687 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 122 states.
[2019-11-23 22:49:27,712 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122.
[2019-11-23 22:49:27,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 122 states.
[2019-11-23 22:49:27,716 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 215 transitions.
[2019-11-23 22:49:27,717 INFO  L78                 Accepts]: Start accepts. Automaton has 122 states and 215 transitions. Word has length 36
[2019-11-23 22:49:27,718 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:27,718 INFO  L462      AbstractCegarLoop]: Abstraction has 122 states and 215 transitions.
[2019-11-23 22:49:27,718 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:27,718 INFO  L276                IsEmpty]: Start isEmpty. Operand 122 states and 215 transitions.
[2019-11-23 22:49:27,720 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2019-11-23 22:49:27,720 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:27,721 INFO  L410         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]
[2019-11-23 22:49:27,721 INFO  L410      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:27,721 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:27,722 INFO  L82        PathProgramCache]: Analyzing trace with hash -1597376438, now seen corresponding path program 1 times
[2019-11-23 22:49:27,722 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:27,722 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169721201]
[2019-11-23 22:49:27,722 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:27,742 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:27,806 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 22:49:27,807 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169721201]
[2019-11-23 22:49:27,807 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:27,807 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:27,808 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870835129]
[2019-11-23 22:49:27,810 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:27,810 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:27,810 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:27,811 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:27,811 INFO  L87              Difference]: Start difference. First operand 122 states and 215 transitions. Second operand 3 states.
[2019-11-23 22:49:27,859 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:27,859 INFO  L93              Difference]: Finished difference Result 234 states and 414 transitions.
[2019-11-23 22:49:27,860 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:27,860 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 36
[2019-11-23 22:49:27,861 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:27,862 INFO  L225             Difference]: With dead ends: 234
[2019-11-23 22:49:27,863 INFO  L226             Difference]: Without dead ends: 122
[2019-11-23 22:49:27,864 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:27,865 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 122 states.
[2019-11-23 22:49:27,877 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122.
[2019-11-23 22:49:27,877 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 122 states.
[2019-11-23 22:49:27,879 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 214 transitions.
[2019-11-23 22:49:27,879 INFO  L78                 Accepts]: Start accepts. Automaton has 122 states and 214 transitions. Word has length 36
[2019-11-23 22:49:27,879 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:27,879 INFO  L462      AbstractCegarLoop]: Abstraction has 122 states and 214 transitions.
[2019-11-23 22:49:27,880 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:27,880 INFO  L276                IsEmpty]: Start isEmpty. Operand 122 states and 214 transitions.
[2019-11-23 22:49:27,881 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2019-11-23 22:49:27,881 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:27,882 INFO  L410         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]
[2019-11-23 22:49:27,882 INFO  L410      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:27,882 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:27,883 INFO  L82        PathProgramCache]: Analyzing trace with hash -211173044, now seen corresponding path program 1 times
[2019-11-23 22:49:27,883 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:27,883 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142795657]
[2019-11-23 22:49:27,884 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:27,901 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:27,977 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 22:49:27,977 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142795657]
[2019-11-23 22:49:27,978 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:27,978 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:27,978 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646720364]
[2019-11-23 22:49:27,979 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:27,979 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:27,979 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:27,993 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:27,994 INFO  L87              Difference]: Start difference. First operand 122 states and 214 transitions. Second operand 3 states.
[2019-11-23 22:49:28,109 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:28,109 INFO  L93              Difference]: Finished difference Result 319 states and 559 transitions.
[2019-11-23 22:49:28,110 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:28,110 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 36
[2019-11-23 22:49:28,110 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:28,113 INFO  L225             Difference]: With dead ends: 319
[2019-11-23 22:49:28,113 INFO  L226             Difference]: Without dead ends: 208
[2019-11-23 22:49:28,114 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:28,115 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 208 states.
[2019-11-23 22:49:28,133 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 197.
[2019-11-23 22:49:28,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 197 states.
[2019-11-23 22:49:28,135 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 332 transitions.
[2019-11-23 22:49:28,135 INFO  L78                 Accepts]: Start accepts. Automaton has 197 states and 332 transitions. Word has length 36
[2019-11-23 22:49:28,135 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:28,136 INFO  L462      AbstractCegarLoop]: Abstraction has 197 states and 332 transitions.
[2019-11-23 22:49:28,136 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:28,136 INFO  L276                IsEmpty]: Start isEmpty. Operand 197 states and 332 transitions.
[2019-11-23 22:49:28,138 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2019-11-23 22:49:28,138 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:28,138 INFO  L410         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]
[2019-11-23 22:49:28,138 INFO  L410      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:28,138 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:28,139 INFO  L82        PathProgramCache]: Analyzing trace with hash 1832433288, now seen corresponding path program 1 times
[2019-11-23 22:49:28,139 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:28,139 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750144482]
[2019-11-23 22:49:28,139 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:28,154 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:28,208 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 22:49:28,209 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750144482]
[2019-11-23 22:49:28,209 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:28,209 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-11-23 22:49:28,209 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987490109]
[2019-11-23 22:49:28,210 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-23 22:49:28,210 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:28,210 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-23 22:49:28,210 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-23 22:49:28,211 INFO  L87              Difference]: Start difference. First operand 197 states and 332 transitions. Second operand 4 states.
[2019-11-23 22:49:28,335 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:28,335 INFO  L93              Difference]: Finished difference Result 533 states and 902 transitions.
[2019-11-23 22:49:28,336 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-11-23 22:49:28,337 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 36
[2019-11-23 22:49:28,337 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:28,339 INFO  L225             Difference]: With dead ends: 533
[2019-11-23 22:49:28,339 INFO  L226             Difference]: Without dead ends: 348
[2019-11-23 22:49:28,341 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-23 22:49:28,342 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 348 states.
[2019-11-23 22:49:28,379 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 341.
[2019-11-23 22:49:28,379 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 341 states.
[2019-11-23 22:49:28,385 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 574 transitions.
[2019-11-23 22:49:28,385 INFO  L78                 Accepts]: Start accepts. Automaton has 341 states and 574 transitions. Word has length 36
[2019-11-23 22:49:28,385 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:28,386 INFO  L462      AbstractCegarLoop]: Abstraction has 341 states and 574 transitions.
[2019-11-23 22:49:28,386 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-23 22:49:28,386 INFO  L276                IsEmpty]: Start isEmpty. Operand 341 states and 574 transitions.
[2019-11-23 22:49:28,388 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2019-11-23 22:49:28,388 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:28,388 INFO  L410         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]
[2019-11-23 22:49:28,389 INFO  L410      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:28,392 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:28,393 INFO  L82        PathProgramCache]: Analyzing trace with hash -539305974, now seen corresponding path program 1 times
[2019-11-23 22:49:28,393 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:28,393 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400865308]
[2019-11-23 22:49:28,393 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:28,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:28,476 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 22:49:28,477 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400865308]
[2019-11-23 22:49:28,477 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:28,477 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-11-23 22:49:28,477 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886975476]
[2019-11-23 22:49:28,479 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-23 22:49:28,479 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:28,480 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-23 22:49:28,480 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-23 22:49:28,481 INFO  L87              Difference]: Start difference. First operand 341 states and 574 transitions. Second operand 4 states.
[2019-11-23 22:49:28,591 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:28,591 INFO  L93              Difference]: Finished difference Result 958 states and 1617 transitions.
[2019-11-23 22:49:28,592 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-11-23 22:49:28,592 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 36
[2019-11-23 22:49:28,593 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:28,597 INFO  L225             Difference]: With dead ends: 958
[2019-11-23 22:49:28,597 INFO  L226             Difference]: Without dead ends: 630
[2019-11-23 22:49:28,598 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-23 22:49:28,600 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 630 states.
[2019-11-23 22:49:28,635 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 623.
[2019-11-23 22:49:28,635 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 623 states.
[2019-11-23 22:49:28,638 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1044 transitions.
[2019-11-23 22:49:28,638 INFO  L78                 Accepts]: Start accepts. Automaton has 623 states and 1044 transitions. Word has length 36
[2019-11-23 22:49:28,638 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:28,639 INFO  L462      AbstractCegarLoop]: Abstraction has 623 states and 1044 transitions.
[2019-11-23 22:49:28,639 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-23 22:49:28,639 INFO  L276                IsEmpty]: Start isEmpty. Operand 623 states and 1044 transitions.
[2019-11-23 22:49:28,644 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2019-11-23 22:49:28,644 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:28,645 INFO  L410         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]
[2019-11-23 22:49:28,645 INFO  L410      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:28,645 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:28,645 INFO  L82        PathProgramCache]: Analyzing trace with hash -477266360, now seen corresponding path program 1 times
[2019-11-23 22:49:28,646 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:28,646 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79948317]
[2019-11-23 22:49:28,647 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:28,671 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:28,709 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 22:49:28,710 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79948317]
[2019-11-23 22:49:28,710 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:28,710 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-11-23 22:49:28,710 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993198370]
[2019-11-23 22:49:28,711 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-23 22:49:28,711 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:28,711 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-23 22:49:28,711 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-23 22:49:28,711 INFO  L87              Difference]: Start difference. First operand 623 states and 1044 transitions. Second operand 4 states.
[2019-11-23 22:49:28,852 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:28,852 INFO  L93              Difference]: Finished difference Result 1894 states and 3154 transitions.
[2019-11-23 22:49:28,853 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-11-23 22:49:28,853 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 36
[2019-11-23 22:49:28,853 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:28,861 INFO  L225             Difference]: With dead ends: 1894
[2019-11-23 22:49:28,861 INFO  L226             Difference]: Without dead ends: 1285
[2019-11-23 22:49:28,863 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-23 22:49:28,865 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1285 states.
[2019-11-23 22:49:28,950 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1278.
[2019-11-23 22:49:28,950 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1278 states.
[2019-11-23 22:49:28,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 2104 transitions.
[2019-11-23 22:49:28,955 INFO  L78                 Accepts]: Start accepts. Automaton has 1278 states and 2104 transitions. Word has length 36
[2019-11-23 22:49:28,956 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:28,956 INFO  L462      AbstractCegarLoop]: Abstraction has 1278 states and 2104 transitions.
[2019-11-23 22:49:28,956 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-23 22:49:28,956 INFO  L276                IsEmpty]: Start isEmpty. Operand 1278 states and 2104 transitions.
[2019-11-23 22:49:28,958 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2019-11-23 22:49:28,958 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:28,958 INFO  L410         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]
[2019-11-23 22:49:28,959 INFO  L410      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:28,959 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:28,959 INFO  L82        PathProgramCache]: Analyzing trace with hash -336717750, now seen corresponding path program 1 times
[2019-11-23 22:49:28,959 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:28,959 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902838602]
[2019-11-23 22:49:28,960 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:28,969 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:29,026 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 22:49:29,026 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902838602]
[2019-11-23 22:49:29,026 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:29,027 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:29,027 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236152814]
[2019-11-23 22:49:29,027 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:29,027 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:29,030 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:29,030 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:29,030 INFO  L87              Difference]: Start difference. First operand 1278 states and 2104 transitions. Second operand 3 states.
[2019-11-23 22:49:29,151 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:29,151 INFO  L93              Difference]: Finished difference Result 2606 states and 4301 transitions.
[2019-11-23 22:49:29,152 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:29,152 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 36
[2019-11-23 22:49:29,153 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:29,160 INFO  L225             Difference]: With dead ends: 2606
[2019-11-23 22:49:29,161 INFO  L226             Difference]: Without dead ends: 1385
[2019-11-23 22:49:29,163 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:29,165 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1385 states.
[2019-11-23 22:49:29,222 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1378.
[2019-11-23 22:49:29,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1378 states.
[2019-11-23 22:49:29,228 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 2261 transitions.
[2019-11-23 22:49:29,229 INFO  L78                 Accepts]: Start accepts. Automaton has 1378 states and 2261 transitions. Word has length 36
[2019-11-23 22:49:29,229 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:29,229 INFO  L462      AbstractCegarLoop]: Abstraction has 1378 states and 2261 transitions.
[2019-11-23 22:49:29,229 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:29,229 INFO  L276                IsEmpty]: Start isEmpty. Operand 1378 states and 2261 transitions.
[2019-11-23 22:49:29,232 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2019-11-23 22:49:29,232 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:29,232 INFO  L410         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]
[2019-11-23 22:49:29,232 INFO  L410      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:29,233 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:29,233 INFO  L82        PathProgramCache]: Analyzing trace with hash 952987590, now seen corresponding path program 1 times
[2019-11-23 22:49:29,233 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:29,234 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210618296]
[2019-11-23 22:49:29,234 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:29,249 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:29,284 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 22:49:29,284 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210618296]
[2019-11-23 22:49:29,285 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:29,285 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-11-23 22:49:29,285 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972254019]
[2019-11-23 22:49:29,285 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-23 22:49:29,286 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:29,286 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-23 22:49:29,286 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-23 22:49:29,286 INFO  L87              Difference]: Start difference. First operand 1378 states and 2261 transitions. Second operand 4 states.
[2019-11-23 22:49:29,417 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:29,418 INFO  L93              Difference]: Finished difference Result 2888 states and 4749 transitions.
[2019-11-23 22:49:29,418 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-11-23 22:49:29,418 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 36
[2019-11-23 22:49:29,419 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:29,426 INFO  L225             Difference]: With dead ends: 2888
[2019-11-23 22:49:29,427 INFO  L226             Difference]: Without dead ends: 1544
[2019-11-23 22:49:29,429 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-23 22:49:29,431 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1544 states.
[2019-11-23 22:49:29,516 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1533.
[2019-11-23 22:49:29,516 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1533 states.
[2019-11-23 22:49:29,521 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2479 transitions.
[2019-11-23 22:49:29,522 INFO  L78                 Accepts]: Start accepts. Automaton has 1533 states and 2479 transitions. Word has length 36
[2019-11-23 22:49:29,522 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:29,522 INFO  L462      AbstractCegarLoop]: Abstraction has 1533 states and 2479 transitions.
[2019-11-23 22:49:29,522 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-23 22:49:29,522 INFO  L276                IsEmpty]: Start isEmpty. Operand 1533 states and 2479 transitions.
[2019-11-23 22:49:29,523 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2019-11-23 22:49:29,523 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:29,523 INFO  L410         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]
[2019-11-23 22:49:29,524 INFO  L410      AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:29,524 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:29,525 INFO  L82        PathProgramCache]: Analyzing trace with hash -635360312, now seen corresponding path program 1 times
[2019-11-23 22:49:29,525 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:29,526 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502744250]
[2019-11-23 22:49:29,526 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:29,542 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:29,572 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 22:49:29,572 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502744250]
[2019-11-23 22:49:29,573 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:29,573 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-11-23 22:49:29,573 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021684487]
[2019-11-23 22:49:29,573 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-23 22:49:29,574 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:29,575 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-23 22:49:29,575 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-23 22:49:29,575 INFO  L87              Difference]: Start difference. First operand 1533 states and 2479 transitions. Second operand 4 states.
[2019-11-23 22:49:29,723 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:29,723 INFO  L93              Difference]: Finished difference Result 3360 states and 5440 transitions.
[2019-11-23 22:49:29,724 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-11-23 22:49:29,724 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 36
[2019-11-23 22:49:29,725 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:29,735 INFO  L225             Difference]: With dead ends: 3360
[2019-11-23 22:49:29,735 INFO  L226             Difference]: Without dead ends: 1873
[2019-11-23 22:49:29,738 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-23 22:49:29,740 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1873 states.
[2019-11-23 22:49:29,806 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1849.
[2019-11-23 22:49:29,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1849 states.
[2019-11-23 22:49:29,813 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2951 transitions.
[2019-11-23 22:49:29,814 INFO  L78                 Accepts]: Start accepts. Automaton has 1849 states and 2951 transitions. Word has length 36
[2019-11-23 22:49:29,814 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:29,814 INFO  L462      AbstractCegarLoop]: Abstraction has 1849 states and 2951 transitions.
[2019-11-23 22:49:29,814 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-23 22:49:29,814 INFO  L276                IsEmpty]: Start isEmpty. Operand 1849 states and 2951 transitions.
[2019-11-23 22:49:29,815 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2019-11-23 22:49:29,815 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:29,815 INFO  L410         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]
[2019-11-23 22:49:29,815 INFO  L410      AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:29,816 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:29,816 INFO  L82        PathProgramCache]: Analyzing trace with hash -1915223990, now seen corresponding path program 1 times
[2019-11-23 22:49:29,816 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:29,816 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208584014]
[2019-11-23 22:49:29,817 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:29,826 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:29,853 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 22:49:29,854 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208584014]
[2019-11-23 22:49:29,854 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:29,854 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:29,855 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261592373]
[2019-11-23 22:49:29,855 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:29,856 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:29,856 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:29,856 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:29,856 INFO  L87              Difference]: Start difference. First operand 1849 states and 2951 transitions. Second operand 3 states.
[2019-11-23 22:49:29,969 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:29,970 INFO  L93              Difference]: Finished difference Result 3319 states and 5302 transitions.
[2019-11-23 22:49:29,970 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:29,970 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 36
[2019-11-23 22:49:29,973 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:29,983 INFO  L225             Difference]: With dead ends: 3319
[2019-11-23 22:49:29,983 INFO  L226             Difference]: Without dead ends: 1498
[2019-11-23 22:49:29,987 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:29,990 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1498 states.
[2019-11-23 22:49:30,089 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1487.
[2019-11-23 22:49:30,089 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1487 states.
[2019-11-23 22:49:30,097 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 2343 transitions.
[2019-11-23 22:49:30,098 INFO  L78                 Accepts]: Start accepts. Automaton has 1487 states and 2343 transitions. Word has length 36
[2019-11-23 22:49:30,098 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:30,098 INFO  L462      AbstractCegarLoop]: Abstraction has 1487 states and 2343 transitions.
[2019-11-23 22:49:30,098 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:30,099 INFO  L276                IsEmpty]: Start isEmpty. Operand 1487 states and 2343 transitions.
[2019-11-23 22:49:30,100 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2019-11-23 22:49:30,100 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:30,100 INFO  L410         BasicCegarLoop]: trace histogram [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]
[2019-11-23 22:49:30,100 INFO  L410      AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:30,101 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:30,101 INFO  L82        PathProgramCache]: Analyzing trace with hash -1648654786, now seen corresponding path program 1 times
[2019-11-23 22:49:30,101 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:30,101 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22699334]
[2019-11-23 22:49:30,101 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:30,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:30,133 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 22:49:30,134 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22699334]
[2019-11-23 22:49:30,134 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:30,134 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:30,135 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10186128]
[2019-11-23 22:49:30,135 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:30,135 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:30,136 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:30,136 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:30,136 INFO  L87              Difference]: Start difference. First operand 1487 states and 2343 transitions. Second operand 3 states.
[2019-11-23 22:49:30,259 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:30,259 INFO  L93              Difference]: Finished difference Result 3710 states and 5901 transitions.
[2019-11-23 22:49:30,259 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:30,259 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 46
[2019-11-23 22:49:30,260 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:30,271 INFO  L225             Difference]: With dead ends: 3710
[2019-11-23 22:49:30,272 INFO  L226             Difference]: Without dead ends: 2277
[2019-11-23 22:49:30,275 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:30,278 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2277 states.
[2019-11-23 22:49:30,370 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 2275.
[2019-11-23 22:49:30,370 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2275 states.
[2019-11-23 22:49:30,377 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 3579 transitions.
[2019-11-23 22:49:30,378 INFO  L78                 Accepts]: Start accepts. Automaton has 2275 states and 3579 transitions. Word has length 46
[2019-11-23 22:49:30,378 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:30,378 INFO  L462      AbstractCegarLoop]: Abstraction has 2275 states and 3579 transitions.
[2019-11-23 22:49:30,378 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:30,378 INFO  L276                IsEmpty]: Start isEmpty. Operand 2275 states and 3579 transitions.
[2019-11-23 22:49:30,380 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2019-11-23 22:49:30,380 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:30,381 INFO  L410         BasicCegarLoop]: trace histogram [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]
[2019-11-23 22:49:30,381 INFO  L410      AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:30,381 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:30,381 INFO  L82        PathProgramCache]: Analyzing trace with hash -1400508292, now seen corresponding path program 1 times
[2019-11-23 22:49:30,381 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:30,382 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154244477]
[2019-11-23 22:49:30,382 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:30,386 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:30,401 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2019-11-23 22:49:30,402 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154244477]
[2019-11-23 22:49:30,402 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:30,402 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:30,402 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904876714]
[2019-11-23 22:49:30,403 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:30,403 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:30,403 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:30,403 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:30,403 INFO  L87              Difference]: Start difference. First operand 2275 states and 3579 transitions. Second operand 3 states.
[2019-11-23 22:49:30,487 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:30,487 INFO  L93              Difference]: Finished difference Result 4452 states and 7032 transitions.
[2019-11-23 22:49:30,488 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:30,488 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 46
[2019-11-23 22:49:30,488 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:30,500 INFO  L225             Difference]: With dead ends: 4452
[2019-11-23 22:49:30,500 INFO  L226             Difference]: Without dead ends: 2231
[2019-11-23 22:49:30,504 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:30,507 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2231 states.
[2019-11-23 22:49:30,628 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2231.
[2019-11-23 22:49:30,629 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2231 states.
[2019-11-23 22:49:30,636 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 3522 transitions.
[2019-11-23 22:49:30,637 INFO  L78                 Accepts]: Start accepts. Automaton has 2231 states and 3522 transitions. Word has length 46
[2019-11-23 22:49:30,637 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:30,637 INFO  L462      AbstractCegarLoop]: Abstraction has 2231 states and 3522 transitions.
[2019-11-23 22:49:30,637 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:30,637 INFO  L276                IsEmpty]: Start isEmpty. Operand 2231 states and 3522 transitions.
[2019-11-23 22:49:30,639 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2019-11-23 22:49:30,639 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:30,639 INFO  L410         BasicCegarLoop]: trace histogram [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]
[2019-11-23 22:49:30,640 INFO  L410      AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:30,640 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:30,640 INFO  L82        PathProgramCache]: Analyzing trace with hash 666181047, now seen corresponding path program 1 times
[2019-11-23 22:49:30,640 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:30,641 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872150201]
[2019-11-23 22:49:30,641 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:30,651 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:30,684 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 22:49:30,684 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872150201]
[2019-11-23 22:49:30,685 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:30,685 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:30,685 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714757531]
[2019-11-23 22:49:30,685 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:30,685 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:30,686 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:30,686 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:30,686 INFO  L87              Difference]: Start difference. First operand 2231 states and 3522 transitions. Second operand 3 states.
[2019-11-23 22:49:30,853 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:30,853 INFO  L93              Difference]: Finished difference Result 5731 states and 9112 transitions.
[2019-11-23 22:49:30,854 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:30,854 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 47
[2019-11-23 22:49:30,855 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:30,876 INFO  L225             Difference]: With dead ends: 5731
[2019-11-23 22:49:30,877 INFO  L226             Difference]: Without dead ends: 3554
[2019-11-23 22:49:30,883 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:30,889 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3554 states.
[2019-11-23 22:49:31,087 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3552.
[2019-11-23 22:49:31,088 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3552 states.
[2019-11-23 22:49:31,102 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3552 states to 3552 states and 5590 transitions.
[2019-11-23 22:49:31,102 INFO  L78                 Accepts]: Start accepts. Automaton has 3552 states and 5590 transitions. Word has length 47
[2019-11-23 22:49:31,102 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:31,102 INFO  L462      AbstractCegarLoop]: Abstraction has 3552 states and 5590 transitions.
[2019-11-23 22:49:31,103 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:31,103 INFO  L276                IsEmpty]: Start isEmpty. Operand 3552 states and 5590 transitions.
[2019-11-23 22:49:31,106 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2019-11-23 22:49:31,106 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:31,106 INFO  L410         BasicCegarLoop]: trace histogram [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]
[2019-11-23 22:49:31,106 INFO  L410      AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:31,107 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:31,107 INFO  L82        PathProgramCache]: Analyzing trace with hash -656218967, now seen corresponding path program 1 times
[2019-11-23 22:49:31,107 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:31,113 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163701888]
[2019-11-23 22:49:31,117 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:31,135 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:31,170 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 22:49:31,170 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163701888]
[2019-11-23 22:49:31,170 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:31,171 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:31,171 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887579718]
[2019-11-23 22:49:31,171 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:31,171 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:31,171 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:31,172 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:31,172 INFO  L87              Difference]: Start difference. First operand 3552 states and 5590 transitions. Second operand 3 states.
[2019-11-23 22:49:31,452 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:31,453 INFO  L93              Difference]: Finished difference Result 9027 states and 14388 transitions.
[2019-11-23 22:49:31,453 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:31,453 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 48
[2019-11-23 22:49:31,454 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:31,485 INFO  L225             Difference]: With dead ends: 9027
[2019-11-23 22:49:31,486 INFO  L226             Difference]: Without dead ends: 5533
[2019-11-23 22:49:31,493 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:31,500 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5533 states.
[2019-11-23 22:49:31,722 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5533 to 5531.
[2019-11-23 22:49:31,723 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5531 states.
[2019-11-23 22:49:31,751 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5531 states to 5531 states and 8775 transitions.
[2019-11-23 22:49:31,751 INFO  L78                 Accepts]: Start accepts. Automaton has 5531 states and 8775 transitions. Word has length 48
[2019-11-23 22:49:31,752 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:31,752 INFO  L462      AbstractCegarLoop]: Abstraction has 5531 states and 8775 transitions.
[2019-11-23 22:49:31,753 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:31,753 INFO  L276                IsEmpty]: Start isEmpty. Operand 5531 states and 8775 transitions.
[2019-11-23 22:49:31,759 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2019-11-23 22:49:31,759 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:31,760 INFO  L410         BasicCegarLoop]: trace histogram [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]
[2019-11-23 22:49:31,760 INFO  L410      AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:31,761 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:31,761 INFO  L82        PathProgramCache]: Analyzing trace with hash -408072473, now seen corresponding path program 1 times
[2019-11-23 22:49:31,761 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:31,761 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666264401]
[2019-11-23 22:49:31,761 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:31,768 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:31,784 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2019-11-23 22:49:31,784 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666264401]
[2019-11-23 22:49:31,785 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:31,785 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:31,785 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046003657]
[2019-11-23 22:49:31,786 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:31,786 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:31,786 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:31,786 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:31,786 INFO  L87              Difference]: Start difference. First operand 5531 states and 8775 transitions. Second operand 3 states.
[2019-11-23 22:49:32,016 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:32,017 INFO  L93              Difference]: Finished difference Result 10960 states and 17424 transitions.
[2019-11-23 22:49:32,017 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:32,017 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 48
[2019-11-23 22:49:32,018 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:32,042 INFO  L225             Difference]: With dead ends: 10960
[2019-11-23 22:49:32,042 INFO  L226             Difference]: Without dead ends: 5487
[2019-11-23 22:49:32,050 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:32,057 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5487 states.
[2019-11-23 22:49:32,317 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5487 to 5487.
[2019-11-23 22:49:32,317 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5487 states.
[2019-11-23 22:49:32,327 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5487 states to 5487 states and 8720 transitions.
[2019-11-23 22:49:32,327 INFO  L78                 Accepts]: Start accepts. Automaton has 5487 states and 8720 transitions. Word has length 48
[2019-11-23 22:49:32,328 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:32,328 INFO  L462      AbstractCegarLoop]: Abstraction has 5487 states and 8720 transitions.
[2019-11-23 22:49:32,328 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:32,328 INFO  L276                IsEmpty]: Start isEmpty. Operand 5487 states and 8720 transitions.
[2019-11-23 22:49:32,331 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2019-11-23 22:49:32,331 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:32,331 INFO  L410         BasicCegarLoop]: trace histogram [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]
[2019-11-23 22:49:32,332 INFO  L410      AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:32,332 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:32,332 INFO  L82        PathProgramCache]: Analyzing trace with hash 2128148300, now seen corresponding path program 1 times
[2019-11-23 22:49:32,332 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:32,332 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215024863]
[2019-11-23 22:49:32,333 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:32,339 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:32,359 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 22:49:32,359 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215024863]
[2019-11-23 22:49:32,360 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:32,360 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:32,360 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668784553]
[2019-11-23 22:49:32,360 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:32,361 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:32,361 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:32,361 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:32,361 INFO  L87              Difference]: Start difference. First operand 5487 states and 8720 transitions. Second operand 3 states.
[2019-11-23 22:49:32,657 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:32,657 INFO  L93              Difference]: Finished difference Result 15505 states and 24580 transitions.
[2019-11-23 22:49:32,658 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:32,658 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 49
[2019-11-23 22:49:32,658 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:32,677 INFO  L225             Difference]: With dead ends: 15505
[2019-11-23 22:49:32,677 INFO  L226             Difference]: Without dead ends: 8306
[2019-11-23 22:49:32,688 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:32,698 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8306 states.
[2019-11-23 22:49:33,058 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8306 to 8306.
[2019-11-23 22:49:33,059 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8306 states.
[2019-11-23 22:49:33,072 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8306 states to 8306 states and 13014 transitions.
[2019-11-23 22:49:33,072 INFO  L78                 Accepts]: Start accepts. Automaton has 8306 states and 13014 transitions. Word has length 49
[2019-11-23 22:49:33,073 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:33,073 INFO  L462      AbstractCegarLoop]: Abstraction has 8306 states and 13014 transitions.
[2019-11-23 22:49:33,073 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:33,073 INFO  L276                IsEmpty]: Start isEmpty. Operand 8306 states and 13014 transitions.
[2019-11-23 22:49:33,078 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2019-11-23 22:49:33,078 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:33,078 INFO  L410         BasicCegarLoop]: trace histogram [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]
[2019-11-23 22:49:33,078 INFO  L410      AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:33,078 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:33,079 INFO  L82        PathProgramCache]: Analyzing trace with hash 1878430016, now seen corresponding path program 1 times
[2019-11-23 22:49:33,079 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:33,079 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562836113]
[2019-11-23 22:49:33,079 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:33,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:33,107 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 22:49:33,108 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562836113]
[2019-11-23 22:49:33,108 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:33,108 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:33,108 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504322768]
[2019-11-23 22:49:33,109 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:33,109 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:33,109 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:33,109 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:33,109 INFO  L87              Difference]: Start difference. First operand 8306 states and 13014 transitions. Second operand 3 states.
[2019-11-23 22:49:33,465 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:33,465 INFO  L93              Difference]: Finished difference Result 17117 states and 26766 transitions.
[2019-11-23 22:49:33,465 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:33,465 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 53
[2019-11-23 22:49:33,466 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:33,483 INFO  L225             Difference]: With dead ends: 17117
[2019-11-23 22:49:33,483 INFO  L226             Difference]: Without dead ends: 8847
[2019-11-23 22:49:33,495 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:33,505 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8847 states.
[2019-11-23 22:49:33,753 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8847 to 8296.
[2019-11-23 22:49:33,753 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8296 states.
[2019-11-23 22:49:33,764 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8296 states to 8296 states and 12747 transitions.
[2019-11-23 22:49:33,764 INFO  L78                 Accepts]: Start accepts. Automaton has 8296 states and 12747 transitions. Word has length 53
[2019-11-23 22:49:33,764 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:33,765 INFO  L462      AbstractCegarLoop]: Abstraction has 8296 states and 12747 transitions.
[2019-11-23 22:49:33,765 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:33,765 INFO  L276                IsEmpty]: Start isEmpty. Operand 8296 states and 12747 transitions.
[2019-11-23 22:49:33,770 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2019-11-23 22:49:33,771 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:33,771 INFO  L410         BasicCegarLoop]: trace histogram [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]
[2019-11-23 22:49:33,771 INFO  L410      AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:33,771 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:33,772 INFO  L82        PathProgramCache]: Analyzing trace with hash -753024327, now seen corresponding path program 1 times
[2019-11-23 22:49:33,772 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:33,772 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671499219]
[2019-11-23 22:49:33,772 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:33,777 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:33,799 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2019-11-23 22:49:33,800 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671499219]
[2019-11-23 22:49:33,800 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:33,800 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:33,800 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653110981]
[2019-11-23 22:49:33,801 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:33,801 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:33,801 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:33,801 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:33,801 INFO  L87              Difference]: Start difference. First operand 8296 states and 12747 transitions. Second operand 3 states.
[2019-11-23 22:49:34,300 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:34,300 INFO  L93              Difference]: Finished difference Result 24576 states and 37848 transitions.
[2019-11-23 22:49:34,301 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:34,301 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 55
[2019-11-23 22:49:34,301 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:34,335 INFO  L225             Difference]: With dead ends: 24576
[2019-11-23 22:49:34,335 INFO  L226             Difference]: Without dead ends: 16283
[2019-11-23 22:49:34,347 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:34,364 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16283 states.
[2019-11-23 22:49:35,403 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16283 to 16153.
[2019-11-23 22:49:35,404 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16153 states.
[2019-11-23 22:49:35,429 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16153 states to 16153 states and 24943 transitions.
[2019-11-23 22:49:35,429 INFO  L78                 Accepts]: Start accepts. Automaton has 16153 states and 24943 transitions. Word has length 55
[2019-11-23 22:49:35,429 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:35,430 INFO  L462      AbstractCegarLoop]: Abstraction has 16153 states and 24943 transitions.
[2019-11-23 22:49:35,430 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:35,430 INFO  L276                IsEmpty]: Start isEmpty. Operand 16153 states and 24943 transitions.
[2019-11-23 22:49:35,437 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2019-11-23 22:49:35,437 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:35,437 INFO  L410         BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 22:49:35,438 INFO  L410      AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:35,438 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:35,438 INFO  L82        PathProgramCache]: Analyzing trace with hash 983251502, now seen corresponding path program 1 times
[2019-11-23 22:49:35,438 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:35,438 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095032038]
[2019-11-23 22:49:35,439 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:35,447 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:35,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 22:49:35,471 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095032038]
[2019-11-23 22:49:35,471 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:35,471 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:35,472 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247510838]
[2019-11-23 22:49:35,472 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:35,472 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:35,472 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:35,473 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:35,473 INFO  L87              Difference]: Start difference. First operand 16153 states and 24943 transitions. Second operand 3 states.
[2019-11-23 22:49:36,072 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:36,072 INFO  L93              Difference]: Finished difference Result 32961 states and 50844 transitions.
[2019-11-23 22:49:36,073 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:36,073 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 86
[2019-11-23 22:49:36,073 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:36,099 INFO  L225             Difference]: With dead ends: 32961
[2019-11-23 22:49:36,099 INFO  L226             Difference]: Without dead ends: 16837
[2019-11-23 22:49:36,122 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:36,136 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16837 states.
[2019-11-23 22:49:36,828 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16837 to 16773.
[2019-11-23 22:49:36,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16773 states.
[2019-11-23 22:49:36,845 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16773 states to 16773 states and 25245 transitions.
[2019-11-23 22:49:36,846 INFO  L78                 Accepts]: Start accepts. Automaton has 16773 states and 25245 transitions. Word has length 86
[2019-11-23 22:49:36,846 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:36,846 INFO  L462      AbstractCegarLoop]: Abstraction has 16773 states and 25245 transitions.
[2019-11-23 22:49:36,846 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:36,846 INFO  L276                IsEmpty]: Start isEmpty. Operand 16773 states and 25245 transitions.
[2019-11-23 22:49:36,854 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2019-11-23 22:49:36,854 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:36,855 INFO  L410         BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 22:49:36,855 INFO  L410      AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:36,855 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:36,855 INFO  L82        PathProgramCache]: Analyzing trace with hash 1499414459, now seen corresponding path program 1 times
[2019-11-23 22:49:36,855 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:36,856 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799747428]
[2019-11-23 22:49:36,856 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:36,864 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:36,892 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2019-11-23 22:49:36,892 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799747428]
[2019-11-23 22:49:36,892 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:36,892 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-11-23 22:49:36,893 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819421729]
[2019-11-23 22:49:36,893 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-23 22:49:36,893 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:36,894 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-23 22:49:36,894 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-23 22:49:36,894 INFO  L87              Difference]: Start difference. First operand 16773 states and 25245 transitions. Second operand 4 states.
[2019-11-23 22:49:37,438 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:37,438 INFO  L93              Difference]: Finished difference Result 27695 states and 41815 transitions.
[2019-11-23 22:49:37,438 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-11-23 22:49:37,438 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 87
[2019-11-23 22:49:37,439 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:37,457 INFO  L225             Difference]: With dead ends: 27695
[2019-11-23 22:49:37,457 INFO  L226             Difference]: Without dead ends: 15867
[2019-11-23 22:49:37,466 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-23 22:49:37,476 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15867 states.
[2019-11-23 22:49:37,907 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15867 to 15761.
[2019-11-23 22:49:37,907 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15761 states.
[2019-11-23 22:49:37,930 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15761 states to 15761 states and 23539 transitions.
[2019-11-23 22:49:37,931 INFO  L78                 Accepts]: Start accepts. Automaton has 15761 states and 23539 transitions. Word has length 87
[2019-11-23 22:49:37,931 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:37,931 INFO  L462      AbstractCegarLoop]: Abstraction has 15761 states and 23539 transitions.
[2019-11-23 22:49:37,931 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-23 22:49:37,931 INFO  L276                IsEmpty]: Start isEmpty. Operand 15761 states and 23539 transitions.
[2019-11-23 22:49:37,937 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2019-11-23 22:49:37,938 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:37,938 INFO  L410         BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 22:49:37,938 INFO  L410      AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:37,938 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:37,939 INFO  L82        PathProgramCache]: Analyzing trace with hash 129921275, now seen corresponding path program 1 times
[2019-11-23 22:49:37,939 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:37,939 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587247515]
[2019-11-23 22:49:37,939 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:37,948 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:38,097 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 22:49:38,098 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587247515]
[2019-11-23 22:49:38,098 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:38,098 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:38,098 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222161013]
[2019-11-23 22:49:38,098 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:38,099 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:38,099 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:38,099 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:38,099 INFO  L87              Difference]: Start difference. First operand 15761 states and 23539 transitions. Second operand 3 states.
[2019-11-23 22:49:38,513 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:38,514 INFO  L93              Difference]: Finished difference Result 32291 states and 48176 transitions.
[2019-11-23 22:49:38,514 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:38,514 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 87
[2019-11-23 22:49:38,514 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:38,534 INFO  L225             Difference]: With dead ends: 32291
[2019-11-23 22:49:38,534 INFO  L226             Difference]: Without dead ends: 16571
[2019-11-23 22:49:38,546 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:38,558 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16571 states.
[2019-11-23 22:49:39,084 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16571 to 16491.
[2019-11-23 22:49:39,085 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16491 states.
[2019-11-23 22:49:39,107 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16491 states to 16491 states and 23911 transitions.
[2019-11-23 22:49:39,108 INFO  L78                 Accepts]: Start accepts. Automaton has 16491 states and 23911 transitions. Word has length 87
[2019-11-23 22:49:39,108 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:39,108 INFO  L462      AbstractCegarLoop]: Abstraction has 16491 states and 23911 transitions.
[2019-11-23 22:49:39,108 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:39,108 INFO  L276                IsEmpty]: Start isEmpty. Operand 16491 states and 23911 transitions.
[2019-11-23 22:49:39,113 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2019-11-23 22:49:39,113 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:39,114 INFO  L410         BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 22:49:39,114 INFO  L410      AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:39,114 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:39,114 INFO  L82        PathProgramCache]: Analyzing trace with hash 793269102, now seen corresponding path program 1 times
[2019-11-23 22:49:39,114 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:39,115 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337075089]
[2019-11-23 22:49:39,115 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:39,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:39,144 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 22:49:39,145 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337075089]
[2019-11-23 22:49:39,146 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:39,146 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:39,146 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102980779]
[2019-11-23 22:49:39,146 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:39,147 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:39,147 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:39,147 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:39,147 INFO  L87              Difference]: Start difference. First operand 16491 states and 23911 transitions. Second operand 3 states.
[2019-11-23 22:49:39,550 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:39,551 INFO  L93              Difference]: Finished difference Result 33398 states and 48544 transitions.
[2019-11-23 22:49:39,552 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:39,552 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 88
[2019-11-23 22:49:39,553 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:39,568 INFO  L225             Difference]: With dead ends: 33398
[2019-11-23 22:49:39,568 INFO  L226             Difference]: Without dead ends: 16968
[2019-11-23 22:49:39,580 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:39,594 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16968 states.
[2019-11-23 22:49:40,101 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16968 to 13475.
[2019-11-23 22:49:40,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13475 states.
[2019-11-23 22:49:40,114 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13475 states to 13475 states and 18849 transitions.
[2019-11-23 22:49:40,114 INFO  L78                 Accepts]: Start accepts. Automaton has 13475 states and 18849 transitions. Word has length 88
[2019-11-23 22:49:40,114 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:40,114 INFO  L462      AbstractCegarLoop]: Abstraction has 13475 states and 18849 transitions.
[2019-11-23 22:49:40,115 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:40,115 INFO  L276                IsEmpty]: Start isEmpty. Operand 13475 states and 18849 transitions.
[2019-11-23 22:49:40,120 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2019-11-23 22:49:40,120 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:40,120 INFO  L410         BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 22:49:40,120 INFO  L410      AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:40,121 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:40,121 INFO  L82        PathProgramCache]: Analyzing trace with hash -831404099, now seen corresponding path program 1 times
[2019-11-23 22:49:40,121 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:40,121 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059000980]
[2019-11-23 22:49:40,122 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:40,136 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:40,164 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2019-11-23 22:49:40,166 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059000980]
[2019-11-23 22:49:40,166 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:40,167 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:40,167 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222942545]
[2019-11-23 22:49:40,167 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:40,167 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:40,168 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:40,168 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:40,168 INFO  L87              Difference]: Start difference. First operand 13475 states and 18849 transitions. Second operand 3 states.
[2019-11-23 22:49:40,573 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:40,574 INFO  L93              Difference]: Finished difference Result 23981 states and 33577 transitions.
[2019-11-23 22:49:40,574 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:40,574 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 89
[2019-11-23 22:49:40,574 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:40,588 INFO  L225             Difference]: With dead ends: 23981
[2019-11-23 22:49:40,588 INFO  L226             Difference]: Without dead ends: 15629
[2019-11-23 22:49:40,597 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:40,609 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15629 states.
[2019-11-23 22:49:41,087 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15629 to 15149.
[2019-11-23 22:49:41,087 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15149 states.
[2019-11-23 22:49:41,102 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15149 states to 15149 states and 20704 transitions.
[2019-11-23 22:49:41,102 INFO  L78                 Accepts]: Start accepts. Automaton has 15149 states and 20704 transitions. Word has length 89
[2019-11-23 22:49:41,102 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:41,103 INFO  L462      AbstractCegarLoop]: Abstraction has 15149 states and 20704 transitions.
[2019-11-23 22:49:41,103 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:41,103 INFO  L276                IsEmpty]: Start isEmpty. Operand 15149 states and 20704 transitions.
[2019-11-23 22:49:41,116 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2019-11-23 22:49:41,116 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:41,116 INFO  L410         BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 22:49:41,117 INFO  L410      AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:41,117 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:41,117 INFO  L82        PathProgramCache]: Analyzing trace with hash -1827636855, now seen corresponding path program 1 times
[2019-11-23 22:49:41,117 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:41,117 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126730615]
[2019-11-23 22:49:41,117 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:41,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:41,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2019-11-23 22:49:41,158 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126730615]
[2019-11-23 22:49:41,158 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:41,158 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:41,158 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669819901]
[2019-11-23 22:49:41,159 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:41,159 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:41,159 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:41,159 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:41,159 INFO  L87              Difference]: Start difference. First operand 15149 states and 20704 transitions. Second operand 3 states.
[2019-11-23 22:49:41,526 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:41,526 INFO  L93              Difference]: Finished difference Result 29536 states and 40326 transitions.
[2019-11-23 22:49:41,527 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:41,527 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 116
[2019-11-23 22:49:41,527 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:41,540 INFO  L225             Difference]: With dead ends: 29536
[2019-11-23 22:49:41,540 INFO  L226             Difference]: Without dead ends: 15079
[2019-11-23 22:49:41,552 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:41,563 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15079 states.
[2019-11-23 22:49:41,935 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15079 to 15079.
[2019-11-23 22:49:41,936 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15079 states.
[2019-11-23 22:49:41,951 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15079 states to 15079 states and 20550 transitions.
[2019-11-23 22:49:41,952 INFO  L78                 Accepts]: Start accepts. Automaton has 15079 states and 20550 transitions. Word has length 116
[2019-11-23 22:49:41,952 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:41,952 INFO  L462      AbstractCegarLoop]: Abstraction has 15079 states and 20550 transitions.
[2019-11-23 22:49:41,952 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:41,952 INFO  L276                IsEmpty]: Start isEmpty. Operand 15079 states and 20550 transitions.
[2019-11-23 22:49:41,965 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2019-11-23 22:49:41,965 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:41,966 INFO  L410         BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 22:49:41,966 INFO  L410      AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:41,966 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:41,966 INFO  L82        PathProgramCache]: Analyzing trace with hash 521223166, now seen corresponding path program 1 times
[2019-11-23 22:49:41,967 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:41,967 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459053027]
[2019-11-23 22:49:41,967 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:41,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:42,017 INFO  L134       CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked.
[2019-11-23 22:49:42,018 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459053027]
[2019-11-23 22:49:42,018 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:42,018 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:42,019 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516072110]
[2019-11-23 22:49:42,019 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:42,019 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:42,019 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:42,020 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:42,020 INFO  L87              Difference]: Start difference. First operand 15079 states and 20550 transitions. Second operand 3 states.
[2019-11-23 22:49:42,733 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:42,733 INFO  L93              Difference]: Finished difference Result 25622 states and 34854 transitions.
[2019-11-23 22:49:42,733 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:42,733 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 127
[2019-11-23 22:49:42,734 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:42,742 INFO  L225             Difference]: With dead ends: 25622
[2019-11-23 22:49:42,742 INFO  L226             Difference]: Without dead ends: 10600
[2019-11-23 22:49:42,750 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:42,757 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10600 states.
[2019-11-23 22:49:42,999 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10600 to 8632.
[2019-11-23 22:49:43,000 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8632 states.
[2019-11-23 22:49:43,008 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8632 states to 8632 states and 11298 transitions.
[2019-11-23 22:49:43,008 INFO  L78                 Accepts]: Start accepts. Automaton has 8632 states and 11298 transitions. Word has length 127
[2019-11-23 22:49:43,008 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:43,008 INFO  L462      AbstractCegarLoop]: Abstraction has 8632 states and 11298 transitions.
[2019-11-23 22:49:43,008 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:43,009 INFO  L276                IsEmpty]: Start isEmpty. Operand 8632 states and 11298 transitions.
[2019-11-23 22:49:43,019 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 129
[2019-11-23 22:49:43,019 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:43,019 INFO  L410         BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 22:49:43,019 INFO  L410      AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:43,020 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:43,020 INFO  L82        PathProgramCache]: Analyzing trace with hash -1827087367, now seen corresponding path program 1 times
[2019-11-23 22:49:43,020 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:43,020 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285562808]
[2019-11-23 22:49:43,020 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:43,028 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:43,061 INFO  L134       CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2019-11-23 22:49:43,061 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285562808]
[2019-11-23 22:49:43,061 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:43,061 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:43,061 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169436324]
[2019-11-23 22:49:43,062 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:43,062 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:43,062 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:43,062 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:43,063 INFO  L87              Difference]: Start difference. First operand 8632 states and 11298 transitions. Second operand 3 states.
[2019-11-23 22:49:43,390 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:43,391 INFO  L93              Difference]: Finished difference Result 14223 states and 18615 transitions.
[2019-11-23 22:49:43,391 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:43,391 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 128
[2019-11-23 22:49:43,391 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:43,400 INFO  L225             Difference]: With dead ends: 14223
[2019-11-23 22:49:43,401 INFO  L226             Difference]: Without dead ends: 6745
[2019-11-23 22:49:43,415 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:43,421 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6745 states.
[2019-11-23 22:49:43,703 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6745 to 6161.
[2019-11-23 22:49:43,703 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6161 states.
[2019-11-23 22:49:43,712 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6161 states to 6161 states and 7897 transitions.
[2019-11-23 22:49:43,713 INFO  L78                 Accepts]: Start accepts. Automaton has 6161 states and 7897 transitions. Word has length 128
[2019-11-23 22:49:43,713 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:43,713 INFO  L462      AbstractCegarLoop]: Abstraction has 6161 states and 7897 transitions.
[2019-11-23 22:49:43,713 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:43,714 INFO  L276                IsEmpty]: Start isEmpty. Operand 6161 states and 7897 transitions.
[2019-11-23 22:49:43,722 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2019-11-23 22:49:43,722 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:43,722 INFO  L410         BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 22:49:43,722 INFO  L410      AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:43,723 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:43,723 INFO  L82        PathProgramCache]: Analyzing trace with hash 210660645, now seen corresponding path program 1 times
[2019-11-23 22:49:43,723 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:43,723 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536509287]
[2019-11-23 22:49:43,723 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:43,730 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:43,773 INFO  L134       CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2019-11-23 22:49:43,773 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536509287]
[2019-11-23 22:49:43,774 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:43,774 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:43,774 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222584390]
[2019-11-23 22:49:43,774 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:43,774 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:43,775 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:43,775 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:43,775 INFO  L87              Difference]: Start difference. First operand 6161 states and 7897 transitions. Second operand 3 states.
[2019-11-23 22:49:43,943 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:43,943 INFO  L93              Difference]: Finished difference Result 11935 states and 15282 transitions.
[2019-11-23 22:49:43,943 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:43,943 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 134
[2019-11-23 22:49:43,943 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:43,949 INFO  L225             Difference]: With dead ends: 11935
[2019-11-23 22:49:43,950 INFO  L226             Difference]: Without dead ends: 6160
[2019-11-23 22:49:43,954 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:44,008 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6160 states.
[2019-11-23 22:49:44,160 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6160 to 6120.
[2019-11-23 22:49:44,161 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6120 states.
[2019-11-23 22:49:44,166 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 7814 transitions.
[2019-11-23 22:49:44,166 INFO  L78                 Accepts]: Start accepts. Automaton has 6120 states and 7814 transitions. Word has length 134
[2019-11-23 22:49:44,166 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:44,166 INFO  L462      AbstractCegarLoop]: Abstraction has 6120 states and 7814 transitions.
[2019-11-23 22:49:44,166 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:44,166 INFO  L276                IsEmpty]: Start isEmpty. Operand 6120 states and 7814 transitions.
[2019-11-23 22:49:44,170 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2019-11-23 22:49:44,170 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:44,170 INFO  L410         BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 22:49:44,171 INFO  L410      AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:44,171 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:44,171 INFO  L82        PathProgramCache]: Analyzing trace with hash 80634053, now seen corresponding path program 1 times
[2019-11-23 22:49:44,171 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:44,171 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942196285]
[2019-11-23 22:49:44,171 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:44,179 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:44,217 INFO  L134       CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2019-11-23 22:49:44,217 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942196285]
[2019-11-23 22:49:44,217 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:44,217 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:44,217 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982578060]
[2019-11-23 22:49:44,218 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:44,218 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:44,218 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:44,218 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:44,218 INFO  L87              Difference]: Start difference. First operand 6120 states and 7814 transitions. Second operand 3 states.
[2019-11-23 22:49:44,547 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:44,547 INFO  L93              Difference]: Finished difference Result 11874 states and 15143 transitions.
[2019-11-23 22:49:44,547 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:44,547 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 134
[2019-11-23 22:49:44,548 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:44,554 INFO  L225             Difference]: With dead ends: 11874
[2019-11-23 22:49:44,554 INFO  L226             Difference]: Without dead ends: 6130
[2019-11-23 22:49:44,559 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:44,563 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6130 states.
[2019-11-23 22:49:44,764 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6130 to 6090.
[2019-11-23 22:49:44,764 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6090 states.
[2019-11-23 22:49:44,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6090 states to 6090 states and 7743 transitions.
[2019-11-23 22:49:44,770 INFO  L78                 Accepts]: Start accepts. Automaton has 6090 states and 7743 transitions. Word has length 134
[2019-11-23 22:49:44,770 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:44,770 INFO  L462      AbstractCegarLoop]: Abstraction has 6090 states and 7743 transitions.
[2019-11-23 22:49:44,770 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:44,770 INFO  L276                IsEmpty]: Start isEmpty. Operand 6090 states and 7743 transitions.
[2019-11-23 22:49:44,774 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2019-11-23 22:49:44,774 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:44,774 INFO  L410         BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 22:49:44,774 INFO  L410      AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:44,774 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:44,775 INFO  L82        PathProgramCache]: Analyzing trace with hash 1507420786, now seen corresponding path program 1 times
[2019-11-23 22:49:44,775 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:44,775 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478116488]
[2019-11-23 22:49:44,775 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:44,782 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:44,805 INFO  L134       CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2019-11-23 22:49:44,806 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478116488]
[2019-11-23 22:49:44,806 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:44,806 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:44,806 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564201597]
[2019-11-23 22:49:44,806 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:44,807 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:44,807 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:44,807 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:44,807 INFO  L87              Difference]: Start difference. First operand 6090 states and 7743 transitions. Second operand 3 states.
[2019-11-23 22:49:44,983 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:44,983 INFO  L93              Difference]: Finished difference Result 10918 states and 13929 transitions.
[2019-11-23 22:49:44,984 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:44,984 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 137
[2019-11-23 22:49:44,984 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:44,988 INFO  L225             Difference]: With dead ends: 10918
[2019-11-23 22:49:44,988 INFO  L226             Difference]: Without dead ends: 5200
[2019-11-23 22:49:44,991 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:44,994 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5200 states.
[2019-11-23 22:49:45,119 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 5198.
[2019-11-23 22:49:45,119 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5198 states.
[2019-11-23 22:49:45,124 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5198 states to 5198 states and 6467 transitions.
[2019-11-23 22:49:45,124 INFO  L78                 Accepts]: Start accepts. Automaton has 5198 states and 6467 transitions. Word has length 137
[2019-11-23 22:49:45,124 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:45,124 INFO  L462      AbstractCegarLoop]: Abstraction has 5198 states and 6467 transitions.
[2019-11-23 22:49:45,124 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:45,124 INFO  L276                IsEmpty]: Start isEmpty. Operand 5198 states and 6467 transitions.
[2019-11-23 22:49:45,127 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2019-11-23 22:49:45,127 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:45,127 INFO  L410         BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 22:49:45,127 INFO  L410      AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:45,127 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:45,128 INFO  L82        PathProgramCache]: Analyzing trace with hash 1526376893, now seen corresponding path program 1 times
[2019-11-23 22:49:45,128 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:45,128 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296450577]
[2019-11-23 22:49:45,128 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:45,135 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:45,181 INFO  L134       CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2019-11-23 22:49:45,182 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296450577]
[2019-11-23 22:49:45,182 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:45,182 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:45,182 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733138732]
[2019-11-23 22:49:45,183 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:45,183 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:45,183 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:45,183 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:45,183 INFO  L87              Difference]: Start difference. First operand 5198 states and 6467 transitions. Second operand 3 states.
[2019-11-23 22:49:45,330 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:45,330 INFO  L93              Difference]: Finished difference Result 9274 states and 11585 transitions.
[2019-11-23 22:49:45,331 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:45,331 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 137
[2019-11-23 22:49:45,331 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:45,334 INFO  L225             Difference]: With dead ends: 9274
[2019-11-23 22:49:45,334 INFO  L226             Difference]: Without dead ends: 4110
[2019-11-23 22:49:45,337 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:45,339 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4110 states.
[2019-11-23 22:49:45,441 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4110 to 4092.
[2019-11-23 22:49:45,441 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4092 states.
[2019-11-23 22:49:45,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 5032 transitions.
[2019-11-23 22:49:45,446 INFO  L78                 Accepts]: Start accepts. Automaton has 4092 states and 5032 transitions. Word has length 137
[2019-11-23 22:49:45,446 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:45,446 INFO  L462      AbstractCegarLoop]: Abstraction has 4092 states and 5032 transitions.
[2019-11-23 22:49:45,446 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:45,447 INFO  L276                IsEmpty]: Start isEmpty. Operand 4092 states and 5032 transitions.
[2019-11-23 22:49:45,449 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2019-11-23 22:49:45,449 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:45,450 INFO  L410         BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 22:49:45,450 INFO  L410      AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:45,450 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:45,450 INFO  L82        PathProgramCache]: Analyzing trace with hash 48056104, now seen corresponding path program 1 times
[2019-11-23 22:49:45,450 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:45,450 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9979965]
[2019-11-23 22:49:45,451 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:45,460 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:45,518 INFO  L134       CoverageAnalysis]: Checked inductivity of 99 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2019-11-23 22:49:45,518 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9979965]
[2019-11-23 22:49:45,518 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:45,518 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:45,519 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128379921]
[2019-11-23 22:49:45,519 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:45,519 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:45,519 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:45,520 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:45,520 INFO  L87              Difference]: Start difference. First operand 4092 states and 5032 transitions. Second operand 3 states.
[2019-11-23 22:49:45,716 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:45,716 INFO  L93              Difference]: Finished difference Result 7599 states and 9405 transitions.
[2019-11-23 22:49:45,716 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:45,716 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 170
[2019-11-23 22:49:45,717 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:45,720 INFO  L225             Difference]: With dead ends: 7599
[2019-11-23 22:49:45,720 INFO  L226             Difference]: Without dead ends: 3783
[2019-11-23 22:49:45,722 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:45,725 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3783 states.
[2019-11-23 22:49:45,866 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3563.
[2019-11-23 22:49:45,866 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3563 states.
[2019-11-23 22:49:45,871 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 4341 transitions.
[2019-11-23 22:49:45,871 INFO  L78                 Accepts]: Start accepts. Automaton has 3563 states and 4341 transitions. Word has length 170
[2019-11-23 22:49:45,871 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:45,871 INFO  L462      AbstractCegarLoop]: Abstraction has 3563 states and 4341 transitions.
[2019-11-23 22:49:45,871 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:45,872 INFO  L276                IsEmpty]: Start isEmpty. Operand 3563 states and 4341 transitions.
[2019-11-23 22:49:45,906 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2019-11-23 22:49:45,906 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:45,906 INFO  L410         BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 22:49:45,907 INFO  L410      AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:45,907 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:45,907 INFO  L82        PathProgramCache]: Analyzing trace with hash -1975319017, now seen corresponding path program 1 times
[2019-11-23 22:49:45,907 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:45,907 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362039860]
[2019-11-23 22:49:45,907 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:45,917 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:45,956 INFO  L134       CoverageAnalysis]: Checked inductivity of 105 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2019-11-23 22:49:45,956 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362039860]
[2019-11-23 22:49:45,957 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:45,957 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:45,957 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632515118]
[2019-11-23 22:49:45,957 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:45,957 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:45,958 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:45,958 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:45,958 INFO  L87              Difference]: Start difference. First operand 3563 states and 4341 transitions. Second operand 3 states.
[2019-11-23 22:49:46,304 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:46,304 INFO  L93              Difference]: Finished difference Result 8926 states and 10917 transitions.
[2019-11-23 22:49:46,305 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:46,305 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 177
[2019-11-23 22:49:46,306 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:46,313 INFO  L225             Difference]: With dead ends: 8926
[2019-11-23 22:49:46,313 INFO  L226             Difference]: Without dead ends: 5639
[2019-11-23 22:49:46,317 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:46,323 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5639 states.
[2019-11-23 22:49:46,616 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5417.
[2019-11-23 22:49:46,617 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5417 states.
[2019-11-23 22:49:46,624 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5417 states to 5417 states and 6519 transitions.
[2019-11-23 22:49:46,624 INFO  L78                 Accepts]: Start accepts. Automaton has 5417 states and 6519 transitions. Word has length 177
[2019-11-23 22:49:46,624 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:46,625 INFO  L462      AbstractCegarLoop]: Abstraction has 5417 states and 6519 transitions.
[2019-11-23 22:49:46,625 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:46,625 INFO  L276                IsEmpty]: Start isEmpty. Operand 5417 states and 6519 transitions.
[2019-11-23 22:49:46,629 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2019-11-23 22:49:46,629 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:46,629 INFO  L410         BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 22:49:46,629 INFO  L410      AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:46,630 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:46,630 INFO  L82        PathProgramCache]: Analyzing trace with hash 1080445198, now seen corresponding path program 1 times
[2019-11-23 22:49:46,630 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:46,630 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418842185]
[2019-11-23 22:49:46,630 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:46,640 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:46,684 INFO  L134       CoverageAnalysis]: Checked inductivity of 105 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2019-11-23 22:49:46,684 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418842185]
[2019-11-23 22:49:46,684 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:46,684 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-11-23 22:49:46,685 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23213895]
[2019-11-23 22:49:46,685 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-23 22:49:46,685 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:46,685 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-23 22:49:46,685 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-23 22:49:46,686 INFO  L87              Difference]: Start difference. First operand 5417 states and 6519 transitions. Second operand 4 states.
[2019-11-23 22:49:46,844 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:46,844 INFO  L93              Difference]: Finished difference Result 8455 states and 10154 transitions.
[2019-11-23 22:49:46,845 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-11-23 22:49:46,845 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 180
[2019-11-23 22:49:46,845 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:46,847 INFO  L225             Difference]: With dead ends: 8455
[2019-11-23 22:49:46,847 INFO  L226             Difference]: Without dead ends: 3314
[2019-11-23 22:49:46,850 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-23 22:49:46,851 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3314 states.
[2019-11-23 22:49:46,925 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 2364.
[2019-11-23 22:49:46,925 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2364 states.
[2019-11-23 22:49:46,927 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 2795 transitions.
[2019-11-23 22:49:46,928 INFO  L78                 Accepts]: Start accepts. Automaton has 2364 states and 2795 transitions. Word has length 180
[2019-11-23 22:49:46,928 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:46,928 INFO  L462      AbstractCegarLoop]: Abstraction has 2364 states and 2795 transitions.
[2019-11-23 22:49:46,928 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-23 22:49:46,928 INFO  L276                IsEmpty]: Start isEmpty. Operand 2364 states and 2795 transitions.
[2019-11-23 22:49:46,929 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 185
[2019-11-23 22:49:46,929 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:46,929 INFO  L410         BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 22:49:46,930 INFO  L410      AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:46,930 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:46,930 INFO  L82        PathProgramCache]: Analyzing trace with hash 844703381, now seen corresponding path program 1 times
[2019-11-23 22:49:46,930 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:46,930 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110333365]
[2019-11-23 22:49:46,930 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:46,940 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:46,990 INFO  L134       CoverageAnalysis]: Checked inductivity of 107 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2019-11-23 22:49:46,990 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110333365]
[2019-11-23 22:49:46,991 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:46,991 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:46,991 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140693855]
[2019-11-23 22:49:46,991 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:46,991 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:46,992 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:46,992 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:46,992 INFO  L87              Difference]: Start difference. First operand 2364 states and 2795 transitions. Second operand 3 states.
[2019-11-23 22:49:47,152 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:47,152 INFO  L93              Difference]: Finished difference Result 6276 states and 7453 transitions.
[2019-11-23 22:49:47,152 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:47,152 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 184
[2019-11-23 22:49:47,153 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:47,155 INFO  L225             Difference]: With dead ends: 6276
[2019-11-23 22:49:47,155 INFO  L226             Difference]: Without dead ends: 3726
[2019-11-23 22:49:47,157 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:47,159 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3726 states.
[2019-11-23 22:49:47,267 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3726 to 3711.
[2019-11-23 22:49:47,267 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3711 states.
[2019-11-23 22:49:47,270 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3711 states to 3711 states and 4391 transitions.
[2019-11-23 22:49:47,271 INFO  L78                 Accepts]: Start accepts. Automaton has 3711 states and 4391 transitions. Word has length 184
[2019-11-23 22:49:47,271 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:47,271 INFO  L462      AbstractCegarLoop]: Abstraction has 3711 states and 4391 transitions.
[2019-11-23 22:49:47,271 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:47,271 INFO  L276                IsEmpty]: Start isEmpty. Operand 3711 states and 4391 transitions.
[2019-11-23 22:49:47,272 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 185
[2019-11-23 22:49:47,273 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:47,273 INFO  L410         BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 22:49:47,273 INFO  L410      AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:47,273 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:47,273 INFO  L82        PathProgramCache]: Analyzing trace with hash 539882129, now seen corresponding path program 1 times
[2019-11-23 22:49:47,273 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:47,273 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469674793]
[2019-11-23 22:49:47,274 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:47,283 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:47,335 INFO  L134       CoverageAnalysis]: Checked inductivity of 107 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2019-11-23 22:49:47,336 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469674793]
[2019-11-23 22:49:47,336 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:47,336 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:47,336 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395752557]
[2019-11-23 22:49:47,337 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:47,337 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:47,337 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:47,337 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:47,337 INFO  L87              Difference]: Start difference. First operand 3711 states and 4391 transitions. Second operand 3 states.
[2019-11-23 22:49:47,443 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:47,443 INFO  L93              Difference]: Finished difference Result 5004 states and 5865 transitions.
[2019-11-23 22:49:47,443 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:47,443 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 184
[2019-11-23 22:49:47,444 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:47,445 INFO  L225             Difference]: With dead ends: 5004
[2019-11-23 22:49:47,445 INFO  L226             Difference]: Without dead ends: 1520
[2019-11-23 22:49:47,446 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:47,447 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1520 states.
[2019-11-23 22:49:47,493 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1520.
[2019-11-23 22:49:47,493 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1520 states.
[2019-11-23 22:49:47,495 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1701 transitions.
[2019-11-23 22:49:47,495 INFO  L78                 Accepts]: Start accepts. Automaton has 1520 states and 1701 transitions. Word has length 184
[2019-11-23 22:49:47,495 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:47,495 INFO  L462      AbstractCegarLoop]: Abstraction has 1520 states and 1701 transitions.
[2019-11-23 22:49:47,495 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:47,495 INFO  L276                IsEmpty]: Start isEmpty. Operand 1520 states and 1701 transitions.
[2019-11-23 22:49:47,496 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 186
[2019-11-23 22:49:47,496 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:47,497 INFO  L410         BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 22:49:47,497 INFO  L410      AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:47,497 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:47,497 INFO  L82        PathProgramCache]: Analyzing trace with hash 391755360, now seen corresponding path program 1 times
[2019-11-23 22:49:47,497 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:47,497 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53172351]
[2019-11-23 22:49:47,497 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:47,519 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:47,746 INFO  L134       CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2019-11-23 22:49:47,746 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53172351]
[2019-11-23 22:49:47,746 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185932225]
[2019-11-23 22:49:47,746 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-23 22:49:47,844 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:47,848 INFO  L255         TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 19 conjunts are in the unsatisfiable core
[2019-11-23 22:49:47,861 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2019-11-23 22:49:48,028 INFO  L134       CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2019-11-23 22:49:48,029 INFO  L220   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-11-23 22:49:48,029 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10
[2019-11-23 22:49:48,029 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722270829]
[2019-11-23 22:49:48,030 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 10 states
[2019-11-23 22:49:48,030 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:48,030 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2019-11-23 22:49:48,030 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2019-11-23 22:49:48,030 INFO  L87              Difference]: Start difference. First operand 1520 states and 1701 transitions. Second operand 10 states.
[2019-11-23 22:49:48,678 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:48,679 INFO  L93              Difference]: Finished difference Result 3342 states and 3749 transitions.
[2019-11-23 22:49:48,679 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2019-11-23 22:49:48,679 INFO  L78                 Accepts]: Start accepts. Automaton has 10 states. Word has length 185
[2019-11-23 22:49:48,680 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:48,693 INFO  L225             Difference]: With dead ends: 3342
[2019-11-23 22:49:48,694 INFO  L226             Difference]: Without dead ends: 2500
[2019-11-23 22:49:48,696 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380
[2019-11-23 22:49:48,698 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2500 states.
[2019-11-23 22:49:48,841 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 1882.
[2019-11-23 22:49:48,842 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1882 states.
[2019-11-23 22:49:48,844 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2107 transitions.
[2019-11-23 22:49:48,844 INFO  L78                 Accepts]: Start accepts. Automaton has 1882 states and 2107 transitions. Word has length 185
[2019-11-23 22:49:48,844 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:48,844 INFO  L462      AbstractCegarLoop]: Abstraction has 1882 states and 2107 transitions.
[2019-11-23 22:49:48,845 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2019-11-23 22:49:48,845 INFO  L276                IsEmpty]: Start isEmpty. Operand 1882 states and 2107 transitions.
[2019-11-23 22:49:48,846 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 192
[2019-11-23 22:49:48,846 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:48,846 INFO  L410         BasicCegarLoop]: trace histogram [7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:49:49,052 WARN  L499      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-23 22:49:49,052 INFO  L410      AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:49,052 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:49,052 INFO  L82        PathProgramCache]: Analyzing trace with hash -1085364486, now seen corresponding path program 1 times
[2019-11-23 22:49:49,052 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:49,053 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153038746]
[2019-11-23 22:49:49,053 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:49,072 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:49,282 INFO  L134       CoverageAnalysis]: Checked inductivity of 140 backedges. 95 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2019-11-23 22:49:49,282 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153038746]
[2019-11-23 22:49:49,282 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917150056]
[2019-11-23 22:49:49,282 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-23 22:49:49,371 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:49,372 INFO  L255         TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 17 conjunts are in the unsatisfiable core
[2019-11-23 22:49:49,378 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2019-11-23 22:49:49,481 INFO  L134       CoverageAnalysis]: Checked inductivity of 140 backedges. 95 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2019-11-23 22:49:49,482 INFO  L220   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-11-23 22:49:49,482 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9
[2019-11-23 22:49:49,482 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996614820]
[2019-11-23 22:49:49,483 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-11-23 22:49:49,483 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:49,483 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-11-23 22:49:49,484 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2019-11-23 22:49:49,484 INFO  L87              Difference]: Start difference. First operand 1882 states and 2107 transitions. Second operand 9 states.
[2019-11-23 22:49:50,058 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:50,059 INFO  L93              Difference]: Finished difference Result 4238 states and 4750 transitions.
[2019-11-23 22:49:50,059 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2019-11-23 22:49:50,059 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 191
[2019-11-23 22:49:50,060 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:50,066 INFO  L225             Difference]: With dead ends: 4238
[2019-11-23 22:49:50,066 INFO  L226             Difference]: Without dead ends: 3054
[2019-11-23 22:49:50,070 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420
[2019-11-23 22:49:50,072 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3054 states.
[2019-11-23 22:49:50,193 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 2246.
[2019-11-23 22:49:50,194 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2246 states.
[2019-11-23 22:49:50,196 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 2519 transitions.
[2019-11-23 22:49:50,196 INFO  L78                 Accepts]: Start accepts. Automaton has 2246 states and 2519 transitions. Word has length 191
[2019-11-23 22:49:50,197 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:50,197 INFO  L462      AbstractCegarLoop]: Abstraction has 2246 states and 2519 transitions.
[2019-11-23 22:49:50,197 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-11-23 22:49:50,197 INFO  L276                IsEmpty]: Start isEmpty. Operand 2246 states and 2519 transitions.
[2019-11-23 22:49:50,199 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 276
[2019-11-23 22:49:50,199 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:50,200 INFO  L410         BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2019-11-23 22:49:50,404 WARN  L499      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-23 22:49:50,404 INFO  L410      AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:50,405 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:50,405 INFO  L82        PathProgramCache]: Analyzing trace with hash 1360853638, now seen corresponding path program 1 times
[2019-11-23 22:49:50,405 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:50,405 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444534918]
[2019-11-23 22:49:50,405 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:50,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:50,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 319 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked.
[2019-11-23 22:49:50,491 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444534918]
[2019-11-23 22:49:50,491 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:50,491 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:50,491 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522019296]
[2019-11-23 22:49:50,492 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:50,492 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:50,492 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:50,492 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:50,493 INFO  L87              Difference]: Start difference. First operand 2246 states and 2519 transitions. Second operand 3 states.
[2019-11-23 22:49:50,668 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:50,668 INFO  L93              Difference]: Finished difference Result 3370 states and 3780 transitions.
[2019-11-23 22:49:50,669 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:50,669 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 275
[2019-11-23 22:49:50,670 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:50,674 INFO  L225             Difference]: With dead ends: 3370
[2019-11-23 22:49:50,674 INFO  L226             Difference]: Without dead ends: 1652
[2019-11-23 22:49:50,676 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:50,678 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1652 states.
[2019-11-23 22:49:50,822 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1582.
[2019-11-23 22:49:50,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1582 states.
[2019-11-23 22:49:50,825 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1755 transitions.
[2019-11-23 22:49:50,826 INFO  L78                 Accepts]: Start accepts. Automaton has 1582 states and 1755 transitions. Word has length 275
[2019-11-23 22:49:50,826 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:50,826 INFO  L462      AbstractCegarLoop]: Abstraction has 1582 states and 1755 transitions.
[2019-11-23 22:49:50,827 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:50,827 INFO  L276                IsEmpty]: Start isEmpty. Operand 1582 states and 1755 transitions.
[2019-11-23 22:49:50,831 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 282
[2019-11-23 22:49:50,831 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 22:49:50,832 INFO  L410         BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2019-11-23 22:49:50,832 INFO  L410      AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 22:49:50,833 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 22:49:50,833 INFO  L82        PathProgramCache]: Analyzing trace with hash -1393925257, now seen corresponding path program 1 times
[2019-11-23 22:49:50,833 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 22:49:50,833 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277933100]
[2019-11-23 22:49:50,834 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 22:49:50,858 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 22:49:50,966 INFO  L134       CoverageAnalysis]: Checked inductivity of 329 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked.
[2019-11-23 22:49:50,966 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277933100]
[2019-11-23 22:49:50,966 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 22:49:50,967 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 22:49:50,967 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794563015]
[2019-11-23 22:49:50,967 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 22:49:50,968 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 22:49:50,968 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 22:49:50,968 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 22:49:50,968 INFO  L87              Difference]: Start difference. First operand 1582 states and 1755 transitions. Second operand 3 states.
[2019-11-23 22:49:51,069 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 22:49:51,070 INFO  L93              Difference]: Finished difference Result 2334 states and 2579 transitions.
[2019-11-23 22:49:51,070 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 22:49:51,070 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 281
[2019-11-23 22:49:51,071 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 22:49:51,071 INFO  L225             Difference]: With dead ends: 2334
[2019-11-23 22:49:51,071 INFO  L226             Difference]: Without dead ends: 0
[2019-11-23 22:49:51,074 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:49:51,074 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2019-11-23 22:49:51,074 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2019-11-23 22:49:51,074 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2019-11-23 22:49:51,075 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2019-11-23 22:49:51,075 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281
[2019-11-23 22:49:51,075 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 22:49:51,075 INFO  L462      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2019-11-23 22:49:51,075 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 22:49:51,075 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2019-11-23 22:49:51,076 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2019-11-23 22:49:51,081 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2019-11-23 22:49:52,125 WARN  L192               SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 451 DAG size of output: 227
[2019-11-23 22:49:52,382 WARN  L192               SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 149
[2019-11-23 22:49:52,505 WARN  L192               SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 104
[2019-11-23 22:49:53,151 WARN  L192               SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 394 DAG size of output: 187
[2019-11-23 22:49:53,396 WARN  L192               SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 108
[2019-11-23 22:49:54,006 WARN  L192               SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 447 DAG size of output: 223
[2019-11-23 22:49:54,355 WARN  L192               SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 181
[2019-11-23 22:49:54,883 WARN  L192               SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 467 DAG size of output: 233
[2019-11-23 22:49:55,078 WARN  L192               SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 308 DAG size of output: 189
[2019-11-23 22:49:55,541 WARN  L192               SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 447 DAG size of output: 223
[2019-11-23 22:49:55,820 WARN  L192               SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 215
[2019-11-23 22:50:02,032 WARN  L192               SmtUtils]: Spent 6.21 s on a formula simplification. DAG size of input: 195 DAG size of output: 151
[2019-11-23 22:50:03,033 WARN  L192               SmtUtils]: Spent 997.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66
[2019-11-23 22:50:04,791 WARN  L192               SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 142 DAG size of output: 100
[2019-11-23 22:50:06,057 WARN  L192               SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 99 DAG size of output: 93
[2019-11-23 22:50:11,193 WARN  L192               SmtUtils]: Spent 5.13 s on a formula simplification. DAG size of input: 158 DAG size of output: 140
[2019-11-23 22:50:11,820 WARN  L192               SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86
[2019-11-23 22:50:12,534 WARN  L192               SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 78
[2019-11-23 22:50:14,233 WARN  L192               SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 99 DAG size of output: 98
[2019-11-23 22:50:19,910 WARN  L192               SmtUtils]: Spent 5.67 s on a formula simplification. DAG size of input: 191 DAG size of output: 150
[2019-11-23 22:50:20,940 WARN  L192               SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 103 DAG size of output: 83
[2019-11-23 22:50:24,248 WARN  L192               SmtUtils]: Spent 3.30 s on a formula simplification. DAG size of input: 150 DAG size of output: 107
[2019-11-23 22:50:24,961 WARN  L192               SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 78
[2019-11-23 22:50:30,924 WARN  L192               SmtUtils]: Spent 5.96 s on a formula simplification. DAG size of input: 199 DAG size of output: 151
[2019-11-23 22:50:31,145 WARN  L192               SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54
[2019-11-23 22:50:34,850 WARN  L192               SmtUtils]: Spent 3.70 s on a formula simplification. DAG size of input: 162 DAG size of output: 123
[2019-11-23 22:50:35,628 WARN  L192               SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71
[2019-11-23 22:50:41,323 WARN  L192               SmtUtils]: Spent 5.69 s on a formula simplification. DAG size of input: 191 DAG size of output: 150
[2019-11-23 22:50:43,253 WARN  L192               SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 214 DAG size of output: 90
[2019-11-23 22:50:43,257 INFO  L444   ceAbstractionStarter]: For program point  L663(lines 663 671)  no Hoare annotation was computed.
[2019-11-23 22:50:43,257 INFO  L444   ceAbstractionStarter]: For program point  L597(lines 535 675)  no Hoare annotation was computed.
[2019-11-23 22:50:43,257 INFO  L444   ceAbstractionStarter]: For program point  L564-1(lines 535 675)  no Hoare annotation was computed.
[2019-11-23 22:50:43,258 INFO  L444   ceAbstractionStarter]: For program point  L399(lines 399 404)  no Hoare annotation was computed.
[2019-11-23 22:50:43,258 INFO  L444   ceAbstractionStarter]: For program point  L399-2(lines 399 404)  no Hoare annotation was computed.
[2019-11-23 22:50:43,259 INFO  L440   ceAbstractionStarter]: At program point  L135(lines 130 170)  the Hoare annotation is:  (let ((.cse21 (+ ~t_b~0 1))) (let ((.cse2 (= ~c2_st~0 0)) (.cse13 (<= 2 ~wb_st~0)) (.cse22 (= 2 ~wl_pc~0)) (.cse23 (<= .cse21 ~data~0)) (.cse25 (<= ~data~0 .cse21)) (.cse26 (= ~e_f~0 ~wl_st~0)) (.cse0 (= ~c2_pc~0 1)) (.cse1 (not (= ~e_f~0 1))) (.cse3 (= ~wb_i~0 1)) (.cse4 (= ~processed~0 0)) (.cse5 (<= 2 ~wl_st~0)) (.cse6 (not (= ~e_c~0 0))) (.cse7 (not (= ~e_f~0 0))) (.cse9 (not (= ~e_e~0 0))) (.cse10 (= ~c2_i~0 1)) (.cse8 (= 1 ~wl_pc~0)) (.cse24 (<= 2 ~c2_st~0)) (.cse11 (not (= ~e_g~0 0))) (.cse12 (= ~c1_i~0 1)) (.cse14 (<= 2 ~r_st~0)) (.cse27 (= 0 ~wb_st~0)) (.cse15 (<= 2 ~e_wl~0)) (.cse16 (= ~c1_pc~0 1)) (.cse17 (not (= ~e_e~0 1))) (.cse18 (not (= ~e_g~0 1))) (.cse19 (<= ~r_i~0 0)) (.cse20 (= 1 ~wb_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 (<= .cse21 ~c_t~0) .cse22 .cse23 .cse3 .cse5 .cse6 .cse9 .cse10 .cse24 .cse11 .cse25 .cse12 .cse13 .cse14 (<= ~c_t~0 .cse21) .cse16 (= ~c_req_up~0 1) .cse26 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse22 .cse3 .cse4 .cse5 (<= ~t_b~0 ~data~0) .cse6 .cse9 .cse10 (<= ~data~0 ~t_b~0) .cse11 .cse12 .cse13 .cse14 (<= ~data~0 ULTIMATE.start_write_loop_~t~0) (<= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse16 .cse26 .cse17 .cse18 .cse19 .cse20) (and .cse3 .cse5 (= ~e_wl~0 ~e_f~0) .cse6 .cse9 .cse10 .cse11 .cse12 (= 0 ~wl_pc~0) .cse15 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse22 .cse23 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse24 .cse11 .cse25 .cse12 .cse14 .cse27 .cse16 .cse17 .cse26 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse8 .cse24 .cse11 .cse12 .cse14 .cse27 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))))
[2019-11-23 22:50:43,259 INFO  L440   ceAbstractionStarter]: At program point  L69(lines 55 125)  the Hoare annotation is:  (let ((.cse26 (= ~e_c~0 ~e_g~0)) (.cse27 (= ~e_g~0 ~e_f~0)) (.cse22 (= ~c2_pc~0 1)) (.cse24 (= ~c1_pc~0 0)) (.cse23 (<= 2 ~c2_st~0)) (.cse13 (= 0 ~wb_st~0)) (.cse25 (= ~c1_st~0 0)) (.cse19 (= 0 ~wb_pc~0)) (.cse0 (= ~c2_st~0 0)) (.cse2 (= ~wb_i~0 1)) (.cse1 (= ~processed~0 0)) (.cse3 (<= ~t_b~0 ~data~0)) (.cse4 (not (= ~e_e~0 0))) (.cse5 (= ~c2_i~0 1)) (.cse6 (<= ~data~0 ~t_b~0)) (.cse7 (<= 2 ~c1_st~0)) (.cse8 (not (= ~e_g~0 0))) (.cse9 (= ~e_e~0 ~e_c~0)) (.cse10 (= ~c1_i~0 1)) (.cse28 (<= 2 ~wb_st~0)) (.cse11 (= ~e_e~0 ~e_f~0)) (.cse12 (<= 2 ~r_st~0)) (.cse14 (= ~c2_pc~0 0)) (.cse15 (<= 2 ~e_wl~0)) (.cse16 (<= ~c_req_up~0 0)) (.cse17 (= ~c1_pc~0 1)) (.cse18 (not (= ~e_e~0 1))) (.cse20 (<= ~r_i~0 0)) (.cse21 (not (= ~e_g~0 1))) (.cse29 (= 1 ~wb_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse22 .cse2 .cse1 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse1 .cse3 .cse5 .cse24 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse26 .cse15 .cse16 .cse18 .cse27 .cse19 .cse20) (and .cse22 .cse2 .cse1 .cse3 .cse4 .cse5 .cse24 .cse23 .cse6 .cse8 .cse9 .cse10 .cse28 .cse11 .cse12 .cse25 .cse15 .cse16 .cse18 .cse20 .cse21 .cse29) (and .cse0 .cse2 .cse1 .cse3 .cse5 .cse24 .cse6 .cse8 .cse10 .cse28 .cse11 .cse12 .cse25 .cse14 .cse26 .cse15 .cse16 .cse18 .cse27 .cse20 .cse29) (and .cse22 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse28 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse29) (and .cse22 .cse2 .cse1 .cse3 .cse4 .cse5 .cse24 .cse23 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse28 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse29)))
[2019-11-23 22:50:43,259 INFO  L444   ceAbstractionStarter]: For program point  L598(lines 598 602)  no Hoare annotation was computed.
[2019-11-23 22:50:43,260 INFO  L440   ceAbstractionStarter]: At program point  L466(lines 459 476)  the Hoare annotation is:  (let ((.cse0 (= ~c2_st~0 0)) (.cse1 (= ~wb_i~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse3 (= ~c1_i~0 1)) (.cse4 (= ~e_e~0 ~e_f~0)) (.cse5 (= 0 ~wb_st~0)) (.cse6 (= ~c1_st~0 0)) (.cse7 (= 0 ~wl_pc~0)) (.cse8 (<= 2 ~e_wl~0)) (.cse9 (= ~e_g~0 ~e_f~0)) (.cse10 (<= ~r_i~0 0))) (or (and .cse0 .cse1 (<= 2 ~wl_st~0) (= ~e_wl~0 ~e_f~0) (not (= ~e_c~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= ~processed~0 0) (<= ~t_b~0 ~data~0) (= 0 ~wl_st~0) .cse2 (= ~c1_pc~0 0) (<= ~data~0 ~t_b~0) .cse3 .cse4 (<= 2 ~r_st~0) .cse5 .cse6 .cse7 (= ~c2_pc~0 0) (= ~e_c~0 ~e_g~0) .cse8 (<= ~c_req_up~0 0) .cse9 (= 0 ~wb_pc~0) .cse10 (= ~e_wl~0 ~e_c~0))))
[2019-11-23 22:50:43,260 INFO  L444   ceAbstractionStarter]: For program point  L467(lines 396 680)  no Hoare annotation was computed.
[2019-11-23 22:50:43,260 INFO  L444   ceAbstractionStarter]: For program point  L434-1(lines 396 680)  no Hoare annotation was computed.
[2019-11-23 22:50:43,260 INFO  L444   ceAbstractionStarter]: For program point  L302(lines 302 306)  no Hoare annotation was computed.
[2019-11-23 22:50:43,260 INFO  L444   ceAbstractionStarter]: For program point  L302-1(lines 288 386)  no Hoare annotation was computed.
[2019-11-23 22:50:43,260 INFO  L444   ceAbstractionStarter]: For program point  L666(lines 666 670)  no Hoare annotation was computed.
[2019-11-23 22:50:43,260 INFO  L444   ceAbstractionStarter]: For program point  L666-1(lines 396 680)  no Hoare annotation was computed.
[2019-11-23 22:50:43,260 INFO  L444   ceAbstractionStarter]: For program point  L468(lines 468 472)  no Hoare annotation was computed.
[2019-11-23 22:50:43,261 INFO  L444   ceAbstractionStarter]: For program point  L634-1(lines 535 675)  no Hoare annotation was computed.
[2019-11-23 22:50:43,261 INFO  L444   ceAbstractionStarter]: For program point  L536(line 536)  no Hoare annotation was computed.
[2019-11-23 22:50:43,261 INFO  L444   ceAbstractionStarter]: For program point  L569-1(lines 535 675)  no Hoare annotation was computed.
[2019-11-23 22:50:43,262 INFO  L440   ceAbstractionStarter]: At program point  L371(lines 288 386)  the Hoare annotation is:  (let ((.cse53 (+ ~t_b~0 2)) (.cse52 (+ ~t_b~0 1)) (.cse35 (= ~e_f~0 ~wl_st~0)) (.cse2 (= ~c2_pc~0 1)) (.cse4 (= ~wb_i~0 1)) (.cse3 (= ~processed~0 0)) (.cse5 (<= 2 ~wl_st~0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~c2_i~0 1)) (.cse9 (= 1 ~wl_pc~0)) (.cse11 (<= 2 ~c2_st~0)) (.cse28 (<= 2 ~c1_st~0)) (.cse13 (not (= ~e_g~0 0))) (.cse14 (= ~e_e~0 ~e_c~0)) (.cse15 (= ~c1_i~0 1)) (.cse30 (<= 2 ~wb_st~0)) (.cse16 (= ~e_e~0 ~e_f~0)) (.cse17 (<= 2 ~r_st~0)) (.cse20 (<= ~c_req_up~0 0)) (.cse33 (= ~c1_pc~0 1)) (.cse21 (not (= ~e_e~0 1))) (.cse23 (not (= ~e_g~0 1))) (.cse24 (<= ~r_i~0 0)) (.cse36 (= 1 ~wb_pc~0))) (let ((.cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse11 .cse28 .cse13 .cse14 .cse15 .cse30 .cse17 .cse20 .cse33 .cse35 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse4 .cse3 .cse5 .cse7 .cse8 .cse9 .cse11 .cse28 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse20 .cse33 .cse21 .cse23 .cse24 .cse36))) (.cse34 (= ~c_req_up~0 1)) (.cse41 (= ~e_c~0 ~e_g~0)) (.cse42 (= ~e_g~0 ~e_f~0)) (.cse40 (= ~c2_pc~0 0)) (.cse46 (<= .cse52 ~c_t~0)) (.cse47 (<= .cse52 ~c~0)) (.cse48 (<= ~c_t~0 .cse52)) (.cse44 (<= .cse52 ~data~0)) (.cse45 (<= ~data~0 .cse52)) (.cse49 (<= ~c~0 .cse52)) (.cse37 (= ~c2_st~0 0)) (.cse50 (not (= ~e_f~0 1))) (.cse51 (not (= ~e_f~0 0))) (.cse6 (<= ~t_b~0 ~data~0)) (.cse38 (= 0 ~wl_st~0)) (.cse10 (= ~c1_pc~0 0)) (.cse12 (<= ~data~0 ~t_b~0)) (.cse18 (= 0 ~wb_st~0)) (.cse19 (= ~c1_st~0 0)) (.cse39 (= 0 ~wl_pc~0)) (.cse0 (<= 2 ~e_wl~0)) (.cse22 (= 0 ~wb_pc~0)) (.cse43 (= ~e_wl~0 ~e_c~0)) (.cse25 (<= .cse53 ~c_t~0)) (.cse26 (= 2 ~wl_pc~0)) (.cse54 (<= .cse53 ~c~0)) (.cse27 (not (= ~e_c~0 0))) (.cse29 (<= .cse53 ~data~0)) (.cse31 (<= ~data~0 .cse53)) (.cse32 (<= ~c_t~0 .cse53)) (.cse55 (<= ~c~0 .cse53))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse2 .cse26 .cse4 .cse5 .cse27 .cse7 .cse8 .cse11 .cse28 .cse13 .cse29 .cse15 .cse30 .cse31 .cse17 .cse32 .cse33 .cse34 .cse35 .cse21 .cse23 .cse24 .cse36) (and .cse26 .cse1) (and .cse37 .cse4 .cse3 .cse6 .cse38 .cse8 .cse10 .cse12 .cse15 .cse30 .cse16 .cse17 .cse19 .cse39 .cse40 .cse41 .cse0 .cse20 .cse42 .cse24 .cse36 .cse43) (and .cse6 .cse1 .cse12) (and .cse2 .cse26 .cse44 .cse3 .cse4 .cse5 .cse27 .cse7 .cse8 .cse11 .cse13 .cse45 .cse15 .cse17 .cse18 .cse19 .cse33 .cse21 .cse35 .cse23 .cse24 .cse36) (and .cse2 .cse3 .cse4 .cse6 .cse38 .cse8 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse39 .cse0 .cse20 .cse33 .cse22 .cse23 .cse24 .cse43) (and .cse37 .cse4 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse40 .cse41 .cse20 .cse21 .cse42 .cse22 .cse24) (and .cse37 .cse4 .cse3 .cse6 .cse38 .cse8 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse39 .cse40 .cse0 .cse20 .cse33 .cse22 .cse23 .cse24 .cse43) (and .cse37 .cse4 .cse3 .cse6 .cse38 .cse8 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse39 .cse40 .cse41 .cse0 .cse20 .cse42 .cse22 .cse24 .cse43) (and (or (and .cse2 .cse26 .cse4 .cse5 .cse27 .cse7 .cse8 .cse11 .cse28 .cse13 .cse29 .cse15 .cse30 .cse31 .cse20 .cse33 .cse35 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse26 .cse44 .cse4 .cse5 .cse27 .cse7 .cse8 .cse11 .cse28 .cse13 .cse45 .cse15 .cse30 .cse20 .cse33 .cse35 .cse21 .cse23 .cse24 .cse36)) .cse46 .cse47 .cse48 .cse49) (and .cse2 .cse37 .cse46 .cse26 .cse44 .cse4 .cse5 .cse27 .cse7 .cse8 .cse28 .cse13 .cse45 .cse15 .cse30 .cse17 .cse48 .cse33 .cse34 .cse35 .cse21 .cse23 .cse24 .cse36) (and .cse46 .cse48 (or (and .cse2 .cse26 .cse44 .cse4 .cse5 .cse27 .cse7 .cse8 .cse11 .cse28 .cse13 .cse45 .cse15 .cse30 .cse17 .cse33 .cse35 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse26 .cse4 .cse5 .cse27 .cse7 .cse8 .cse11 .cse28 .cse13 .cse29 .cse15 .cse30 .cse31 .cse17 .cse33 .cse35 .cse21 .cse23 .cse24 .cse36)) .cse34) (and .cse2 .cse50 .cse4 .cse6 .cse38 .cse51 .cse7 .cse8 .cse9 .cse11 .cse28 .cse12 .cse13 .cse14 .cse15 .cse30 .cse17 .cse20 .cse33 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse50 .cse4 .cse5 .cse27 .cse51 .cse9 .cse7 .cse8 .cse11 .cse13 .cse15 .cse30 .cse17 .cse19 .cse0 .cse33 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse50 .cse3 .cse4 .cse5 .cse27 .cse51 .cse7 .cse8 .cse9 .cse11 .cse13 .cse15 .cse17 .cse18 .cse19 .cse0 .cse33 .cse21 .cse23 .cse24 .cse36) (and .cse37 .cse3 .cse4 .cse6 .cse38 .cse8 .cse12 .cse28 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse39 .cse40 .cse0 .cse20 .cse33 .cse23 .cse24 .cse36 .cse43) (and .cse2 .cse46 .cse26 .cse44 .cse4 .cse5 .cse27 .cse7 .cse8 .cse11 .cse13 .cse45 .cse15 .cse30 .cse17 .cse19 .cse48 .cse33 .cse34 .cse35 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse50 .cse4 .cse5 .cse27 .cse51 .cse9 .cse7 .cse8 .cse11 .cse28 .cse13 .cse15 .cse30 .cse0 .cse33 .cse21 .cse23 .cse24 .cse36) (and .cse37 .cse4 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse30 .cse16 .cse17 .cse19 .cse40 .cse41 .cse20 .cse21 .cse42 .cse24 .cse36) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse33 .cse21 .cse22 .cse23 .cse24) (and .cse2 .cse26 .cse4 .cse3 .cse5 .cse27 .cse7 .cse8 .cse11 .cse28 .cse13 .cse15 .cse29 .cse17 .cse31 .cse18 .cse33 .cse21 .cse35 .cse23 .cse24 .cse36) (and .cse2 .cse37 .cse26 .cse44 .cse4 .cse3 .cse5 .cse27 .cse7 .cse8 .cse28 .cse13 .cse45 .cse15 .cse17 .cse18 .cse33 .cse21 .cse35 .cse23 .cse24 .cse36) (and .cse2 .cse50 .cse37 .cse4 .cse3 .cse5 .cse27 .cse51 .cse9 .cse7 .cse8 .cse13 .cse15 .cse30 .cse17 .cse19 .cse0 .cse33 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse4 .cse3 .cse6 .cse38 .cse8 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse39 .cse0 .cse20 .cse33 .cse23 .cse24 .cse36 .cse43) (and .cse37 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse28 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse40 .cse20 .cse33 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse50 .cse37 .cse4 .cse3 .cse5 .cse27 .cse51 .cse7 .cse8 .cse9 .cse28 .cse13 .cse15 .cse17 .cse18 .cse0 .cse33 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse37 .cse26 .cse4 .cse3 .cse5 .cse6 .cse27 .cse7 .cse8 .cse12 .cse13 .cse15 .cse30 .cse17 .cse19 (<= ~data~0 ULTIMATE.start_write_loop_~t~0) (<= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse33 .cse35 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse19 .cse20 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse3 .cse4 .cse6 .cse38 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse19 .cse39 .cse0 .cse20 .cse23 .cse24 .cse36 .cse43) (and .cse2 .cse50 .cse4 .cse3 .cse5 .cse27 .cse51 .cse7 .cse8 .cse9 .cse11 .cse28 .cse13 .cse15 .cse17 .cse18 .cse0 .cse33 .cse21 .cse23 .cse24 .cse36) (and .cse37 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse40 .cse20 .cse33 .cse21 .cse22 .cse23 .cse24) (and (<= ~d~0 .cse52) (<= .cse52 ~d~0) .cse46 .cse47 .cse48 (or (and .cse2 .cse50 .cse26 .cse4 .cse38 .cse27 .cse51 .cse7 .cse8 .cse11 .cse28 .cse13 .cse29 .cse15 .cse30 .cse17 .cse31 .cse20 .cse33 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse50 .cse26 .cse44 .cse4 .cse38 .cse27 .cse51 .cse7 .cse8 .cse11 .cse28 .cse13 .cse45 .cse15 .cse30 .cse17 .cse20 .cse33 .cse21 .cse23 .cse24 .cse36)) .cse49) (and .cse2 .cse50 .cse37 .cse4 .cse5 .cse27 .cse51 .cse9 .cse7 .cse8 .cse28 .cse13 .cse15 .cse30 .cse17 .cse0 .cse33 .cse21 .cse23 .cse24 .cse36) (and .cse4 .cse5 (= ~e_wl~0 ~e_f~0) .cse27 .cse7 .cse8 .cse13 .cse15 .cse39 .cse0 .cse21 .cse23 .cse24) (and .cse25 .cse2 .cse50 .cse26 .cse4 (<= .cse53 ~d~0) .cse54 .cse38 .cse27 .cse51 .cse7 .cse8 .cse11 .cse28 .cse30 .cse33 .cse23 .cse24 .cse36 (<= ~d~0 .cse53) .cse13 .cse29 .cse15 .cse17 .cse31 .cse32 .cse55 .cse20 .cse21) (and .cse2 .cse3 .cse4 .cse6 .cse38 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse39 .cse0 .cse20 .cse22 .cse23 .cse24 .cse43) (and .cse25 .cse2 .cse26 .cse4 .cse5 .cse54 .cse27 .cse7 .cse8 .cse11 .cse28 .cse30 .cse33 .cse23 .cse24 .cse36 .cse13 .cse29 .cse15 .cse31 .cse32 .cse55 .cse20 .cse35 .cse21))))
[2019-11-23 22:50:43,262 INFO  L444   ceAbstractionStarter]: For program point  L504-1(lines 396 680)  no Hoare annotation was computed.
[2019-11-23 22:50:43,262 INFO  L444   ceAbstractionStarter]: For program point  L439-1(lines 396 680)  no Hoare annotation was computed.
[2019-11-23 22:50:43,262 INFO  L444   ceAbstractionStarter]: For program point  L109(lines 109 119)  no Hoare annotation was computed.
[2019-11-23 22:50:43,263 INFO  L440   ceAbstractionStarter]: At program point  L341(lines 288 386)  the Hoare annotation is:  (let ((.cse52 (+ ~t_b~0 2)) (.cse50 (+ ~t_b~0 1)) (.cse39 (= ~e_f~0 ~wl_st~0)) (.cse2 (= ~c2_pc~0 1)) (.cse4 (= ~wb_i~0 1)) (.cse3 (= ~processed~0 0)) (.cse5 (<= 2 ~wl_st~0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~c2_i~0 1)) (.cse9 (= 1 ~wl_pc~0)) (.cse11 (<= 2 ~c2_st~0)) (.cse40 (<= 2 ~c1_st~0)) (.cse13 (not (= ~e_g~0 0))) (.cse14 (= ~e_e~0 ~e_c~0)) (.cse15 (= ~c1_i~0 1)) (.cse28 (<= 2 ~wb_st~0)) (.cse16 (= ~e_e~0 ~e_f~0)) (.cse17 (<= 2 ~r_st~0)) (.cse20 (<= ~c_req_up~0 0)) (.cse38 (= ~c1_pc~0 1)) (.cse21 (not (= ~e_e~0 1))) (.cse23 (not (= ~e_g~0 1))) (.cse24 (<= ~r_i~0 0)) (.cse33 (= 1 ~wb_pc~0))) (let ((.cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse11 .cse40 .cse13 .cse14 .cse15 .cse28 .cse17 .cse20 .cse38 .cse39 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse4 .cse3 .cse5 .cse7 .cse8 .cse9 .cse11 .cse40 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse20 .cse38 .cse21 .cse23 .cse24 .cse33))) (.cse47 (= ~c_req_up~0 1)) (.cse31 (= ~e_c~0 ~e_g~0)) (.cse32 (= ~e_g~0 ~e_f~0)) (.cse30 (= ~c2_pc~0 0)) (.cse43 (<= .cse50 ~c_t~0)) (.cse44 (<= .cse50 ~c~0)) (.cse45 (<= ~c_t~0 .cse50)) (.cse35 (<= .cse50 ~data~0)) (.cse37 (<= ~data~0 .cse50)) (.cse46 (<= ~c~0 .cse50)) (.cse26 (= ~c2_st~0 0)) (.cse48 (not (= ~e_f~0 1))) (.cse49 (not (= ~e_f~0 0))) (.cse6 (<= ~t_b~0 ~data~0)) (.cse27 (= 0 ~wl_st~0)) (.cse10 (= ~c1_pc~0 0)) (.cse12 (<= ~data~0 ~t_b~0)) (.cse18 (= 0 ~wb_st~0)) (.cse19 (= ~c1_st~0 0)) (.cse29 (= 0 ~wl_pc~0)) (.cse0 (<= 2 ~e_wl~0)) (.cse22 (= 0 ~wb_pc~0)) (.cse34 (= ~e_wl~0 ~e_c~0)) (.cse51 (<= .cse52 ~c_t~0)) (.cse25 (= 2 ~wl_pc~0)) (.cse53 (<= .cse52 ~c~0)) (.cse36 (not (= ~e_c~0 0))) (.cse41 (<= .cse52 ~data~0)) (.cse42 (<= ~data~0 .cse52)) (.cse54 (<= ~c_t~0 .cse52)) (.cse55 (<= ~c~0 .cse52))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse1) (and .cse26 .cse4 .cse3 .cse6 .cse27 .cse8 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse19 .cse29 .cse30 .cse31 .cse0 .cse20 .cse32 .cse24 .cse33 .cse34) (and .cse6 .cse1 .cse12) (and .cse2 .cse25 .cse35 .cse3 .cse4 .cse5 .cse36 .cse7 .cse8 .cse11 .cse13 .cse37 .cse15 .cse17 .cse18 .cse19 .cse38 .cse21 .cse39 .cse23 .cse24 .cse33) (and .cse2 .cse3 .cse4 .cse6 .cse27 .cse8 .cse11 .cse12 .cse40 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse0 .cse20 .cse38 .cse22 .cse23 .cse24 .cse34) (and .cse26 .cse4 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse30 .cse31 .cse20 .cse21 .cse32 .cse22 .cse24) (and .cse26 .cse4 .cse3 .cse6 .cse27 .cse8 .cse12 .cse40 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse30 .cse0 .cse20 .cse38 .cse22 .cse23 .cse24 .cse34) (and .cse26 .cse4 .cse3 .cse6 .cse27 .cse8 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse29 .cse30 .cse31 .cse0 .cse20 .cse32 .cse22 .cse24 .cse34) (and (or (and .cse2 .cse25 .cse4 .cse5 .cse36 .cse7 .cse8 .cse11 .cse40 .cse13 .cse41 .cse15 .cse28 .cse42 .cse20 .cse38 .cse39 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse25 .cse35 .cse4 .cse5 .cse36 .cse7 .cse8 .cse11 .cse40 .cse13 .cse37 .cse15 .cse28 .cse20 .cse38 .cse39 .cse21 .cse23 .cse24 .cse33)) .cse43 .cse44 .cse45 .cse46) (and .cse2 .cse26 .cse43 .cse25 .cse35 .cse4 .cse5 .cse36 .cse7 .cse8 .cse40 .cse13 .cse37 .cse15 .cse28 .cse17 .cse45 .cse38 .cse47 .cse39 .cse21 .cse23 .cse24 .cse33) (and .cse43 .cse45 (or (and .cse2 .cse25 .cse35 .cse4 .cse5 .cse36 .cse7 .cse8 .cse11 .cse40 .cse13 .cse37 .cse15 .cse28 .cse17 .cse38 .cse39 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse25 .cse4 .cse5 .cse36 .cse7 .cse8 .cse11 .cse40 .cse13 .cse41 .cse15 .cse28 .cse42 .cse17 .cse38 .cse39 .cse21 .cse23 .cse24 .cse33)) .cse47) (and .cse2 .cse48 .cse4 .cse6 .cse27 .cse49 .cse7 .cse8 .cse9 .cse11 .cse40 .cse12 .cse13 .cse14 .cse15 .cse28 .cse17 .cse20 .cse38 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse48 .cse4 .cse5 .cse36 .cse49 .cse9 .cse7 .cse8 .cse11 .cse13 .cse15 .cse28 .cse17 .cse19 .cse0 .cse38 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse48 .cse3 .cse4 .cse5 .cse36 .cse49 .cse7 .cse8 .cse9 .cse11 .cse13 .cse15 .cse17 .cse18 .cse19 .cse0 .cse38 .cse21 .cse23 .cse24 .cse33) (and .cse26 .cse3 .cse4 .cse6 .cse27 .cse8 .cse12 .cse40 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse29 .cse30 .cse0 .cse20 .cse38 .cse23 .cse24 .cse33 .cse34) (and .cse2 .cse43 .cse25 .cse35 .cse4 .cse5 .cse36 .cse7 .cse8 .cse11 .cse13 .cse37 .cse15 .cse28 .cse17 .cse19 .cse45 .cse38 .cse47 .cse39 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse48 .cse4 .cse5 .cse36 .cse49 .cse9 .cse7 .cse8 .cse11 .cse40 .cse13 .cse15 .cse28 .cse0 .cse38 .cse21 .cse23 .cse24 .cse33) (and .cse26 .cse4 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse19 .cse30 .cse31 .cse20 .cse21 .cse32 .cse24 .cse33) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse40 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse38 .cse21 .cse22 .cse23 .cse24) (and .cse2 .cse25 .cse4 .cse3 .cse5 .cse36 .cse7 .cse8 .cse11 .cse40 .cse13 .cse15 .cse41 .cse17 .cse42 .cse18 .cse38 .cse21 .cse39 .cse23 .cse24 .cse33) (and .cse2 .cse26 .cse25 .cse35 .cse4 .cse3 .cse5 .cse36 .cse7 .cse8 .cse40 .cse13 .cse37 .cse15 .cse17 .cse18 .cse38 .cse21 .cse39 .cse23 .cse24 .cse33) (and .cse2 .cse48 .cse26 .cse4 .cse3 .cse5 .cse36 .cse49 .cse9 .cse7 .cse8 .cse13 .cse15 .cse28 .cse17 .cse19 .cse0 .cse38 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse4 .cse3 .cse6 .cse27 .cse8 .cse11 .cse12 .cse40 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse29 .cse0 .cse20 .cse38 .cse23 .cse24 .cse33 .cse34) (and .cse26 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse40 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse30 .cse20 .cse38 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse48 .cse26 .cse4 .cse3 .cse5 .cse36 .cse49 .cse7 .cse8 .cse9 .cse40 .cse13 .cse15 .cse17 .cse18 .cse0 .cse38 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse26 .cse25 .cse4 .cse3 .cse5 .cse6 .cse36 .cse7 .cse8 .cse12 .cse13 .cse15 .cse28 .cse17 .cse19 (<= ~data~0 ULTIMATE.start_write_loop_~t~0) (<= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse38 .cse39 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse19 .cse20 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse3 .cse4 .cse6 .cse27 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse19 .cse29 .cse0 .cse20 .cse23 .cse24 .cse33 .cse34) (and .cse2 .cse48 .cse4 .cse3 .cse5 .cse36 .cse49 .cse7 .cse8 .cse9 .cse11 .cse40 .cse13 .cse15 .cse17 .cse18 .cse0 .cse38 .cse21 .cse23 .cse24 .cse33) (and .cse26 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse40 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse30 .cse20 .cse38 .cse21 .cse22 .cse23 .cse24) (and (<= ~d~0 .cse50) (<= .cse50 ~d~0) .cse43 .cse44 .cse45 (or (and .cse2 .cse48 .cse25 .cse4 .cse27 .cse36 .cse49 .cse7 .cse8 .cse11 .cse40 .cse13 .cse41 .cse15 .cse28 .cse17 .cse42 .cse20 .cse38 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse48 .cse25 .cse35 .cse4 .cse27 .cse36 .cse49 .cse7 .cse8 .cse11 .cse40 .cse13 .cse37 .cse15 .cse28 .cse17 .cse20 .cse38 .cse21 .cse23 .cse24 .cse33)) .cse46) (and .cse2 .cse48 .cse26 .cse4 .cse5 .cse36 .cse49 .cse9 .cse7 .cse8 .cse40 .cse13 .cse15 .cse28 .cse17 .cse0 .cse38 .cse21 .cse23 .cse24 .cse33) (and .cse4 .cse5 (= ~e_wl~0 ~e_f~0) .cse36 .cse7 .cse8 .cse13 .cse15 .cse29 .cse0 .cse21 .cse23 .cse24) (and .cse51 .cse2 .cse48 .cse25 .cse4 (<= .cse52 ~d~0) .cse53 .cse27 .cse36 .cse49 .cse7 .cse8 .cse11 .cse40 .cse28 .cse38 .cse23 .cse24 .cse33 (<= ~d~0 .cse52) .cse13 .cse41 .cse15 .cse17 .cse42 .cse54 .cse55 .cse20 .cse21) (and .cse2 .cse3 .cse4 .cse6 .cse27 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse29 .cse0 .cse20 .cse22 .cse23 .cse24 .cse34) (and .cse51 .cse2 .cse25 .cse4 .cse5 .cse53 .cse36 .cse7 .cse8 .cse11 .cse40 .cse28 .cse38 .cse23 .cse24 .cse33 .cse13 .cse41 .cse15 .cse42 .cse54 .cse55 .cse20 .cse39 .cse21))))
[2019-11-23 22:50:43,263 INFO  L444   ceAbstractionStarter]: For program point  L176(lines 176 184)  no Hoare annotation was computed.
[2019-11-23 22:50:43,264 INFO  L444   ceAbstractionStarter]: For program point  L143(line 143)  no Hoare annotation was computed.
[2019-11-23 22:50:43,264 INFO  L444   ceAbstractionStarter]: For program point  L606(lines 535 675)  no Hoare annotation was computed.
[2019-11-23 22:50:43,264 INFO  L444   ceAbstractionStarter]: For program point  L639-1(lines 535 675)  no Hoare annotation was computed.
[2019-11-23 22:50:43,264 INFO  L444   ceAbstractionStarter]: For program point  L375(lines 375 382)  no Hoare annotation was computed.
[2019-11-23 22:50:43,264 INFO  L444   ceAbstractionStarter]: For program point  L78(line 78)  no Hoare annotation was computed.
[2019-11-23 22:50:43,264 INFO  L444   ceAbstractionStarter]: For program point  L607(lines 607 611)  no Hoare annotation was computed.
[2019-11-23 22:50:43,264 INFO  L444   ceAbstractionStarter]: For program point  L574-1(lines 535 675)  no Hoare annotation was computed.
[2019-11-23 22:50:43,264 INFO  L444   ceAbstractionStarter]: For program point  L409-1(lines 396 680)  no Hoare annotation was computed.
[2019-11-23 22:50:43,264 INFO  L444   ceAbstractionStarter]: For program point  L112(lines 112 118)  no Hoare annotation was computed.
[2019-11-23 22:50:43,264 INFO  L444   ceAbstractionStarter]: For program point  L13(line 13)  no Hoare annotation was computed.
[2019-11-23 22:50:43,265 INFO  L440   ceAbstractionStarter]: At program point  L707(lines 682 709)  the Hoare annotation is:  (= ~c2_i~0 1)
[2019-11-23 22:50:43,265 INFO  L444   ceAbstractionStarter]: For program point  L542(lines 542 552)  no Hoare annotation was computed.
[2019-11-23 22:50:43,265 INFO  L444   ceAbstractionStarter]: For program point  L509-1(lines 396 680)  no Hoare annotation was computed.
[2019-11-23 22:50:43,265 INFO  L444   ceAbstractionStarter]: For program point  L542-2(lines 542 552)  no Hoare annotation was computed.
[2019-11-23 22:50:43,266 INFO  L440   ceAbstractionStarter]: At program point  L311(lines 288 386)  the Hoare annotation is:  (let ((.cse51 (+ ~t_b~0 2)) (.cse49 (+ ~t_b~0 1))) (let ((.cse46 (= ~c_req_up~0 1)) (.cse28 (= ~e_c~0 ~e_g~0)) (.cse30 (= ~e_g~0 ~e_f~0)) (.cse42 (<= .cse49 ~c_t~0)) (.cse43 (<= .cse49 ~c~0)) (.cse44 (<= ~c_t~0 .cse49)) (.cse34 (<= .cse49 ~data~0)) (.cse36 (<= ~data~0 .cse49)) (.cse45 (<= ~c~0 .cse49)) (.cse27 (= ~c2_pc~0 0)) (.cse23 (= ~c2_st~0 0)) (.cse7 (= 1 ~wl_pc~0)) (.cse47 (not (= ~e_f~0 1))) (.cse48 (not (= ~e_f~0 0))) (.cse1 (= ~processed~0 0)) (.cse4 (<= ~t_b~0 ~data~0)) (.cse24 (= 0 ~wl_st~0)) (.cse8 (= ~c1_pc~0 0)) (.cse10 (<= ~data~0 ~t_b~0)) (.cse12 (= ~e_e~0 ~e_c~0)) (.cse14 (= ~e_e~0 ~e_f~0)) (.cse15 (<= 2 ~r_st~0)) (.cse16 (= 0 ~wb_st~0)) (.cse17 (= ~c1_st~0 0)) (.cse26 (= 0 ~wl_pc~0)) (.cse29 (<= 2 ~e_wl~0)) (.cse20 (= 0 ~wb_pc~0)) (.cse32 (= ~e_wl~0 ~e_c~0)) (.cse50 (<= .cse51 ~c_t~0)) (.cse0 (= ~c2_pc~0 1)) (.cse33 (= 2 ~wl_pc~0)) (.cse2 (= ~wb_i~0 1)) (.cse3 (<= 2 ~wl_st~0)) (.cse52 (<= .cse51 ~c~0)) (.cse35 (not (= ~e_c~0 0))) (.cse5 (not (= ~e_e~0 0))) (.cse6 (= ~c2_i~0 1)) (.cse9 (<= 2 ~c2_st~0)) (.cse39 (<= 2 ~c1_st~0)) (.cse25 (<= 2 ~wb_st~0)) (.cse37 (= ~c1_pc~0 1)) (.cse21 (not (= ~e_g~0 1))) (.cse22 (<= ~r_i~0 0)) (.cse31 (= 1 ~wb_pc~0)) (.cse11 (not (= ~e_g~0 0))) (.cse40 (<= .cse51 ~data~0)) (.cse13 (= ~c1_i~0 1)) (.cse41 (<= ~data~0 .cse51)) (.cse53 (<= ~c_t~0 .cse51)) (.cse54 (<= ~c~0 .cse51)) (.cse18 (<= ~c_req_up~0 0)) (.cse38 (= ~e_f~0 ~wl_st~0)) (.cse19 (not (= ~e_e~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse2 .cse1 .cse4 .cse24 .cse6 .cse8 .cse10 .cse13 .cse25 .cse14 .cse15 .cse17 .cse26 .cse27 .cse28 .cse29 .cse18 .cse30 .cse22 .cse31 .cse32) (and .cse0 .cse33 .cse34 .cse1 .cse2 .cse3 .cse35 .cse5 .cse6 .cse9 .cse11 .cse36 .cse13 .cse15 .cse16 .cse17 .cse37 .cse19 .cse38 .cse21 .cse22 .cse31) (and .cse0 .cse1 .cse2 .cse4 .cse24 .cse6 .cse9 .cse10 .cse39 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse29 .cse18 .cse37 .cse20 .cse21 .cse22 .cse32) (and .cse23 .cse2 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse28 .cse18 .cse19 .cse30 .cse20 .cse22) (and .cse23 .cse2 .cse1 .cse4 .cse24 .cse6 .cse10 .cse39 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse27 .cse29 .cse18 .cse37 .cse20 .cse21 .cse22 .cse32) (and .cse23 .cse2 .cse1 .cse4 .cse24 .cse6 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26 .cse27 .cse28 .cse29 .cse18 .cse30 .cse20 .cse22 .cse32) (and (or (and .cse0 .cse33 .cse2 .cse3 .cse35 .cse5 .cse6 .cse9 .cse39 .cse11 .cse40 .cse13 .cse25 .cse41 .cse18 .cse37 .cse38 .cse19 .cse21 .cse22 .cse31) (and .cse0 .cse33 .cse34 .cse2 .cse3 .cse35 .cse5 .cse6 .cse9 .cse39 .cse11 .cse36 .cse13 .cse25 .cse18 .cse37 .cse38 .cse19 .cse21 .cse22 .cse31)) .cse42 .cse43 .cse44 .cse45) (and .cse0 .cse23 .cse42 .cse33 .cse34 .cse2 .cse3 .cse35 .cse5 .cse6 .cse39 .cse11 .cse36 .cse13 .cse25 .cse15 .cse44 .cse37 .cse46 .cse38 .cse19 .cse21 .cse22 .cse31) (and .cse0 .cse47 .cse2 .cse4 .cse24 .cse48 .cse5 .cse6 .cse7 .cse9 .cse39 .cse10 .cse11 .cse12 .cse13 .cse25 .cse15 .cse18 .cse37 .cse19 .cse21 .cse22 .cse31) (and .cse0 .cse47 .cse2 .cse3 .cse35 .cse48 .cse7 .cse5 .cse6 .cse9 .cse11 .cse13 .cse25 .cse15 .cse17 .cse29 .cse37 .cse19 .cse21 .cse22 .cse31) (and .cse0 .cse47 .cse1 .cse2 .cse3 .cse35 .cse48 .cse5 .cse6 .cse7 .cse9 .cse11 .cse13 .cse15 .cse16 .cse17 .cse29 .cse37 .cse19 .cse21 .cse22 .cse31) (and .cse23 .cse1 .cse2 .cse4 .cse24 .cse6 .cse10 .cse39 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse26 .cse27 .cse29 .cse18 .cse37 .cse21 .cse22 .cse31 .cse32) (and .cse0 .cse42 .cse33 .cse34 .cse2 .cse3 .cse35 .cse5 .cse6 .cse9 .cse11 .cse36 .cse13 .cse25 .cse15 .cse17 .cse44 .cse37 .cse46 .cse38 .cse19 .cse21 .cse22 .cse31) (and .cse0 .cse47 .cse2 .cse3 .cse35 .cse48 .cse7 .cse5 .cse6 .cse9 .cse39 .cse11 .cse13 .cse25 .cse29 .cse37 .cse19 .cse21 .cse22 .cse31) (and .cse23 .cse2 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse25 .cse14 .cse15 .cse17 .cse27 .cse28 .cse18 .cse19 .cse30 .cse22 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse39 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse37 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse33 .cse2 .cse1 .cse3 .cse35 .cse5 .cse6 .cse9 .cse39 .cse11 .cse13 .cse40 .cse15 .cse41 .cse16 .cse37 .cse19 .cse38 .cse21 .cse22 .cse31) (and .cse0 .cse23 .cse33 .cse34 .cse2 .cse1 .cse3 .cse35 .cse5 .cse6 .cse39 .cse11 .cse36 .cse13 .cse15 .cse16 .cse37 .cse19 .cse38 .cse21 .cse22 .cse31) (and .cse0 .cse47 .cse23 .cse2 .cse1 .cse3 .cse35 .cse48 .cse7 .cse5 .cse6 .cse11 .cse13 .cse25 .cse15 .cse17 .cse29 .cse37 .cse19 .cse21 .cse22 .cse31) (and .cse0 .cse2 .cse1 .cse4 .cse24 .cse6 .cse9 .cse10 .cse39 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse26 .cse29 .cse18 .cse37 .cse21 .cse22 .cse31 .cse32) (and .cse23 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse39 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse27 .cse18 .cse37 .cse19 .cse21 .cse22 .cse31) (and .cse0 .cse23 .cse33 .cse2 .cse1 .cse3 .cse4 .cse35 .cse5 .cse6 .cse10 .cse11 .cse13 .cse25 .cse15 .cse17 (<= ~data~0 ULTIMATE.start_write_loop_~t~0) (<= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse37 .cse38 .cse19 .cse21 .cse22 .cse31) (and .cse0 .cse47 .cse23 .cse2 .cse1 .cse3 .cse35 .cse48 .cse5 .cse6 .cse7 .cse39 .cse11 .cse13 .cse15 .cse16 .cse29 .cse37 .cse19 .cse21 .cse22 .cse31) (and .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse31) (and .cse0 .cse1 .cse2 .cse4 .cse24 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse17 .cse26 .cse29 .cse18 .cse21 .cse22 .cse31 .cse32) (and .cse0 .cse47 .cse2 .cse1 .cse3 .cse35 .cse48 .cse5 .cse6 .cse7 .cse9 .cse39 .cse11 .cse13 .cse15 .cse16 .cse29 .cse37 .cse19 .cse21 .cse22 .cse31) (and (<= ~d~0 .cse49) (<= .cse49 ~d~0) .cse42 .cse43 .cse44 (or (and .cse0 .cse47 .cse33 .cse2 .cse24 .cse35 .cse48 .cse5 .cse6 .cse9 .cse39 .cse11 .cse40 .cse13 .cse25 .cse15 .cse41 .cse18 .cse37 .cse19 .cse21 .cse22 .cse31) (and .cse0 .cse47 .cse33 .cse34 .cse2 .cse24 .cse35 .cse48 .cse5 .cse6 .cse9 .cse39 .cse11 .cse36 .cse13 .cse25 .cse15 .cse18 .cse37 .cse19 .cse21 .cse22 .cse31)) .cse45) (and .cse23 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse39 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse18 .cse37 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse39 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse18 .cse37 .cse19 .cse21 .cse22 .cse31) (and .cse0 .cse47 .cse23 .cse2 .cse3 .cse35 .cse48 .cse7 .cse5 .cse6 .cse39 .cse11 .cse13 .cse25 .cse15 .cse29 .cse37 .cse19 .cse21 .cse22 .cse31) (and .cse2 .cse3 (= ~e_wl~0 ~e_f~0) .cse35 .cse5 .cse6 .cse11 .cse13 .cse26 .cse29 .cse19 .cse21 .cse22) (and .cse50 .cse0 .cse47 .cse33 .cse2 (<= .cse51 ~d~0) .cse52 .cse24 .cse35 .cse48 .cse5 .cse6 .cse9 .cse39 .cse25 .cse37 .cse21 .cse22 .cse31 (<= ~d~0 .cse51) .cse11 .cse40 .cse13 .cse15 .cse41 .cse53 .cse54 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse4 .cse24 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26 .cse29 .cse18 .cse20 .cse21 .cse22 .cse32) (and .cse50 .cse0 .cse33 .cse2 .cse3 .cse52 .cse35 .cse5 .cse6 .cse9 .cse39 .cse25 .cse37 .cse21 .cse22 .cse31 .cse11 .cse40 .cse13 .cse41 .cse53 .cse54 .cse18 .cse38 .cse19))))
[2019-11-23 22:50:43,266 INFO  L444   ceAbstractionStarter]: For program point  L179(lines 179 183)  no Hoare annotation was computed.
[2019-11-23 22:50:43,266 INFO  L440   ceAbstractionStarter]: At program point  L14(lines 55 125)  the Hoare annotation is:  (let ((.cse8 (<= 2 ~c1_st~0)) (.cse20 (<= 2 ~c2_st~0)) (.cse0 (= ~c2_pc~0 1)) (.cse1 (not (= ~e_f~0 1))) (.cse2 (= ~c2_st~0 0)) (.cse3 (= ~wb_i~0 1)) (.cse4 (not (= ~e_c~0 0))) (.cse5 (= ~c2_i~0 1)) (.cse6 (not (= ~e_e~0 0))) (.cse9 (not (= ~e_g~0 0))) (.cse11 (= ~c1_i~0 1)) (.cse12 (<= 2 ~wb_st~0)) (.cse13 (<= 2 ~r_st~0)) (.cse21 (= ~c1_st~0 0)) (.cse15 (= ~c1_pc~0 1)) (.cse16 (not (= ~e_e~0 1))) (.cse17 (<= ~r_i~0 0)) (.cse18 (not (= ~e_g~0 1))) (.cse19 (= 1 ~wb_pc~0))) (let ((.cse24 (= 2 ~wl_pc~0)) (.cse25 (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse9 .cse11 .cse12 .cse13 .cse21 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse11 .cse12 .cse13 .cse21 .cse15 .cse16 .cse17 .cse18 .cse19))) (.cse22 (not (= ~e_f~0 0)))) (or (and (let ((.cse7 (= 1 ~wl_pc~0)) (.cse10 (= ~e_e~0 ~e_c~0)) (.cse14 (<= ~c_req_up~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) (<= ~t_b~0 ~data~0) .cse22 (<= ~data~0 ~t_b~0)) (let ((.cse23 (+ ~t_b~0 1))) (and (<= ~data~0 .cse23) .cse24 (<= .cse23 ~data~0) .cse25 .cse22)) (let ((.cse26 (+ ~t_b~0 2))) (and (<= .cse26 ~data~0) (<= ~data~0 .cse26) .cse24 .cse25 .cse22)))))
[2019-11-23 22:50:43,267 INFO  L444   ceAbstractionStarter]: For program point  L543(lines 543 548)  no Hoare annotation was computed.
[2019-11-23 22:50:43,267 INFO  L444   ceAbstractionStarter]: For program point  L477(lines 396 680)  no Hoare annotation was computed.
[2019-11-23 22:50:43,267 INFO  L444   ceAbstractionStarter]: For program point  L543-2(lines 543 548)  no Hoare annotation was computed.
[2019-11-23 22:50:43,267 INFO  L444   ceAbstractionStarter]: For program point  L444-1(lines 396 680)  no Hoare annotation was computed.
[2019-11-23 22:50:43,267 INFO  L444   ceAbstractionStarter]: For program point  L345(lines 345 352)  no Hoare annotation was computed.
[2019-11-23 22:50:43,267 INFO  L440   ceAbstractionStarter]: At program point  L180(lines 175 215)  the Hoare annotation is:  (let ((.cse27 (+ ~t_b~0 1))) (let ((.cse22 (= 0 ~wb_st~0)) (.cse23 (not (= ~e_f~0 1))) (.cse3 (= ~processed~0 0)) (.cse24 (not (= ~e_f~0 0))) (.cse25 (= 1 ~wl_pc~0)) (.cse12 (= ~c1_st~0 0)) (.cse26 (<= 2 ~e_wl~0)) (.cse0 (= ~c2_pc~0 1)) (.cse1 (= 2 ~wl_pc~0)) (.cse19 (<= .cse27 ~data~0)) (.cse2 (= ~wb_i~0 1)) (.cse4 (<= 2 ~wl_st~0)) (.cse5 (not (= ~e_c~0 0))) (.cse6 (not (= ~e_e~0 0))) (.cse7 (= ~c2_i~0 1)) (.cse20 (<= 2 ~c1_st~0)) (.cse8 (not (= ~e_g~0 0))) (.cse21 (<= ~data~0 .cse27)) (.cse9 (= ~c1_i~0 1)) (.cse10 (<= 2 ~wb_st~0)) (.cse11 (<= 2 ~r_st~0)) (.cse13 (= ~c1_pc~0 1)) (.cse14 (= ~e_f~0 ~wl_st~0)) (.cse15 (not (= ~e_e~0 1))) (.cse16 (not (= ~e_g~0 1))) (.cse17 (<= ~r_i~0 0)) (.cse18 (= 1 ~wb_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~t_b~0 ~data~0) .cse5 .cse6 .cse7 (<= ~data~0 ~t_b~0) .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~data~0 ULTIMATE.start_write_loop_~t~0) (<= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse21 .cse9 .cse11 .cse22 .cse13 .cse15 .cse14 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse25 .cse20 .cse8 .cse9 .cse11 .cse22 .cse26 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse2 .cse4 .cse5 .cse24 .cse25 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse26 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse2 .cse4 (= ~e_wl~0 ~e_f~0) .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~wl_pc~0) .cse26 .cse15 .cse16 .cse17) (and .cse0 .cse23 .cse2 .cse3 .cse4 .cse5 .cse24 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse26 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 (<= .cse27 ~c_t~0) .cse1 .cse19 .cse2 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse21 .cse9 .cse10 .cse11 (<= ~c_t~0 .cse27) .cse13 (= ~c_req_up~0 1) .cse14 .cse15 .cse16 .cse17 .cse18))))
[2019-11-23 22:50:43,267 INFO  L440   ceAbstractionStarter]: At program point  L676(lines 393 681)  the Hoare annotation is:  (= ~c2_i~0 1)
[2019-11-23 22:50:43,268 INFO  L444   ceAbstractionStarter]: For program point  L478(lines 478 482)  no Hoare annotation was computed.
[2019-11-23 22:50:43,268 INFO  L444   ceAbstractionStarter]: For program point  L644-1(lines 535 675)  no Hoare annotation was computed.
[2019-11-23 22:50:43,268 INFO  L440   ceAbstractionStarter]: At program point  L149-1(lines 130 170)  the Hoare annotation is:  (let ((.cse40 (+ ~t_b~0 1)) (.cse41 (+ ~t_b~0 2)) (.cse23 (= 1 ~wl_pc~0)) (.cse10 (= ~e_e~0 ~e_f~0)) (.cse27 (= ~c2_pc~0 1)) (.cse1 (= ~processed~0 0)) (.cse2 (= ~wb_i~0 1)) (.cse21 (<= 2 ~wl_st~0)) (.cse22 (not (= ~e_e~0 0))) (.cse5 (= ~c2_i~0 1)) (.cse33 (<= 2 ~c2_st~0)) (.cse7 (not (= ~e_g~0 0))) (.cse8 (= ~e_e~0 ~e_c~0)) (.cse9 (= ~c1_i~0 1)) (.cse24 (<= 2 ~wb_st~0)) (.cse11 (<= 2 ~r_st~0)) (.cse16 (<= ~c_req_up~0 0)) (.cse31 (= ~c1_pc~0 1)) (.cse37 (= ~e_f~0 ~wl_st~0)) (.cse25 (not (= ~e_e~0 1))) (.cse18 (not (= ~e_g~0 1))) (.cse19 (<= ~r_i~0 0)) (.cse26 (= 1 ~wb_pc~0))) (let ((.cse14 (= ~c2_pc~0 0)) (.cse32 (or (and .cse27 .cse1 .cse2 .cse21 .cse22 .cse5 .cse23 .cse33 .cse7 .cse8 .cse9 .cse24 .cse10 .cse11 .cse16 .cse25 .cse18 .cse19 .cse26) (and .cse27 .cse1 .cse2 .cse21 .cse22 .cse5 .cse33 .cse7 .cse8 .cse9 .cse24 .cse11 .cse16 .cse31 .cse37 .cse25 .cse18 .cse19 .cse26))) (.cse0 (= ~c2_st~0 0)) (.cse28 (not (= ~e_f~0 1))) (.cse35 (<= .cse41 ~data~0)) (.cse36 (<= ~data~0 .cse41)) (.cse34 (= 2 ~wl_pc~0)) (.cse38 (<= .cse40 ~data~0)) (.cse29 (not (= ~e_c~0 0))) (.cse39 (<= ~data~0 .cse40)) (.cse4 (= 0 ~wl_st~0)) (.cse13 (= 0 ~wl_pc~0)) (.cse15 (<= 2 ~e_wl~0)) (.cse20 (= ~e_wl~0 ~e_c~0)) (.cse3 (<= ~t_b~0 ~data~0)) (.cse30 (not (= ~e_f~0 0))) (.cse6 (<= ~data~0 ~t_b~0)) (.cse12 (= 0 ~wb_st~0)) (.cse17 (= 0 ~wb_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse1 .cse21 .cse3 .cse22 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse24 .cse10 .cse11 .cse14 .cse16 .cse25 .cse18 .cse19 .cse26) (and .cse27 .cse28 .cse0 .cse2 .cse1 .cse21 .cse29 .cse30 .cse22 .cse5 .cse23 .cse7 .cse9 .cse11 .cse12 .cse15 .cse31 .cse25 .cse18 .cse19 .cse26) (and .cse3 .cse32 .cse6) (and .cse15 .cse32) (and .cse27 .cse28 .cse2 .cse1 .cse21 .cse29 .cse30 .cse22 .cse5 .cse23 .cse33 .cse7 .cse9 .cse11 .cse12 .cse15 .cse31 .cse25 .cse18 .cse19 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse26) (and .cse27 .cse28 .cse0 .cse2 .cse1 .cse21 .cse29 .cse30 .cse23 .cse22 .cse5 .cse7 .cse9 .cse24 .cse11 .cse15 .cse31 .cse25 .cse18 .cse19 .cse26) (and .cse0 .cse1 .cse2 .cse21 .cse3 .cse22 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse16 .cse25 .cse17 .cse18 .cse19) (and .cse27 .cse34 .cse2 .cse1 .cse21 .cse29 .cse22 .cse5 .cse33 .cse7 .cse9 .cse35 .cse11 .cse36 .cse12 .cse31 .cse25 .cse37 .cse18 .cse19 .cse26) (and .cse34 .cse32) (and .cse2 .cse21 (= ~e_wl~0 ~e_f~0) .cse29 .cse22 .cse5 .cse7 .cse9 .cse13 .cse15 .cse25 .cse18 .cse19) (and .cse27 .cse0 .cse34 .cse38 .cse2 .cse1 .cse21 .cse29 .cse22 .cse5 .cse7 .cse39 .cse9 .cse11 .cse12 .cse31 .cse25 .cse37 .cse18 .cse19 .cse26) (and .cse27 .cse28 .cse2 .cse21 .cse29 .cse30 .cse23 .cse22 .cse5 .cse33 .cse7 .cse9 .cse24 .cse11 .cse15 .cse31 .cse25 .cse18 .cse19 .cse26) (and .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse33 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and (<= .cse40 ~c_t~0) (<= ~c_t~0 .cse40) (= ~c_req_up~0 1) (or (and .cse27 .cse34 .cse2 .cse21 .cse29 .cse22 .cse5 .cse33 .cse7 .cse35 .cse9 .cse24 .cse36 .cse11 .cse31 .cse37 .cse25 .cse18 .cse19 .cse26) (and .cse27 .cse34 .cse38 .cse2 .cse21 .cse29 .cse22 .cse5 .cse33 .cse7 .cse39 .cse9 .cse24 .cse11 .cse31 .cse37 .cse25 .cse18 .cse19 .cse26))) (and .cse27 .cse2 .cse1 .cse3 .cse4 .cse5 .cse33 .cse6 .cse7 .cse8 .cse9 .cse24 .cse10 .cse11 .cse13 .cse15 .cse16 .cse18 .cse19 .cse26 .cse20) (and .cse27 .cse2 .cse1 .cse21 .cse3 .cse30 .cse5 .cse23 .cse33 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16 .cse25 .cse17 .cse18 .cse19))))
[2019-11-23 22:50:43,268 INFO  L444   ceAbstractionStarter]: For program point  L83(lines 83 91)  no Hoare annotation was computed.
[2019-11-23 22:50:43,268 INFO  L444   ceAbstractionStarter]: For program point  L83-1(lines 77 120)  no Hoare annotation was computed.
[2019-11-23 22:50:43,269 INFO  L444   ceAbstractionStarter]: For program point  L414-1(lines 396 680)  no Hoare annotation was computed.
[2019-11-23 22:50:43,269 INFO  L444   ceAbstractionStarter]: For program point  L315(lines 315 322)  no Hoare annotation was computed.
[2019-11-23 22:50:43,269 INFO  L444   ceAbstractionStarter]: For program point  L84(lines 84 88)  no Hoare annotation was computed.
[2019-11-23 22:50:43,269 INFO  L444   ceAbstractionStarter]: For program point  L580(lines 580 584)  no Hoare annotation was computed.
[2019-11-23 22:50:43,269 INFO  L444   ceAbstractionStarter]: For program point  L514-1(lines 396 680)  no Hoare annotation was computed.
[2019-11-23 22:50:43,269 INFO  L444   ceAbstractionStarter]: For program point  L449-1(lines 396 680)  no Hoare annotation was computed.
[2019-11-23 22:50:43,269 INFO  L444   ceAbstractionStarter]: For program point  ULTIMATE.startENTRY(line -1)  no Hoare annotation was computed.
[2019-11-23 22:50:43,269 INFO  L444   ceAbstractionStarter]: For program point  L152(lines 152 160)  no Hoare annotation was computed.
[2019-11-23 22:50:43,269 INFO  L444   ceAbstractionStarter]: For program point  L152-1(lines 152 160)  no Hoare annotation was computed.
[2019-11-23 22:50:43,269 INFO  L444   ceAbstractionStarter]: For program point  L615(lines 535 675)  no Hoare annotation was computed.
[2019-11-23 22:50:43,270 INFO  L444   ceAbstractionStarter]: For program point  L153(lines 153 157)  no Hoare annotation was computed.
[2019-11-23 22:50:43,270 INFO  L444   ceAbstractionStarter]: For program point  L616(lines 616 620)  no Hoare annotation was computed.
[2019-11-23 22:50:43,270 INFO  L444   ceAbstractionStarter]: For program point  L649-1(lines 535 675)  no Hoare annotation was computed.
[2019-11-23 22:50:43,270 INFO  L444   ceAbstractionStarter]: For program point  L419-1(lines 396 680)  no Hoare annotation was computed.
[2019-11-23 22:50:43,270 INFO  L444   ceAbstractionStarter]: For program point  L221(lines 221 229)  no Hoare annotation was computed.
[2019-11-23 22:50:43,270 INFO  L444   ceAbstractionStarter]: For program point  L188(line 188)  no Hoare annotation was computed.
[2019-11-23 22:50:43,270 INFO  L444   ceAbstractionStarter]: For program point  L56(lines 56 68)  no Hoare annotation was computed.
[2019-11-23 22:50:43,270 INFO  L444   ceAbstractionStarter]: For program point  L486(lines 396 680)  no Hoare annotation was computed.
[2019-11-23 22:50:43,270 INFO  L444   ceAbstractionStarter]: For program point  L519-1(lines 396 680)  no Hoare annotation was computed.
[2019-11-23 22:50:43,271 INFO  L440   ceAbstractionStarter]: At program point  L387(lines 279 392)  the Hoare annotation is:  (let ((.cse32 (+ ~t_b~0 2)) (.cse18 (= ~e_f~0 ~wl_st~0)) (.cse2 (= ~c2_pc~0 1)) (.cse4 (= ~wb_i~0 1)) (.cse5 (<= 2 ~wl_st~0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~c2_i~0 1)) (.cse33 (= 1 ~wl_pc~0)) (.cse9 (<= 2 ~c2_st~0)) (.cse10 (<= 2 ~c1_st~0)) (.cse11 (not (= ~e_g~0 0))) (.cse13 (= ~c1_i~0 1)) (.cse14 (<= 2 ~wb_st~0)) (.cse29 (<= 2 ~r_st~0)) (.cse16 (<= ~c_req_up~0 0)) (.cse17 (= ~c1_pc~0 1)) (.cse19 (not (= ~e_e~0 1))) (.cse20 (not (= ~e_g~0 1))) (.cse21 (<= ~r_i~0 0)) (.cse22 (= 1 ~wb_pc~0)) (.cse26 (+ ~t_b~0 1))) (let ((.cse25 (<= .cse26 ~c_t~0)) (.cse27 (<= ~c_t~0 .cse26)) (.cse23 (<= .cse26 ~data~0)) (.cse24 (<= ~data~0 .cse26)) (.cse31 (= ~c_req_up~0 1)) (.cse1 (let ((.cse34 (= ~processed~0 0)) (.cse35 (= ~e_e~0 ~e_c~0))) (or (and .cse2 .cse34 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse35 .cse13 .cse14 .cse29 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse4 .cse34 .cse5 .cse7 .cse8 .cse33 .cse9 .cse10 .cse11 .cse35 .cse13 .cse14 (= ~e_e~0 ~e_f~0) .cse29 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22)))) (.cse28 (<= .cse32 ~c_t~0)) (.cse3 (= 2 ~wl_pc~0)) (.cse12 (<= .cse32 ~data~0)) (.cse15 (<= ~data~0 .cse32)) (.cse30 (<= ~c_t~0 .cse32)) (.cse6 (not (= ~e_c~0 0))) (.cse0 (<= 2 ~e_wl~0))) (or (and .cse0 .cse1) (and (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)) .cse25 (<= .cse26 ~c~0) .cse27 (<= ~c~0 .cse26)) (and .cse28 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse29 .cse30 .cse17 .cse31 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse3 .cse1) (and .cse25 .cse27 (or (and .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse14 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)) .cse31) (and .cse4 .cse5 (= ~e_wl~0 ~e_f~0) .cse6 .cse7 .cse8 .cse11 .cse13 (= 0 ~wl_pc~0) .cse0 .cse19 .cse20 .cse21) (and (<= ~t_b~0 ~data~0) .cse1 (<= ~data~0 ~t_b~0)) (and .cse28 .cse2 .cse3 .cse4 .cse5 (<= .cse32 ~c~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse17 .cse20 .cse21 .cse22 .cse11 .cse12 .cse13 .cse15 .cse30 (<= ~c~0 .cse32) .cse16 .cse18 .cse19) (and .cse2 (not (= ~e_f~0 1)) .cse4 .cse5 .cse6 (not (= ~e_f~0 0)) .cse33 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse0 .cse17 .cse19 .cse20 .cse21 .cse22))))
[2019-11-23 22:50:43,271 INFO  L444   ceAbstractionStarter]: For program point  L255(lines 255 272)  no Hoare annotation was computed.
[2019-11-23 22:50:43,271 INFO  L440   ceAbstractionStarter]: At program point  L586(lines 579 596)  the Hoare annotation is:  (let ((.cse24 (+ ~t_b~0 2))) (let ((.cse1 (= 2 ~wl_pc~0)) (.cse10 (<= .cse24 ~data~0)) (.cse13 (<= ~data~0 .cse24)) (.cse14 (<= ~c_req_up~0 0)) (.cse16 (= ~e_f~0 ~wl_st~0)) (.cse0 (= ~c2_pc~0 1)) (.cse23 (not (= ~e_f~0 1))) (.cse2 (= ~wb_i~0 1)) (.cse3 (<= 2 ~wl_st~0)) (.cse4 (not (= ~e_c~0 0))) (.cse5 (not (= ~e_e~0 0))) (.cse6 (= ~c2_i~0 1)) (.cse7 (<= 2 ~c2_st~0)) (.cse8 (<= 2 ~c1_st~0)) (.cse9 (not (= ~e_g~0 0))) (.cse11 (= ~c1_i~0 1)) (.cse12 (<= 2 ~wb_st~0)) (.cse22 (<= 2 ~e_wl~0)) (.cse15 (= ~c1_pc~0 1)) (.cse17 (not (= ~e_e~0 1))) (.cse18 (not (= ~e_g~0 1))) (.cse19 (<= ~r_i~0 0)) (.cse20 (= 1 ~wb_pc~0))) (or (let ((.cse21 (+ ~t_b~0 1))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 (<= .cse21 ~data~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~data~0 .cse21) .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (<= .cse21 ~c_t~0) (<= .cse21 ~c~0) (<= ~c_t~0 .cse21) (<= ~c~0 .cse21))) (and .cse2 .cse3 (= ~e_wl~0 ~e_f~0) .cse4 .cse5 .cse6 .cse9 .cse11 (= 0 ~wl_pc~0) .cse22 .cse17 .cse18 .cse19) (and .cse0 .cse23 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~e_e~0 ~e_c~0) .cse11 .cse12 (<= 2 ~r_st~0) .cse15 .cse17 .cse18 .cse19 .cse20) (and (<= .cse24 ~c_t~0) .cse0 .cse1 .cse2 .cse3 (<= .cse24 ~c~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse15 .cse18 .cse19 .cse20 .cse9 .cse10 .cse11 .cse13 (<= ~c_t~0 .cse24) (<= ~c~0 .cse24) .cse14 .cse16 .cse17) (and .cse0 .cse23 .cse2 .cse3 .cse4 (not (= ~e_f~0 0)) (= 1 ~wl_pc~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse22 .cse15 .cse17 .cse18 .cse19 .cse20))))
[2019-11-23 22:50:43,271 INFO  L444   ceAbstractionStarter]: For program point  L487(lines 487 491)  no Hoare annotation was computed.
[2019-11-23 22:50:43,272 INFO  L444   ceAbstractionStarter]: For program point  L454-1(lines 396 680)  no Hoare annotation was computed.
[2019-11-23 22:50:43,272 INFO  L444   ceAbstractionStarter]: For program point  L289(lines 288 386)  no Hoare annotation was computed.
[2019-11-23 22:50:43,272 INFO  L444   ceAbstractionStarter]: For program point  ULTIMATE.startEXIT(line -1)  no Hoare annotation was computed.
[2019-11-23 22:50:43,272 INFO  L444   ceAbstractionStarter]: For program point  L256(lines 256 260)  no Hoare annotation was computed.
[2019-11-23 22:50:43,272 INFO  L444   ceAbstractionStarter]: For program point  L587(lines 535 675)  no Hoare annotation was computed.
[2019-11-23 22:50:43,272 INFO  L444   ceAbstractionStarter]: For program point  L554(lines 554 558)  no Hoare annotation was computed.
[2019-11-23 22:50:43,272 INFO  L444   ceAbstractionStarter]: For program point  L554-2(lines 535 675)  no Hoare annotation was computed.
[2019-11-23 22:50:43,273 INFO  L440   ceAbstractionStarter]: At program point  L356(lines 288 386)  the Hoare annotation is:  (let ((.cse53 (+ ~t_b~0 2)) (.cse52 (+ ~t_b~0 1)) (.cse35 (= ~e_f~0 ~wl_st~0)) (.cse2 (= ~c2_pc~0 1)) (.cse4 (= ~wb_i~0 1)) (.cse3 (= ~processed~0 0)) (.cse5 (<= 2 ~wl_st~0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~c2_i~0 1)) (.cse9 (= 1 ~wl_pc~0)) (.cse11 (<= 2 ~c2_st~0)) (.cse28 (<= 2 ~c1_st~0)) (.cse13 (not (= ~e_g~0 0))) (.cse14 (= ~e_e~0 ~e_c~0)) (.cse15 (= ~c1_i~0 1)) (.cse30 (<= 2 ~wb_st~0)) (.cse16 (= ~e_e~0 ~e_f~0)) (.cse17 (<= 2 ~r_st~0)) (.cse20 (<= ~c_req_up~0 0)) (.cse33 (= ~c1_pc~0 1)) (.cse21 (not (= ~e_e~0 1))) (.cse23 (not (= ~e_g~0 1))) (.cse24 (<= ~r_i~0 0)) (.cse36 (= 1 ~wb_pc~0))) (let ((.cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse11 .cse28 .cse13 .cse14 .cse15 .cse30 .cse17 .cse20 .cse33 .cse35 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse4 .cse3 .cse5 .cse7 .cse8 .cse9 .cse11 .cse28 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse20 .cse33 .cse21 .cse23 .cse24 .cse36))) (.cse34 (= ~c_req_up~0 1)) (.cse41 (= ~e_c~0 ~e_g~0)) (.cse42 (= ~e_g~0 ~e_f~0)) (.cse40 (= ~c2_pc~0 0)) (.cse46 (<= .cse52 ~c_t~0)) (.cse47 (<= .cse52 ~c~0)) (.cse48 (<= ~c_t~0 .cse52)) (.cse44 (<= .cse52 ~data~0)) (.cse45 (<= ~data~0 .cse52)) (.cse49 (<= ~c~0 .cse52)) (.cse37 (= ~c2_st~0 0)) (.cse50 (not (= ~e_f~0 1))) (.cse51 (not (= ~e_f~0 0))) (.cse6 (<= ~t_b~0 ~data~0)) (.cse38 (= 0 ~wl_st~0)) (.cse10 (= ~c1_pc~0 0)) (.cse12 (<= ~data~0 ~t_b~0)) (.cse18 (= 0 ~wb_st~0)) (.cse19 (= ~c1_st~0 0)) (.cse39 (= 0 ~wl_pc~0)) (.cse0 (<= 2 ~e_wl~0)) (.cse22 (= 0 ~wb_pc~0)) (.cse43 (= ~e_wl~0 ~e_c~0)) (.cse25 (<= .cse53 ~c_t~0)) (.cse26 (= 2 ~wl_pc~0)) (.cse54 (<= .cse53 ~c~0)) (.cse27 (not (= ~e_c~0 0))) (.cse29 (<= .cse53 ~data~0)) (.cse31 (<= ~data~0 .cse53)) (.cse32 (<= ~c_t~0 .cse53)) (.cse55 (<= ~c~0 .cse53))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse2 .cse26 .cse4 .cse5 .cse27 .cse7 .cse8 .cse11 .cse28 .cse13 .cse29 .cse15 .cse30 .cse31 .cse17 .cse32 .cse33 .cse34 .cse35 .cse21 .cse23 .cse24 .cse36) (and .cse26 .cse1) (and .cse37 .cse4 .cse3 .cse6 .cse38 .cse8 .cse10 .cse12 .cse15 .cse30 .cse16 .cse17 .cse19 .cse39 .cse40 .cse41 .cse0 .cse20 .cse42 .cse24 .cse36 .cse43) (and .cse6 .cse1 .cse12) (and .cse2 .cse26 .cse44 .cse3 .cse4 .cse5 .cse27 .cse7 .cse8 .cse11 .cse13 .cse45 .cse15 .cse17 .cse18 .cse19 .cse33 .cse21 .cse35 .cse23 .cse24 .cse36) (and .cse2 .cse3 .cse4 .cse6 .cse38 .cse8 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse39 .cse0 .cse20 .cse33 .cse22 .cse23 .cse24 .cse43) (and .cse37 .cse4 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse40 .cse41 .cse20 .cse21 .cse42 .cse22 .cse24) (and .cse37 .cse4 .cse3 .cse6 .cse38 .cse8 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse39 .cse40 .cse0 .cse20 .cse33 .cse22 .cse23 .cse24 .cse43) (and .cse37 .cse4 .cse3 .cse6 .cse38 .cse8 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse39 .cse40 .cse41 .cse0 .cse20 .cse42 .cse22 .cse24 .cse43) (and (or (and .cse2 .cse26 .cse4 .cse5 .cse27 .cse7 .cse8 .cse11 .cse28 .cse13 .cse29 .cse15 .cse30 .cse31 .cse20 .cse33 .cse35 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse26 .cse44 .cse4 .cse5 .cse27 .cse7 .cse8 .cse11 .cse28 .cse13 .cse45 .cse15 .cse30 .cse20 .cse33 .cse35 .cse21 .cse23 .cse24 .cse36)) .cse46 .cse47 .cse48 .cse49) (and .cse2 .cse37 .cse46 .cse26 .cse44 .cse4 .cse5 .cse27 .cse7 .cse8 .cse28 .cse13 .cse45 .cse15 .cse30 .cse17 .cse48 .cse33 .cse34 .cse35 .cse21 .cse23 .cse24 .cse36) (and .cse46 .cse48 (or (and .cse2 .cse26 .cse44 .cse4 .cse5 .cse27 .cse7 .cse8 .cse11 .cse28 .cse13 .cse45 .cse15 .cse30 .cse17 .cse33 .cse35 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse26 .cse4 .cse5 .cse27 .cse7 .cse8 .cse11 .cse28 .cse13 .cse29 .cse15 .cse30 .cse31 .cse17 .cse33 .cse35 .cse21 .cse23 .cse24 .cse36)) .cse34) (and .cse2 .cse50 .cse4 .cse6 .cse38 .cse51 .cse7 .cse8 .cse9 .cse11 .cse28 .cse12 .cse13 .cse14 .cse15 .cse30 .cse17 .cse20 .cse33 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse50 .cse4 .cse5 .cse27 .cse51 .cse9 .cse7 .cse8 .cse11 .cse13 .cse15 .cse30 .cse17 .cse19 .cse0 .cse33 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse50 .cse3 .cse4 .cse5 .cse27 .cse51 .cse7 .cse8 .cse9 .cse11 .cse13 .cse15 .cse17 .cse18 .cse19 .cse0 .cse33 .cse21 .cse23 .cse24 .cse36) (and .cse37 .cse3 .cse4 .cse6 .cse38 .cse8 .cse12 .cse28 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse39 .cse40 .cse0 .cse20 .cse33 .cse23 .cse24 .cse36 .cse43) (and .cse2 .cse46 .cse26 .cse44 .cse4 .cse5 .cse27 .cse7 .cse8 .cse11 .cse13 .cse45 .cse15 .cse30 .cse17 .cse19 .cse48 .cse33 .cse34 .cse35 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse50 .cse4 .cse5 .cse27 .cse51 .cse9 .cse7 .cse8 .cse11 .cse28 .cse13 .cse15 .cse30 .cse0 .cse33 .cse21 .cse23 .cse24 .cse36) (and .cse37 .cse4 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse30 .cse16 .cse17 .cse19 .cse40 .cse41 .cse20 .cse21 .cse42 .cse24 .cse36) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse33 .cse21 .cse22 .cse23 .cse24) (and .cse2 .cse26 .cse4 .cse3 .cse5 .cse27 .cse7 .cse8 .cse11 .cse28 .cse13 .cse15 .cse29 .cse17 .cse31 .cse18 .cse33 .cse21 .cse35 .cse23 .cse24 .cse36) (and .cse2 .cse37 .cse26 .cse44 .cse4 .cse3 .cse5 .cse27 .cse7 .cse8 .cse28 .cse13 .cse45 .cse15 .cse17 .cse18 .cse33 .cse21 .cse35 .cse23 .cse24 .cse36) (and .cse2 .cse50 .cse37 .cse4 .cse3 .cse5 .cse27 .cse51 .cse9 .cse7 .cse8 .cse13 .cse15 .cse30 .cse17 .cse19 .cse0 .cse33 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse4 .cse3 .cse6 .cse38 .cse8 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse39 .cse0 .cse20 .cse33 .cse23 .cse24 .cse36 .cse43) (and .cse37 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse28 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse40 .cse20 .cse33 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse50 .cse37 .cse4 .cse3 .cse5 .cse27 .cse51 .cse7 .cse8 .cse9 .cse28 .cse13 .cse15 .cse17 .cse18 .cse0 .cse33 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse37 .cse26 .cse4 .cse3 .cse5 .cse6 .cse27 .cse7 .cse8 .cse12 .cse13 .cse15 .cse30 .cse17 .cse19 (<= ~data~0 ULTIMATE.start_write_loop_~t~0) (<= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse33 .cse35 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse19 .cse20 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse3 .cse4 .cse6 .cse38 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse19 .cse39 .cse0 .cse20 .cse23 .cse24 .cse36 .cse43) (and .cse2 .cse50 .cse4 .cse3 .cse5 .cse27 .cse51 .cse7 .cse8 .cse9 .cse11 .cse28 .cse13 .cse15 .cse17 .cse18 .cse0 .cse33 .cse21 .cse23 .cse24 .cse36) (and .cse37 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse40 .cse20 .cse33 .cse21 .cse22 .cse23 .cse24) (and (<= ~d~0 .cse52) (<= .cse52 ~d~0) .cse46 .cse47 .cse48 (or (and .cse2 .cse50 .cse26 .cse4 .cse38 .cse27 .cse51 .cse7 .cse8 .cse11 .cse28 .cse13 .cse29 .cse15 .cse30 .cse17 .cse31 .cse20 .cse33 .cse21 .cse23 .cse24 .cse36) (and .cse2 .cse50 .cse26 .cse44 .cse4 .cse38 .cse27 .cse51 .cse7 .cse8 .cse11 .cse28 .cse13 .cse45 .cse15 .cse30 .cse17 .cse20 .cse33 .cse21 .cse23 .cse24 .cse36)) .cse49) (and .cse2 .cse50 .cse37 .cse4 .cse5 .cse27 .cse51 .cse9 .cse7 .cse8 .cse28 .cse13 .cse15 .cse30 .cse17 .cse0 .cse33 .cse21 .cse23 .cse24 .cse36) (and .cse4 .cse5 (= ~e_wl~0 ~e_f~0) .cse27 .cse7 .cse8 .cse13 .cse15 .cse39 .cse0 .cse21 .cse23 .cse24) (and .cse25 .cse2 .cse50 .cse26 .cse4 (<= .cse53 ~d~0) .cse54 .cse38 .cse27 .cse51 .cse7 .cse8 .cse11 .cse28 .cse30 .cse33 .cse23 .cse24 .cse36 (<= ~d~0 .cse53) .cse13 .cse29 .cse15 .cse17 .cse31 .cse32 .cse55 .cse20 .cse21) (and .cse2 .cse3 .cse4 .cse6 .cse38 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse39 .cse0 .cse20 .cse22 .cse23 .cse24 .cse43) (and .cse25 .cse2 .cse26 .cse4 .cse5 .cse54 .cse27 .cse7 .cse8 .cse11 .cse28 .cse30 .cse33 .cse23 .cse24 .cse36 .cse13 .cse29 .cse15 .cse31 .cse32 .cse55 .cse20 .cse35 .cse21))))
[2019-11-23 22:50:43,273 INFO  L444   ceAbstractionStarter]: For program point  L224(lines 224 228)  no Hoare annotation was computed.
[2019-11-23 22:50:43,274 INFO  L444   ceAbstractionStarter]: For program point  L92(lines 92 100)  no Hoare annotation was computed.
[2019-11-23 22:50:43,274 INFO  L444   ceAbstractionStarter]: For program point  L59(lines 59 67)  no Hoare annotation was computed.
[2019-11-23 22:50:43,274 INFO  L444   ceAbstractionStarter]: For program point  L588(lines 588 592)  no Hoare annotation was computed.
[2019-11-23 22:50:43,274 INFO  L440   ceAbstractionStarter]: At program point  L225(lines 220 247)  the Hoare annotation is:  (let ((.cse28 (+ ~t_b~0 1))) (let ((.cse10 (<= 2 ~c2_st~0)) (.cse24 (= ~c1_st~0 0)) (.cse1 (not (= ~e_f~0 1))) (.cse6 (not (= ~e_f~0 0))) (.cse9 (= 1 ~wl_pc~0)) (.cse15 (<= 2 ~e_wl~0)) (.cse0 (= ~c2_pc~0 1)) (.cse27 (= ~c2_st~0 0)) (.cse21 (= 2 ~wl_pc~0)) (.cse25 (<= .cse28 ~data~0)) (.cse3 (= ~processed~0 0)) (.cse2 (= ~wb_i~0 1)) (.cse4 (<= 2 ~wl_st~0)) (.cse5 (not (= ~e_c~0 0))) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~c2_i~0 1)) (.cse11 (<= 2 ~c1_st~0)) (.cse12 (not (= ~e_g~0 0))) (.cse26 (<= ~data~0 .cse28)) (.cse13 (= ~c1_i~0 1)) (.cse14 (<= 2 ~r_st~0)) (.cse16 (= ~c1_pc~0 1)) (.cse23 (= ~e_f~0 ~wl_st~0)) (.cse17 (not (= ~e_e~0 1))) (.cse18 (not (= ~e_g~0 1))) (.cse19 (<= ~r_i~0 0)) (.cse20 (= 1 ~wb_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse22 (+ ~t_b~0 2))) (and .cse0 .cse21 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 (<= .cse22 ~data~0) .cse14 (<= ~data~0 .cse22) .cse16 .cse17 .cse23 .cse18 .cse19 .cse20)) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse24 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse2 .cse4 (= ~e_wl~0 ~e_f~0) .cse5 .cse7 .cse8 .cse12 .cse13 (= 0 ~wl_pc~0) .cse15 .cse17 .cse18 .cse19) (and .cse0 .cse21 .cse25 .cse3 .cse2 .cse4 .cse5 .cse7 .cse8 .cse10 .cse12 .cse26 .cse13 .cse14 .cse24 .cse16 .cse17 .cse23 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse27 .cse3 .cse2 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse27 .cse21 .cse25 .cse3 .cse2 .cse4 .cse5 .cse7 .cse8 .cse11 .cse12 .cse26 .cse13 .cse14 .cse16 .cse23 .cse17 .cse18 .cse19 .cse20))))
[2019-11-23 22:50:43,274 INFO  L444   ceAbstractionStarter]: For program point  L93(lines 93 97)  no Hoare annotation was computed.
[2019-11-23 22:50:43,275 INFO  L440   ceAbstractionStarter]: At program point  L60(lines 55 125)  the Hoare annotation is:  (let ((.cse6 (+ ~t_b~0 2))) (let ((.cse1 (<= .cse6 ~data~0)) (.cse2 (<= ~data~0 .cse6)) (.cse3 (= 2 ~wl_pc~0)) (.cse4 (not (= ~e_f~0 0))) (.cse5 (let ((.cse25 (<= 2 ~c2_st~0)) (.cse18 (= ~c1_st~0 0)) (.cse7 (= ~c2_pc~0 1)) (.cse8 (not (= ~e_f~0 1))) (.cse9 (= ~c2_st~0 0)) (.cse10 (= ~wb_i~0 1)) (.cse11 (not (= ~e_c~0 0))) (.cse12 (= ~c2_i~0 1)) (.cse13 (not (= ~e_e~0 0))) (.cse26 (<= 2 ~c1_st~0)) (.cse14 (not (= ~e_g~0 0))) (.cse15 (= ~c1_i~0 1)) (.cse16 (<= 2 ~wb_st~0)) (.cse17 (<= 2 ~r_st~0)) (.cse19 (<= ~c_req_up~0 0)) (.cse20 (= ~c1_pc~0 1)) (.cse21 (not (= ~e_e~0 1))) (.cse22 (<= ~r_i~0 0)) (.cse23 (not (= ~e_g~0 1))) (.cse24 (= 1 ~wb_pc~0))) (or (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse25 .cse26 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24))))) (or (let ((.cse0 (+ ~t_b~0 1))) (and (<= ~d~0 .cse0) (<= .cse0 ~d~0) (<= .cse0 ~c_t~0) (<= .cse0 ~c~0) (<= ~c_t~0 .cse0) (or (and .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= ~data~0 .cse0) .cse3 (<= .cse0 ~data~0) .cse4 .cse5)) (<= ~c~0 .cse0))) (and (<= .cse6 ~c_t~0) .cse1 .cse2 (<= ~c_t~0 .cse6) .cse3 (<= ~d~0 .cse6) (<= ~c~0 .cse6) (<= .cse6 ~d~0) (<= .cse6 ~c~0) .cse4 .cse5))))
[2019-11-23 22:50:43,275 INFO  L444   ceAbstractionStarter]: For program point  L424-1(lines 396 680)  no Hoare annotation was computed.
[2019-11-23 22:50:43,275 INFO  L444   ceAbstractionStarter]: For program point  ULTIMATE.startFINAL(line -1)  no Hoare annotation was computed.
[2019-11-23 22:50:43,275 INFO  L444   ceAbstractionStarter]: For program point  L524-1(lines 396 680)  no Hoare annotation was computed.
[2019-11-23 22:50:43,276 INFO  L440   ceAbstractionStarter]: At program point  L326(lines 288 386)  the Hoare annotation is:  (let ((.cse52 (+ ~t_b~0 2)) (.cse50 (+ ~t_b~0 1)) (.cse39 (= ~e_f~0 ~wl_st~0)) (.cse2 (= ~c2_pc~0 1)) (.cse4 (= ~wb_i~0 1)) (.cse3 (= ~processed~0 0)) (.cse5 (<= 2 ~wl_st~0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~c2_i~0 1)) (.cse9 (= 1 ~wl_pc~0)) (.cse11 (<= 2 ~c2_st~0)) (.cse40 (<= 2 ~c1_st~0)) (.cse13 (not (= ~e_g~0 0))) (.cse14 (= ~e_e~0 ~e_c~0)) (.cse15 (= ~c1_i~0 1)) (.cse28 (<= 2 ~wb_st~0)) (.cse16 (= ~e_e~0 ~e_f~0)) (.cse17 (<= 2 ~r_st~0)) (.cse20 (<= ~c_req_up~0 0)) (.cse38 (= ~c1_pc~0 1)) (.cse21 (not (= ~e_e~0 1))) (.cse23 (not (= ~e_g~0 1))) (.cse24 (<= ~r_i~0 0)) (.cse33 (= 1 ~wb_pc~0))) (let ((.cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse11 .cse40 .cse13 .cse14 .cse15 .cse28 .cse17 .cse20 .cse38 .cse39 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse4 .cse3 .cse5 .cse7 .cse8 .cse9 .cse11 .cse40 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse20 .cse38 .cse21 .cse23 .cse24 .cse33))) (.cse47 (= ~c_req_up~0 1)) (.cse31 (= ~e_c~0 ~e_g~0)) (.cse32 (= ~e_g~0 ~e_f~0)) (.cse30 (= ~c2_pc~0 0)) (.cse43 (<= .cse50 ~c_t~0)) (.cse44 (<= .cse50 ~c~0)) (.cse45 (<= ~c_t~0 .cse50)) (.cse35 (<= .cse50 ~data~0)) (.cse37 (<= ~data~0 .cse50)) (.cse46 (<= ~c~0 .cse50)) (.cse26 (= ~c2_st~0 0)) (.cse48 (not (= ~e_f~0 1))) (.cse49 (not (= ~e_f~0 0))) (.cse6 (<= ~t_b~0 ~data~0)) (.cse27 (= 0 ~wl_st~0)) (.cse10 (= ~c1_pc~0 0)) (.cse12 (<= ~data~0 ~t_b~0)) (.cse18 (= 0 ~wb_st~0)) (.cse19 (= ~c1_st~0 0)) (.cse29 (= 0 ~wl_pc~0)) (.cse0 (<= 2 ~e_wl~0)) (.cse22 (= 0 ~wb_pc~0)) (.cse34 (= ~e_wl~0 ~e_c~0)) (.cse51 (<= .cse52 ~c_t~0)) (.cse25 (= 2 ~wl_pc~0)) (.cse53 (<= .cse52 ~c~0)) (.cse36 (not (= ~e_c~0 0))) (.cse41 (<= .cse52 ~data~0)) (.cse42 (<= ~data~0 .cse52)) (.cse54 (<= ~c_t~0 .cse52)) (.cse55 (<= ~c~0 .cse52))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse1) (and .cse26 .cse4 .cse3 .cse6 .cse27 .cse8 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse19 .cse29 .cse30 .cse31 .cse0 .cse20 .cse32 .cse24 .cse33 .cse34) (and .cse6 .cse1 .cse12) (and .cse2 .cse25 .cse35 .cse3 .cse4 .cse5 .cse36 .cse7 .cse8 .cse11 .cse13 .cse37 .cse15 .cse17 .cse18 .cse19 .cse38 .cse21 .cse39 .cse23 .cse24 .cse33) (and .cse2 .cse3 .cse4 .cse6 .cse27 .cse8 .cse11 .cse12 .cse40 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse0 .cse20 .cse38 .cse22 .cse23 .cse24 .cse34) (and .cse26 .cse4 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse30 .cse31 .cse20 .cse21 .cse32 .cse22 .cse24) (and .cse26 .cse4 .cse3 .cse6 .cse27 .cse8 .cse12 .cse40 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse30 .cse0 .cse20 .cse38 .cse22 .cse23 .cse24 .cse34) (and .cse26 .cse4 .cse3 .cse6 .cse27 .cse8 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse29 .cse30 .cse31 .cse0 .cse20 .cse32 .cse22 .cse24 .cse34) (and (or (and .cse2 .cse25 .cse4 .cse5 .cse36 .cse7 .cse8 .cse11 .cse40 .cse13 .cse41 .cse15 .cse28 .cse42 .cse20 .cse38 .cse39 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse25 .cse35 .cse4 .cse5 .cse36 .cse7 .cse8 .cse11 .cse40 .cse13 .cse37 .cse15 .cse28 .cse20 .cse38 .cse39 .cse21 .cse23 .cse24 .cse33)) .cse43 .cse44 .cse45 .cse46) (and .cse2 .cse26 .cse43 .cse25 .cse35 .cse4 .cse5 .cse36 .cse7 .cse8 .cse40 .cse13 .cse37 .cse15 .cse28 .cse17 .cse45 .cse38 .cse47 .cse39 .cse21 .cse23 .cse24 .cse33) (and .cse43 .cse45 (or (and .cse2 .cse25 .cse35 .cse4 .cse5 .cse36 .cse7 .cse8 .cse11 .cse40 .cse13 .cse37 .cse15 .cse28 .cse17 .cse38 .cse39 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse25 .cse4 .cse5 .cse36 .cse7 .cse8 .cse11 .cse40 .cse13 .cse41 .cse15 .cse28 .cse42 .cse17 .cse38 .cse39 .cse21 .cse23 .cse24 .cse33)) .cse47) (and .cse2 .cse48 .cse4 .cse6 .cse27 .cse49 .cse7 .cse8 .cse9 .cse11 .cse40 .cse12 .cse13 .cse14 .cse15 .cse28 .cse17 .cse20 .cse38 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse48 .cse4 .cse5 .cse36 .cse49 .cse9 .cse7 .cse8 .cse11 .cse13 .cse15 .cse28 .cse17 .cse19 .cse0 .cse38 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse48 .cse3 .cse4 .cse5 .cse36 .cse49 .cse7 .cse8 .cse9 .cse11 .cse13 .cse15 .cse17 .cse18 .cse19 .cse0 .cse38 .cse21 .cse23 .cse24 .cse33) (and .cse26 .cse3 .cse4 .cse6 .cse27 .cse8 .cse12 .cse40 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse29 .cse30 .cse0 .cse20 .cse38 .cse23 .cse24 .cse33 .cse34) (and .cse2 .cse43 .cse25 .cse35 .cse4 .cse5 .cse36 .cse7 .cse8 .cse11 .cse13 .cse37 .cse15 .cse28 .cse17 .cse19 .cse45 .cse38 .cse47 .cse39 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse48 .cse4 .cse5 .cse36 .cse49 .cse9 .cse7 .cse8 .cse11 .cse40 .cse13 .cse15 .cse28 .cse0 .cse38 .cse21 .cse23 .cse24 .cse33) (and .cse26 .cse4 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse19 .cse30 .cse31 .cse20 .cse21 .cse32 .cse24 .cse33) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse40 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse38 .cse21 .cse22 .cse23 .cse24) (and .cse2 .cse25 .cse4 .cse3 .cse5 .cse36 .cse7 .cse8 .cse11 .cse40 .cse13 .cse15 .cse41 .cse17 .cse42 .cse18 .cse38 .cse21 .cse39 .cse23 .cse24 .cse33) (and .cse2 .cse26 .cse25 .cse35 .cse4 .cse3 .cse5 .cse36 .cse7 .cse8 .cse40 .cse13 .cse37 .cse15 .cse17 .cse18 .cse38 .cse21 .cse39 .cse23 .cse24 .cse33) (and .cse2 .cse48 .cse26 .cse4 .cse3 .cse5 .cse36 .cse49 .cse9 .cse7 .cse8 .cse13 .cse15 .cse28 .cse17 .cse19 .cse0 .cse38 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse4 .cse3 .cse6 .cse27 .cse8 .cse11 .cse12 .cse40 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse29 .cse0 .cse20 .cse38 .cse23 .cse24 .cse33 .cse34) (and .cse26 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse40 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse30 .cse20 .cse38 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse48 .cse26 .cse4 .cse3 .cse5 .cse36 .cse49 .cse7 .cse8 .cse9 .cse40 .cse13 .cse15 .cse17 .cse18 .cse0 .cse38 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse26 .cse25 .cse4 .cse3 .cse5 .cse6 .cse36 .cse7 .cse8 .cse12 .cse13 .cse15 .cse28 .cse17 .cse19 (<= ~data~0 ULTIMATE.start_write_loop_~t~0) (<= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse38 .cse39 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse19 .cse20 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse3 .cse4 .cse6 .cse27 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse19 .cse29 .cse0 .cse20 .cse23 .cse24 .cse33 .cse34) (and .cse2 .cse48 .cse4 .cse3 .cse5 .cse36 .cse49 .cse7 .cse8 .cse9 .cse11 .cse40 .cse13 .cse15 .cse17 .cse18 .cse0 .cse38 .cse21 .cse23 .cse24 .cse33) (and .cse26 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse40 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse30 .cse20 .cse38 .cse21 .cse22 .cse23 .cse24) (and (<= ~d~0 .cse50) (<= .cse50 ~d~0) .cse43 .cse44 .cse45 (or (and .cse2 .cse48 .cse25 .cse4 .cse27 .cse36 .cse49 .cse7 .cse8 .cse11 .cse40 .cse13 .cse41 .cse15 .cse28 .cse17 .cse42 .cse20 .cse38 .cse21 .cse23 .cse24 .cse33) (and .cse2 .cse48 .cse25 .cse35 .cse4 .cse27 .cse36 .cse49 .cse7 .cse8 .cse11 .cse40 .cse13 .cse37 .cse15 .cse28 .cse17 .cse20 .cse38 .cse21 .cse23 .cse24 .cse33)) .cse46) (and .cse2 .cse48 .cse26 .cse4 .cse5 .cse36 .cse49 .cse9 .cse7 .cse8 .cse40 .cse13 .cse15 .cse28 .cse17 .cse0 .cse38 .cse21 .cse23 .cse24 .cse33) (and .cse4 .cse5 (= ~e_wl~0 ~e_f~0) .cse36 .cse7 .cse8 .cse13 .cse15 .cse29 .cse0 .cse21 .cse23 .cse24) (and .cse51 .cse2 .cse48 .cse25 .cse4 (<= .cse52 ~d~0) .cse53 .cse27 .cse36 .cse49 .cse7 .cse8 .cse11 .cse40 .cse28 .cse38 .cse23 .cse24 .cse33 (<= ~d~0 .cse52) .cse13 .cse41 .cse15 .cse17 .cse42 .cse54 .cse55 .cse20 .cse21) (and .cse2 .cse3 .cse4 .cse6 .cse27 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse29 .cse0 .cse20 .cse22 .cse23 .cse24 .cse34) (and .cse51 .cse2 .cse25 .cse4 .cse5 .cse53 .cse36 .cse7 .cse8 .cse11 .cse40 .cse28 .cse38 .cse23 .cse24 .cse33 .cse13 .cse41 .cse15 .cse42 .cse54 .cse55 .cse20 .cse39 .cse21))))
[2019-11-23 22:50:43,276 INFO  L444   ceAbstractionStarter]: For program point  L293(lines 293 309)  no Hoare annotation was computed.
[2019-11-23 22:50:43,277 INFO  L440   ceAbstractionStarter]: At program point  L194-1(lines 175 215)  the Hoare annotation is:  (let ((.cse0 (= ~c2_pc~0 1)) (.cse39 (= ~e_f~0 ~wl_st~0)) (.cse2 (= ~processed~0 0)) (.cse3 (= ~wb_i~0 1)) (.cse4 (<= 2 ~wl_st~0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~c2_i~0 1)) (.cse9 (= 1 ~wl_pc~0)) (.cse36 (<= 2 ~c1_st~0)) (.cse10 (not (= ~e_g~0 0))) (.cse22 (= ~e_e~0 ~e_c~0)) (.cse11 (= ~c1_i~0 1)) (.cse38 (<= 2 ~wb_st~0)) (.cse23 (= ~e_e~0 ~e_f~0)) (.cse12 (<= 2 ~r_st~0)) (.cse25 (<= ~c_req_up~0 0)) (.cse16 (= ~c1_pc~0 1)) (.cse17 (not (= ~e_e~0 1))) (.cse18 (not (= ~e_g~0 1))) (.cse19 (<= ~r_i~0 0)) (.cse20 (= 1 ~wb_pc~0)) (.cse43 (+ ~t_b~0 2)) (.cse33 (+ ~t_b~0 1))) (let ((.cse35 (<= .cse33 ~data~0)) (.cse37 (<= ~data~0 .cse33)) (.cse40 (<= .cse43 ~data~0)) (.cse41 (<= ~data~0 .cse43)) (.cse13 (= 0 ~wb_st~0)) (.cse26 (= 0 ~wb_pc~0)) (.cse34 (= 2 ~wl_pc~0)) (.cse21 (= 0 ~wl_st~0)) (.cse28 (= ~e_c~0 ~e_g~0)) (.cse29 (= ~e_g~0 ~e_f~0)) (.cse27 (= ~e_wl~0 ~e_c~0)) (.cse31 (= ~c1_pc~0 0)) (.cse24 (= 0 ~wl_pc~0)) (.cse1 (not (= ~e_f~0 1))) (.cse5 (not (= ~e_c~0 0))) (.cse6 (not (= ~e_f~0 0))) (.cse14 (= ~c1_st~0 0)) (.cse15 (<= 2 ~e_wl~0)) (.cse30 (<= ~t_b~0 ~data~0)) (.cse42 (or (and .cse0 .cse2 .cse3 .cse4 .cse7 .cse8 .cse36 .cse10 .cse22 .cse11 .cse38 .cse12 .cse25 .cse16 .cse39 .cse17 .cse18 .cse19 .cse20) (and .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse36 .cse10 .cse22 .cse11 .cse38 .cse23 .cse12 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20))) (.cse32 (<= ~data~0 ~t_b~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and (or (and .cse0 .cse3 .cse21 .cse8 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse14 .cse24 .cse15 .cse25 .cse26 .cse18 .cse19 .cse27) (and .cse3 .cse21 .cse8 .cse11 .cse23 .cse12 .cse13 .cse14 .cse24 .cse28 .cse15 .cse25 .cse29 .cse26 .cse19 .cse27)) .cse2 .cse30 .cse31 .cse32) (and (<= .cse33 ~c_t~0) (or (and .cse0 .cse34 .cse35 .cse3 .cse4 .cse5 .cse7 .cse8 .cse36 .cse10 .cse37 .cse11 .cse38 .cse12 .cse16 .cse39 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse34 .cse3 .cse4 .cse5 .cse7 .cse8 .cse36 .cse10 .cse11 .cse40 .cse38 .cse12 .cse41 .cse16 .cse39 .cse17 .cse18 .cse19 .cse20)) (<= ~c_t~0 .cse33) (= ~c_req_up~0 1)) (and .cse15 .cse42) (and .cse2 .cse3 .cse30 .cse21 .cse8 .cse32 .cse36 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse15 .cse25 .cse16 .cse26 .cse18 .cse19 .cse27) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse36 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse34 .cse35 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse37 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse39 .cse18 .cse19 .cse20) (and .cse2 .cse30 (or (and .cse3 .cse4 .cse8 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse28 .cse25 .cse29 .cse26 .cse18 .cse19) (and .cse0 .cse3 .cse4 .cse9 .cse7 .cse8 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse14 .cse25 .cse17 .cse26 .cse18 .cse19)) .cse31 .cse32) (and .cse3 .cse2 .cse30 .cse21 .cse8 .cse32 .cse36 .cse10 .cse22 .cse11 .cse38 .cse23 .cse12 .cse24 .cse15 .cse25 .cse16 .cse18 .cse19 .cse27 .cse20) (and .cse0 .cse34 .cse3 .cse2 .cse4 .cse5 .cse7 .cse8 .cse36 .cse10 .cse11 .cse40 .cse12 .cse41 .cse13 .cse16 .cse17 .cse39 .cse18 .cse19 .cse20) (and .cse2 .cse3 .cse4 .cse30 .cse7 .cse8 .cse9 .cse32 .cse36 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse25 .cse16 .cse17 .cse26 .cse18 .cse19) (and .cse34 .cse42) (and .cse2 .cse30 .cse6 .cse31 (or (and .cse0 .cse3 .cse4 .cse9 .cse8 .cse10 .cse22 .cse11 .cse23 .cse38 .cse12 .cse14 .cse25 .cse17 .cse18 .cse19 .cse20) (and .cse3 .cse4 .cse8 .cse9 .cse11 .cse38 .cse23 .cse12 .cse14 .cse28 .cse25 .cse29 .cse18 .cse19 .cse20)) .cse32) (and (or (and .cse0 .cse3 .cse21 .cse8 .cse10 .cse22 .cse11 .cse23 .cse38 .cse12 .cse14 .cse24 .cse25 .cse18 .cse19 .cse27 .cse20) (and .cse3 .cse21 .cse8 .cse11 .cse38 .cse23 .cse12 .cse14 .cse24 .cse28 .cse25 .cse29 .cse19 .cse27 .cse20)) .cse2 .cse15 .cse30 .cse31 .cse32) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse36 .cse10 .cse11 .cse38 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse3 .cse4 (= ~e_wl~0 ~e_f~0) .cse5 .cse7 .cse8 .cse10 .cse11 .cse24 .cse15 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse10 .cse11 .cse38 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse30 .cse42 .cse32))))
[2019-11-23 22:50:43,277 INFO  L444   ceAbstractionStarter]: For program point  L62(lines 62 66)  no Hoare annotation was computed.
[2019-11-23 22:50:43,277 INFO  L444   ceAbstractionStarter]: For program point  L657(lines 657 673)  no Hoare annotation was computed.
[2019-11-23 22:50:43,277 INFO  L444   ceAbstractionStarter]: For program point  L624-1(lines 535 675)  no Hoare annotation was computed.
[2019-11-23 22:50:43,277 INFO  L444   ceAbstractionStarter]: For program point  L360(lines 360 367)  no Hoare annotation was computed.
[2019-11-23 22:50:43,277 INFO  L444   ceAbstractionStarter]: For program point  L559-1(lines 535 675)  no Hoare annotation was computed.
[2019-11-23 22:50:43,277 INFO  L444   ceAbstractionStarter]: For program point  L460(lines 460 464)  no Hoare annotation was computed.
[2019-11-23 22:50:43,278 INFO  L440   ceAbstractionStarter]: At program point  L262(lines 255 272)  the Hoare annotation is:  (let ((.cse19 (+ ~t_b~0 2))) (let ((.cse21 (<= .cse19 ~data~0)) (.cse22 (<= ~data~0 .cse19)) (.cse20 (= 2 ~wl_pc~0)) (.cse23 (<= ~c_req_up~0 0)) (.cse17 (= ~c2_st~0 0)) (.cse14 (<= 2 ~wb_st~0)) (.cse13 (<= 2 ~c1_st~0)) (.cse10 (= ~c2_pc~0 1)) (.cse24 (= ~processed~0 0)) (.cse2 (= ~wb_i~0 1)) (.cse3 (<= 2 ~wl_st~0)) (.cse5 (not (= ~e_c~0 0))) (.cse6 (not (= ~e_e~0 0))) (.cse7 (= ~c2_i~0 1)) (.cse11 (= 1 ~wl_pc~0)) (.cse12 (<= 2 ~c2_st~0)) (.cse0 (not (= ~e_g~0 0))) (.cse1 (= ~c1_i~0 1)) (.cse25 (= 0 ~wb_st~0)) (.cse27 (= ~c1_st~0 0)) (.cse4 (<= 2 ~e_wl~0)) (.cse15 (= ~c1_pc~0 1)) (.cse18 (= ~e_f~0 ~wl_st~0)) (.cse8 (not (= ~e_g~0 1))) (.cse9 (<= ~r_i~0 0)) (.cse16 (= 1 ~wb_pc~0))) (or (and .cse0 .cse1 (= 0 ~wl_pc~0) .cse2 .cse3 .cse4 (= ~e_wl~0 ~e_f~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 (not (= ~e_f~0 1)) .cse2 .cse3 .cse5 (not (= ~e_f~0 0)) .cse11 .cse6 .cse7 .cse12 .cse13 .cse0 .cse1 .cse14 .cse4 .cse15 .cse8 .cse9 .cse16) (and .cse10 .cse17 .cse2 .cse3 .cse5 .cse11 .cse6 .cse7 .cse13 .cse0 .cse1 .cse14 .cse4 .cse15 .cse18 .cse8 .cse9 .cse16) (and (<= .cse19 ~c_t~0) .cse10 .cse20 .cse2 (<= .cse19 ~d~0) .cse3 (<= .cse19 ~c~0) .cse5 .cse6 .cse7 .cse12 .cse13 .cse14 .cse15 .cse8 .cse9 .cse16 (<= ~d~0 .cse19) .cse0 .cse21 .cse1 .cse22 (<= ~c_t~0 .cse19) (<= ~c~0 .cse19) .cse23 .cse18) (and .cse10 .cse17 .cse24 .cse2 .cse3 .cse5 .cse11 .cse6 .cse7 .cse13 .cse0 .cse1 .cse25 .cse4 .cse15 .cse18 .cse8 .cse9 .cse16) (let ((.cse26 (+ ~t_b~0 1))) (and (<= ~d~0 .cse26) (<= .cse26 ~d~0) (<= .cse26 ~c_t~0) (<= .cse26 ~c~0) (<= ~c_t~0 .cse26) (or (and .cse10 .cse20 .cse2 .cse3 .cse5 .cse6 .cse7 .cse12 .cse13 .cse0 .cse21 .cse1 .cse14 .cse22 .cse23 .cse15 .cse18 .cse8 .cse9 .cse16) (and .cse10 .cse20 (<= .cse26 ~data~0) .cse2 .cse3 .cse5 .cse6 .cse7 .cse12 .cse13 .cse0 (<= ~data~0 .cse26) .cse1 .cse14 .cse23 .cse15 .cse18 .cse8 .cse9 .cse16)) (<= ~c~0 .cse26))) (and .cse10 .cse17 .cse2 .cse24 .cse3 .cse5 .cse11 .cse6 .cse7 .cse0 .cse1 .cse14 .cse27 .cse4 .cse15 .cse18 .cse8 .cse9 .cse16) (and .cse10 .cse2 .cse3 .cse5 .cse11 .cse6 .cse7 .cse12 .cse0 .cse1 .cse14 .cse27 .cse4 .cse15 .cse18 .cse8 .cse9 .cse16) (and .cse10 .cse2 .cse24 .cse3 .cse5 .cse6 .cse7 .cse11 .cse12 .cse13 .cse0 .cse1 .cse25 .cse4 .cse15 .cse18 .cse8 .cse9 .cse16) (and .cse10 .cse24 .cse2 .cse3 .cse5 .cse6 .cse7 .cse11 .cse12 .cse0 .cse1 .cse25 .cse27 .cse4 .cse15 .cse18 .cse8 .cse9 .cse16))))
[2019-11-23 22:50:43,278 INFO  L444   ceAbstractionStarter]: For program point  L296(lines 296 308)  no Hoare annotation was computed.
[2019-11-23 22:50:43,278 INFO  L444   ceAbstractionStarter]: For program point  L263(lines 255 272)  no Hoare annotation was computed.
[2019-11-23 22:50:43,278 INFO  L444   ceAbstractionStarter]: For program point  L197(lines 197 205)  no Hoare annotation was computed.
[2019-11-23 22:50:43,278 INFO  L444   ceAbstractionStarter]: For program point  L197-1(lines 197 205)  no Hoare annotation was computed.
[2019-11-23 22:50:43,278 INFO  L444   ceAbstractionStarter]: For program point  L131(lines 131 139)  no Hoare annotation was computed.
[2019-11-23 22:50:43,279 INFO  L444   ceAbstractionStarter]: For program point  L-1(line -1)  no Hoare annotation was computed.
[2019-11-23 22:50:43,279 INFO  L444   ceAbstractionStarter]: For program point  ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13)  no Hoare annotation was computed.
[2019-11-23 22:50:43,279 INFO  L444   ceAbstractionStarter]: For program point  L660(lines 660 672)  no Hoare annotation was computed.
[2019-11-23 22:50:43,279 INFO  L444   ceAbstractionStarter]: For program point  L495(lines 396 680)  no Hoare annotation was computed.
[2019-11-23 22:50:43,279 INFO  L444   ceAbstractionStarter]: For program point  L429-1(lines 396 680)  no Hoare annotation was computed.
[2019-11-23 22:50:43,279 INFO  L444   ceAbstractionStarter]: For program point  L330(lines 330 337)  no Hoare annotation was computed.
[2019-11-23 22:50:43,279 INFO  L444   ceAbstractionStarter]: For program point  L264(lines 264 268)  no Hoare annotation was computed.
[2019-11-23 22:50:43,279 INFO  L444   ceAbstractionStarter]: For program point  L198(lines 198 202)  no Hoare annotation was computed.
[2019-11-23 22:50:43,279 INFO  L444   ceAbstractionStarter]: For program point  L496(lines 496 500)  no Hoare annotation was computed.
[2019-11-23 22:50:43,280 INFO  L440   ceAbstractionStarter]: At program point  L232-1(lines 220 247)  the Hoare annotation is:  (let ((.cse44 (+ ~t_b~0 1))) (let ((.cse13 (= ~c2_pc~0 0)) (.cse14 (= ~e_c~0 ~e_g~0)) (.cse17 (= ~e_g~0 ~e_f~0)) (.cse0 (= ~c2_st~0 0)) (.cse31 (not (= ~e_f~0 1))) (.cse33 (not (= ~e_f~0 0))) (.cse4 (= 0 ~wl_st~0)) (.cse12 (= 0 ~wl_pc~0)) (.cse15 (<= 2 ~e_wl~0)) (.cse20 (= ~e_wl~0 ~e_c~0)) (.cse21 (<= 2 ~c1_st~0)) (.cse36 (<= .cse44 ~c_t~0)) (.cse37 (= 2 ~wl_pc~0)) (.cse38 (<= .cse44 ~data~0)) (.cse32 (not (= ~e_c~0 0))) (.cse39 (<= ~data~0 .cse44)) (.cse40 (<= ~c_t~0 .cse44)) (.cse24 (= ~c1_pc~0 1)) (.cse41 (= ~c_req_up~0 1)) (.cse42 (= ~e_f~0 ~wl_st~0)) (.cse35 (= 1 ~wb_pc~0)) (.cse30 (= ~c2_pc~0 1)) (.cse1 (= ~wb_i~0 1)) (.cse2 (= ~processed~0 0)) (.cse26 (<= 2 ~wl_st~0)) (.cse3 (<= ~t_b~0 ~data~0)) (.cse27 (not (= ~e_e~0 0))) (.cse5 (= ~c2_i~0 1)) (.cse28 (= 1 ~wl_pc~0)) (.cse6 (= ~c1_pc~0 0)) (.cse34 (<= 2 ~c2_st~0)) (.cse7 (<= ~data~0 ~t_b~0)) (.cse22 (not (= ~e_g~0 0))) (.cse23 (= ~e_e~0 ~e_c~0)) (.cse8 (= ~c1_i~0 1)) (.cse9 (= ~e_e~0 ~e_f~0)) (.cse10 (<= 2 ~r_st~0)) (.cse11 (= ~c1_st~0 0)) (.cse16 (<= ~c_req_up~0 0)) (.cse29 (not (= ~e_e~0 1))) (.cse18 (= 0 ~wb_pc~0)) (.cse25 (not (= ~e_g~0 1))) (.cse19 (<= ~r_i~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse21 .cse22 .cse23 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse24 .cse18 .cse25 .cse19 .cse20) (and .cse0 .cse2 .cse1 .cse26 .cse3 .cse27 .cse5 .cse28 .cse7 .cse21 .cse22 .cse23 .cse8 .cse9 .cse10 .cse13 .cse16 .cse24 .cse29 .cse18 .cse25 .cse19) (and .cse30 .cse31 .cse1 .cse26 .cse32 .cse33 .cse28 .cse27 .cse5 .cse34 .cse21 .cse22 .cse8 .cse10 .cse15 .cse24 .cse29 .cse25 .cse19 .cse35) (and .cse30 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse34 .cse7 .cse22 .cse23 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse18 .cse25 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse26 .cse3 .cse5 .cse28 .cse6 .cse7 .cse22 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse29 .cse17 .cse18 .cse19) (and .cse30 .cse2 .cse1 .cse26 .cse3 .cse27 .cse5 .cse28 .cse34 .cse7 .cse21 .cse22 .cse23 .cse8 .cse9 .cse10 .cse16 .cse24 .cse29 .cse18 .cse25 .cse19) (and .cse30 .cse0 .cse36 .cse37 .cse38 .cse1 .cse26 .cse32 .cse27 .cse5 .cse21 .cse22 .cse39 .cse8 .cse10 .cse40 .cse24 .cse41 .cse42 .cse29 .cse25 .cse19 .cse35) (and .cse30 .cse31 .cse0 .cse1 .cse26 .cse32 .cse33 .cse28 .cse27 .cse5 .cse21 .cse22 .cse8 .cse10 .cse15 .cse24 .cse29 .cse25 .cse19 .cse35) (and .cse30 .cse31 .cse1 .cse26 .cse32 .cse33 .cse28 .cse27 .cse5 .cse34 .cse22 .cse8 .cse10 .cse11 .cse15 .cse24 .cse29 .cse25 .cse19 .cse35) (and .cse1 .cse26 (= ~e_wl~0 ~e_f~0) .cse32 .cse27 .cse5 .cse22 .cse8 .cse12 .cse15 .cse29 .cse25 .cse19) (and .cse30 .cse2 .cse1 .cse3 .cse4 .cse5 .cse34 .cse7 .cse21 .cse22 .cse23 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse24 .cse18 .cse25 .cse19 .cse20) (let ((.cse43 (+ ~t_b~0 2))) (and .cse30 (<= .cse43 ~c_t~0) .cse37 .cse1 .cse26 .cse32 .cse27 .cse5 .cse34 .cse21 .cse22 .cse8 (<= .cse43 ~data~0) .cse10 (<= ~data~0 .cse43) (<= ~c_t~0 .cse43) .cse24 .cse41 .cse42 .cse29 .cse25 .cse19 .cse35)) (and .cse30 .cse36 .cse37 .cse38 .cse1 .cse26 .cse32 .cse27 .cse5 .cse34 .cse22 .cse39 .cse8 .cse10 .cse11 .cse40 .cse24 .cse41 .cse42 .cse29 .cse25 .cse19 .cse35) (and .cse30 .cse1 .cse2 .cse26 .cse3 .cse27 .cse5 .cse28 .cse6 .cse34 .cse7 .cse22 .cse23 .cse8 .cse9 .cse10 .cse11 .cse16 .cse29 .cse18 .cse25 .cse19))))
[2019-11-23 22:50:43,280 INFO  L444   ceAbstractionStarter]: For program point  L629-1(lines 535 675)  no Hoare annotation was computed.
[2019-11-23 22:50:43,280 INFO  L444   ceAbstractionStarter]: For program point  L398(lines 398 408)  no Hoare annotation was computed.
[2019-11-23 22:50:43,280 INFO  L444   ceAbstractionStarter]: For program point  L398-2(lines 396 680)  no Hoare annotation was computed.
[2019-11-23 22:50:43,280 INFO  L444   ceAbstractionStarter]: For program point  L299(lines 299 307)  no Hoare annotation was computed.
[2019-11-23 22:50:43,281 INFO  L444   ceAbstractionStarter]: For program point  L233(line 233)  no Hoare annotation was computed.
[2019-11-23 22:50:43,281 INFO  L444   ceAbstractionStarter]: For program point  L134(lines 134 138)  no Hoare annotation was computed.
[2019-11-23 22:50:43,457 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:50:43 BoogieIcfgContainer
[2019-11-23 22:50:43,457 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-11-23 22:50:43,458 INFO  L168              Benchmark]: Toolchain (without parser) took 77655.83 ms. Allocated memory was 146.3 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 102.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB.
[2019-11-23 22:50:43,459 INFO  L168              Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB.
[2019-11-23 22:50:43,459 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 506.53 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.4 MB in the beginning and 179.6 MB in the end (delta: -77.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB.
[2019-11-23 22:50:43,459 INFO  L168              Benchmark]: Boogie Procedure Inliner took 53.56 ms. Allocated memory is still 203.4 MB. Free memory was 179.6 MB in the beginning and 177.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
[2019-11-23 22:50:43,460 INFO  L168              Benchmark]: Boogie Preprocessor took 41.76 ms. Allocated memory is still 203.4 MB. Free memory was 177.0 MB in the beginning and 174.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB.
[2019-11-23 22:50:43,460 INFO  L168              Benchmark]: RCFGBuilder took 796.72 ms. Allocated memory is still 203.4 MB. Free memory was 174.1 MB in the beginning and 134.8 MB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB.
[2019-11-23 22:50:43,460 INFO  L168              Benchmark]: TraceAbstraction took 76252.17 ms. Allocated memory was 203.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 134.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB.
[2019-11-23 22:50:43,463 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 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 506.53 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.4 MB in the beginning and 179.6 MB in the end (delta: -77.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 53.56 ms. Allocated memory is still 203.4 MB. Free memory was 179.6 MB in the beginning and 177.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 41.76 ms. Allocated memory is still 203.4 MB. Free memory was 177.0 MB in the beginning and 174.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 796.72 ms. Allocated memory is still 203.4 MB. Free memory was 174.1 MB in the beginning and 134.8 MB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 76252.17 ms. Allocated memory was 203.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 134.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 13]: 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: 393]: Loop Invariant
    Derived loop invariant: c2_i == 1
  - InvariantResult [Line: 288]: Loop Invariant
    Derived loop invariant: ((((((((((((((((((((((((((((((((((((((2 <= e_wl && ((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0)) || (((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && c_t <= t_b + 2) && c1_pc == 1) && c_req_up == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (2 == wl_pc && ((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && data <= t_b) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && c2_pc == 0) && e_c == e_g) && 2 <= e_wl) && c_req_up <= 0) && e_g == e_f) && r_i <= 0) && 1 == wb_pc) && e_wl == e_c)) || ((t_b <= data && ((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && data <= t_b)) || (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && data <= t_b) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c2_pc == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f) && 0 == wb_pc) && r_i <= 0)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && 0 == wl_pc) && c2_pc == 0) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && data <= t_b) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 0 == wl_pc) && c2_pc == 0) && e_c == e_g) && 2 <= e_wl) && c_req_up <= 0) && e_g == e_f) && 0 == wb_pc) && r_i <= 0) && e_wl == e_c)) || (((((((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) && t_b + 1 <= c_t) && t_b + 1 <= c) && c_t <= t_b + 1) && c <= t_b + 1)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && t_b + 1 <= c_t) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_t <= t_b + 1) && c1_pc == 1) && c_req_up == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((t_b + 1 <= c_t && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c_req_up == 1)) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && t_b <= data) && 0 == wl_st) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_st == 0 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c2_pc == 0) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c_t <= t_b + 1) && c1_pc == 1) && c_req_up == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && data <= t_b) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c2_pc == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0)) || (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && t_b + 2 <= data) && 2 <= r_st) && data <= t_b + 2) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && e_wl == e_c)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c2_pc == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && data <= t) && t <= data) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c2_pc == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0)) || ((((((d <= t_b + 1 && t_b + 1 <= d) && t_b + 1 <= c_t) && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && 2 == wl_pc) && wb_i == 1) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c <= t_b + 1)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || ((((((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && !(e_f == 1)) && 2 == wl_pc) && wb_i == 1) && t_b + 2 <= d) && t_b + 2 <= c) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && d <= t_b + 2) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= r_st) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1))) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c)) || ((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && t_b + 2 <= c) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && e_f == wl_st) && !(e_e == 1))
  - InvariantResult [Line: 55]: Loop Invariant
    Derived loop invariant: (((((((((((((((((((((((((((c2_st == 0 && processed == 0) && wb_i == 1) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c2_pc == 0) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && 0 == wb_pc) && r_i <= 0) && !(e_g == 1)) || (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && 0 == wb_pc) && r_i <= 0) && !(e_g == 1))) || ((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && c2_i == 1) && c1_pc == 0) && data <= t_b) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c2_pc == 0) && e_c == e_g) && 2 <= e_wl) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f) && 0 == wb_pc) && r_i <= 0)) || (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c_req_up <= 0) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc)) || ((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && c2_i == 1) && c1_pc == 0) && data <= t_b) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c2_pc == 0) && e_c == e_g) && 2 <= e_wl) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 2 <= e_wl) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc) && r_i <= 0) && !(e_g == 1))) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c2_pc == 0) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc)
  - InvariantResult [Line: 682]: Loop Invariant
    Derived loop invariant: c2_i == 1
  - InvariantResult [Line: 279]: Loop Invariant
    Derived loop invariant: ((((((((2 <= e_wl && ((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) || (((((((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) && t_b + 1 <= c_t) && t_b + 1 <= c) && c_t <= t_b + 1) && c <= t_b + 1)) || (((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && c_t <= t_b + 2) && c1_pc == 1) && c_req_up == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (2 == wl_pc && ((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || (((t_b + 1 <= c_t && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c_req_up == 1)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || ((t_b <= data && ((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && data <= t_b)) || ((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && t_b + 2 <= c) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && e_f == wl_st) && !(e_e == 1))) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)
  - InvariantResult [Line: 255]: Loop Invariant
    Derived loop invariant: (((((((((((((((((((!(e_g == 0) && c1_i == 1) && 0 == wl_pc) && wb_i == 1) && 2 <= wl_st) && 2 <= e_wl) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 1)) && r_i <= 0) || ((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((c2_pc == 1 && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && t_b + 2 <= d) && 2 <= wl_st) && t_b + 2 <= c) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && d <= t_b + 2) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && e_f == wl_st)) || ((((((((((((((((((c2_pc == 1 && c2_st == 0) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((d <= t_b + 1 && t_b + 1 <= d) && t_b + 1 <= c_t) && t_b + 1 <= c) && c_t <= t_b + 1) && ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || (((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c <= t_b + 1)) || ((((((((((((((((((c2_pc == 1 && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((c2_pc == 1 && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 0 == wb_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)
  - InvariantResult [Line: 288]: Loop Invariant
    Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && data <= t_b) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && c2_pc == 0) && e_c == e_g) && 2 <= e_wl) && c_req_up <= 0) && e_g == e_f) && r_i <= 0) && 1 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && data <= t_b) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c2_pc == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f) && 0 == wb_pc) && r_i <= 0)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && 0 == wl_pc) && c2_pc == 0) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && data <= t_b) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 0 == wl_pc) && c2_pc == 0) && e_c == e_g) && 2 <= e_wl) && c_req_up <= 0) && e_g == e_f) && 0 == wb_pc) && r_i <= 0) && e_wl == e_c)) || (((((((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) && t_b + 1 <= c_t) && t_b + 1 <= c) && c_t <= t_b + 1) && c <= t_b + 1)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && t_b + 1 <= c_t) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_t <= t_b + 1) && c1_pc == 1) && c_req_up == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && t_b <= data) && 0 == wl_st) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_st == 0 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c2_pc == 0) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c_t <= t_b + 1) && c1_pc == 1) && c_req_up == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && data <= t_b) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c2_pc == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0)) || (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && t_b + 2 <= data) && 2 <= r_st) && data <= t_b + 2) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && e_wl == e_c)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c2_pc == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && data <= t) && t <= data) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((d <= t_b + 1 && t_b + 1 <= d) && t_b + 1 <= c_t) && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && 2 == wl_pc) && wb_i == 1) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c <= t_b + 1)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c2_pc == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || ((((((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && !(e_f == 1)) && 2 == wl_pc) && wb_i == 1) && t_b + 2 <= d) && t_b + 2 <= c) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && d <= t_b + 2) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= r_st) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1))) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c)) || ((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && t_b + 2 <= c) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && e_f == wl_st) && !(e_e == 1))
  - InvariantResult [Line: 55]: Loop Invariant
    Derived loop invariant: ((((((d <= t_b + 1 && t_b + 1 <= d) && t_b + 1 <= c_t) && t_b + 1 <= c) && c_t <= t_b + 1) && (((((t_b + 2 <= data && data <= t_b + 2) && 2 == wl_pc) && !(e_f == 0)) && ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc) || (((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc)) || (((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc)) || (((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc))) || ((((data <= t_b + 1 && 2 == wl_pc) && t_b + 1 <= data) && !(e_f == 0)) && ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc) || (((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc)) || (((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc)) || (((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc))))) && c <= t_b + 1) || ((((((((((t_b + 2 <= c_t && t_b + 2 <= data) && data <= t_b + 2) && c_t <= t_b + 2) && 2 == wl_pc) && d <= t_b + 2) && c <= t_b + 2) && t_b + 2 <= d) && t_b + 2 <= c) && !(e_f == 0)) && ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc) || (((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc)) || (((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc)) || (((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc)))
  - InvariantResult [Line: 130]: Loop Invariant
    Derived loop invariant: (((((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_t <= t_b + 1) && c1_pc == 1) && c_req_up == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && data <= t) && t <= data) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)
  - InvariantResult [Line: 220]: Loop Invariant
    Derived loop invariant: (((((((((((((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && data <= t_b) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && c2_pc == 0) && e_c == e_g) && 2 <= e_wl) && c_req_up <= 0) && e_g == e_f) && 0 == wb_pc) && r_i <= 0) && e_wl == e_c) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c2_pc == 0) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c)) || (((((((((((((((((((((c2_st == 0 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c2_pc == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c)) || ((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && data <= t_b) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c2_pc == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f) && 0 == wb_pc) && r_i <= 0)) || (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && t_b + 1 <= c_t) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && c_t <= t_b + 1) && c1_pc == 1) && c_req_up == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && t_b + 2 <= c_t) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && t_b + 2 <= data) && 2 <= r_st) && data <= t_b + 2) && c_t <= t_b + 2) && c1_pc == 1) && c_req_up == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && c1_st == 0) && c_t <= t_b + 1) && c1_pc == 1) && c_req_up == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0)
  - InvariantResult [Line: 288]: Loop Invariant
    Derived loop invariant: (((((((((((((((((((((((((((((((((((((2 <= e_wl && ((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0)) || (2 == wl_pc && ((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && data <= t_b) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && c2_pc == 0) && e_c == e_g) && 2 <= e_wl) && c_req_up <= 0) && e_g == e_f) && r_i <= 0) && 1 == wb_pc) && e_wl == e_c)) || ((t_b <= data && ((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && data <= t_b)) || (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && data <= t_b) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c2_pc == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f) && 0 == wb_pc) && r_i <= 0)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && 0 == wl_pc) && c2_pc == 0) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && data <= t_b) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 0 == wl_pc) && c2_pc == 0) && e_c == e_g) && 2 <= e_wl) && c_req_up <= 0) && e_g == e_f) && 0 == wb_pc) && r_i <= 0) && e_wl == e_c)) || (((((((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) && t_b + 1 <= c_t) && t_b + 1 <= c) && c_t <= t_b + 1) && c <= t_b + 1)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && t_b + 1 <= c_t) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_t <= t_b + 1) && c1_pc == 1) && c_req_up == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((t_b + 1 <= c_t && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c_req_up == 1)) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && t_b <= data) && 0 == wl_st) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_st == 0 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c2_pc == 0) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c_t <= t_b + 1) && c1_pc == 1) && c_req_up == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && data <= t_b) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c2_pc == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0)) || (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && t_b + 2 <= data) && 2 <= r_st) && data <= t_b + 2) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && e_wl == e_c)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c2_pc == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && data <= t) && t <= data) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c2_pc == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0)) || ((((((d <= t_b + 1 && t_b + 1 <= d) && t_b + 1 <= c_t) && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && 2 == wl_pc) && wb_i == 1) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c <= t_b + 1)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || ((((((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && !(e_f == 1)) && 2 == wl_pc) && wb_i == 1) && t_b + 2 <= d) && t_b + 2 <= c) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && d <= t_b + 2) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= r_st) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1))) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c)) || ((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && t_b + 2 <= c) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && e_f == wl_st) && !(e_e == 1))
  - InvariantResult [Line: 579]: Loop Invariant
    Derived loop invariant: ((((((((((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) && t_b + 1 <= c_t) && t_b + 1 <= c) && c_t <= t_b + 1) && c <= t_b + 1) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || (((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && t_b + 2 <= c) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && e_f == wl_st) && !(e_e == 1))) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)
  - InvariantResult [Line: 130]: Loop Invariant
    Derived loop invariant: ((((((((((((((((((((((((((((((((((((c2_st == 0 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && 0 == wl_pc) && c2_pc == 0) && 2 <= e_wl) && c_req_up <= 0) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c) || ((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c2_pc == 0) && c_req_up <= 0) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((t_b <= data && (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && data <= t_b)) || (2 <= e_wl && (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_st == 0 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c2_pc == 0) && 2 <= e_wl) && c_req_up <= 0) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_st == 0 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c2_pc == 0) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && t_b + 2 <= data) && 2 <= r_st) && data <= t_b + 2) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (2 == wl_pc && (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c)) || (((t_b + 1 <= c_t && c_t <= t_b + 1) && c_req_up == 1) && ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || (((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || ((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && e_wl == e_c)) || ((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_f == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0)
  - InvariantResult [Line: 175]: Loop Invariant
    Derived loop invariant: (((((((((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && data <= t) && t <= data) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_t <= t_b + 1) && c1_pc == 1) && c_req_up == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)
  - InvariantResult [Line: 288]: Loop Invariant
    Derived loop invariant: ((((((((((((((((((((((((((((((((((((((2 <= e_wl && ((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0)) || (((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && c_t <= t_b + 2) && c1_pc == 1) && c_req_up == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (2 == wl_pc && ((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && data <= t_b) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && c2_pc == 0) && e_c == e_g) && 2 <= e_wl) && c_req_up <= 0) && e_g == e_f) && r_i <= 0) && 1 == wb_pc) && e_wl == e_c)) || ((t_b <= data && ((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && data <= t_b)) || (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && data <= t_b) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c2_pc == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f) && 0 == wb_pc) && r_i <= 0)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && 0 == wl_pc) && c2_pc == 0) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && data <= t_b) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 0 == wl_pc) && c2_pc == 0) && e_c == e_g) && 2 <= e_wl) && c_req_up <= 0) && e_g == e_f) && 0 == wb_pc) && r_i <= 0) && e_wl == e_c)) || (((((((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) && t_b + 1 <= c_t) && t_b + 1 <= c) && c_t <= t_b + 1) && c <= t_b + 1)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && t_b + 1 <= c_t) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_t <= t_b + 1) && c1_pc == 1) && c_req_up == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((t_b + 1 <= c_t && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c_req_up == 1)) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && t_b <= data) && 0 == wl_st) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_st == 0 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c2_pc == 0) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c_t <= t_b + 1) && c1_pc == 1) && c_req_up == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && data <= t_b) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c2_pc == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0)) || (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && t_b + 2 <= data) && 2 <= r_st) && data <= t_b + 2) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && e_wl == e_c)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c2_pc == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && data <= t) && t <= data) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c2_pc == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0)) || ((((((d <= t_b + 1 && t_b + 1 <= d) && t_b + 1 <= c_t) && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && 2 == wl_pc) && wb_i == 1) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c <= t_b + 1)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || ((((((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && !(e_f == 1)) && 2 == wl_pc) && wb_i == 1) && t_b + 2 <= d) && t_b + 2 <= c) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && d <= t_b + 2) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= r_st) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1))) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c)) || ((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && t_b + 2 <= c) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && e_f == wl_st) && !(e_e == 1))
  - InvariantResult [Line: 459]: Loop Invariant
    Derived loop invariant: (((((((((((((c2_st == 0 && wb_i == 1) && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && c2_i == 1) && c1_i == 1) && e_e == e_f) && 0 == wb_st) && c1_st == 0) && 0 == wl_pc) && 2 <= e_wl) && e_g == e_f) && r_i <= 0) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && data <= t_b) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 0 == wl_pc) && c2_pc == 0) && e_c == e_g) && 2 <= e_wl) && c_req_up <= 0) && e_g == e_f) && 0 == wb_pc) && r_i <= 0) && e_wl == e_c)
  - InvariantResult [Line: 175]: Loop Invariant
    Derived loop invariant: ((((((((((((((((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && 0 == wl_st) && c2_i == 1) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c) || (((((((((((((((wb_i == 1 && 0 == wl_st) && c2_i == 1) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 0 == wl_pc) && e_c == e_g) && 2 <= e_wl) && c_req_up <= 0) && e_g == e_f) && 0 == wb_pc) && r_i <= 0) && e_wl == e_c)) && processed == 0) && t_b <= data) && c1_pc == 0) && data <= t_b)) || (((t_b + 1 <= c_t && ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || (((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && t_b + 2 <= data) && 2 <= wb_st) && 2 <= r_st) && data <= t_b + 2) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c_t <= t_b + 1) && c_req_up == 1)) || (2 <= e_wl && (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((processed == 0 && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || ((((((((((((((((((((processed == 0 && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((processed == 0 && t_b <= data) && ((((((((((((((((wb_i == 1 && 2 <= wl_st) && c2_i == 1) && 1 == wl_pc) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_g == e_f) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) || (((((((((((((((((c2_pc == 1 && wb_i == 1) && 2 <= wl_st) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0))) && c1_pc == 0) && data <= t_b)) || ((((((((((((((((((((wb_i == 1 && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && t_b + 2 <= data) && 2 <= r_st) && data <= t_b + 2) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((processed == 0 && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0)) || (2 == wl_pc && (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((processed == 0 && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || (((((processed == 0 && t_b <= data) && !(e_f == 0)) && c1_pc == 0) && (((((((((((((((((c2_pc == 1 && wb_i == 1) && 2 <= wl_st) && 1 == wl_pc) && c2_i == 1) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((wb_i == 1 && 2 <= wl_st) && c2_i == 1) && 1 == wl_pc) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_g == e_f) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && data <= t_b)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && 0 == wl_st) && c2_i == 1) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && c_req_up <= 0) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c) && 1 == wb_pc) || ((((((((((((((wb_i == 1 && 0 == wl_st) && c2_i == 1) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && e_c == e_g) && c_req_up <= 0) && e_g == e_f) && r_i <= 0) && e_wl == e_c) && 1 == wb_pc)) && processed == 0) && 2 <= e_wl) && t_b <= data) && c1_pc == 0) && data <= t_b)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((t_b <= data && (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((processed == 0 && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && data <= t_b)
  - InvariantResult [Line: 220]: Loop Invariant
    Derived loop invariant: (((((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && t_b + 2 <= data) && 2 <= r_st) && data <= t_b + 2) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && c1_st == 0) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && t_b + 1 <= data) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)
  - InvariantResult [Line: 288]: Loop Invariant
    Derived loop invariant: (((((((((((((((((((((((((((((((((((((2 <= e_wl && ((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0)) || (2 == wl_pc && ((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && data <= t_b) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && c2_pc == 0) && e_c == e_g) && 2 <= e_wl) && c_req_up <= 0) && e_g == e_f) && r_i <= 0) && 1 == wb_pc) && e_wl == e_c)) || ((t_b <= data && ((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && data <= t_b)) || (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && data <= t_b) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c2_pc == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f) && 0 == wb_pc) && r_i <= 0)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && 0 == wl_pc) && c2_pc == 0) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && data <= t_b) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 0 == wl_pc) && c2_pc == 0) && e_c == e_g) && 2 <= e_wl) && c_req_up <= 0) && e_g == e_f) && 0 == wb_pc) && r_i <= 0) && e_wl == e_c)) || (((((((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) && t_b + 1 <= c_t) && t_b + 1 <= c) && c_t <= t_b + 1) && c <= t_b + 1)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && t_b + 1 <= c_t) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_t <= t_b + 1) && c1_pc == 1) && c_req_up == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((t_b + 1 <= c_t && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c_req_up == 1)) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && t_b <= data) && 0 == wl_st) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_st == 0 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c2_pc == 0) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c_t <= t_b + 1) && c1_pc == 1) && c_req_up == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && data <= t_b) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c2_pc == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0)) || (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && t_b + 2 <= data) && 2 <= r_st) && data <= t_b + 2) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && e_wl == e_c)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c2_pc == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && data <= t) && t <= data) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && data <= t_b) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c2_pc == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0)) || ((((((d <= t_b + 1 && t_b + 1 <= d) && t_b + 1 <= c_t) && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && 2 == wl_pc) && wb_i == 1) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c <= t_b + 1)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || ((((((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && !(e_f == 1)) && 2 == wl_pc) && wb_i == 1) && t_b + 2 <= d) && t_b + 2 <= c) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && d <= t_b + 2) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= r_st) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1))) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c)) || ((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && t_b + 2 <= c) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && e_f == wl_st) && !(e_e == 1))
  - InvariantResult [Line: 55]: Loop Invariant
    Derived loop invariant: ((((((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && 1 == wl_pc) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc)) && t_b <= data) && !(e_f == 0)) && data <= t_b) || ((((data <= t_b + 1 && 2 == wl_pc) && t_b + 1 <= data) && (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc) || ((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc)) || ((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc)) || ((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc))) && !(e_f == 0))) || ((((t_b + 2 <= data && data <= t_b + 2) && 2 == wl_pc) && (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc) || ((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc)) || ((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc)) || ((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && !(e_c == 0)) && c2_i == 1) && !(e_e == 0)) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c1_pc == 1) && !(e_e == 1)) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc))) && !(e_f == 0))
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 126 locations, 1 error locations. Result: SAFE, OverallTime: 75.9s, OverallIterations: 39, TraceHistogramMax: 9, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 52.1s, HoareTripleCheckerStatistics: 8551 SDtfs, 7312 SDslu, 8889 SDs, 0 SdLazy, 1078 SolverSat, 238 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 565 GetRequests, 470 SyntacticMatches, 7 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16773occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.8s AutomataMinimizationTime, 39 MinimizatonAttempts, 10550 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 1179 NumberOfFragments, 26501 HoareAnnotationTreeSize, 20 FomulaSimplifications, 393321 FormulaSimplificationTreeSizeReduction, 4.7s HoareSimplificationTime, 20 FomulaSimplificationsInter, 392605 FormulaSimplificationTreeSizeReductionInter, 47.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 4305 NumberOfCodeBlocks, 4305 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 4264 ConstructedInterpolants, 0 QuantifiedInterpolants, 1525572 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1001 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 41 InterpolantComputations, 37 PerfectInterpolantSequences, 2029/2119 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Received shutdown request...