./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/systemc/toy_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/systemc/toy_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2cf465b3c46ffeaae0c4558b2b00688c0a746a8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 15:35:39,336 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:35:39,338 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:35:39,356 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:35:39,357 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:35:39,359 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:35:39,361 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:35:39,363 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:35:39,366 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:35:39,370 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:35:39,372 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:35:39,373 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:35:39,374 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:35:39,378 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:35:39,386 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:35:39,387 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:35:39,389 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:35:39,391 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:35:39,395 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:35:39,397 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:35:39,399 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:35:39,401 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:35:39,407 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:35:39,409 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:35:39,410 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:35:39,410 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:35:39,412 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:35:39,414 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:35:39,416 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:35:39,419 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:35:39,419 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:35:39,419 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:35:39,420 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:35:39,421 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:35:39,423 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:35:39,424 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:35:39,426 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:35:39,453 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:35:39,455 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:35:39,459 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:35:39,459 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:35:39,460 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:35:39,460 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:35:39,460 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:35:39,460 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:35:39,460 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:35:39,461 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:35:39,461 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:35:39,461 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:35:39,461 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:35:39,461 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:35:39,461 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:35:39,462 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:35:39,464 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:35:39,464 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:35:39,464 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:35:39,464 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:35:39,464 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:35:39,464 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:35:39,466 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:35:39,466 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:35:39,466 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:35:39,466 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:35:39,466 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:35:39,466 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:35:39,467 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2cf465b3c46ffeaae0c4558b2b00688c0a746a8 [2019-01-12 15:35:39,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:35:39,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:35:39,556 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:35:39,557 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:35:39,558 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:35:39,559 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/toy_true-unreach-call_false-termination.cil.c [2019-01-12 15:35:39,616 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dd587587/cb8d3c5c1a314210a5d543ea64caea01/FLAG6872b7953 [2019-01-12 15:35:40,037 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:35:40,038 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/toy_true-unreach-call_false-termination.cil.c [2019-01-12 15:35:40,049 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dd587587/cb8d3c5c1a314210a5d543ea64caea01/FLAG6872b7953 [2019-01-12 15:35:40,381 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dd587587/cb8d3c5c1a314210a5d543ea64caea01 [2019-01-12 15:35:40,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:35:40,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:35:40,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:35:40,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:35:40,392 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:35:40,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:35:40" (1/1) ... [2019-01-12 15:35:40,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56746068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:35:40, skipping insertion in model container [2019-01-12 15:35:40,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:35:40" (1/1) ... [2019-01-12 15:35:40,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:35:40,455 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:35:40,759 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:35:40,770 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:35:40,851 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:35:40,871 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:35:40,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:35:40 WrapperNode [2019-01-12 15:35:40,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:35:40,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:35:40,873 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:35:40,873 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:35:40,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:35:40" (1/1) ... [2019-01-12 15:35:40,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:35:40" (1/1) ... [2019-01-12 15:35:41,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:35:41,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:35:41,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:35:41,025 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:35:41,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:35:40" (1/1) ... [2019-01-12 15:35:41,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:35:40" (1/1) ... [2019-01-12 15:35:41,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:35:40" (1/1) ... [2019-01-12 15:35:41,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:35:40" (1/1) ... [2019-01-12 15:35:41,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:35:40" (1/1) ... [2019-01-12 15:35:41,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:35:40" (1/1) ... [2019-01-12 15:35:41,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:35:40" (1/1) ... [2019-01-12 15:35:41,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:35:41,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:35:41,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:35:41,092 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:35:41,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:35:40" (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-01-12 15:35:41,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:35:41,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:35:42,271 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:35:42,271 INFO L286 CfgBuilder]: Removed 26 assue(true) statements. [2019-01-12 15:35:42,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:35:42 BoogieIcfgContainer [2019-01-12 15:35:42,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:35:42,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:35:42,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:35:42,279 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:35:42,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:35:40" (1/3) ... [2019-01-12 15:35:42,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d2698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:35:42, skipping insertion in model container [2019-01-12 15:35:42,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:35:40" (2/3) ... [2019-01-12 15:35:42,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d2698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:35:42, skipping insertion in model container [2019-01-12 15:35:42,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:35:42" (3/3) ... [2019-01-12 15:35:42,284 INFO L112 eAbstractionObserver]: Analyzing ICFG toy_true-unreach-call_false-termination.cil.c [2019-01-12 15:35:42,295 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:35:42,305 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 15:35:42,323 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 15:35:42,359 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:35:42,360 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:35:42,360 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:35:42,360 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:35:42,361 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:35:42,361 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:35:42,361 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:35:42,361 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:35:42,362 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:35:42,383 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-01-12 15:35:42,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 15:35:42,395 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:35:42,396 INFO L402 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-01-12 15:35:42,399 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:35:42,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:35:42,405 INFO L82 PathProgramCache]: Analyzing trace with hash -895776564, now seen corresponding path program 1 times [2019-01-12 15:35:42,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:35:42,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:35:42,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:42,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:35:42,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:35:42,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:35:42,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:35:42,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:35:42,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:35:42,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:35:42,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:35:42,618 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2019-01-12 15:35:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:35:42,695 INFO L93 Difference]: Finished difference Result 244 states and 453 transitions. [2019-01-12 15:35:42,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:35:42,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-12 15:35:42,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:35:42,709 INFO L225 Difference]: With dead ends: 244 [2019-01-12 15:35:42,709 INFO L226 Difference]: Without dead ends: 122 [2019-01-12 15:35:42,712 INFO L631 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-01-12 15:35:42,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-12 15:35:42,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-01-12 15:35:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-12 15:35:42,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 215 transitions. [2019-01-12 15:35:42,761 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 215 transitions. Word has length 36 [2019-01-12 15:35:42,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:35:42,762 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 215 transitions. [2019-01-12 15:35:42,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:35:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 215 transitions. [2019-01-12 15:35:42,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 15:35:42,765 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:35:42,765 INFO L402 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-01-12 15:35:42,766 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:35:42,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:35:42,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1597376438, now seen corresponding path program 1 times [2019-01-12 15:35:42,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:35:42,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:35:42,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:42,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:35:42,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:35:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:35:42,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:35:42,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:35:42,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:35:42,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:35:42,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:35:42,869 INFO L87 Difference]: Start difference. First operand 122 states and 215 transitions. Second operand 3 states. [2019-01-12 15:35:42,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:35:42,909 INFO L93 Difference]: Finished difference Result 234 states and 414 transitions. [2019-01-12 15:35:42,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:35:42,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-12 15:35:42,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:35:42,912 INFO L225 Difference]: With dead ends: 234 [2019-01-12 15:35:42,912 INFO L226 Difference]: Without dead ends: 122 [2019-01-12 15:35:42,914 INFO L631 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-01-12 15:35:42,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-12 15:35:42,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-01-12 15:35:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-12 15:35:42,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 214 transitions. [2019-01-12 15:35:42,930 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 214 transitions. Word has length 36 [2019-01-12 15:35:42,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:35:42,930 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 214 transitions. [2019-01-12 15:35:42,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:35:42,931 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 214 transitions. [2019-01-12 15:35:42,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 15:35:42,933 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:35:42,934 INFO L402 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-01-12 15:35:42,934 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:35:42,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:35:42,934 INFO L82 PathProgramCache]: Analyzing trace with hash -211173044, now seen corresponding path program 1 times [2019-01-12 15:35:42,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:35:42,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:35:42,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:42,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:35:42,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:35:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:35:43,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:35:43,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:35:43,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:35:43,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:35:43,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:35:43,047 INFO L87 Difference]: Start difference. First operand 122 states and 214 transitions. Second operand 3 states. [2019-01-12 15:35:43,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:35:43,266 INFO L93 Difference]: Finished difference Result 319 states and 559 transitions. [2019-01-12 15:35:43,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:35:43,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-12 15:35:43,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:35:43,271 INFO L225 Difference]: With dead ends: 319 [2019-01-12 15:35:43,271 INFO L226 Difference]: Without dead ends: 208 [2019-01-12 15:35:43,272 INFO L631 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-01-12 15:35:43,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-12 15:35:43,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 197. [2019-01-12 15:35:43,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-12 15:35:43,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 332 transitions. [2019-01-12 15:35:43,297 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 332 transitions. Word has length 36 [2019-01-12 15:35:43,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:35:43,297 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 332 transitions. [2019-01-12 15:35:43,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:35:43,297 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 332 transitions. [2019-01-12 15:35:43,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 15:35:43,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:35:43,301 INFO L402 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-01-12 15:35:43,301 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:35:43,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:35:43,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1832433288, now seen corresponding path program 1 times [2019-01-12 15:35:43,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:35:43,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:35:43,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:43,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:35:43,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:35:43,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:35:43,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:35:43,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 15:35:43,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 15:35:43,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 15:35:43,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 15:35:43,389 INFO L87 Difference]: Start difference. First operand 197 states and 332 transitions. Second operand 4 states. [2019-01-12 15:35:44,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:35:44,145 INFO L93 Difference]: Finished difference Result 533 states and 902 transitions. [2019-01-12 15:35:44,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:35:44,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-01-12 15:35:44,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:35:44,151 INFO L225 Difference]: With dead ends: 533 [2019-01-12 15:35:44,151 INFO L226 Difference]: Without dead ends: 348 [2019-01-12 15:35:44,153 INFO L631 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-01-12 15:35:44,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-01-12 15:35:44,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 341. [2019-01-12 15:35:44,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-12 15:35:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 574 transitions. [2019-01-12 15:35:44,182 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 574 transitions. Word has length 36 [2019-01-12 15:35:44,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:35:44,183 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 574 transitions. [2019-01-12 15:35:44,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 15:35:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 574 transitions. [2019-01-12 15:35:44,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 15:35:44,186 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:35:44,186 INFO L402 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-01-12 15:35:44,187 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:35:44,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:35:44,187 INFO L82 PathProgramCache]: Analyzing trace with hash -539305974, now seen corresponding path program 1 times [2019-01-12 15:35:44,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:35:44,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:35:44,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:44,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:35:44,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:35:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:35:44,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:35:44,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 15:35:44,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 15:35:44,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 15:35:44,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 15:35:44,282 INFO L87 Difference]: Start difference. First operand 341 states and 574 transitions. Second operand 4 states. [2019-01-12 15:35:44,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:35:44,866 INFO L93 Difference]: Finished difference Result 958 states and 1617 transitions. [2019-01-12 15:35:44,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:35:44,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-01-12 15:35:44,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:35:44,872 INFO L225 Difference]: With dead ends: 958 [2019-01-12 15:35:44,873 INFO L226 Difference]: Without dead ends: 630 [2019-01-12 15:35:44,874 INFO L631 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-01-12 15:35:44,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-01-12 15:35:44,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 623. [2019-01-12 15:35:44,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-01-12 15:35:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1044 transitions. [2019-01-12 15:35:44,924 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 1044 transitions. Word has length 36 [2019-01-12 15:35:44,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:35:44,925 INFO L480 AbstractCegarLoop]: Abstraction has 623 states and 1044 transitions. [2019-01-12 15:35:44,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 15:35:44,925 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1044 transitions. [2019-01-12 15:35:44,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 15:35:44,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:35:44,930 INFO L402 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-01-12 15:35:44,930 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:35:44,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:35:44,930 INFO L82 PathProgramCache]: Analyzing trace with hash -477266360, now seen corresponding path program 1 times [2019-01-12 15:35:44,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:35:44,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:35:44,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:44,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:35:44,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:35:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:35:44,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:35:44,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 15:35:44,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 15:35:44,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 15:35:44,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 15:35:44,994 INFO L87 Difference]: Start difference. First operand 623 states and 1044 transitions. Second operand 4 states. [2019-01-12 15:35:45,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:35:45,517 INFO L93 Difference]: Finished difference Result 1894 states and 3154 transitions. [2019-01-12 15:35:45,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:35:45,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-01-12 15:35:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:35:45,528 INFO L225 Difference]: With dead ends: 1894 [2019-01-12 15:35:45,528 INFO L226 Difference]: Without dead ends: 1285 [2019-01-12 15:35:45,530 INFO L631 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-01-12 15:35:45,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2019-01-12 15:35:45,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1278. [2019-01-12 15:35:45,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1278 states. [2019-01-12 15:35:45,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 2104 transitions. [2019-01-12 15:35:45,602 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 2104 transitions. Word has length 36 [2019-01-12 15:35:45,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:35:45,603 INFO L480 AbstractCegarLoop]: Abstraction has 1278 states and 2104 transitions. [2019-01-12 15:35:45,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 15:35:45,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 2104 transitions. [2019-01-12 15:35:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 15:35:45,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:35:45,607 INFO L402 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-01-12 15:35:45,607 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:35:45,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:35:45,608 INFO L82 PathProgramCache]: Analyzing trace with hash -336717750, now seen corresponding path program 1 times [2019-01-12 15:35:45,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:35:45,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:35:45,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:45,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:35:45,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:35:45,878 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 6 [2019-01-12 15:35:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:35:45,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:35:45,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:35:45,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:35:45,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:35:45,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:35:45,898 INFO L87 Difference]: Start difference. First operand 1278 states and 2104 transitions. Second operand 3 states. [2019-01-12 15:35:46,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:35:46,601 INFO L93 Difference]: Finished difference Result 2606 states and 4301 transitions. [2019-01-12 15:35:46,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:35:46,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-12 15:35:46,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:35:46,610 INFO L225 Difference]: With dead ends: 2606 [2019-01-12 15:35:46,610 INFO L226 Difference]: Without dead ends: 1385 [2019-01-12 15:35:46,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:35:46,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2019-01-12 15:35:46,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1378. [2019-01-12 15:35:46,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2019-01-12 15:35:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 2261 transitions. [2019-01-12 15:35:46,676 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 2261 transitions. Word has length 36 [2019-01-12 15:35:46,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:35:46,677 INFO L480 AbstractCegarLoop]: Abstraction has 1378 states and 2261 transitions. [2019-01-12 15:35:46,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:35:46,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 2261 transitions. [2019-01-12 15:35:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 15:35:46,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:35:46,681 INFO L402 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-01-12 15:35:46,681 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:35:46,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:35:46,681 INFO L82 PathProgramCache]: Analyzing trace with hash 952987590, now seen corresponding path program 1 times [2019-01-12 15:35:46,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:35:46,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:35:46,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:46,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:35:46,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:35:46,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:35:46,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:35:46,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 15:35:46,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 15:35:46,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 15:35:46,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 15:35:46,839 INFO L87 Difference]: Start difference. First operand 1378 states and 2261 transitions. Second operand 4 states. [2019-01-12 15:35:47,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:35:47,707 INFO L93 Difference]: Finished difference Result 2888 states and 4749 transitions. [2019-01-12 15:35:47,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 15:35:47,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-01-12 15:35:47,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:35:47,722 INFO L225 Difference]: With dead ends: 2888 [2019-01-12 15:35:47,723 INFO L226 Difference]: Without dead ends: 1544 [2019-01-12 15:35:47,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:35:47,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2019-01-12 15:35:47,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1533. [2019-01-12 15:35:47,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1533 states. [2019-01-12 15:35:47,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2479 transitions. [2019-01-12 15:35:47,825 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2479 transitions. Word has length 36 [2019-01-12 15:35:47,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:35:47,825 INFO L480 AbstractCegarLoop]: Abstraction has 1533 states and 2479 transitions. [2019-01-12 15:35:47,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 15:35:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2479 transitions. [2019-01-12 15:35:47,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 15:35:47,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:35:47,830 INFO L402 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-01-12 15:35:47,830 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:35:47,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:35:47,831 INFO L82 PathProgramCache]: Analyzing trace with hash -635360312, now seen corresponding path program 1 times [2019-01-12 15:35:47,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:35:47,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:35:47,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:47,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:35:47,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:35:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:35:48,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:35:48,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 15:35:48,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 15:35:48,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 15:35:48,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 15:35:48,013 INFO L87 Difference]: Start difference. First operand 1533 states and 2479 transitions. Second operand 4 states. [2019-01-12 15:35:48,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:35:48,939 INFO L93 Difference]: Finished difference Result 3360 states and 5440 transitions. [2019-01-12 15:35:48,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 15:35:48,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-01-12 15:35:48,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:35:48,954 INFO L225 Difference]: With dead ends: 3360 [2019-01-12 15:35:48,954 INFO L226 Difference]: Without dead ends: 1873 [2019-01-12 15:35:48,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:35:48,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2019-01-12 15:35:49,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1849. [2019-01-12 15:35:49,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2019-01-12 15:35:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2951 transitions. [2019-01-12 15:35:49,074 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2951 transitions. Word has length 36 [2019-01-12 15:35:49,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:35:49,074 INFO L480 AbstractCegarLoop]: Abstraction has 1849 states and 2951 transitions. [2019-01-12 15:35:49,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 15:35:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2951 transitions. [2019-01-12 15:35:49,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 15:35:49,076 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:35:49,076 INFO L402 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-01-12 15:35:49,079 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:35:49,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:35:49,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1915223990, now seen corresponding path program 1 times [2019-01-12 15:35:49,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:35:49,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:35:49,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:49,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:35:49,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:35:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:35:49,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:35:49,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:35:49,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:35:49,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:35:49,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:35:49,199 INFO L87 Difference]: Start difference. First operand 1849 states and 2951 transitions. Second operand 3 states. [2019-01-12 15:35:49,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:35:49,651 INFO L93 Difference]: Finished difference Result 3319 states and 5302 transitions. [2019-01-12 15:35:49,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:35:49,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-12 15:35:49,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:35:49,661 INFO L225 Difference]: With dead ends: 3319 [2019-01-12 15:35:49,661 INFO L226 Difference]: Without dead ends: 1498 [2019-01-12 15:35:49,665 INFO L631 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-01-12 15:35:49,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2019-01-12 15:35:49,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1487. [2019-01-12 15:35:49,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1487 states. [2019-01-12 15:35:49,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 2343 transitions. [2019-01-12 15:35:49,738 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 2343 transitions. Word has length 36 [2019-01-12 15:35:49,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:35:49,738 INFO L480 AbstractCegarLoop]: Abstraction has 1487 states and 2343 transitions. [2019-01-12 15:35:49,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:35:49,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 2343 transitions. [2019-01-12 15:35:49,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-12 15:35:49,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:35:49,743 INFO L402 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-01-12 15:35:49,743 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:35:49,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:35:49,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1648654786, now seen corresponding path program 1 times [2019-01-12 15:35:49,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:35:49,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:35:49,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:49,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:35:49,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:35:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:35:49,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:35:49,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:35:49,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:35:49,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:35:49,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:35:49,823 INFO L87 Difference]: Start difference. First operand 1487 states and 2343 transitions. Second operand 3 states. [2019-01-12 15:35:50,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:35:50,153 INFO L93 Difference]: Finished difference Result 3710 states and 5901 transitions. [2019-01-12 15:35:50,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:35:50,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-01-12 15:35:50,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:35:50,168 INFO L225 Difference]: With dead ends: 3710 [2019-01-12 15:35:50,169 INFO L226 Difference]: Without dead ends: 2277 [2019-01-12 15:35:50,173 INFO L631 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-01-12 15:35:50,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2019-01-12 15:35:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 2275. [2019-01-12 15:35:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2275 states. [2019-01-12 15:35:50,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 3579 transitions. [2019-01-12 15:35:50,314 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 3579 transitions. Word has length 46 [2019-01-12 15:35:50,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:35:50,315 INFO L480 AbstractCegarLoop]: Abstraction has 2275 states and 3579 transitions. [2019-01-12 15:35:50,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:35:50,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 3579 transitions. [2019-01-12 15:35:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-12 15:35:50,318 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:35:50,318 INFO L402 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-01-12 15:35:50,319 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:35:50,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:35:50,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1400508292, now seen corresponding path program 1 times [2019-01-12 15:35:50,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:35:50,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:35:50,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:50,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:35:50,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:35:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 15:35:50,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:35:50,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:35:50,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:35:50,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:35:50,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:35:50,397 INFO L87 Difference]: Start difference. First operand 2275 states and 3579 transitions. Second operand 3 states. [2019-01-12 15:35:50,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:35:50,506 INFO L93 Difference]: Finished difference Result 4452 states and 7032 transitions. [2019-01-12 15:35:50,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:35:50,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-01-12 15:35:50,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:35:50,520 INFO L225 Difference]: With dead ends: 4452 [2019-01-12 15:35:50,520 INFO L226 Difference]: Without dead ends: 2231 [2019-01-12 15:35:50,525 INFO L631 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-01-12 15:35:50,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-01-12 15:35:50,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2231. [2019-01-12 15:35:50,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2019-01-12 15:35:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 3522 transitions. [2019-01-12 15:35:50,642 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 3522 transitions. Word has length 46 [2019-01-12 15:35:50,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:35:50,642 INFO L480 AbstractCegarLoop]: Abstraction has 2231 states and 3522 transitions. [2019-01-12 15:35:50,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:35:50,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 3522 transitions. [2019-01-12 15:35:50,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-12 15:35:50,646 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:35:50,646 INFO L402 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-01-12 15:35:50,647 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:35:50,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:35:50,648 INFO L82 PathProgramCache]: Analyzing trace with hash 666181047, now seen corresponding path program 1 times [2019-01-12 15:35:50,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:35:50,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:35:50,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:50,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:35:50,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:35:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:35:50,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:35:50,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:35:50,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:35:50,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:35:50,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:35:50,720 INFO L87 Difference]: Start difference. First operand 2231 states and 3522 transitions. Second operand 3 states. [2019-01-12 15:35:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:35:51,078 INFO L93 Difference]: Finished difference Result 5731 states and 9112 transitions. [2019-01-12 15:35:51,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:35:51,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-01-12 15:35:51,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:35:51,097 INFO L225 Difference]: With dead ends: 5731 [2019-01-12 15:35:51,097 INFO L226 Difference]: Without dead ends: 3554 [2019-01-12 15:35:51,102 INFO L631 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-01-12 15:35:51,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2019-01-12 15:35:51,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3552. [2019-01-12 15:35:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3552 states. [2019-01-12 15:35:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3552 states to 3552 states and 5590 transitions. [2019-01-12 15:35:51,261 INFO L78 Accepts]: Start accepts. Automaton has 3552 states and 5590 transitions. Word has length 47 [2019-01-12 15:35:51,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:35:51,262 INFO L480 AbstractCegarLoop]: Abstraction has 3552 states and 5590 transitions. [2019-01-12 15:35:51,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:35:51,262 INFO L276 IsEmpty]: Start isEmpty. Operand 3552 states and 5590 transitions. [2019-01-12 15:35:51,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-12 15:35:51,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:35:51,269 INFO L402 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-01-12 15:35:51,270 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:35:51,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:35:51,270 INFO L82 PathProgramCache]: Analyzing trace with hash -656218967, now seen corresponding path program 1 times [2019-01-12 15:35:51,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:35:51,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:35:51,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:51,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:35:51,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:35:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:35:51,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:35:51,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:35:51,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:35:51,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:35:51,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:35:51,354 INFO L87 Difference]: Start difference. First operand 3552 states and 5590 transitions. Second operand 3 states. [2019-01-12 15:35:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:35:51,806 INFO L93 Difference]: Finished difference Result 9027 states and 14388 transitions. [2019-01-12 15:35:51,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:35:51,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-01-12 15:35:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:35:51,838 INFO L225 Difference]: With dead ends: 9027 [2019-01-12 15:35:51,838 INFO L226 Difference]: Without dead ends: 5533 [2019-01-12 15:35:51,846 INFO L631 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-01-12 15:35:51,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5533 states. [2019-01-12 15:35:52,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5533 to 5531. [2019-01-12 15:35:52,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5531 states. [2019-01-12 15:35:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5531 states to 5531 states and 8775 transitions. [2019-01-12 15:35:52,096 INFO L78 Accepts]: Start accepts. Automaton has 5531 states and 8775 transitions. Word has length 48 [2019-01-12 15:35:52,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:35:52,096 INFO L480 AbstractCegarLoop]: Abstraction has 5531 states and 8775 transitions. [2019-01-12 15:35:52,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:35:52,096 INFO L276 IsEmpty]: Start isEmpty. Operand 5531 states and 8775 transitions. [2019-01-12 15:35:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-12 15:35:52,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:35:52,103 INFO L402 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-01-12 15:35:52,103 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:35:52,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:35:52,104 INFO L82 PathProgramCache]: Analyzing trace with hash -408072473, now seen corresponding path program 1 times [2019-01-12 15:35:52,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:35:52,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:35:52,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:52,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:35:52,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:35:52,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 15:35:52,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:35:52,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:35:52,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:35:52,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:35:52,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:35:52,174 INFO L87 Difference]: Start difference. First operand 5531 states and 8775 transitions. Second operand 3 states. [2019-01-12 15:35:52,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:35:52,464 INFO L93 Difference]: Finished difference Result 10960 states and 17424 transitions. [2019-01-12 15:35:52,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:35:52,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-01-12 15:35:52,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:35:52,487 INFO L225 Difference]: With dead ends: 10960 [2019-01-12 15:35:52,487 INFO L226 Difference]: Without dead ends: 5487 [2019-01-12 15:35:52,495 INFO L631 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-01-12 15:35:52,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5487 states. [2019-01-12 15:35:52,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5487 to 5487. [2019-01-12 15:35:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5487 states. [2019-01-12 15:35:52,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5487 states to 5487 states and 8720 transitions. [2019-01-12 15:35:52,713 INFO L78 Accepts]: Start accepts. Automaton has 5487 states and 8720 transitions. Word has length 48 [2019-01-12 15:35:52,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:35:52,713 INFO L480 AbstractCegarLoop]: Abstraction has 5487 states and 8720 transitions. [2019-01-12 15:35:52,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:35:52,714 INFO L276 IsEmpty]: Start isEmpty. Operand 5487 states and 8720 transitions. [2019-01-12 15:35:52,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 15:35:52,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:35:52,718 INFO L402 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-01-12 15:35:52,719 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:35:52,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:35:52,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2128148300, now seen corresponding path program 1 times [2019-01-12 15:35:52,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:35:52,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:35:52,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:52,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:35:52,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:35:52,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:35:52,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:35:52,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:35:52,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:35:52,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:35:52,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:35:52,801 INFO L87 Difference]: Start difference. First operand 5487 states and 8720 transitions. Second operand 3 states. [2019-01-12 15:35:53,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:35:53,195 INFO L93 Difference]: Finished difference Result 15505 states and 24580 transitions. [2019-01-12 15:35:53,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:35:53,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-01-12 15:35:53,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:35:53,214 INFO L225 Difference]: With dead ends: 15505 [2019-01-12 15:35:53,215 INFO L226 Difference]: Without dead ends: 8306 [2019-01-12 15:35:53,226 INFO L631 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-01-12 15:35:53,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8306 states. [2019-01-12 15:35:53,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8306 to 8306. [2019-01-12 15:35:53,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8306 states. [2019-01-12 15:35:53,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8306 states to 8306 states and 13014 transitions. [2019-01-12 15:35:53,550 INFO L78 Accepts]: Start accepts. Automaton has 8306 states and 13014 transitions. Word has length 49 [2019-01-12 15:35:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:35:53,550 INFO L480 AbstractCegarLoop]: Abstraction has 8306 states and 13014 transitions. [2019-01-12 15:35:53,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:35:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand 8306 states and 13014 transitions. [2019-01-12 15:35:53,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 15:35:53,557 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:35:53,558 INFO L402 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-01-12 15:35:53,558 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:35:53,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:35:53,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1878430016, now seen corresponding path program 1 times [2019-01-12 15:35:53,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:35:53,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:35:53,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:53,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:35:53,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:35:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:35:53,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:35:53,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:35:53,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:35:53,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:35:53,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:35:53,630 INFO L87 Difference]: Start difference. First operand 8306 states and 13014 transitions. Second operand 3 states. [2019-01-12 15:35:54,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:35:54,002 INFO L93 Difference]: Finished difference Result 17117 states and 26766 transitions. [2019-01-12 15:35:54,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:35:54,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-01-12 15:35:54,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:35:54,023 INFO L225 Difference]: With dead ends: 17117 [2019-01-12 15:35:54,023 INFO L226 Difference]: Without dead ends: 8847 [2019-01-12 15:35:54,034 INFO L631 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-01-12 15:35:54,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8847 states. [2019-01-12 15:35:54,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8847 to 8296. [2019-01-12 15:35:54,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8296 states. [2019-01-12 15:35:54,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8296 states to 8296 states and 12747 transitions. [2019-01-12 15:35:54,359 INFO L78 Accepts]: Start accepts. Automaton has 8296 states and 12747 transitions. Word has length 53 [2019-01-12 15:35:54,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:35:54,359 INFO L480 AbstractCegarLoop]: Abstraction has 8296 states and 12747 transitions. [2019-01-12 15:35:54,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:35:54,359 INFO L276 IsEmpty]: Start isEmpty. Operand 8296 states and 12747 transitions. [2019-01-12 15:35:54,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 15:35:54,365 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:35:54,365 INFO L402 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-01-12 15:35:54,365 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:35:54,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:35:54,366 INFO L82 PathProgramCache]: Analyzing trace with hash -753024327, now seen corresponding path program 1 times [2019-01-12 15:35:54,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:35:54,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:35:54,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:54,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:35:54,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:35:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 15:35:54,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:35:54,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:35:54,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:35:54,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:35:54,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:35:54,423 INFO L87 Difference]: Start difference. First operand 8296 states and 12747 transitions. Second operand 3 states. [2019-01-12 15:35:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:35:54,906 INFO L93 Difference]: Finished difference Result 24576 states and 37848 transitions. [2019-01-12 15:35:54,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:35:54,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-01-12 15:35:54,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:35:54,936 INFO L225 Difference]: With dead ends: 24576 [2019-01-12 15:35:54,936 INFO L226 Difference]: Without dead ends: 16283 [2019-01-12 15:35:54,950 INFO L631 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-01-12 15:35:54,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16283 states. [2019-01-12 15:35:55,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16283 to 16153. [2019-01-12 15:35:55,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16153 states. [2019-01-12 15:35:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16153 states to 16153 states and 24943 transitions. [2019-01-12 15:35:55,911 INFO L78 Accepts]: Start accepts. Automaton has 16153 states and 24943 transitions. Word has length 55 [2019-01-12 15:35:55,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:35:55,911 INFO L480 AbstractCegarLoop]: Abstraction has 16153 states and 24943 transitions. [2019-01-12 15:35:55,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:35:55,911 INFO L276 IsEmpty]: Start isEmpty. Operand 16153 states and 24943 transitions. [2019-01-12 15:35:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-12 15:35:55,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:35:55,919 INFO L402 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-01-12 15:35:55,920 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:35:55,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:35:55,920 INFO L82 PathProgramCache]: Analyzing trace with hash 983251502, now seen corresponding path program 1 times [2019-01-12 15:35:55,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:35:55,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:35:55,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:55,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:35:55,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:35:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:35:55,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:35:55,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:35:55,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:35:55,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:35:55,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:35:55,991 INFO L87 Difference]: Start difference. First operand 16153 states and 24943 transitions. Second operand 3 states. [2019-01-12 15:35:56,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:35:56,596 INFO L93 Difference]: Finished difference Result 32961 states and 50844 transitions. [2019-01-12 15:35:56,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:35:56,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-01-12 15:35:56,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:35:56,625 INFO L225 Difference]: With dead ends: 32961 [2019-01-12 15:35:56,626 INFO L226 Difference]: Without dead ends: 16837 [2019-01-12 15:35:56,647 INFO L631 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-01-12 15:35:56,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16837 states. [2019-01-12 15:35:57,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16837 to 16773. [2019-01-12 15:35:57,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16773 states. [2019-01-12 15:35:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16773 states to 16773 states and 25245 transitions. [2019-01-12 15:35:57,623 INFO L78 Accepts]: Start accepts. Automaton has 16773 states and 25245 transitions. Word has length 86 [2019-01-12 15:35:57,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:35:57,623 INFO L480 AbstractCegarLoop]: Abstraction has 16773 states and 25245 transitions. [2019-01-12 15:35:57,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:35:57,623 INFO L276 IsEmpty]: Start isEmpty. Operand 16773 states and 25245 transitions. [2019-01-12 15:35:57,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-12 15:35:57,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:35:57,630 INFO L402 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-01-12 15:35:57,631 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:35:57,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:35:57,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1499414459, now seen corresponding path program 1 times [2019-01-12 15:35:57,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:35:57,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:35:57,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:57,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:35:57,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:35:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:35:57,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:35:57,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 15:35:57,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 15:35:57,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 15:35:57,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 15:35:57,754 INFO L87 Difference]: Start difference. First operand 16773 states and 25245 transitions. Second operand 4 states. [2019-01-12 15:35:58,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:35:58,398 INFO L93 Difference]: Finished difference Result 27695 states and 41815 transitions. [2019-01-12 15:35:58,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 15:35:58,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-01-12 15:35:58,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:35:58,421 INFO L225 Difference]: With dead ends: 27695 [2019-01-12 15:35:58,422 INFO L226 Difference]: Without dead ends: 15867 [2019-01-12 15:35:58,436 INFO L631 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-01-12 15:35:58,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15867 states. [2019-01-12 15:35:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15867 to 15761. [2019-01-12 15:35:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15761 states. [2019-01-12 15:35:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15761 states to 15761 states and 23539 transitions. [2019-01-12 15:35:59,180 INFO L78 Accepts]: Start accepts. Automaton has 15761 states and 23539 transitions. Word has length 87 [2019-01-12 15:35:59,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:35:59,181 INFO L480 AbstractCegarLoop]: Abstraction has 15761 states and 23539 transitions. [2019-01-12 15:35:59,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 15:35:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 15761 states and 23539 transitions. [2019-01-12 15:35:59,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-12 15:35:59,186 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:35:59,186 INFO L402 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-01-12 15:35:59,186 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:35:59,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:35:59,186 INFO L82 PathProgramCache]: Analyzing trace with hash 129921275, now seen corresponding path program 1 times [2019-01-12 15:35:59,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:35:59,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:35:59,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:59,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:35:59,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:35:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:35:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:35:59,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:35:59,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:35:59,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:35:59,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:35:59,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:35:59,267 INFO L87 Difference]: Start difference. First operand 15761 states and 23539 transitions. Second operand 3 states. [2019-01-12 15:36:00,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:36:00,112 INFO L93 Difference]: Finished difference Result 32291 states and 48176 transitions. [2019-01-12 15:36:00,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:36:00,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-01-12 15:36:00,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:36:00,131 INFO L225 Difference]: With dead ends: 32291 [2019-01-12 15:36:00,131 INFO L226 Difference]: Without dead ends: 16571 [2019-01-12 15:36:00,148 INFO L631 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-01-12 15:36:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16571 states. [2019-01-12 15:36:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16571 to 16491. [2019-01-12 15:36:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16491 states. [2019-01-12 15:36:01,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16491 states to 16491 states and 23911 transitions. [2019-01-12 15:36:01,050 INFO L78 Accepts]: Start accepts. Automaton has 16491 states and 23911 transitions. Word has length 87 [2019-01-12 15:36:01,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:36:01,050 INFO L480 AbstractCegarLoop]: Abstraction has 16491 states and 23911 transitions. [2019-01-12 15:36:01,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:36:01,050 INFO L276 IsEmpty]: Start isEmpty. Operand 16491 states and 23911 transitions. [2019-01-12 15:36:01,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-12 15:36:01,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:36:01,056 INFO L402 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-01-12 15:36:01,057 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:36:01,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:36:01,057 INFO L82 PathProgramCache]: Analyzing trace with hash 793269102, now seen corresponding path program 1 times [2019-01-12 15:36:01,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:36:01,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:36:01,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:01,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:36:01,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:36:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:36:01,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:36:01,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:36:01,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:36:01,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:36:01,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:36:01,141 INFO L87 Difference]: Start difference. First operand 16491 states and 23911 transitions. Second operand 3 states. [2019-01-12 15:36:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:36:01,744 INFO L93 Difference]: Finished difference Result 33398 states and 48544 transitions. [2019-01-12 15:36:01,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:36:01,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-01-12 15:36:01,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:36:01,766 INFO L225 Difference]: With dead ends: 33398 [2019-01-12 15:36:01,766 INFO L226 Difference]: Without dead ends: 16968 [2019-01-12 15:36:01,783 INFO L631 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-01-12 15:36:01,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16968 states. [2019-01-12 15:36:02,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16968 to 13475. [2019-01-12 15:36:02,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13475 states. [2019-01-12 15:36:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13475 states to 13475 states and 18849 transitions. [2019-01-12 15:36:02,774 INFO L78 Accepts]: Start accepts. Automaton has 13475 states and 18849 transitions. Word has length 88 [2019-01-12 15:36:02,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:36:02,775 INFO L480 AbstractCegarLoop]: Abstraction has 13475 states and 18849 transitions. [2019-01-12 15:36:02,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:36:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 13475 states and 18849 transitions. [2019-01-12 15:36:02,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-12 15:36:02,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:36:02,786 INFO L402 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-01-12 15:36:02,786 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:36:02,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:36:02,787 INFO L82 PathProgramCache]: Analyzing trace with hash -831404099, now seen corresponding path program 1 times [2019-01-12 15:36:02,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:36:02,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:36:02,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:02,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:36:02,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:36:02,943 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:36:02,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:36:02,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:36:02,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:36:02,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:36:02,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:36:02,946 INFO L87 Difference]: Start difference. First operand 13475 states and 18849 transitions. Second operand 3 states. [2019-01-12 15:36:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:36:03,561 INFO L93 Difference]: Finished difference Result 23981 states and 33577 transitions. [2019-01-12 15:36:03,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:36:03,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-01-12 15:36:03,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:36:03,578 INFO L225 Difference]: With dead ends: 23981 [2019-01-12 15:36:03,578 INFO L226 Difference]: Without dead ends: 15629 [2019-01-12 15:36:03,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:36:03,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15629 states. [2019-01-12 15:36:04,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15629 to 15149. [2019-01-12 15:36:04,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15149 states. [2019-01-12 15:36:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15149 states to 15149 states and 20704 transitions. [2019-01-12 15:36:04,065 INFO L78 Accepts]: Start accepts. Automaton has 15149 states and 20704 transitions. Word has length 89 [2019-01-12 15:36:04,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:36:04,065 INFO L480 AbstractCegarLoop]: Abstraction has 15149 states and 20704 transitions. [2019-01-12 15:36:04,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:36:04,065 INFO L276 IsEmpty]: Start isEmpty. Operand 15149 states and 20704 transitions. [2019-01-12 15:36:04,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-12 15:36:04,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:36:04,079 INFO L402 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-01-12 15:36:04,080 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:36:04,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:36:04,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1827636855, now seen corresponding path program 1 times [2019-01-12 15:36:04,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:36:04,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:36:04,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:04,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:36:04,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:36:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 15:36:04,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:36:04,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:36:04,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:36:04,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:36:04,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:36:04,157 INFO L87 Difference]: Start difference. First operand 15149 states and 20704 transitions. Second operand 3 states. [2019-01-12 15:36:04,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:36:04,792 INFO L93 Difference]: Finished difference Result 29536 states and 40326 transitions. [2019-01-12 15:36:04,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:36:04,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-01-12 15:36:04,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:36:05,021 INFO L225 Difference]: With dead ends: 29536 [2019-01-12 15:36:05,021 INFO L226 Difference]: Without dead ends: 15079 [2019-01-12 15:36:05,031 INFO L631 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-01-12 15:36:05,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15079 states. [2019-01-12 15:36:05,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15079 to 15079. [2019-01-12 15:36:05,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15079 states. [2019-01-12 15:36:05,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15079 states to 15079 states and 20550 transitions. [2019-01-12 15:36:05,494 INFO L78 Accepts]: Start accepts. Automaton has 15079 states and 20550 transitions. Word has length 116 [2019-01-12 15:36:05,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:36:05,494 INFO L480 AbstractCegarLoop]: Abstraction has 15079 states and 20550 transitions. [2019-01-12 15:36:05,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:36:05,494 INFO L276 IsEmpty]: Start isEmpty. Operand 15079 states and 20550 transitions. [2019-01-12 15:36:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-01-12 15:36:05,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:36:05,508 INFO L402 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-01-12 15:36:05,509 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:36:05,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:36:05,509 INFO L82 PathProgramCache]: Analyzing trace with hash 521223166, now seen corresponding path program 1 times [2019-01-12 15:36:05,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:36:05,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:36:05,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:05,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:36:05,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:36:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-12 15:36:05,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:36:05,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:36:05,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:36:05,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:36:05,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:36:05,556 INFO L87 Difference]: Start difference. First operand 15079 states and 20550 transitions. Second operand 3 states. [2019-01-12 15:36:05,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:36:05,990 INFO L93 Difference]: Finished difference Result 25622 states and 34854 transitions. [2019-01-12 15:36:05,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:36:05,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-01-12 15:36:05,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:36:06,002 INFO L225 Difference]: With dead ends: 25622 [2019-01-12 15:36:06,002 INFO L226 Difference]: Without dead ends: 10600 [2019-01-12 15:36:06,013 INFO L631 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-01-12 15:36:06,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10600 states. [2019-01-12 15:36:06,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10600 to 8632. [2019-01-12 15:36:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8632 states. [2019-01-12 15:36:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8632 states to 8632 states and 11298 transitions. [2019-01-12 15:36:06,348 INFO L78 Accepts]: Start accepts. Automaton has 8632 states and 11298 transitions. Word has length 127 [2019-01-12 15:36:06,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:36:06,348 INFO L480 AbstractCegarLoop]: Abstraction has 8632 states and 11298 transitions. [2019-01-12 15:36:06,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:36:06,348 INFO L276 IsEmpty]: Start isEmpty. Operand 8632 states and 11298 transitions. [2019-01-12 15:36:06,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-12 15:36:06,359 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:36:06,359 INFO L402 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-01-12 15:36:06,359 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:36:06,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:36:06,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1827087367, now seen corresponding path program 1 times [2019-01-12 15:36:06,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:36:06,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:36:06,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:06,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:36:06,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:36:06,432 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 15:36:06,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:36:06,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:36:06,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:36:06,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:36:06,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:36:06,434 INFO L87 Difference]: Start difference. First operand 8632 states and 11298 transitions. Second operand 3 states. [2019-01-12 15:36:06,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:36:06,870 INFO L93 Difference]: Finished difference Result 14223 states and 18615 transitions. [2019-01-12 15:36:06,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:36:06,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-01-12 15:36:06,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:36:06,878 INFO L225 Difference]: With dead ends: 14223 [2019-01-12 15:36:06,878 INFO L226 Difference]: Without dead ends: 6745 [2019-01-12 15:36:06,884 INFO L631 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-01-12 15:36:06,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6745 states. [2019-01-12 15:36:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6745 to 6161. [2019-01-12 15:36:07,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6161 states. [2019-01-12 15:36:07,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6161 states to 6161 states and 7897 transitions. [2019-01-12 15:36:07,181 INFO L78 Accepts]: Start accepts. Automaton has 6161 states and 7897 transitions. Word has length 128 [2019-01-12 15:36:07,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:36:07,181 INFO L480 AbstractCegarLoop]: Abstraction has 6161 states and 7897 transitions. [2019-01-12 15:36:07,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:36:07,182 INFO L276 IsEmpty]: Start isEmpty. Operand 6161 states and 7897 transitions. [2019-01-12 15:36:07,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-01-12 15:36:07,187 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:36:07,187 INFO L402 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-01-12 15:36:07,187 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:36:07,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:36:07,188 INFO L82 PathProgramCache]: Analyzing trace with hash 210660645, now seen corresponding path program 1 times [2019-01-12 15:36:07,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:36:07,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:36:07,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:07,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:36:07,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:36:07,272 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-12 15:36:07,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:36:07,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:36:07,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:36:07,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:36:07,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:36:07,274 INFO L87 Difference]: Start difference. First operand 6161 states and 7897 transitions. Second operand 3 states. [2019-01-12 15:36:07,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:36:07,574 INFO L93 Difference]: Finished difference Result 11935 states and 15282 transitions. [2019-01-12 15:36:07,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:36:07,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-01-12 15:36:07,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:36:07,582 INFO L225 Difference]: With dead ends: 11935 [2019-01-12 15:36:07,582 INFO L226 Difference]: Without dead ends: 6160 [2019-01-12 15:36:07,588 INFO L631 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-01-12 15:36:07,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6160 states. [2019-01-12 15:36:07,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6160 to 6120. [2019-01-12 15:36:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-01-12 15:36:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 7814 transitions. [2019-01-12 15:36:07,838 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 7814 transitions. Word has length 134 [2019-01-12 15:36:07,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:36:07,838 INFO L480 AbstractCegarLoop]: Abstraction has 6120 states and 7814 transitions. [2019-01-12 15:36:07,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:36:07,838 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 7814 transitions. [2019-01-12 15:36:07,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-01-12 15:36:07,842 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:36:07,842 INFO L402 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-01-12 15:36:07,843 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:36:07,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:36:07,843 INFO L82 PathProgramCache]: Analyzing trace with hash 80634053, now seen corresponding path program 1 times [2019-01-12 15:36:07,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:36:07,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:36:07,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:07,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:36:07,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:36:07,922 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-12 15:36:07,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:36:07,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:36:07,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:36:07,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:36:07,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:36:07,924 INFO L87 Difference]: Start difference. First operand 6120 states and 7814 transitions. Second operand 3 states. [2019-01-12 15:36:08,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:36:08,404 INFO L93 Difference]: Finished difference Result 11874 states and 15143 transitions. [2019-01-12 15:36:08,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:36:08,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-01-12 15:36:08,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:36:08,412 INFO L225 Difference]: With dead ends: 11874 [2019-01-12 15:36:08,412 INFO L226 Difference]: Without dead ends: 6130 [2019-01-12 15:36:08,418 INFO L631 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-01-12 15:36:08,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6130 states. [2019-01-12 15:36:08,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6130 to 6090. [2019-01-12 15:36:08,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6090 states. [2019-01-12 15:36:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6090 states to 6090 states and 7743 transitions. [2019-01-12 15:36:08,642 INFO L78 Accepts]: Start accepts. Automaton has 6090 states and 7743 transitions. Word has length 134 [2019-01-12 15:36:08,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:36:08,642 INFO L480 AbstractCegarLoop]: Abstraction has 6090 states and 7743 transitions. [2019-01-12 15:36:08,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:36:08,643 INFO L276 IsEmpty]: Start isEmpty. Operand 6090 states and 7743 transitions. [2019-01-12 15:36:08,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-01-12 15:36:08,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:36:08,647 INFO L402 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-01-12 15:36:08,647 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:36:08,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:36:08,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1507420786, now seen corresponding path program 1 times [2019-01-12 15:36:08,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:36:08,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:36:08,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:08,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:36:08,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:36:08,710 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-12 15:36:08,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:36:08,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:36:08,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:36:08,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:36:08,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:36:08,711 INFO L87 Difference]: Start difference. First operand 6090 states and 7743 transitions. Second operand 3 states. [2019-01-12 15:36:09,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:36:09,040 INFO L93 Difference]: Finished difference Result 10918 states and 13929 transitions. [2019-01-12 15:36:09,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:36:09,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-01-12 15:36:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:36:09,046 INFO L225 Difference]: With dead ends: 10918 [2019-01-12 15:36:09,046 INFO L226 Difference]: Without dead ends: 5200 [2019-01-12 15:36:09,051 INFO L631 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-01-12 15:36:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2019-01-12 15:36:09,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 5198. [2019-01-12 15:36:09,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5198 states. [2019-01-12 15:36:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5198 states to 5198 states and 6467 transitions. [2019-01-12 15:36:09,240 INFO L78 Accepts]: Start accepts. Automaton has 5198 states and 6467 transitions. Word has length 137 [2019-01-12 15:36:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:36:09,241 INFO L480 AbstractCegarLoop]: Abstraction has 5198 states and 6467 transitions. [2019-01-12 15:36:09,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:36:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 5198 states and 6467 transitions. [2019-01-12 15:36:09,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-01-12 15:36:09,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:36:09,244 INFO L402 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-01-12 15:36:09,245 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:36:09,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:36:09,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1526376893, now seen corresponding path program 1 times [2019-01-12 15:36:09,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:36:09,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:36:09,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:09,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:36:09,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:36:09,335 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-12 15:36:09,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:36:09,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:36:09,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:36:09,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:36:09,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:36:09,338 INFO L87 Difference]: Start difference. First operand 5198 states and 6467 transitions. Second operand 3 states. [2019-01-12 15:36:09,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:36:09,883 INFO L93 Difference]: Finished difference Result 9274 states and 11585 transitions. [2019-01-12 15:36:09,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:36:09,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-01-12 15:36:09,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:36:09,892 INFO L225 Difference]: With dead ends: 9274 [2019-01-12 15:36:09,892 INFO L226 Difference]: Without dead ends: 4110 [2019-01-12 15:36:09,898 INFO L631 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-01-12 15:36:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4110 states. [2019-01-12 15:36:10,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4110 to 4092. [2019-01-12 15:36:10,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4092 states. [2019-01-12 15:36:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 5032 transitions. [2019-01-12 15:36:10,203 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 5032 transitions. Word has length 137 [2019-01-12 15:36:10,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:36:10,203 INFO L480 AbstractCegarLoop]: Abstraction has 4092 states and 5032 transitions. [2019-01-12 15:36:10,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:36:10,203 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 5032 transitions. [2019-01-12 15:36:10,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-12 15:36:10,206 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:36:10,207 INFO L402 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-01-12 15:36:10,207 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:36:10,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:36:10,207 INFO L82 PathProgramCache]: Analyzing trace with hash 48056104, now seen corresponding path program 1 times [2019-01-12 15:36:10,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:36:10,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:36:10,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:10,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:36:10,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:36:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-12 15:36:10,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:36:10,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:36:10,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:36:10,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:36:10,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:36:10,283 INFO L87 Difference]: Start difference. First operand 4092 states and 5032 transitions. Second operand 3 states. [2019-01-12 15:36:10,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:36:10,592 INFO L93 Difference]: Finished difference Result 7599 states and 9405 transitions. [2019-01-12 15:36:10,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:36:10,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-01-12 15:36:10,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:36:10,596 INFO L225 Difference]: With dead ends: 7599 [2019-01-12 15:36:10,596 INFO L226 Difference]: Without dead ends: 3783 [2019-01-12 15:36:10,599 INFO L631 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-01-12 15:36:10,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2019-01-12 15:36:10,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3563. [2019-01-12 15:36:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3563 states. [2019-01-12 15:36:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 4341 transitions. [2019-01-12 15:36:10,792 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 4341 transitions. Word has length 170 [2019-01-12 15:36:10,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:36:10,793 INFO L480 AbstractCegarLoop]: Abstraction has 3563 states and 4341 transitions. [2019-01-12 15:36:10,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:36:10,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 4341 transitions. [2019-01-12 15:36:10,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-12 15:36:10,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:36:10,797 INFO L402 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-01-12 15:36:10,797 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:36:10,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:36:10,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1975319017, now seen corresponding path program 1 times [2019-01-12 15:36:10,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:36:10,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:36:10,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:10,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:36:10,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:36:10,898 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-12 15:36:10,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:36:10,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:36:10,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:36:10,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:36:10,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:36:10,899 INFO L87 Difference]: Start difference. First operand 3563 states and 4341 transitions. Second operand 3 states. [2019-01-12 15:36:11,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:36:11,326 INFO L93 Difference]: Finished difference Result 8926 states and 10917 transitions. [2019-01-12 15:36:11,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:36:11,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-01-12 15:36:11,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:36:11,332 INFO L225 Difference]: With dead ends: 8926 [2019-01-12 15:36:11,332 INFO L226 Difference]: Without dead ends: 5639 [2019-01-12 15:36:11,336 INFO L631 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-01-12 15:36:11,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2019-01-12 15:36:11,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5417. [2019-01-12 15:36:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5417 states. [2019-01-12 15:36:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5417 states to 5417 states and 6519 transitions. [2019-01-12 15:36:11,810 INFO L78 Accepts]: Start accepts. Automaton has 5417 states and 6519 transitions. Word has length 177 [2019-01-12 15:36:11,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:36:11,811 INFO L480 AbstractCegarLoop]: Abstraction has 5417 states and 6519 transitions. [2019-01-12 15:36:11,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:36:11,811 INFO L276 IsEmpty]: Start isEmpty. Operand 5417 states and 6519 transitions. [2019-01-12 15:36:11,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-12 15:36:11,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:36:11,820 INFO L402 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-01-12 15:36:11,820 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:36:11,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:36:11,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1080445198, now seen corresponding path program 1 times [2019-01-12 15:36:11,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:36:11,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:36:11,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:11,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:36:11,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:36:11,982 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-12 15:36:11,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:36:11,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 15:36:11,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 15:36:11,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 15:36:11,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 15:36:11,983 INFO L87 Difference]: Start difference. First operand 5417 states and 6519 transitions. Second operand 4 states. [2019-01-12 15:36:12,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:36:12,884 INFO L93 Difference]: Finished difference Result 8455 states and 10154 transitions. [2019-01-12 15:36:12,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:36:12,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-01-12 15:36:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:36:12,891 INFO L225 Difference]: With dead ends: 8455 [2019-01-12 15:36:12,891 INFO L226 Difference]: Without dead ends: 3314 [2019-01-12 15:36:12,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:36:12,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2019-01-12 15:36:13,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 2364. [2019-01-12 15:36:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2364 states. [2019-01-12 15:36:13,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 2795 transitions. [2019-01-12 15:36:13,081 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 2795 transitions. Word has length 180 [2019-01-12 15:36:13,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:36:13,082 INFO L480 AbstractCegarLoop]: Abstraction has 2364 states and 2795 transitions. [2019-01-12 15:36:13,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 15:36:13,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 2795 transitions. [2019-01-12 15:36:13,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-12 15:36:13,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:36:13,087 INFO L402 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-01-12 15:36:13,088 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:36:13,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:36:13,088 INFO L82 PathProgramCache]: Analyzing trace with hash 844703381, now seen corresponding path program 1 times [2019-01-12 15:36:13,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:36:13,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:36:13,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:13,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:36:13,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:36:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 15:36:13,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:36:13,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:36:13,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:36:13,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:36:13,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:36:13,205 INFO L87 Difference]: Start difference. First operand 2364 states and 2795 transitions. Second operand 3 states. [2019-01-12 15:36:13,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:36:13,793 INFO L93 Difference]: Finished difference Result 6276 states and 7453 transitions. [2019-01-12 15:36:13,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:36:13,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-01-12 15:36:13,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:36:13,800 INFO L225 Difference]: With dead ends: 6276 [2019-01-12 15:36:13,801 INFO L226 Difference]: Without dead ends: 3726 [2019-01-12 15:36:13,804 INFO L631 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-01-12 15:36:13,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3726 states. [2019-01-12 15:36:14,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3726 to 3711. [2019-01-12 15:36:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3711 states. [2019-01-12 15:36:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3711 states to 3711 states and 4391 transitions. [2019-01-12 15:36:14,061 INFO L78 Accepts]: Start accepts. Automaton has 3711 states and 4391 transitions. Word has length 184 [2019-01-12 15:36:14,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:36:14,061 INFO L480 AbstractCegarLoop]: Abstraction has 3711 states and 4391 transitions. [2019-01-12 15:36:14,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:36:14,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3711 states and 4391 transitions. [2019-01-12 15:36:14,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-12 15:36:14,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:36:14,066 INFO L402 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-01-12 15:36:14,067 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:36:14,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:36:14,068 INFO L82 PathProgramCache]: Analyzing trace with hash 539882129, now seen corresponding path program 1 times [2019-01-12 15:36:14,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:36:14,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:36:14,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:14,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:36:14,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:36:14,146 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-12 15:36:14,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:36:14,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:36:14,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:36:14,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:36:14,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:36:14,147 INFO L87 Difference]: Start difference. First operand 3711 states and 4391 transitions. Second operand 3 states. [2019-01-12 15:36:14,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:36:14,277 INFO L93 Difference]: Finished difference Result 5004 states and 5865 transitions. [2019-01-12 15:36:14,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:36:14,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-01-12 15:36:14,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:36:14,279 INFO L225 Difference]: With dead ends: 5004 [2019-01-12 15:36:14,279 INFO L226 Difference]: Without dead ends: 1520 [2019-01-12 15:36:14,281 INFO L631 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-01-12 15:36:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2019-01-12 15:36:14,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1520. [2019-01-12 15:36:14,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1520 states. [2019-01-12 15:36:14,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1701 transitions. [2019-01-12 15:36:14,345 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 1701 transitions. Word has length 184 [2019-01-12 15:36:14,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:36:14,346 INFO L480 AbstractCegarLoop]: Abstraction has 1520 states and 1701 transitions. [2019-01-12 15:36:14,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:36:14,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1701 transitions. [2019-01-12 15:36:14,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-01-12 15:36:14,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:36:14,348 INFO L402 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-01-12 15:36:14,348 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:36:14,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:36:14,348 INFO L82 PathProgramCache]: Analyzing trace with hash 391755360, now seen corresponding path program 1 times [2019-01-12 15:36:14,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:36:14,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:36:14,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:14,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:36:14,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:36:14,606 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 15:36:14,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:36:14,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:36:14,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:36:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:36:14,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:36:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 15:36:15,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:36:15,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-12 15:36:15,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 15:36:15,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 15:36:15,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:36:15,134 INFO L87 Difference]: Start difference. First operand 1520 states and 1701 transitions. Second operand 10 states. [2019-01-12 15:36:15,675 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 15:36:16,488 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 15:36:16,866 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 15:36:17,273 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 15:36:17,744 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-12 15:36:18,348 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-12 15:36:19,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:36:19,089 INFO L93 Difference]: Finished difference Result 3342 states and 3749 transitions. [2019-01-12 15:36:19,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 15:36:19,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 185 [2019-01-12 15:36:19,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:36:19,096 INFO L225 Difference]: With dead ends: 3342 [2019-01-12 15:36:19,096 INFO L226 Difference]: Without dead ends: 2500 [2019-01-12 15:36:19,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-01-12 15:36:19,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2019-01-12 15:36:19,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 1882. [2019-01-12 15:36:19,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1882 states. [2019-01-12 15:36:19,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2107 transitions. [2019-01-12 15:36:19,285 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2107 transitions. Word has length 185 [2019-01-12 15:36:19,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:36:19,286 INFO L480 AbstractCegarLoop]: Abstraction has 1882 states and 2107 transitions. [2019-01-12 15:36:19,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 15:36:19,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2107 transitions. [2019-01-12 15:36:19,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-01-12 15:36:19,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:36:19,293 INFO L402 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-01-12 15:36:19,293 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:36:19,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:36:19,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1085364486, now seen corresponding path program 1 times [2019-01-12 15:36:19,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:36:19,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:36:19,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:19,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:36:19,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:36:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 95 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 15:36:19,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:36:19,651 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:36:19,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:36:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:36:19,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:36:19,855 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 95 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 15:36:19,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:36:19,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-12 15:36:19,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 15:36:19,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 15:36:19,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:36:19,876 INFO L87 Difference]: Start difference. First operand 1882 states and 2107 transitions. Second operand 9 states. [2019-01-12 15:36:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:36:21,129 INFO L93 Difference]: Finished difference Result 4238 states and 4750 transitions. [2019-01-12 15:36:21,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 15:36:21,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2019-01-12 15:36:21,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:36:21,134 INFO L225 Difference]: With dead ends: 4238 [2019-01-12 15:36:21,134 INFO L226 Difference]: Without dead ends: 3054 [2019-01-12 15:36:21,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-01-12 15:36:21,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2019-01-12 15:36:21,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 2246. [2019-01-12 15:36:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2019-01-12 15:36:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 2519 transitions. [2019-01-12 15:36:21,350 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 2519 transitions. Word has length 191 [2019-01-12 15:36:21,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:36:21,350 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 2519 transitions. [2019-01-12 15:36:21,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 15:36:21,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 2519 transitions. [2019-01-12 15:36:21,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-01-12 15:36:21,356 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:36:21,357 INFO L402 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-01-12 15:36:21,357 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:36:21,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:36:21,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1360853638, now seen corresponding path program 1 times [2019-01-12 15:36:21,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:36:21,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:36:21,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:21,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:36:21,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:36:21,510 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-01-12 15:36:21,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:36:21,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:36:21,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:36:21,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:36:21,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:36:21,512 INFO L87 Difference]: Start difference. First operand 2246 states and 2519 transitions. Second operand 3 states. [2019-01-12 15:36:21,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:36:21,841 INFO L93 Difference]: Finished difference Result 3370 states and 3780 transitions. [2019-01-12 15:36:21,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:36:21,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 275 [2019-01-12 15:36:21,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:36:21,847 INFO L225 Difference]: With dead ends: 3370 [2019-01-12 15:36:21,847 INFO L226 Difference]: Without dead ends: 1652 [2019-01-12 15:36:21,850 INFO L631 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-01-12 15:36:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2019-01-12 15:36:21,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1582. [2019-01-12 15:36:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2019-01-12 15:36:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1755 transitions. [2019-01-12 15:36:21,992 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1755 transitions. Word has length 275 [2019-01-12 15:36:21,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:36:21,993 INFO L480 AbstractCegarLoop]: Abstraction has 1582 states and 1755 transitions. [2019-01-12 15:36:21,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:36:21,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1755 transitions. [2019-01-12 15:36:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-01-12 15:36:21,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:36:21,998 INFO L402 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-01-12 15:36:21,999 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:36:21,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:36:21,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1393925257, now seen corresponding path program 1 times [2019-01-12 15:36:21,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:36:21,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:36:22,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:22,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:36:22,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:36:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:36:22,108 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-01-12 15:36:22,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:36:22,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:36:22,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:36:22,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:36:22,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:36:22,111 INFO L87 Difference]: Start difference. First operand 1582 states and 1755 transitions. Second operand 3 states. [2019-01-12 15:36:22,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:36:22,308 INFO L93 Difference]: Finished difference Result 2334 states and 2579 transitions. [2019-01-12 15:36:22,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:36:22,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2019-01-12 15:36:22,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:36:22,310 INFO L225 Difference]: With dead ends: 2334 [2019-01-12 15:36:22,310 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 15:36:22,314 INFO L631 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-01-12 15:36:22,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 15:36:22,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 15:36:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 15:36:22,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 15:36:22,315 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281 [2019-01-12 15:36:22,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:36:22,317 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 15:36:22,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:36:22,317 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 15:36:22,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 15:36:22,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 15:36:22,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:22,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:22,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:22,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:22,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:22,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:22,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:22,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:22,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:22,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:22,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:22,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:22,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:22,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:22,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:22,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:22,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:22,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:22,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,355 WARN L181 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 452 DAG size of output: 226 [2019-01-12 15:36:23,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,608 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 144 [2019-01-12 15:36:23,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:23,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,310 WARN L181 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 395 DAG size of output: 191 [2019-01-12 15:36:24,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,558 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 109 [2019-01-12 15:36:24,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:24,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,280 WARN L181 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 448 DAG size of output: 225 [2019-01-12 15:36:25,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,613 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 192 [2019-01-12 15:36:25,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:25,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,219 WARN L181 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 468 DAG size of output: 231 [2019-01-12 15:36:26,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,398 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 309 DAG size of output: 190 [2019-01-12 15:36:26,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:36:26,953 WARN L181 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 448 DAG size of output: 225 [2019-01-12 15:36:27,348 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 216 [2019-01-12 15:36:34,682 WARN L181 SmtUtils]: Spent 7.32 s on a formula simplification. DAG size of input: 190 DAG size of output: 150 [2019-01-12 15:36:35,676 WARN L181 SmtUtils]: Spent 990.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-01-12 15:36:37,587 WARN L181 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 133 DAG size of output: 100 [2019-01-12 15:36:38,851 WARN L181 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 98 DAG size of output: 93 [2019-01-12 15:36:44,377 WARN L181 SmtUtils]: Spent 5.52 s on a formula simplification. DAG size of input: 162 DAG size of output: 140 [2019-01-12 15:36:45,034 WARN L181 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-01-12 15:36:45,806 WARN L181 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 78 [2019-01-12 15:36:47,656 WARN L181 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2019-01-12 15:36:54,086 WARN L181 SmtUtils]: Spent 6.43 s on a formula simplification. DAG size of input: 189 DAG size of output: 149 [2019-01-12 15:36:55,038 WARN L181 SmtUtils]: Spent 947.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-01-12 15:36:58,844 WARN L181 SmtUtils]: Spent 3.80 s on a formula simplification. DAG size of input: 159 DAG size of output: 110 [2019-01-12 15:36:59,609 WARN L181 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 78 [2019-01-12 15:37:06,656 WARN L181 SmtUtils]: Spent 7.04 s on a formula simplification. DAG size of input: 194 DAG size of output: 150 [2019-01-12 15:37:06,876 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-01-12 15:37:09,771 WARN L181 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 165 DAG size of output: 124 [2019-01-12 15:37:10,687 WARN L181 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-01-12 15:37:17,022 WARN L181 SmtUtils]: Spent 6.33 s on a formula simplification. DAG size of input: 189 DAG size of output: 149 [2019-01-12 15:37:19,078 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 215 DAG size of output: 90 [2019-01-12 15:37:19,083 INFO L448 ceAbstractionStarter]: For program point L663(lines 663 671) no Hoare annotation was computed. [2019-01-12 15:37:19,084 INFO L448 ceAbstractionStarter]: For program point L597(lines 535 675) no Hoare annotation was computed. [2019-01-12 15:37:19,084 INFO L448 ceAbstractionStarter]: For program point L564-1(lines 535 675) no Hoare annotation was computed. [2019-01-12 15:37:19,084 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 404) no Hoare annotation was computed. [2019-01-12 15:37:19,084 INFO L448 ceAbstractionStarter]: For program point L399-2(lines 399 404) no Hoare annotation was computed. [2019-01-12 15:37:19,085 INFO L444 ceAbstractionStarter]: At program point L135(lines 130 170) the Hoare annotation is: (let ((.cse26 (+ ~t_b~0 1))) (let ((.cse21 (<= .cse26 ~data~0)) (.cse25 (<= ~data~0 .cse26)) (.cse20 (= ~wb_st~0 0)) (.cse1 (not (= ~e_f~0 1))) (.cse5 (= ~wl_pc~0 1)) (.cse7 (<= 2 ~c2_st~0)) (.cse14 (not (= 0 ~e_f~0))) (.cse0 (= ~c2_pc~0 1)) (.cse27 (= ~c2_st~0 0)) (.cse23 (= ~processed~0 0)) (.cse24 (= ~wl_st~0 ~e_f~0)) (.cse8 (<= 2 ~wb_st~0)) (.cse15 (= ~c1_pc~0 1)) (.cse22 (= ~wl_pc~0 2)) (.cse4 (= ~wb_pc~0 1)) (.cse9 (<= 2 ~r_st~0)) (.cse2 (= ~wb_i~0 1)) (.cse3 (<= 2 ~wl_st~0)) (.cse6 (= 1 ~c2_i~0)) (.cse10 (not (= 0 ~e_g~0))) (.cse11 (= 1 ~c1_i~0)) (.cse12 (not (= 0 ~e_e~0))) (.cse13 (<= 2 ~e_wl~0)) (.cse16 (not (= ~e_e~0 1))) (.cse17 (not (= ~e_g~0 1))) (.cse18 (not (= 0 ~e_c~0))) (.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) (and .cse0 .cse20 .cse21 .cse22 .cse2 .cse23 .cse3 .cse4 .cse6 .cse24 .cse7 .cse25 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 (<= .cse26 ~c_t~0) .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse15 (= ~c_req_up~0 1) .cse17 .cse19 .cse21 .cse22 .cse4 .cse25 .cse9 .cse10 .cse11 .cse12 (<= ~c_t~0 .cse26) .cse16 .cse18) (and .cse0 .cse1 .cse27 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse20 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse27 .cse2 .cse23 .cse3 .cse24 (<= ~t_b~0 ~data~0) .cse6 (<= ~data~0 ~t_b~0) .cse8 (<= ~data~0 ULTIMATE.start_write_loop_~t~0) (<= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse15 .cse17 .cse19 .cse22 .cse4 .cse9 .cse10 .cse11 .cse12 .cse16 .cse18) (and .cse2 .cse3 (= ~e_wl~0 ~e_f~0) .cse6 .cse10 .cse11 .cse12 .cse13 (= ~wl_pc~0 0) .cse16 .cse17 .cse18 .cse19)))) [2019-01-12 15:37:19,086 INFO L444 ceAbstractionStarter]: At program point L69(lines 55 125) the Hoare annotation is: (let ((.cse4 (= ~c2_st~0 0)) (.cse0 (= ~c2_pc~0 0)) (.cse22 (= ~e_c~0 ~e_f~0)) (.cse25 (= ~e_c~0 ~e_g~0)) (.cse17 (not (= 0 ~e_c~0))) (.cse13 (= ~c1_pc~0 1)) (.cse21 (<= 2 ~c1_st~0)) (.cse26 (= ~wb_st~0 0)) (.cse27 (= ~wb_pc~0 0)) (.cse29 (= ~c2_pc~0 1)) (.cse5 (= ~wb_i~0 1)) (.cse6 (= ~wb_pc~0 1)) (.cse7 (= 1 ~c2_i~0)) (.cse8 (<= 2 ~wb_st~0)) (.cse9 (<= 2 ~r_st~0)) (.cse10 (not (= 0 ~e_g~0))) (.cse11 (= 1 ~c1_i~0)) (.cse24 (= ~c1_st~0 0)) (.cse12 (<= ~c_req_up~0 0)) (.cse14 (not (= ~e_e~0 1))) (.cse15 (= ~e_f~0 ~e_e~0)) (.cse16 (<= ~r_i~0 0)) (.cse18 (not (= ~e_g~0 1))) (.cse19 (= ~e_f~0 ~e_c~0)) (.cse1 (= ~processed~0 0)) (.cse2 (<= 2 ~e_wl~0)) (.cse28 (not (= 0 ~e_f~0))) (.cse3 (<= ~t_b~0 ~data~0)) (.cse23 (= ~c1_pc~0 0)) (.cse30 (<= 2 ~c2_st~0)) (.cse20 (<= ~data~0 ~t_b~0))) (or (and .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse20 .cse21) (and .cse4 .cse5 .cse1 .cse3 .cse7 .cse20 .cse8 .cse0 .cse2 .cse15 .cse16 .cse22 .cse6 .cse23 .cse9 .cse11 .cse24 .cse25 .cse12 .cse14 .cse17) (and (and .cse26 .cse4 .cse27 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19) .cse0 .cse1 .cse2 .cse28 .cse3 .cse20 .cse21) (and (and .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19) .cse1 .cse2 .cse28 .cse3 .cse30 .cse20 .cse21) (and .cse26 .cse4 .cse5 .cse1 .cse3 .cse7 .cse20 .cse0 .cse2 .cse15 .cse16 .cse22 .cse27 .cse23 .cse9 .cse11 .cse24 .cse25 .cse12 .cse14 .cse17) (and (and .cse29 .cse26 .cse27 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19) .cse1 .cse2 .cse28 .cse3 .cse30 .cse20 .cse21) (and (and .cse29 .cse26 .cse27 .cse5 .cse7 .cse9 .cse10 .cse11 .cse24 .cse12 .cse14 .cse15 .cse16 .cse18 .cse19) .cse1 .cse2 .cse28 .cse3 .cse23 .cse30 .cse20) (and (and .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse14 .cse15 .cse16 .cse18 .cse19) .cse1 .cse2 .cse28 .cse3 .cse23 .cse30 .cse20))) [2019-01-12 15:37:19,086 INFO L448 ceAbstractionStarter]: For program point L598(lines 598 602) no Hoare annotation was computed. [2019-01-12 15:37:19,086 INFO L444 ceAbstractionStarter]: At program point L466(lines 459 476) the Hoare annotation is: (let ((.cse0 (= ~wb_st~0 0)) (.cse1 (= ~c2_st~0 0)) (.cse2 (= ~wb_i~0 1)) (.cse3 (= 1 ~c2_i~0)) (.cse8 (= 1 ~c1_i~0)) (.cse9 (= ~c1_st~0 0)) (.cse4 (<= 2 ~e_wl~0)) (.cse5 (= ~wl_pc~0 0)) (.cse6 (= ~e_f~0 ~e_e~0)) (.cse7 (<= ~r_i~0 0))) (or (and .cse0 .cse1 .cse2 (= ~processed~0 0) (<= ~t_b~0 ~data~0) .cse3 (= ~wl_st~0 0) (<= ~data~0 ~t_b~0) (= ~c2_pc~0 0) .cse4 .cse5 .cse6 .cse7 (= ~e_c~0 ~e_f~0) (= ~wb_pc~0 0) (= ~c1_pc~0 0) (<= 2 ~r_st~0) .cse8 .cse9 (= ~e_c~0 ~e_g~0) (<= ~c_req_up~0 0) (= ~e_wl~0 ~e_c~0)) (and .cse0 .cse1 .cse2 (<= 2 ~wl_st~0) (= ~e_wl~0 ~e_f~0) .cse3 (= ~e_f~0 ~e_g~0) .cse8 .cse9 .cse4 .cse5 .cse6 (not (= 0 ~e_c~0)) .cse7))) [2019-01-12 15:37:19,087 INFO L448 ceAbstractionStarter]: For program point L467(lines 396 680) no Hoare annotation was computed. [2019-01-12 15:37:19,087 INFO L448 ceAbstractionStarter]: For program point L434-1(lines 396 680) no Hoare annotation was computed. [2019-01-12 15:37:19,087 INFO L448 ceAbstractionStarter]: For program point L302(lines 302 306) no Hoare annotation was computed. [2019-01-12 15:37:19,087 INFO L448 ceAbstractionStarter]: For program point L302-1(lines 288 386) no Hoare annotation was computed. [2019-01-12 15:37:19,087 INFO L448 ceAbstractionStarter]: For program point L666(lines 666 670) no Hoare annotation was computed. [2019-01-12 15:37:19,087 INFO L448 ceAbstractionStarter]: For program point L666-1(lines 396 680) no Hoare annotation was computed. [2019-01-12 15:37:19,087 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 472) no Hoare annotation was computed. [2019-01-12 15:37:19,087 INFO L448 ceAbstractionStarter]: For program point L634-1(lines 535 675) no Hoare annotation was computed. [2019-01-12 15:37:19,087 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-01-12 15:37:19,087 INFO L448 ceAbstractionStarter]: For program point L569-1(lines 535 675) no Hoare annotation was computed. [2019-01-12 15:37:19,089 INFO L444 ceAbstractionStarter]: At program point L371(lines 288 386) the Hoare annotation is: (let ((.cse42 (+ ~t_b~0 2)) (.cse50 (+ ~t_b~0 1)) (.cse49 (= ~wl_pc~0 1)) (.cse33 (= ~e_f~0 ~e_e~0)) (.cse34 (= ~e_c~0 ~e_f~0)) (.cse3 (= ~c2_pc~0 1)) (.cse28 (= ~processed~0 0)) (.cse6 (= ~wb_i~0 1)) (.cse18 (= ~wb_pc~0 1)) (.cse7 (<= 2 ~wl_st~0)) (.cse8 (= ~wl_st~0 ~e_f~0)) (.cse9 (= 1 ~c2_i~0)) (.cse55 (= ~e_c~0 ~e_e~0)) (.cse30 (<= 2 ~c2_st~0)) (.cse10 (<= 2 ~c1_st~0)) (.cse11 (<= 2 ~wb_st~0)) (.cse20 (<= 2 ~r_st~0)) (.cse21 (not (= 0 ~e_g~0))) (.cse22 (= 1 ~c1_i~0)) (.cse38 (<= ~c_req_up~0 0)) (.cse12 (= ~c1_pc~0 1)) (.cse25 (not (= ~e_e~0 1))) (.cse14 (not (= ~e_g~0 1))) (.cse26 (not (= 0 ~e_c~0))) (.cse15 (<= ~r_i~0 0))) (let ((.cse13 (= ~c_req_up~0 1)) (.cse1 (or (and .cse3 .cse28 .cse6 .cse7 .cse49 .cse9 .cse30 .cse10 .cse11 .cse12 .cse33 .cse14 .cse15 .cse34 .cse18 .cse20 .cse21 .cse22 .cse38 .cse25 .cse26) (and .cse3 .cse28 .cse6 .cse18 .cse7 .cse8 .cse9 .cse55 .cse30 .cse10 .cse11 .cse20 .cse21 .cse22 .cse38 .cse12 .cse25 .cse14 .cse26 .cse15))) (.cse5 (<= .cse50 ~c_t~0)) (.cse51 (<= .cse50 ~c~0)) (.cse24 (<= ~c_t~0 .cse50)) (.cse52 (<= ~c~0 .cse50)) (.cse41 (not (= ~e_f~0 1))) (.cse44 (not (= 0 ~e_f~0))) (.cse40 (<= .cse42 ~c_t~0)) (.cse43 (<= .cse42 ~c~0)) (.cse45 (<= .cse42 ~data~0)) (.cse46 (<= ~data~0 .cse42)) (.cse47 (<= ~c_t~0 .cse42)) (.cse48 (<= ~c~0 .cse42)) (.cse16 (<= .cse50 ~data~0)) (.cse17 (= ~wl_pc~0 2)) (.cse19 (<= ~data~0 .cse50)) (.cse23 (not (= 0 ~e_e~0))) (.cse27 (= ~wb_st~0 0)) (.cse4 (= ~c2_st~0 0)) (.cse0 (<= ~t_b~0 ~data~0)) (.cse29 (= ~wl_st~0 0)) (.cse2 (<= ~data~0 ~t_b~0)) (.cse53 (= ~c2_pc~0 0)) (.cse31 (<= 2 ~e_wl~0)) (.cse32 (= ~wl_pc~0 0)) (.cse35 (= ~wb_pc~0 0)) (.cse36 (= ~c1_pc~0 0)) (.cse37 (= ~c1_st~0 0)) (.cse54 (= ~e_c~0 ~e_g~0)) (.cse39 (= ~e_wl~0 ~e_c~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse3 .cse27 .cse6 .cse28 .cse9 .cse0 .cse29 .cse30 .cse2 .cse31 .cse32 .cse33 .cse14 .cse15 .cse34 .cse35 .cse36 .cse20 .cse21 .cse22 .cse37 .cse38 .cse39) (and .cse40 .cse3 .cse41 .cse6 (<= .cse42 ~d~0) .cse43 .cse9 .cse29 .cse30 .cse10 .cse11 .cse44 .cse12 .cse14 .cse15 (<= ~d~0 .cse42) .cse17 .cse18 .cse45 .cse46 .cse20 .cse21 .cse47 .cse22 .cse23 .cse48 .cse38 .cse25 .cse26) (and .cse3 .cse27 .cse41 .cse6 .cse28 .cse7 .cse18 .cse49 .cse9 .cse30 .cse10 .cse20 .cse21 .cse22 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse40 .cse3 .cse6 .cse7 .cse8 .cse9 .cse30 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse45 .cse46 .cse20 .cse21 .cse47 .cse22 .cse23 .cse25 .cse26) (and .cse17 .cse1) (and (<= ~d~0 .cse50) (<= .cse50 ~d~0) .cse5 (or (and .cse3 .cse41 .cse16 .cse17 .cse6 .cse18 .cse9 .cse29 .cse30 .cse10 .cse19 .cse11 .cse20 .cse21 .cse22 .cse23 .cse44 .cse38 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse41 .cse17 .cse6 .cse18 .cse9 .cse29 .cse30 .cse10 .cse45 .cse11 .cse46 .cse20 .cse21 .cse22 .cse23 .cse44 .cse38 .cse12 .cse25 .cse14 .cse26 .cse15)) .cse51 .cse24 .cse52) (and .cse3 .cse4 .cse6 .cse28 .cse7 .cse8 .cse0 .cse9 .cse2 .cse11 (<= ~data~0 ULTIMATE.start_write_loop_~t~0) (<= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse12 .cse14 .cse15 .cse17 .cse18 .cse20 .cse21 .cse22 .cse37 .cse23 .cse25 .cse26) (and .cse27 .cse4 .cse6 .cse28 .cse7 .cse49 .cse0 .cse9 .cse2 .cse53 .cse33 .cse15 .cse34 .cse35 .cse36 .cse20 .cse22 .cse37 .cse54 .cse38 .cse25 .cse26) (and .cse3 .cse41 .cse4 .cse6 .cse28 .cse7 .cse18 .cse49 .cse9 .cse11 .cse20 .cse21 .cse22 .cse37 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse5 .cse24 (or (and .cse3 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse30 .cse10 .cse45 .cse11 .cse46 .cse20 .cse21 .cse22 .cse23 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse16 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse30 .cse10 .cse19 .cse11 .cse20 .cse21 .cse22 .cse23 .cse12 .cse25 .cse14 .cse26 .cse15)) .cse13) (and .cse3 .cse41 .cse6 .cse18 .cse49 .cse9 .cse0 .cse29 .cse55 .cse30 .cse10 .cse2 .cse11 .cse20 .cse21 .cse22 .cse38 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse27 .cse6 .cse28 .cse9 .cse0 .cse29 .cse30 .cse2 .cse10 .cse31 .cse12 .cse32 .cse33 .cse14 .cse15 .cse34 .cse35 .cse20 .cse21 .cse22 .cse38 .cse39) (and .cse3 .cse27 .cse16 .cse17 .cse6 .cse28 .cse7 .cse18 .cse9 .cse8 .cse30 .cse19 .cse20 .cse21 .cse22 .cse37 .cse23 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse27 .cse4 .cse28 .cse6 .cse7 .cse49 .cse0 .cse9 .cse2 .cse10 .cse53 .cse12 .cse33 .cse14 .cse15 .cse34 .cse35 .cse20 .cse21 .cse22 .cse38 .cse25 .cse26) (and .cse3 .cse6 .cse28 .cse9 .cse0 .cse29 .cse30 .cse2 .cse10 .cse11 .cse31 .cse12 .cse32 .cse33 .cse14 .cse15 .cse34 .cse18 .cse20 .cse21 .cse22 .cse38 .cse39) (and .cse3 .cse27 .cse28 .cse6 .cse7 .cse49 .cse0 .cse9 .cse30 .cse2 .cse33 .cse14 .cse15 .cse34 .cse35 .cse36 .cse20 .cse21 .cse22 .cse37 .cse38 .cse25 .cse26) (and .cse3 .cse41 .cse6 .cse7 .cse18 .cse49 .cse9 .cse30 .cse11 .cse20 .cse21 .cse22 .cse37 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse41 .cse4 .cse6 .cse7 .cse18 .cse49 .cse9 .cse10 .cse11 .cse20 .cse21 .cse22 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse27 .cse41 .cse4 .cse28 .cse6 .cse49 .cse7 .cse18 .cse9 .cse10 .cse20 .cse21 .cse22 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse30 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse37 .cse23 .cse24 .cse25 .cse26) (and .cse4 .cse6 .cse28 .cse9 .cse0 .cse29 .cse2 .cse10 .cse11 .cse53 .cse31 .cse12 .cse32 .cse33 .cse14 .cse15 .cse34 .cse18 .cse20 .cse21 .cse22 .cse38 .cse39) (and .cse31 .cse1) (and .cse6 .cse7 (= ~e_wl~0 ~e_f~0) .cse9 .cse21 .cse22 .cse23 .cse31 .cse32 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse27 .cse28 .cse6 .cse7 .cse49 .cse9 .cse0 .cse30 .cse2 .cse10 .cse12 .cse33 .cse14 .cse15 .cse34 .cse35 .cse20 .cse21 .cse22 .cse38 .cse25 .cse26) (and .cse3 .cse27 .cse17 .cse6 .cse28 .cse7 .cse18 .cse9 .cse8 .cse30 .cse10 .cse45 .cse20 .cse21 .cse46 .cse22 .cse23 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse27 .cse41 .cse6 .cse28 .cse7 .cse18 .cse49 .cse9 .cse30 .cse20 .cse21 .cse22 .cse37 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse4 .cse6 .cse28 .cse0 .cse9 .cse29 .cse2 .cse11 .cse53 .cse31 .cse32 .cse33 .cse15 .cse34 .cse18 .cse36 .cse20 .cse22 .cse37 .cse54 .cse38 .cse39) (and .cse27 .cse4 .cse6 .cse28 .cse9 .cse0 .cse29 .cse2 .cse10 .cse53 .cse31 .cse12 .cse32 .cse33 .cse14 .cse15 .cse34 .cse35 .cse20 .cse21 .cse22 .cse38 .cse39) (and .cse4 .cse6 .cse28 .cse7 .cse49 .cse9 .cse0 .cse2 .cse10 .cse11 .cse53 .cse12 .cse33 .cse14 .cse15 .cse34 .cse18 .cse20 .cse21 .cse22 .cse38 .cse25 .cse26) (and .cse5 .cse51 .cse24 (or (and .cse3 .cse16 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse30 .cse10 .cse19 .cse11 .cse21 .cse22 .cse23 .cse38 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse30 .cse10 .cse45 .cse11 .cse46 .cse21 .cse22 .cse23 .cse38 .cse12 .cse25 .cse14 .cse26 .cse15)) .cse52) (and .cse3 .cse41 .cse6 .cse7 .cse18 .cse49 .cse9 .cse30 .cse10 .cse11 .cse21 .cse22 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse40 .cse3 .cse6 .cse7 .cse8 .cse9 .cse43 .cse30 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse45 .cse46 .cse21 .cse47 .cse22 .cse23 .cse48 .cse38 .cse25 .cse26) (and .cse4 .cse6 .cse28 .cse7 .cse49 .cse0 .cse9 .cse2 .cse11 .cse53 .cse33 .cse15 .cse34 .cse18 .cse36 .cse20 .cse22 .cse37 .cse54 .cse38 .cse25 .cse26) (and .cse3 .cse28 .cse6 .cse7 .cse49 .cse0 .cse9 .cse30 .cse2 .cse11 .cse33 .cse14 .cse15 .cse34 .cse18 .cse36 .cse20 .cse21 .cse22 .cse37 .cse38 .cse25 .cse26) (and .cse3 .cse27 .cse4 .cse16 .cse17 .cse28 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse19 .cse20 .cse21 .cse22 .cse23 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse6 .cse28 .cse9 .cse0 .cse29 .cse30 .cse2 .cse11 .cse31 .cse32 .cse33 .cse14 .cse15 .cse34 .cse18 .cse36 .cse20 .cse21 .cse22 .cse37 .cse38 .cse39) (and .cse27 .cse4 .cse6 .cse28 .cse0 .cse9 .cse29 .cse2 .cse53 .cse31 .cse32 .cse33 .cse15 .cse34 .cse35 .cse36 .cse20 .cse22 .cse37 .cse54 .cse38 .cse39)))) [2019-01-12 15:37:19,089 INFO L448 ceAbstractionStarter]: For program point L504-1(lines 396 680) no Hoare annotation was computed. [2019-01-12 15:37:19,089 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 396 680) no Hoare annotation was computed. [2019-01-12 15:37:19,089 INFO L448 ceAbstractionStarter]: For program point L109(lines 109 119) no Hoare annotation was computed. [2019-01-12 15:37:19,090 INFO L444 ceAbstractionStarter]: At program point L341(lines 288 386) the Hoare annotation is: (let ((.cse42 (+ ~t_b~0 2)) (.cse50 (+ ~t_b~0 1)) (.cse49 (= ~wl_pc~0 1)) (.cse33 (= ~e_f~0 ~e_e~0)) (.cse34 (= ~e_c~0 ~e_f~0)) (.cse3 (= ~c2_pc~0 1)) (.cse28 (= ~processed~0 0)) (.cse6 (= ~wb_i~0 1)) (.cse18 (= ~wb_pc~0 1)) (.cse7 (<= 2 ~wl_st~0)) (.cse8 (= ~wl_st~0 ~e_f~0)) (.cse9 (= 1 ~c2_i~0)) (.cse55 (= ~e_c~0 ~e_e~0)) (.cse30 (<= 2 ~c2_st~0)) (.cse10 (<= 2 ~c1_st~0)) (.cse11 (<= 2 ~wb_st~0)) (.cse20 (<= 2 ~r_st~0)) (.cse21 (not (= 0 ~e_g~0))) (.cse22 (= 1 ~c1_i~0)) (.cse38 (<= ~c_req_up~0 0)) (.cse12 (= ~c1_pc~0 1)) (.cse25 (not (= ~e_e~0 1))) (.cse14 (not (= ~e_g~0 1))) (.cse26 (not (= 0 ~e_c~0))) (.cse15 (<= ~r_i~0 0))) (let ((.cse13 (= ~c_req_up~0 1)) (.cse1 (or (and .cse3 .cse28 .cse6 .cse7 .cse49 .cse9 .cse30 .cse10 .cse11 .cse12 .cse33 .cse14 .cse15 .cse34 .cse18 .cse20 .cse21 .cse22 .cse38 .cse25 .cse26) (and .cse3 .cse28 .cse6 .cse18 .cse7 .cse8 .cse9 .cse55 .cse30 .cse10 .cse11 .cse20 .cse21 .cse22 .cse38 .cse12 .cse25 .cse14 .cse26 .cse15))) (.cse5 (<= .cse50 ~c_t~0)) (.cse51 (<= .cse50 ~c~0)) (.cse24 (<= ~c_t~0 .cse50)) (.cse52 (<= ~c~0 .cse50)) (.cse41 (not (= ~e_f~0 1))) (.cse44 (not (= 0 ~e_f~0))) (.cse40 (<= .cse42 ~c_t~0)) (.cse43 (<= .cse42 ~c~0)) (.cse45 (<= .cse42 ~data~0)) (.cse46 (<= ~data~0 .cse42)) (.cse47 (<= ~c_t~0 .cse42)) (.cse48 (<= ~c~0 .cse42)) (.cse16 (<= .cse50 ~data~0)) (.cse17 (= ~wl_pc~0 2)) (.cse19 (<= ~data~0 .cse50)) (.cse23 (not (= 0 ~e_e~0))) (.cse27 (= ~wb_st~0 0)) (.cse4 (= ~c2_st~0 0)) (.cse0 (<= ~t_b~0 ~data~0)) (.cse29 (= ~wl_st~0 0)) (.cse2 (<= ~data~0 ~t_b~0)) (.cse53 (= ~c2_pc~0 0)) (.cse31 (<= 2 ~e_wl~0)) (.cse32 (= ~wl_pc~0 0)) (.cse35 (= ~wb_pc~0 0)) (.cse36 (= ~c1_pc~0 0)) (.cse37 (= ~c1_st~0 0)) (.cse54 (= ~e_c~0 ~e_g~0)) (.cse39 (= ~e_wl~0 ~e_c~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse3 .cse27 .cse6 .cse28 .cse9 .cse0 .cse29 .cse30 .cse2 .cse31 .cse32 .cse33 .cse14 .cse15 .cse34 .cse35 .cse36 .cse20 .cse21 .cse22 .cse37 .cse38 .cse39) (and .cse40 .cse3 .cse41 .cse6 (<= .cse42 ~d~0) .cse43 .cse9 .cse29 .cse30 .cse10 .cse11 .cse44 .cse12 .cse14 .cse15 (<= ~d~0 .cse42) .cse17 .cse18 .cse45 .cse46 .cse20 .cse21 .cse47 .cse22 .cse23 .cse48 .cse38 .cse25 .cse26) (and .cse3 .cse27 .cse41 .cse6 .cse28 .cse7 .cse18 .cse49 .cse9 .cse30 .cse10 .cse20 .cse21 .cse22 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse17 .cse1) (and (<= ~d~0 .cse50) (<= .cse50 ~d~0) .cse5 (or (and .cse3 .cse41 .cse16 .cse17 .cse6 .cse18 .cse9 .cse29 .cse30 .cse10 .cse19 .cse11 .cse20 .cse21 .cse22 .cse23 .cse44 .cse38 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse41 .cse17 .cse6 .cse18 .cse9 .cse29 .cse30 .cse10 .cse45 .cse11 .cse46 .cse20 .cse21 .cse22 .cse23 .cse44 .cse38 .cse12 .cse25 .cse14 .cse26 .cse15)) .cse51 .cse24 .cse52) (and .cse3 .cse4 .cse6 .cse28 .cse7 .cse8 .cse0 .cse9 .cse2 .cse11 (<= ~data~0 ULTIMATE.start_write_loop_~t~0) (<= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse12 .cse14 .cse15 .cse17 .cse18 .cse20 .cse21 .cse22 .cse37 .cse23 .cse25 .cse26) (and .cse27 .cse4 .cse6 .cse28 .cse7 .cse49 .cse0 .cse9 .cse2 .cse53 .cse33 .cse15 .cse34 .cse35 .cse36 .cse20 .cse22 .cse37 .cse54 .cse38 .cse25 .cse26) (and .cse3 .cse41 .cse4 .cse6 .cse28 .cse7 .cse18 .cse49 .cse9 .cse11 .cse20 .cse21 .cse22 .cse37 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse5 .cse24 (or (and .cse3 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse30 .cse10 .cse45 .cse11 .cse46 .cse20 .cse21 .cse22 .cse23 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse16 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse30 .cse10 .cse19 .cse11 .cse20 .cse21 .cse22 .cse23 .cse12 .cse25 .cse14 .cse26 .cse15)) .cse13) (and .cse3 .cse41 .cse6 .cse18 .cse49 .cse9 .cse0 .cse29 .cse55 .cse30 .cse10 .cse2 .cse11 .cse20 .cse21 .cse22 .cse38 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse27 .cse6 .cse28 .cse9 .cse0 .cse29 .cse30 .cse2 .cse10 .cse31 .cse12 .cse32 .cse33 .cse14 .cse15 .cse34 .cse35 .cse20 .cse21 .cse22 .cse38 .cse39) (and .cse3 .cse27 .cse16 .cse17 .cse6 .cse28 .cse7 .cse18 .cse9 .cse8 .cse30 .cse19 .cse20 .cse21 .cse22 .cse37 .cse23 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse27 .cse4 .cse28 .cse6 .cse7 .cse49 .cse0 .cse9 .cse2 .cse10 .cse53 .cse12 .cse33 .cse14 .cse15 .cse34 .cse35 .cse20 .cse21 .cse22 .cse38 .cse25 .cse26) (and .cse3 .cse6 .cse28 .cse9 .cse0 .cse29 .cse30 .cse2 .cse10 .cse11 .cse31 .cse12 .cse32 .cse33 .cse14 .cse15 .cse34 .cse18 .cse20 .cse21 .cse22 .cse38 .cse39) (and .cse3 .cse27 .cse28 .cse6 .cse7 .cse49 .cse0 .cse9 .cse30 .cse2 .cse33 .cse14 .cse15 .cse34 .cse35 .cse36 .cse20 .cse21 .cse22 .cse37 .cse38 .cse25 .cse26) (and .cse3 .cse41 .cse6 .cse7 .cse18 .cse49 .cse9 .cse30 .cse11 .cse20 .cse21 .cse22 .cse37 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse41 .cse4 .cse6 .cse7 .cse18 .cse49 .cse9 .cse10 .cse11 .cse20 .cse21 .cse22 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse27 .cse41 .cse4 .cse28 .cse6 .cse49 .cse7 .cse18 .cse9 .cse10 .cse20 .cse21 .cse22 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse30 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse37 .cse23 .cse24 .cse25 .cse26) (and .cse4 .cse6 .cse28 .cse9 .cse0 .cse29 .cse2 .cse10 .cse11 .cse53 .cse31 .cse12 .cse32 .cse33 .cse14 .cse15 .cse34 .cse18 .cse20 .cse21 .cse22 .cse38 .cse39) (and .cse31 .cse1) (and .cse6 .cse7 (= ~e_wl~0 ~e_f~0) .cse9 .cse21 .cse22 .cse23 .cse31 .cse32 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse27 .cse28 .cse6 .cse7 .cse49 .cse9 .cse0 .cse30 .cse2 .cse10 .cse12 .cse33 .cse14 .cse15 .cse34 .cse35 .cse20 .cse21 .cse22 .cse38 .cse25 .cse26) (and .cse3 .cse27 .cse17 .cse6 .cse28 .cse7 .cse18 .cse9 .cse8 .cse30 .cse10 .cse45 .cse20 .cse21 .cse46 .cse22 .cse23 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse27 .cse41 .cse6 .cse28 .cse7 .cse18 .cse49 .cse9 .cse30 .cse20 .cse21 .cse22 .cse37 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse4 .cse6 .cse28 .cse0 .cse9 .cse29 .cse2 .cse11 .cse53 .cse31 .cse32 .cse33 .cse15 .cse34 .cse18 .cse36 .cse20 .cse22 .cse37 .cse54 .cse38 .cse39) (and .cse27 .cse4 .cse6 .cse28 .cse9 .cse0 .cse29 .cse2 .cse10 .cse53 .cse31 .cse12 .cse32 .cse33 .cse14 .cse15 .cse34 .cse35 .cse20 .cse21 .cse22 .cse38 .cse39) (and .cse4 .cse6 .cse28 .cse7 .cse49 .cse9 .cse0 .cse2 .cse10 .cse11 .cse53 .cse12 .cse33 .cse14 .cse15 .cse34 .cse18 .cse20 .cse21 .cse22 .cse38 .cse25 .cse26) (and .cse5 .cse51 .cse24 (or (and .cse3 .cse16 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse30 .cse10 .cse19 .cse11 .cse21 .cse22 .cse23 .cse38 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse30 .cse10 .cse45 .cse11 .cse46 .cse21 .cse22 .cse23 .cse38 .cse12 .cse25 .cse14 .cse26 .cse15)) .cse52) (and .cse3 .cse41 .cse6 .cse7 .cse18 .cse49 .cse9 .cse30 .cse10 .cse11 .cse21 .cse22 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse40 .cse3 .cse6 .cse7 .cse8 .cse9 .cse43 .cse30 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse45 .cse46 .cse21 .cse47 .cse22 .cse23 .cse48 .cse38 .cse25 .cse26) (and .cse4 .cse6 .cse28 .cse7 .cse49 .cse0 .cse9 .cse2 .cse11 .cse53 .cse33 .cse15 .cse34 .cse18 .cse36 .cse20 .cse22 .cse37 .cse54 .cse38 .cse25 .cse26) (and .cse3 .cse28 .cse6 .cse7 .cse49 .cse0 .cse9 .cse30 .cse2 .cse11 .cse33 .cse14 .cse15 .cse34 .cse18 .cse36 .cse20 .cse21 .cse22 .cse37 .cse38 .cse25 .cse26) (and .cse3 .cse27 .cse4 .cse16 .cse17 .cse28 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse19 .cse20 .cse21 .cse22 .cse23 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse6 .cse28 .cse9 .cse0 .cse29 .cse30 .cse2 .cse11 .cse31 .cse32 .cse33 .cse14 .cse15 .cse34 .cse18 .cse36 .cse20 .cse21 .cse22 .cse37 .cse38 .cse39) (and .cse27 .cse4 .cse6 .cse28 .cse0 .cse9 .cse29 .cse2 .cse53 .cse31 .cse32 .cse33 .cse15 .cse34 .cse35 .cse36 .cse20 .cse22 .cse37 .cse54 .cse38 .cse39)))) [2019-01-12 15:37:19,090 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 184) no Hoare annotation was computed. [2019-01-12 15:37:19,090 INFO L448 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-01-12 15:37:19,090 INFO L448 ceAbstractionStarter]: For program point L606(lines 535 675) no Hoare annotation was computed. [2019-01-12 15:37:19,090 INFO L448 ceAbstractionStarter]: For program point L639-1(lines 535 675) no Hoare annotation was computed. [2019-01-12 15:37:19,090 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 382) no Hoare annotation was computed. [2019-01-12 15:37:19,090 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-01-12 15:37:19,090 INFO L448 ceAbstractionStarter]: For program point L607(lines 607 611) no Hoare annotation was computed. [2019-01-12 15:37:19,091 INFO L448 ceAbstractionStarter]: For program point L574-1(lines 535 675) no Hoare annotation was computed. [2019-01-12 15:37:19,091 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 396 680) no Hoare annotation was computed. [2019-01-12 15:37:19,091 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 118) no Hoare annotation was computed. [2019-01-12 15:37:19,091 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2019-01-12 15:37:19,091 INFO L444 ceAbstractionStarter]: At program point L707(lines 682 709) the Hoare annotation is: (= 1 ~c2_i~0) [2019-01-12 15:37:19,091 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 552) no Hoare annotation was computed. [2019-01-12 15:37:19,091 INFO L448 ceAbstractionStarter]: For program point L509-1(lines 396 680) no Hoare annotation was computed. [2019-01-12 15:37:19,091 INFO L448 ceAbstractionStarter]: For program point L542-2(lines 542 552) no Hoare annotation was computed. [2019-01-12 15:37:19,092 INFO L444 ceAbstractionStarter]: At program point L311(lines 288 386) the Hoare annotation is: (let ((.cse43 (+ ~t_b~0 2)) (.cse50 (+ ~t_b~0 1))) (let ((.cse23 (= ~c_req_up~0 1)) (.cse21 (<= .cse50 ~c_t~0)) (.cse51 (<= .cse50 ~c~0)) (.cse27 (<= ~c_t~0 .cse50)) (.cse52 (<= ~c~0 .cse50)) (.cse42 (<= .cse43 ~c_t~0)) (.cse44 (<= .cse43 ~c~0)) (.cse45 (<= .cse43 ~data~0)) (.cse46 (<= ~data~0 .cse43)) (.cse47 (<= ~c_t~0 .cse43)) (.cse48 (<= ~c~0 .cse43)) (.cse1 (not (= ~e_f~0 1))) (.cse6 (= ~wl_pc~0 1)) (.cse15 (not (= 0 ~e_f~0))) (.cse24 (<= .cse50 ~data~0)) (.cse25 (= ~wl_pc~0 2)) (.cse4 (<= 2 ~wl_st~0)) (.cse22 (= ~wl_st~0 ~e_f~0)) (.cse8 (<= 2 ~c1_st~0)) (.cse26 (<= ~data~0 .cse50)) (.cse13 (not (= 0 ~e_e~0))) (.cse16 (= ~c1_pc~0 1)) (.cse17 (not (= ~e_e~0 1))) (.cse19 (not (= 0 ~e_c~0))) (.cse0 (= ~c2_pc~0 1)) (.cse32 (<= 2 ~c2_st~0)) (.cse9 (<= 2 ~wb_st~0)) (.cse18 (not (= ~e_g~0 1))) (.cse5 (= ~wb_pc~0 1)) (.cse11 (not (= 0 ~e_g~0))) (.cse28 (= ~wb_st~0 0)) (.cse2 (= ~c2_st~0 0)) (.cse3 (= ~wb_i~0 1)) (.cse29 (= ~processed~0 0)) (.cse30 (<= ~t_b~0 ~data~0)) (.cse7 (= 1 ~c2_i~0)) (.cse31 (= ~wl_st~0 0)) (.cse33 (<= ~data~0 ~t_b~0)) (.cse49 (= ~c2_pc~0 0)) (.cse14 (<= 2 ~e_wl~0)) (.cse34 (= ~wl_pc~0 0)) (.cse35 (= ~e_f~0 ~e_e~0)) (.cse20 (<= ~r_i~0 0)) (.cse36 (= ~e_c~0 ~e_f~0)) (.cse37 (= ~wb_pc~0 0)) (.cse38 (= ~c1_pc~0 0)) (.cse10 (<= 2 ~r_st~0)) (.cse12 (= 1 ~c1_i~0)) (.cse39 (= ~c1_st~0 0)) (.cse53 (= ~e_c~0 ~e_g~0)) (.cse40 (<= ~c_req_up~0 0)) (.cse41 (= ~e_wl~0 ~e_c~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 .cse21 .cse3 .cse4 .cse22 .cse7 .cse8 .cse9 .cse16 .cse23 .cse18 .cse20 .cse24 .cse25 .cse5 .cse26 .cse10 .cse11 .cse12 .cse13 .cse27 .cse17 .cse19) (and .cse0 .cse28 .cse3 .cse29 .cse7 .cse30 .cse31 .cse32 .cse33 .cse14 .cse34 .cse35 .cse18 .cse20 .cse36 .cse37 .cse38 .cse10 .cse11 .cse12 .cse39 .cse40 .cse41) (and .cse42 .cse0 .cse1 .cse3 (<= .cse43 ~d~0) .cse44 .cse7 .cse31 .cse32 .cse8 .cse9 .cse15 .cse16 .cse18 .cse20 (<= ~d~0 .cse43) .cse25 .cse5 .cse45 .cse46 .cse10 .cse11 .cse47 .cse12 .cse13 .cse48 .cse40 .cse17 .cse19) (and .cse0 .cse28 .cse1 .cse2 .cse29 .cse3 .cse6 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse21 .cse3 .cse4 .cse22 .cse7 .cse32 .cse9 .cse16 .cse23 .cse18 .cse20 .cse24 .cse25 .cse5 .cse26 .cse10 .cse11 .cse12 .cse39 .cse13 .cse27 .cse17 .cse19) (and .cse0 .cse28 .cse1 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse32 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse2 .cse3 .cse29 .cse7 .cse30 .cse31 .cse33 .cse8 .cse9 .cse49 .cse14 .cse16 .cse34 .cse35 .cse18 .cse20 .cse36 .cse5 .cse10 .cse11 .cse12 .cse40 .cse41) (and .cse3 .cse4 (= ~e_wl~0 ~e_f~0) .cse7 .cse11 .cse12 .cse13 .cse14 .cse34 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse28 .cse29 .cse3 .cse4 .cse6 .cse7 .cse30 .cse32 .cse33 .cse8 .cse16 .cse35 .cse18 .cse20 .cse36 .cse37 .cse10 .cse11 .cse12 .cse40 .cse17 .cse19) (and (<= ~d~0 .cse50) (<= .cse50 ~d~0) .cse21 (or (and .cse0 .cse1 .cse24 .cse25 .cse3 .cse5 .cse7 .cse31 .cse32 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse40 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse25 .cse3 .cse5 .cse7 .cse31 .cse32 .cse8 .cse45 .cse9 .cse46 .cse10 .cse11 .cse12 .cse13 .cse15 .cse40 .cse16 .cse17 .cse18 .cse19 .cse20)) .cse51 .cse27 .cse52) (and .cse0 .cse28 .cse25 .cse3 .cse29 .cse4 .cse5 .cse7 .cse22 .cse32 .cse8 .cse45 .cse10 .cse11 .cse46 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse28 .cse1 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse32 .cse10 .cse11 .cse12 .cse39 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse2 .cse3 .cse29 .cse30 .cse7 .cse31 .cse33 .cse9 .cse49 .cse14 .cse34 .cse35 .cse20 .cse36 .cse5 .cse38 .cse10 .cse12 .cse39 .cse53 .cse40 .cse41) (and .cse0 .cse2 .cse3 .cse29 .cse4 .cse22 .cse30 .cse7 .cse33 .cse9 (<= ~data~0 ULTIMATE.start_write_loop_~t~0) (<= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse16 .cse18 .cse20 .cse25 .cse5 .cse10 .cse11 .cse12 .cse39 .cse13 .cse17 .cse19) (and .cse28 .cse2 .cse3 .cse29 .cse4 .cse6 .cse30 .cse7 .cse33 .cse49 .cse35 .cse20 .cse36 .cse37 .cse38 .cse10 .cse12 .cse39 .cse53 .cse40 .cse17 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse39 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse28 .cse2 .cse3 .cse29 .cse7 .cse30 .cse31 .cse33 .cse8 .cse49 .cse14 .cse16 .cse34 .cse35 .cse18 .cse20 .cse36 .cse37 .cse10 .cse11 .cse12 .cse40 .cse41) (and .cse2 .cse3 .cse29 .cse4 .cse6 .cse7 .cse30 .cse33 .cse8 .cse9 .cse49 .cse16 .cse35 .cse18 .cse20 .cse36 .cse5 .cse10 .cse11 .cse12 .cse40 .cse17 .cse19) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse30 .cse31 (= ~e_c~0 ~e_e~0) .cse32 .cse8 .cse33 .cse9 .cse10 .cse11 .cse12 .cse40 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse51 .cse27 (or (and .cse0 .cse24 .cse25 .cse3 .cse4 .cse5 .cse22 .cse7 .cse32 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse40 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse25 .cse3 .cse4 .cse5 .cse22 .cse7 .cse32 .cse8 .cse45 .cse9 .cse46 .cse11 .cse12 .cse13 .cse40 .cse16 .cse17 .cse18 .cse19 .cse20)) .cse52) (and .cse0 .cse28 .cse3 .cse29 .cse7 .cse30 .cse31 .cse32 .cse33 .cse8 .cse14 .cse16 .cse34 .cse35 .cse18 .cse20 .cse36 .cse37 .cse10 .cse11 .cse12 .cse40 .cse41) (and .cse0 .cse28 .cse24 .cse25 .cse3 .cse29 .cse4 .cse5 .cse7 .cse22 .cse32 .cse26 .cse10 .cse11 .cse12 .cse39 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse28 .cse2 .cse29 .cse3 .cse4 .cse6 .cse30 .cse7 .cse33 .cse8 .cse49 .cse16 .cse35 .cse18 .cse20 .cse36 .cse37 .cse10 .cse11 .cse12 .cse40 .cse17 .cse19) (and .cse0 .cse29 .cse3 .cse4 .cse6 .cse30 .cse7 .cse32 .cse33 .cse8 .cse9 .cse16 .cse35 .cse18 .cse20 .cse36 .cse5 .cse10 .cse11 .cse12 .cse40 .cse17 .cse19) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse32 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse3 .cse29 .cse7 .cse30 .cse31 .cse32 .cse33 .cse8 .cse9 .cse14 .cse16 .cse34 .cse35 .cse18 .cse20 .cse36 .cse5 .cse10 .cse11 .cse12 .cse40 .cse41) (and .cse42 .cse0 .cse3 .cse4 .cse22 .cse7 .cse44 .cse32 .cse8 .cse9 .cse16 .cse18 .cse20 .cse25 .cse5 .cse45 .cse46 .cse11 .cse47 .cse12 .cse13 .cse48 .cse40 .cse17 .cse19) (and .cse2 .cse3 .cse29 .cse4 .cse6 .cse30 .cse7 .cse33 .cse9 .cse49 .cse35 .cse20 .cse36 .cse5 .cse38 .cse10 .cse12 .cse39 .cse53 .cse40 .cse17 .cse19) (and .cse0 .cse28 .cse29 .cse3 .cse4 .cse6 .cse30 .cse7 .cse32 .cse33 .cse35 .cse18 .cse20 .cse36 .cse37 .cse38 .cse10 .cse11 .cse12 .cse39 .cse40 .cse17 .cse19) (and .cse0 .cse29 .cse3 .cse4 .cse6 .cse30 .cse7 .cse32 .cse33 .cse9 .cse35 .cse18 .cse20 .cse36 .cse5 .cse38 .cse10 .cse11 .cse12 .cse39 .cse40 .cse17 .cse19) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse32 .cse9 .cse10 .cse11 .cse12 .cse39 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse28 .cse2 .cse24 .cse25 .cse29 .cse3 .cse4 .cse5 .cse22 .cse7 .cse8 .cse26 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse3 .cse29 .cse7 .cse30 .cse31 .cse32 .cse33 .cse9 .cse14 .cse34 .cse35 .cse18 .cse20 .cse36 .cse5 .cse38 .cse10 .cse11 .cse12 .cse39 .cse40 .cse41) (and .cse28 .cse2 .cse3 .cse29 .cse30 .cse7 .cse31 .cse33 .cse49 .cse14 .cse34 .cse35 .cse20 .cse36 .cse37 .cse38 .cse10 .cse12 .cse39 .cse53 .cse40 .cse41)))) [2019-01-12 15:37:19,092 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 183) no Hoare annotation was computed. [2019-01-12 15:37:19,093 INFO L444 ceAbstractionStarter]: At program point L14(lines 55 125) the Hoare annotation is: (let ((.cse22 (= ~c1_st~0 0)) (.cse8 (= ~c2_st~0 0)) (.cse6 (<= 2 ~wb_st~0)) (.cse5 (= ~c2_pc~0 1)) (.cse7 (not (= ~e_f~0 1))) (.cse9 (<= 2 ~r_st~0)) (.cse10 (and (and (and (not (= 0 ~e_g~0)) (= 1 ~c2_i~0) (<= ~r_i~0 0)) (not (= 0 ~e_e~0))) (not (= 0 ~e_c~0)))) (.cse11 (= 1 ~c1_i~0)) (.cse12 (= ~wb_i~0 1)) (.cse18 (= ~wb_pc~0 1)) (.cse17 (= ~c1_pc~0 1)) (.cse13 (not (= ~e_e~0 1))) (.cse14 (not (= ~e_g~0 1))) (.cse21 (<= 2 ~c2_st~0)) (.cse20 (<= 2 ~c1_st~0))) (let ((.cse1 (or (and .cse6 (and .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse18 .cse17 .cse13 .cse14)) (and .cse6 (and .cse5 .cse7 .cse9 .cse10 .cse11 .cse22 .cse12 .cse18 .cse17 .cse13 .cse14) .cse21) (and .cse6 (and .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse17 .cse13 .cse14) .cse20) (and .cse6 (and .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse18 .cse17 .cse13 .cse14) .cse21 .cse20))) (.cse2 (= ~wl_pc~0 2)) (.cse3 (not (= 0 ~e_f~0)))) (or (let ((.cse0 (+ ~t_b~0 1))) (and (<= ~data~0 .cse0) .cse1 (<= .cse0 ~data~0) .cse2 .cse3)) (let ((.cse4 (+ ~t_b~0 2))) (and (<= .cse4 ~data~0) .cse1 (<= ~data~0 .cse4) .cse2 .cse3)) (and .cse3 (<= ~t_b~0 ~data~0) (let ((.cse15 (= ~e_c~0 ~e_e~0)) (.cse16 (<= ~c_req_up~0 0)) (.cse19 (= ~wl_pc~0 1))) (or (and .cse5 .cse6 (and .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17) .cse18 .cse19 .cse20) (and .cse5 .cse6 (and .cse7 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17) .cse18 .cse19 .cse21 .cse20) (and .cse5 .cse6 (and .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17) .cse18 .cse19) (and .cse5 .cse6 (and (and .cse9 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse15) .cse7 .cse16 .cse17) .cse18 .cse19 .cse21))) (<= ~data~0 ~t_b~0))))) [2019-01-12 15:37:19,093 INFO L448 ceAbstractionStarter]: For program point L543(lines 543 548) no Hoare annotation was computed. [2019-01-12 15:37:19,093 INFO L448 ceAbstractionStarter]: For program point L477(lines 396 680) no Hoare annotation was computed. [2019-01-12 15:37:19,093 INFO L448 ceAbstractionStarter]: For program point L543-2(lines 543 548) no Hoare annotation was computed. [2019-01-12 15:37:19,093 INFO L448 ceAbstractionStarter]: For program point L444-1(lines 396 680) no Hoare annotation was computed. [2019-01-12 15:37:19,093 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 352) no Hoare annotation was computed. [2019-01-12 15:37:19,093 INFO L444 ceAbstractionStarter]: At program point L180(lines 175 215) the Hoare annotation is: (let ((.cse27 (+ ~t_b~0 1))) (let ((.cse20 (= ~wb_st~0 0)) (.cse1 (not (= ~e_f~0 1))) (.cse21 (= ~processed~0 0)) (.cse5 (= ~wl_pc~0 1)) (.cse24 (= ~c1_st~0 0)) (.cse14 (not (= 0 ~e_f~0))) (.cse0 (= ~c2_pc~0 1)) (.cse22 (= ~wl_st~0 ~e_f~0)) (.cse7 (<= 2 ~c1_st~0)) (.cse8 (<= 2 ~wb_st~0)) (.cse15 (= ~c1_pc~0 1)) (.cse25 (<= .cse27 ~data~0)) (.cse23 (= ~wl_pc~0 2)) (.cse4 (= ~wb_pc~0 1)) (.cse26 (<= ~data~0 .cse27)) (.cse9 (<= 2 ~r_st~0)) (.cse2 (= ~wb_i~0 1)) (.cse3 (<= 2 ~wl_st~0)) (.cse6 (= 1 ~c2_i~0)) (.cse10 (not (= 0 ~e_g~0))) (.cse11 (= 1 ~c1_i~0)) (.cse12 (not (= 0 ~e_e~0))) (.cse13 (<= 2 ~e_wl~0)) (.cse16 (not (= ~e_e~0 1))) (.cse17 (not (= ~e_g~0 1))) (.cse18 (not (= 0 ~e_c~0))) (.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) (and .cse0 .cse20 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse21 .cse3 .cse22 (<= ~t_b~0 ~data~0) .cse6 (<= ~data~0 ~t_b~0) .cse8 (<= ~data~0 ULTIMATE.start_write_loop_~t~0) (<= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse15 .cse17 .cse19 .cse23 .cse4 .cse9 .cse10 .cse11 .cse24 .cse12 .cse16 .cse18) (and .cse0 .cse20 .cse25 .cse23 .cse2 .cse21 .cse3 .cse4 .cse6 .cse22 .cse7 .cse26 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 (<= .cse27 ~c_t~0) .cse2 .cse3 .cse22 .cse6 .cse7 .cse8 .cse15 (= ~c_req_up~0 1) .cse17 .cse19 .cse25 .cse23 .cse4 .cse26 .cse9 .cse10 .cse11 .cse12 (<= ~c_t~0 .cse27) .cse16 .cse18) (and .cse2 .cse3 (= ~e_wl~0 ~e_f~0) .cse6 .cse10 .cse11 .cse12 .cse13 (= ~wl_pc~0 0) .cse16 .cse17 .cse18 .cse19)))) [2019-01-12 15:37:19,094 INFO L444 ceAbstractionStarter]: At program point L676(lines 393 681) the Hoare annotation is: (= 1 ~c2_i~0) [2019-01-12 15:37:19,094 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-01-12 15:37:19,094 INFO L448 ceAbstractionStarter]: For program point L644-1(lines 535 675) no Hoare annotation was computed. [2019-01-12 15:37:19,094 INFO L444 ceAbstractionStarter]: At program point L149-1(lines 130 170) the Hoare annotation is: (let ((.cse42 (+ ~t_b~0 2)) (.cse41 (+ ~t_b~0 1)) (.cse36 (= ~wl_st~0 ~e_f~0)) (.cse31 (= ~c1_pc~0 1)) (.cse21 (= ~c2_pc~0 1)) (.cse1 (= ~processed~0 0)) (.cse5 (= ~wb_i~0 1)) (.cse25 (<= 2 ~wl_st~0)) (.cse6 (= ~wb_pc~0 1)) (.cse24 (= ~wl_pc~0 1)) (.cse7 (= 1 ~c2_i~0)) (.cse28 (<= 2 ~c2_st~0)) (.cse9 (<= 2 ~wb_st~0)) (.cse10 (<= 2 ~r_st~0)) (.cse11 (not (= 0 ~e_g~0))) (.cse12 (= 1 ~c1_i~0)) (.cse13 (<= ~c_req_up~0 0)) (.cse26 (not (= ~e_e~0 1))) (.cse15 (= ~e_f~0 ~e_e~0)) (.cse16 (not (= ~e_g~0 1))) (.cse32 (not (= 0 ~e_c~0))) (.cse17 (<= ~r_i~0 0)) (.cse19 (= ~e_f~0 ~e_c~0))) (let ((.cse8 (= ~wl_st~0 0)) (.cse14 (= ~wl_pc~0 0)) (.cse34 (= ~e_c~0 ~e_f~0)) (.cse18 (= ~e_wl~0 ~e_c~0)) (.cse33 (or (and .cse21 .cse1 .cse5 .cse6 .cse25 .cse36 .cse7 (= ~e_c~0 ~e_e~0) .cse28 .cse9 .cse10 .cse11 .cse12 .cse13 .cse31 .cse26 .cse16 .cse32 .cse17) (and .cse21 .cse1 .cse5 .cse25 .cse6 .cse24 .cse7 .cse28 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse15 .cse16 .cse32 .cse17 .cse19))) (.cse29 (not (= ~e_f~0 1))) (.cse2 (<= 2 ~e_wl~0)) (.cse39 (<= .cse41 ~data~0)) (.cse40 (<= ~data~0 .cse41)) (.cse35 (= ~wl_pc~0 2)) (.cse37 (<= .cse42 ~data~0)) (.cse38 (<= ~data~0 .cse42)) (.cse30 (not (= 0 ~e_e~0))) (.cse22 (= ~wb_st~0 0)) (.cse4 (= ~c2_st~0 0)) (.cse23 (= ~wb_pc~0 0)) (.cse0 (= ~c2_pc~0 0)) (.cse27 (not (= 0 ~e_f~0))) (.cse3 (<= ~t_b~0 ~data~0)) (.cse20 (<= ~data~0 ~t_b~0))) (or (and .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse20) (and .cse1 (and .cse21 .cse22 .cse23 .cse5 .cse24 .cse25 .cse7 .cse10 .cse11 .cse12 .cse13 .cse26 .cse15 .cse16 .cse17 .cse19) .cse27 .cse3 .cse28 .cse20) (and (and .cse21 .cse22 .cse29 .cse4 .cse1 .cse5 .cse24 .cse25 .cse6 .cse7 .cse10 .cse11 .cse12 .cse30 .cse27 .cse31 .cse26 .cse16 .cse32 .cse17) .cse2) (and .cse2 .cse33) (and .cse21 .cse22 .cse1 .cse5 .cse3 .cse7 .cse8 .cse28 .cse20 .cse2 .cse14 .cse15 .cse16 .cse17 .cse34 .cse23 .cse10 .cse11 .cse12 .cse13 .cse18) (and .cse5 .cse25 (= ~e_wl~0 ~e_f~0) .cse7 .cse11 .cse12 .cse30 .cse2 .cse14 .cse26 .cse16 .cse32 .cse17) (and .cse21 .cse29 .cse4 .cse5 .cse1 .cse25 .cse6 .cse24 .cse7 .cse9 .cse10 .cse11 .cse12 .cse30 .cse2 .cse27 .cse31 .cse26 .cse16 .cse32 .cse17) (and .cse21 .cse22 .cse35 .cse5 .cse1 .cse25 .cse6 .cse7 .cse36 .cse28 .cse37 .cse10 .cse11 .cse38 .cse12 .cse30 .cse31 .cse26 .cse16 .cse32 .cse17) (and .cse21 .cse22 .cse29 .cse5 .cse1 .cse25 .cse6 .cse24 .cse7 .cse28 .cse10 .cse11 .cse12 .cse30 .cse2 .cse27 .cse31 .cse26 .cse16 .cse32 .cse17) (and .cse0 .cse1 .cse3 (and .cse4 .cse5 .cse25 .cse6 .cse24 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse15 .cse16 .cse32 .cse17 .cse19) .cse20) (and .cse21 .cse22 .cse4 .cse39 .cse35 .cse1 .cse5 .cse25 .cse6 .cse36 .cse7 .cse40 .cse10 .cse11 .cse12 .cse30 .cse31 .cse26 .cse16 .cse32 .cse17) (and .cse35 .cse33) (and .cse1 .cse3 (and .cse21 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse2 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse28 .cse20) (and .cse22 .cse4 .cse5 .cse1 .cse7 .cse3 .cse8 .cse20 .cse0 .cse2 .cse14 .cse15 .cse16 .cse17 .cse34 .cse23 .cse10 .cse11 .cse12 .cse13 .cse18) (and .cse3 .cse33 .cse20) (and .cse21 .cse29 .cse5 .cse25 .cse6 .cse24 .cse7 .cse28 .cse9 .cse10 .cse11 .cse12 .cse30 .cse2 .cse27 .cse31 .cse26 .cse16 .cse32 .cse17) (and (<= .cse41 ~c_t~0) (or (and .cse21 .cse39 .cse35 .cse5 .cse25 .cse6 .cse36 .cse7 .cse28 .cse40 .cse9 .cse10 .cse11 .cse12 .cse30 .cse31 .cse26 .cse16 .cse32 .cse17) (and .cse21 .cse35 .cse5 .cse25 .cse6 .cse36 .cse7 .cse28 .cse37 .cse9 .cse38 .cse10 .cse11 .cse12 .cse30 .cse31 .cse26 .cse16 .cse32 .cse17)) (<= ~c_t~0 .cse41) (= ~c_req_up~0 1)) (and (and .cse22 .cse4 .cse23 .cse5 .cse25 .cse24 .cse7 .cse10 .cse11 .cse12 .cse13 .cse26 .cse15 .cse16 .cse17 .cse19) .cse0 .cse1 .cse27 .cse3 .cse20)))) [2019-01-12 15:37:19,094 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-01-12 15:37:19,095 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 77 120) no Hoare annotation was computed. [2019-01-12 15:37:19,095 INFO L448 ceAbstractionStarter]: For program point L414-1(lines 396 680) no Hoare annotation was computed. [2019-01-12 15:37:19,095 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 322) no Hoare annotation was computed. [2019-01-12 15:37:19,095 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-01-12 15:37:19,095 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 584) no Hoare annotation was computed. [2019-01-12 15:37:19,095 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 396 680) no Hoare annotation was computed. [2019-01-12 15:37:19,095 INFO L448 ceAbstractionStarter]: For program point L449-1(lines 396 680) no Hoare annotation was computed. [2019-01-12 15:37:19,095 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 15:37:19,095 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 160) no Hoare annotation was computed. [2019-01-12 15:37:19,095 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 152 160) no Hoare annotation was computed. [2019-01-12 15:37:19,095 INFO L448 ceAbstractionStarter]: For program point L615(lines 535 675) no Hoare annotation was computed. [2019-01-12 15:37:19,096 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 157) no Hoare annotation was computed. [2019-01-12 15:37:19,096 INFO L448 ceAbstractionStarter]: For program point L616(lines 616 620) no Hoare annotation was computed. [2019-01-12 15:37:19,096 INFO L448 ceAbstractionStarter]: For program point L649-1(lines 535 675) no Hoare annotation was computed. [2019-01-12 15:37:19,096 INFO L448 ceAbstractionStarter]: For program point L419-1(lines 396 680) no Hoare annotation was computed. [2019-01-12 15:37:19,096 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2019-01-12 15:37:19,096 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 229) no Hoare annotation was computed. [2019-01-12 15:37:19,096 INFO L448 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-01-12 15:37:19,096 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 68) no Hoare annotation was computed. [2019-01-12 15:37:19,096 INFO L448 ceAbstractionStarter]: For program point L486(lines 396 680) no Hoare annotation was computed. [2019-01-12 15:37:19,096 INFO L448 ceAbstractionStarter]: For program point L519-1(lines 396 680) no Hoare annotation was computed. [2019-01-12 15:37:19,097 INFO L444 ceAbstractionStarter]: At program point L387(lines 279 392) the Hoare annotation is: (let ((.cse33 (+ ~t_b~0 2)) (.cse32 (= ~wl_pc~0 1)) (.cse3 (= ~c2_pc~0 1)) (.cse5 (= ~wb_i~0 1)) (.cse7 (= ~wb_pc~0 1)) (.cse6 (<= 2 ~wl_st~0)) (.cse8 (= ~wl_st~0 ~e_f~0)) (.cse9 (= 1 ~c2_i~0)) (.cse10 (<= 2 ~c2_st~0)) (.cse11 (<= 2 ~c1_st~0)) (.cse13 (<= 2 ~wb_st~0)) (.cse15 (<= 2 ~r_st~0)) (.cse16 (not (= 0 ~e_g~0))) (.cse17 (= 1 ~c1_i~0)) (.cse28 (<= ~c_req_up~0 0)) (.cse19 (= ~c1_pc~0 1)) (.cse20 (not (= ~e_e~0 1))) (.cse21 (not (= ~e_g~0 1))) (.cse22 (not (= 0 ~e_c~0))) (.cse23 (<= ~r_i~0 0)) (.cse27 (+ ~t_b~0 1))) (let ((.cse1 (<= .cse27 ~c_t~0)) (.cse2 (<= ~c_t~0 .cse27)) (.cse24 (<= .cse27 ~data~0)) (.cse25 (<= ~data~0 .cse27)) (.cse26 (= ~c_req_up~0 1)) (.cse0 (let ((.cse34 (= ~processed~0 0))) (or (and .cse3 .cse34 .cse5 .cse6 .cse32 .cse9 .cse10 .cse11 .cse13 .cse19 (= ~e_f~0 ~e_e~0) .cse21 .cse23 (= ~e_c~0 ~e_f~0) .cse7 .cse15 .cse16 .cse17 .cse28 .cse20 .cse22) (and .cse3 .cse34 .cse5 .cse7 .cse6 .cse8 .cse9 (= ~e_c~0 ~e_e~0) .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse28 .cse19 .cse20 .cse21 .cse22 .cse23)))) (.cse31 (<= 2 ~e_wl~0)) (.cse29 (<= .cse33 ~c_t~0)) (.cse4 (= ~wl_pc~0 2)) (.cse12 (<= .cse33 ~data~0)) (.cse14 (<= ~data~0 .cse33)) (.cse30 (<= ~c_t~0 .cse33)) (.cse18 (not (= 0 ~e_e~0)))) (or (and (<= ~t_b~0 ~data~0) .cse0 (<= ~data~0 ~t_b~0)) (and .cse1 .cse2 (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)) .cse26) (and .cse1 (<= .cse27 ~c~0) .cse2 (or (and .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse13 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse22 .cse23)) (<= ~c~0 .cse27)) (and .cse29 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse19 .cse26 .cse21 .cse23 .cse4 .cse7 .cse12 .cse14 .cse15 .cse16 .cse30 .cse17 .cse18 .cse20 .cse22) (and .cse31 .cse0) (and .cse5 .cse6 (= ~e_wl~0 ~e_f~0) .cse9 .cse16 .cse17 .cse18 .cse31 (= ~wl_pc~0 0) .cse20 .cse21 .cse22 .cse23) (and .cse4 .cse0) (and .cse3 (not (= ~e_f~0 1)) .cse5 .cse6 .cse7 .cse32 .cse9 .cse10 .cse11 .cse13 .cse16 .cse17 .cse18 .cse31 (not (= 0 ~e_f~0)) .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse29 .cse3 .cse5 .cse6 .cse8 .cse9 (<= .cse33 ~c~0) .cse10 .cse11 .cse13 .cse19 .cse21 .cse23 .cse4 .cse7 .cse12 .cse14 .cse16 .cse30 .cse17 .cse18 (<= ~c~0 .cse33) .cse28 .cse20 .cse22)))) [2019-01-12 15:37:19,097 INFO L448 ceAbstractionStarter]: For program point L255(lines 255 272) no Hoare annotation was computed. [2019-01-12 15:37:19,097 INFO L444 ceAbstractionStarter]: At program point L586(lines 579 596) the Hoare annotation is: (let ((.cse24 (+ ~t_b~0 2))) (let ((.cse22 (not (= ~e_f~0 1))) (.cse1 (= ~c2_pc~0 1)) (.cse6 (= ~wl_st~0 ~e_f~0)) (.cse8 (<= 2 ~c2_st~0)) (.cse9 (<= 2 ~c1_st~0)) (.cse10 (<= 2 ~wb_st~0)) (.cse15 (= ~c1_pc~0 1)) (.cse2 (= ~wl_pc~0 2)) (.cse5 (= ~wb_pc~0 1)) (.cse20 (<= .cse24 ~data~0)) (.cse21 (<= ~data~0 .cse24)) (.cse14 (<= ~c_req_up~0 0)) (.cse3 (= ~wb_i~0 1)) (.cse4 (<= 2 ~wl_st~0)) (.cse7 (= 1 ~c2_i~0)) (.cse11 (not (= 0 ~e_g~0))) (.cse12 (= 1 ~c1_i~0)) (.cse13 (not (= 0 ~e_e~0))) (.cse23 (<= 2 ~e_wl~0)) (.cse16 (not (= ~e_e~0 1))) (.cse17 (not (= ~e_g~0 1))) (.cse18 (not (= 0 ~e_c~0))) (.cse19 (<= ~r_i~0 0))) (or (let ((.cse0 (+ ~t_b~0 1))) (and (<= .cse0 ~c_t~0) (<= .cse0 ~c~0) (<= ~c_t~0 .cse0) (or (and .cse1 (<= .cse0 ~data~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~data~0 .cse0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (<= ~c~0 .cse0))) (and .cse1 .cse22 .cse3 .cse5 .cse4 .cse7 (= ~e_c~0 ~e_e~0) .cse8 .cse9 .cse10 (<= 2 ~r_st~0) .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse22 .cse3 .cse4 .cse5 (= ~wl_pc~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse23 (not (= 0 ~e_f~0)) .cse15 .cse16 .cse17 .cse18 .cse19) (and (<= .cse24 ~c_t~0) .cse1 .cse3 .cse4 .cse6 .cse7 (<= .cse24 ~c~0) .cse8 .cse9 .cse10 .cse15 .cse17 .cse19 .cse2 .cse5 .cse20 .cse21 .cse11 (<= ~c_t~0 .cse24) .cse12 .cse13 (<= ~c~0 .cse24) .cse14 .cse16 .cse18) (and .cse3 .cse4 (= ~e_wl~0 ~e_f~0) .cse7 .cse11 .cse12 .cse13 .cse23 (= ~wl_pc~0 0) .cse16 .cse17 .cse18 .cse19)))) [2019-01-12 15:37:19,098 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 491) no Hoare annotation was computed. [2019-01-12 15:37:19,098 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 396 680) no Hoare annotation was computed. [2019-01-12 15:37:19,098 INFO L448 ceAbstractionStarter]: For program point L289(lines 288 386) no Hoare annotation was computed. [2019-01-12 15:37:19,098 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 15:37:19,098 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 260) no Hoare annotation was computed. [2019-01-12 15:37:19,098 INFO L448 ceAbstractionStarter]: For program point L587(lines 535 675) no Hoare annotation was computed. [2019-01-12 15:37:19,098 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2019-01-12 15:37:19,098 INFO L448 ceAbstractionStarter]: For program point L554-2(lines 535 675) no Hoare annotation was computed. [2019-01-12 15:37:19,099 INFO L444 ceAbstractionStarter]: At program point L356(lines 288 386) the Hoare annotation is: (let ((.cse42 (+ ~t_b~0 2)) (.cse50 (+ ~t_b~0 1)) (.cse49 (= ~wl_pc~0 1)) (.cse33 (= ~e_f~0 ~e_e~0)) (.cse34 (= ~e_c~0 ~e_f~0)) (.cse3 (= ~c2_pc~0 1)) (.cse28 (= ~processed~0 0)) (.cse6 (= ~wb_i~0 1)) (.cse18 (= ~wb_pc~0 1)) (.cse7 (<= 2 ~wl_st~0)) (.cse8 (= ~wl_st~0 ~e_f~0)) (.cse9 (= 1 ~c2_i~0)) (.cse55 (= ~e_c~0 ~e_e~0)) (.cse30 (<= 2 ~c2_st~0)) (.cse10 (<= 2 ~c1_st~0)) (.cse11 (<= 2 ~wb_st~0)) (.cse20 (<= 2 ~r_st~0)) (.cse21 (not (= 0 ~e_g~0))) (.cse22 (= 1 ~c1_i~0)) (.cse38 (<= ~c_req_up~0 0)) (.cse12 (= ~c1_pc~0 1)) (.cse25 (not (= ~e_e~0 1))) (.cse14 (not (= ~e_g~0 1))) (.cse26 (not (= 0 ~e_c~0))) (.cse15 (<= ~r_i~0 0))) (let ((.cse13 (= ~c_req_up~0 1)) (.cse1 (or (and .cse3 .cse28 .cse6 .cse7 .cse49 .cse9 .cse30 .cse10 .cse11 .cse12 .cse33 .cse14 .cse15 .cse34 .cse18 .cse20 .cse21 .cse22 .cse38 .cse25 .cse26) (and .cse3 .cse28 .cse6 .cse18 .cse7 .cse8 .cse9 .cse55 .cse30 .cse10 .cse11 .cse20 .cse21 .cse22 .cse38 .cse12 .cse25 .cse14 .cse26 .cse15))) (.cse5 (<= .cse50 ~c_t~0)) (.cse51 (<= .cse50 ~c~0)) (.cse24 (<= ~c_t~0 .cse50)) (.cse52 (<= ~c~0 .cse50)) (.cse41 (not (= ~e_f~0 1))) (.cse44 (not (= 0 ~e_f~0))) (.cse40 (<= .cse42 ~c_t~0)) (.cse43 (<= .cse42 ~c~0)) (.cse45 (<= .cse42 ~data~0)) (.cse46 (<= ~data~0 .cse42)) (.cse47 (<= ~c_t~0 .cse42)) (.cse48 (<= ~c~0 .cse42)) (.cse16 (<= .cse50 ~data~0)) (.cse17 (= ~wl_pc~0 2)) (.cse19 (<= ~data~0 .cse50)) (.cse23 (not (= 0 ~e_e~0))) (.cse27 (= ~wb_st~0 0)) (.cse4 (= ~c2_st~0 0)) (.cse0 (<= ~t_b~0 ~data~0)) (.cse29 (= ~wl_st~0 0)) (.cse2 (<= ~data~0 ~t_b~0)) (.cse53 (= ~c2_pc~0 0)) (.cse31 (<= 2 ~e_wl~0)) (.cse32 (= ~wl_pc~0 0)) (.cse35 (= ~wb_pc~0 0)) (.cse36 (= ~c1_pc~0 0)) (.cse37 (= ~c1_st~0 0)) (.cse54 (= ~e_c~0 ~e_g~0)) (.cse39 (= ~e_wl~0 ~e_c~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse3 .cse27 .cse6 .cse28 .cse9 .cse0 .cse29 .cse30 .cse2 .cse31 .cse32 .cse33 .cse14 .cse15 .cse34 .cse35 .cse36 .cse20 .cse21 .cse22 .cse37 .cse38 .cse39) (and .cse40 .cse3 .cse41 .cse6 (<= .cse42 ~d~0) .cse43 .cse9 .cse29 .cse30 .cse10 .cse11 .cse44 .cse12 .cse14 .cse15 (<= ~d~0 .cse42) .cse17 .cse18 .cse45 .cse46 .cse20 .cse21 .cse47 .cse22 .cse23 .cse48 .cse38 .cse25 .cse26) (and .cse3 .cse27 .cse41 .cse6 .cse28 .cse7 .cse18 .cse49 .cse9 .cse30 .cse10 .cse20 .cse21 .cse22 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse40 .cse3 .cse6 .cse7 .cse8 .cse9 .cse30 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse45 .cse46 .cse20 .cse21 .cse47 .cse22 .cse23 .cse25 .cse26) (and .cse17 .cse1) (and (<= ~d~0 .cse50) (<= .cse50 ~d~0) .cse5 (or (and .cse3 .cse41 .cse16 .cse17 .cse6 .cse18 .cse9 .cse29 .cse30 .cse10 .cse19 .cse11 .cse20 .cse21 .cse22 .cse23 .cse44 .cse38 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse41 .cse17 .cse6 .cse18 .cse9 .cse29 .cse30 .cse10 .cse45 .cse11 .cse46 .cse20 .cse21 .cse22 .cse23 .cse44 .cse38 .cse12 .cse25 .cse14 .cse26 .cse15)) .cse51 .cse24 .cse52) (and .cse3 .cse4 .cse6 .cse28 .cse7 .cse8 .cse0 .cse9 .cse2 .cse11 (<= ~data~0 ULTIMATE.start_write_loop_~t~0) (<= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse12 .cse14 .cse15 .cse17 .cse18 .cse20 .cse21 .cse22 .cse37 .cse23 .cse25 .cse26) (and .cse27 .cse4 .cse6 .cse28 .cse7 .cse49 .cse0 .cse9 .cse2 .cse53 .cse33 .cse15 .cse34 .cse35 .cse36 .cse20 .cse22 .cse37 .cse54 .cse38 .cse25 .cse26) (and .cse3 .cse41 .cse4 .cse6 .cse28 .cse7 .cse18 .cse49 .cse9 .cse11 .cse20 .cse21 .cse22 .cse37 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse5 .cse24 (or (and .cse3 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse30 .cse10 .cse45 .cse11 .cse46 .cse20 .cse21 .cse22 .cse23 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse16 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse30 .cse10 .cse19 .cse11 .cse20 .cse21 .cse22 .cse23 .cse12 .cse25 .cse14 .cse26 .cse15)) .cse13) (and .cse3 .cse41 .cse6 .cse18 .cse49 .cse9 .cse0 .cse29 .cse55 .cse30 .cse10 .cse2 .cse11 .cse20 .cse21 .cse22 .cse38 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse27 .cse6 .cse28 .cse9 .cse0 .cse29 .cse30 .cse2 .cse10 .cse31 .cse12 .cse32 .cse33 .cse14 .cse15 .cse34 .cse35 .cse20 .cse21 .cse22 .cse38 .cse39) (and .cse3 .cse27 .cse16 .cse17 .cse6 .cse28 .cse7 .cse18 .cse9 .cse8 .cse30 .cse19 .cse20 .cse21 .cse22 .cse37 .cse23 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse27 .cse4 .cse28 .cse6 .cse7 .cse49 .cse0 .cse9 .cse2 .cse10 .cse53 .cse12 .cse33 .cse14 .cse15 .cse34 .cse35 .cse20 .cse21 .cse22 .cse38 .cse25 .cse26) (and .cse3 .cse6 .cse28 .cse9 .cse0 .cse29 .cse30 .cse2 .cse10 .cse11 .cse31 .cse12 .cse32 .cse33 .cse14 .cse15 .cse34 .cse18 .cse20 .cse21 .cse22 .cse38 .cse39) (and .cse3 .cse27 .cse28 .cse6 .cse7 .cse49 .cse0 .cse9 .cse30 .cse2 .cse33 .cse14 .cse15 .cse34 .cse35 .cse36 .cse20 .cse21 .cse22 .cse37 .cse38 .cse25 .cse26) (and .cse3 .cse41 .cse6 .cse7 .cse18 .cse49 .cse9 .cse30 .cse11 .cse20 .cse21 .cse22 .cse37 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse41 .cse4 .cse6 .cse7 .cse18 .cse49 .cse9 .cse10 .cse11 .cse20 .cse21 .cse22 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse27 .cse41 .cse4 .cse28 .cse6 .cse49 .cse7 .cse18 .cse9 .cse10 .cse20 .cse21 .cse22 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse30 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse37 .cse23 .cse24 .cse25 .cse26) (and .cse4 .cse6 .cse28 .cse9 .cse0 .cse29 .cse2 .cse10 .cse11 .cse53 .cse31 .cse12 .cse32 .cse33 .cse14 .cse15 .cse34 .cse18 .cse20 .cse21 .cse22 .cse38 .cse39) (and .cse31 .cse1) (and .cse6 .cse7 (= ~e_wl~0 ~e_f~0) .cse9 .cse21 .cse22 .cse23 .cse31 .cse32 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse27 .cse28 .cse6 .cse7 .cse49 .cse9 .cse0 .cse30 .cse2 .cse10 .cse12 .cse33 .cse14 .cse15 .cse34 .cse35 .cse20 .cse21 .cse22 .cse38 .cse25 .cse26) (and .cse3 .cse27 .cse17 .cse6 .cse28 .cse7 .cse18 .cse9 .cse8 .cse30 .cse10 .cse45 .cse20 .cse21 .cse46 .cse22 .cse23 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse27 .cse41 .cse6 .cse28 .cse7 .cse18 .cse49 .cse9 .cse30 .cse20 .cse21 .cse22 .cse37 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse4 .cse6 .cse28 .cse0 .cse9 .cse29 .cse2 .cse11 .cse53 .cse31 .cse32 .cse33 .cse15 .cse34 .cse18 .cse36 .cse20 .cse22 .cse37 .cse54 .cse38 .cse39) (and .cse27 .cse4 .cse6 .cse28 .cse9 .cse0 .cse29 .cse2 .cse10 .cse53 .cse31 .cse12 .cse32 .cse33 .cse14 .cse15 .cse34 .cse35 .cse20 .cse21 .cse22 .cse38 .cse39) (and .cse4 .cse6 .cse28 .cse7 .cse49 .cse9 .cse0 .cse2 .cse10 .cse11 .cse53 .cse12 .cse33 .cse14 .cse15 .cse34 .cse18 .cse20 .cse21 .cse22 .cse38 .cse25 .cse26) (and .cse5 .cse51 .cse24 (or (and .cse3 .cse16 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse30 .cse10 .cse19 .cse11 .cse21 .cse22 .cse23 .cse38 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse30 .cse10 .cse45 .cse11 .cse46 .cse21 .cse22 .cse23 .cse38 .cse12 .cse25 .cse14 .cse26 .cse15)) .cse52) (and .cse3 .cse41 .cse6 .cse7 .cse18 .cse49 .cse9 .cse30 .cse10 .cse11 .cse21 .cse22 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse40 .cse3 .cse6 .cse7 .cse8 .cse9 .cse43 .cse30 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse45 .cse46 .cse21 .cse47 .cse22 .cse23 .cse48 .cse38 .cse25 .cse26) (and .cse4 .cse6 .cse28 .cse7 .cse49 .cse0 .cse9 .cse2 .cse11 .cse53 .cse33 .cse15 .cse34 .cse18 .cse36 .cse20 .cse22 .cse37 .cse54 .cse38 .cse25 .cse26) (and .cse3 .cse28 .cse6 .cse7 .cse49 .cse0 .cse9 .cse30 .cse2 .cse11 .cse33 .cse14 .cse15 .cse34 .cse18 .cse36 .cse20 .cse21 .cse22 .cse37 .cse38 .cse25 .cse26) (and .cse3 .cse27 .cse4 .cse16 .cse17 .cse28 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse19 .cse20 .cse21 .cse22 .cse23 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse6 .cse28 .cse9 .cse0 .cse29 .cse30 .cse2 .cse11 .cse31 .cse32 .cse33 .cse14 .cse15 .cse34 .cse18 .cse36 .cse20 .cse21 .cse22 .cse37 .cse38 .cse39) (and .cse27 .cse4 .cse6 .cse28 .cse0 .cse9 .cse29 .cse2 .cse53 .cse31 .cse32 .cse33 .cse15 .cse34 .cse35 .cse36 .cse20 .cse22 .cse37 .cse54 .cse38 .cse39)))) [2019-01-12 15:37:19,115 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 228) no Hoare annotation was computed. [2019-01-12 15:37:19,115 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 100) no Hoare annotation was computed. [2019-01-12 15:37:19,115 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 67) no Hoare annotation was computed. [2019-01-12 15:37:19,115 INFO L448 ceAbstractionStarter]: For program point L588(lines 588 592) no Hoare annotation was computed. [2019-01-12 15:37:19,115 INFO L444 ceAbstractionStarter]: At program point L225(lines 220 247) the Hoare annotation is: (let ((.cse28 (+ ~t_b~0 1))) (let ((.cse8 (<= 2 ~c2_st~0)) (.cse22 (= ~c1_st~0 0)) (.cse20 (<= .cse28 ~data~0)) (.cse1 (= ~wl_pc~0 2)) (.cse6 (= ~wl_st~0 ~e_f~0)) (.cse21 (<= ~data~0 .cse28)) (.cse0 (= ~c2_pc~0 1)) (.cse23 (not (= ~e_f~0 1))) (.cse27 (= ~c2_st~0 0)) (.cse2 (= ~processed~0 0)) (.cse3 (= ~wb_i~0 1)) (.cse4 (= ~wb_pc~0 1)) (.cse24 (= ~wl_pc~0 1)) (.cse5 (<= 2 ~wl_st~0)) (.cse7 (= 1 ~c2_i~0)) (.cse9 (<= 2 ~c1_st~0)) (.cse11 (<= 2 ~r_st~0)) (.cse12 (not (= 0 ~e_g~0))) (.cse13 (= 1 ~c1_i~0)) (.cse14 (not (= 0 ~e_e~0))) (.cse26 (not (= 0 ~e_f~0))) (.cse15 (= ~c1_pc~0 1)) (.cse16 (not (= ~e_e~0 1))) (.cse17 (not (= ~e_g~0 1))) (.cse18 (not (= 0 ~e_c~0))) (.cse19 (<= ~r_i~0 0)) (.cse25 (<= 2 ~e_wl~0))) (or (let ((.cse10 (+ ~t_b~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse10 ~data~0) (<= ~data~0 .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse5 .cse4 .cse7 .cse6 .cse8 .cse21 .cse11 .cse12 .cse13 .cse22 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse23 .cse2 .cse3 .cse4 .cse24 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse25 .cse26 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse23 .cse2 .cse3 .cse5 .cse4 .cse24 .cse7 .cse8 .cse11 .cse12 .cse13 .cse22 .cse14 .cse25 .cse26 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse3 .cse5 (= ~e_wl~0 ~e_f~0) .cse7 .cse12 .cse13 .cse14 .cse25 (= ~wl_pc~0 0) .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse27 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and (and .cse0 .cse23 .cse27 .cse2 .cse3 .cse4 .cse24 .cse5 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17 .cse18 .cse19) .cse25)))) [2019-01-12 15:37:19,115 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2019-01-12 15:37:19,116 INFO L444 ceAbstractionStarter]: At program point L60(lines 55 125) the Hoare annotation is: (let ((.cse0 (+ ~t_b~0 2))) (let ((.cse1 (<= .cse0 ~data~0)) (.cse2 (<= ~data~0 .cse0)) (.cse3 (= ~wl_pc~0 2)) (.cse4 (let ((.cse12 (<= 2 ~c1_st~0)) (.cse9 (= ~c2_st~0 0)) (.cse7 (= ~c2_pc~0 1)) (.cse8 (not (= ~e_f~0 1))) (.cse10 (= ~wb_i~0 1)) (.cse11 (= ~wb_pc~0 1)) (.cse21 (<= 2 ~c2_st~0)) (.cse13 (<= 2 ~wb_st~0)) (.cse14 (<= 2 ~r_st~0)) (.cse15 (and (and (and (not (= 0 ~e_g~0)) (= 1 ~c2_i~0) (<= ~r_i~0 0)) (not (= 0 ~e_e~0))) (not (= 0 ~e_c~0)))) (.cse16 (= 1 ~c1_i~0)) (.cse22 (= ~c1_st~0 0)) (.cse17 (<= ~c_req_up~0 0)) (.cse18 (= ~c1_pc~0 1)) (.cse19 (not (= ~e_e~0 1))) (.cse20 (not (= ~e_g~0 1)))) (or (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse7 .cse8 .cse10 .cse11 .cse21 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse22 .cse17 .cse18 .cse19 .cse20) (and .cse7 .cse8 .cse10 .cse11 .cse21 .cse13 .cse14 .cse15 .cse16 .cse22 .cse17 .cse18 .cse19 .cse20)))) (.cse5 (not (= 0 ~e_f~0)))) (or (and (<= .cse0 ~c_t~0) .cse1 .cse2 (<= ~c_t~0 .cse0) (<= ~d~0 .cse0) .cse3 .cse4 (<= ~c~0 .cse0) (<= .cse0 ~d~0) .cse5 (<= .cse0 ~c~0)) (let ((.cse6 (+ ~t_b~0 1))) (and (<= ~d~0 .cse6) (<= .cse6 ~d~0) (<= .cse6 ~c_t~0) (or (and (<= ~data~0 .cse6) (<= .cse6 ~data~0) .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse5)) (<= .cse6 ~c~0) (<= ~c_t~0 .cse6) (<= ~c~0 .cse6)))))) [2019-01-12 15:37:19,116 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 396 680) no Hoare annotation was computed. [2019-01-12 15:37:19,116 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 15:37:19,116 INFO L448 ceAbstractionStarter]: For program point L524-1(lines 396 680) no Hoare annotation was computed. [2019-01-12 15:37:19,117 INFO L444 ceAbstractionStarter]: At program point L326(lines 288 386) the Hoare annotation is: (let ((.cse42 (+ ~t_b~0 2)) (.cse50 (+ ~t_b~0 1)) (.cse49 (= ~wl_pc~0 1)) (.cse33 (= ~e_f~0 ~e_e~0)) (.cse34 (= ~e_c~0 ~e_f~0)) (.cse3 (= ~c2_pc~0 1)) (.cse28 (= ~processed~0 0)) (.cse6 (= ~wb_i~0 1)) (.cse18 (= ~wb_pc~0 1)) (.cse7 (<= 2 ~wl_st~0)) (.cse8 (= ~wl_st~0 ~e_f~0)) (.cse9 (= 1 ~c2_i~0)) (.cse55 (= ~e_c~0 ~e_e~0)) (.cse30 (<= 2 ~c2_st~0)) (.cse10 (<= 2 ~c1_st~0)) (.cse11 (<= 2 ~wb_st~0)) (.cse20 (<= 2 ~r_st~0)) (.cse21 (not (= 0 ~e_g~0))) (.cse22 (= 1 ~c1_i~0)) (.cse38 (<= ~c_req_up~0 0)) (.cse12 (= ~c1_pc~0 1)) (.cse25 (not (= ~e_e~0 1))) (.cse14 (not (= ~e_g~0 1))) (.cse26 (not (= 0 ~e_c~0))) (.cse15 (<= ~r_i~0 0))) (let ((.cse13 (= ~c_req_up~0 1)) (.cse1 (or (and .cse3 .cse28 .cse6 .cse7 .cse49 .cse9 .cse30 .cse10 .cse11 .cse12 .cse33 .cse14 .cse15 .cse34 .cse18 .cse20 .cse21 .cse22 .cse38 .cse25 .cse26) (and .cse3 .cse28 .cse6 .cse18 .cse7 .cse8 .cse9 .cse55 .cse30 .cse10 .cse11 .cse20 .cse21 .cse22 .cse38 .cse12 .cse25 .cse14 .cse26 .cse15))) (.cse5 (<= .cse50 ~c_t~0)) (.cse51 (<= .cse50 ~c~0)) (.cse24 (<= ~c_t~0 .cse50)) (.cse52 (<= ~c~0 .cse50)) (.cse41 (not (= ~e_f~0 1))) (.cse44 (not (= 0 ~e_f~0))) (.cse40 (<= .cse42 ~c_t~0)) (.cse43 (<= .cse42 ~c~0)) (.cse45 (<= .cse42 ~data~0)) (.cse46 (<= ~data~0 .cse42)) (.cse47 (<= ~c_t~0 .cse42)) (.cse48 (<= ~c~0 .cse42)) (.cse16 (<= .cse50 ~data~0)) (.cse17 (= ~wl_pc~0 2)) (.cse19 (<= ~data~0 .cse50)) (.cse23 (not (= 0 ~e_e~0))) (.cse27 (= ~wb_st~0 0)) (.cse4 (= ~c2_st~0 0)) (.cse0 (<= ~t_b~0 ~data~0)) (.cse29 (= ~wl_st~0 0)) (.cse2 (<= ~data~0 ~t_b~0)) (.cse53 (= ~c2_pc~0 0)) (.cse31 (<= 2 ~e_wl~0)) (.cse32 (= ~wl_pc~0 0)) (.cse35 (= ~wb_pc~0 0)) (.cse36 (= ~c1_pc~0 0)) (.cse37 (= ~c1_st~0 0)) (.cse54 (= ~e_c~0 ~e_g~0)) (.cse39 (= ~e_wl~0 ~e_c~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse3 .cse27 .cse6 .cse28 .cse9 .cse0 .cse29 .cse30 .cse2 .cse31 .cse32 .cse33 .cse14 .cse15 .cse34 .cse35 .cse36 .cse20 .cse21 .cse22 .cse37 .cse38 .cse39) (and .cse40 .cse3 .cse41 .cse6 (<= .cse42 ~d~0) .cse43 .cse9 .cse29 .cse30 .cse10 .cse11 .cse44 .cse12 .cse14 .cse15 (<= ~d~0 .cse42) .cse17 .cse18 .cse45 .cse46 .cse20 .cse21 .cse47 .cse22 .cse23 .cse48 .cse38 .cse25 .cse26) (and .cse3 .cse27 .cse41 .cse6 .cse28 .cse7 .cse18 .cse49 .cse9 .cse30 .cse10 .cse20 .cse21 .cse22 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse17 .cse1) (and (<= ~d~0 .cse50) (<= .cse50 ~d~0) .cse5 (or (and .cse3 .cse41 .cse16 .cse17 .cse6 .cse18 .cse9 .cse29 .cse30 .cse10 .cse19 .cse11 .cse20 .cse21 .cse22 .cse23 .cse44 .cse38 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse41 .cse17 .cse6 .cse18 .cse9 .cse29 .cse30 .cse10 .cse45 .cse11 .cse46 .cse20 .cse21 .cse22 .cse23 .cse44 .cse38 .cse12 .cse25 .cse14 .cse26 .cse15)) .cse51 .cse24 .cse52) (and .cse3 .cse4 .cse6 .cse28 .cse7 .cse8 .cse0 .cse9 .cse2 .cse11 (<= ~data~0 ULTIMATE.start_write_loop_~t~0) (<= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse12 .cse14 .cse15 .cse17 .cse18 .cse20 .cse21 .cse22 .cse37 .cse23 .cse25 .cse26) (and .cse27 .cse4 .cse6 .cse28 .cse7 .cse49 .cse0 .cse9 .cse2 .cse53 .cse33 .cse15 .cse34 .cse35 .cse36 .cse20 .cse22 .cse37 .cse54 .cse38 .cse25 .cse26) (and .cse3 .cse41 .cse4 .cse6 .cse28 .cse7 .cse18 .cse49 .cse9 .cse11 .cse20 .cse21 .cse22 .cse37 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse5 .cse24 (or (and .cse3 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse30 .cse10 .cse45 .cse11 .cse46 .cse20 .cse21 .cse22 .cse23 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse16 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse30 .cse10 .cse19 .cse11 .cse20 .cse21 .cse22 .cse23 .cse12 .cse25 .cse14 .cse26 .cse15)) .cse13) (and .cse3 .cse41 .cse6 .cse18 .cse49 .cse9 .cse0 .cse29 .cse55 .cse30 .cse10 .cse2 .cse11 .cse20 .cse21 .cse22 .cse38 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse27 .cse6 .cse28 .cse9 .cse0 .cse29 .cse30 .cse2 .cse10 .cse31 .cse12 .cse32 .cse33 .cse14 .cse15 .cse34 .cse35 .cse20 .cse21 .cse22 .cse38 .cse39) (and .cse3 .cse27 .cse16 .cse17 .cse6 .cse28 .cse7 .cse18 .cse9 .cse8 .cse30 .cse19 .cse20 .cse21 .cse22 .cse37 .cse23 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse27 .cse4 .cse28 .cse6 .cse7 .cse49 .cse0 .cse9 .cse2 .cse10 .cse53 .cse12 .cse33 .cse14 .cse15 .cse34 .cse35 .cse20 .cse21 .cse22 .cse38 .cse25 .cse26) (and .cse3 .cse6 .cse28 .cse9 .cse0 .cse29 .cse30 .cse2 .cse10 .cse11 .cse31 .cse12 .cse32 .cse33 .cse14 .cse15 .cse34 .cse18 .cse20 .cse21 .cse22 .cse38 .cse39) (and .cse3 .cse27 .cse28 .cse6 .cse7 .cse49 .cse0 .cse9 .cse30 .cse2 .cse33 .cse14 .cse15 .cse34 .cse35 .cse36 .cse20 .cse21 .cse22 .cse37 .cse38 .cse25 .cse26) (and .cse3 .cse41 .cse6 .cse7 .cse18 .cse49 .cse9 .cse30 .cse11 .cse20 .cse21 .cse22 .cse37 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse41 .cse4 .cse6 .cse7 .cse18 .cse49 .cse9 .cse10 .cse11 .cse20 .cse21 .cse22 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse27 .cse41 .cse4 .cse28 .cse6 .cse49 .cse7 .cse18 .cse9 .cse10 .cse20 .cse21 .cse22 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse30 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse37 .cse23 .cse24 .cse25 .cse26) (and .cse4 .cse6 .cse28 .cse9 .cse0 .cse29 .cse2 .cse10 .cse11 .cse53 .cse31 .cse12 .cse32 .cse33 .cse14 .cse15 .cse34 .cse18 .cse20 .cse21 .cse22 .cse38 .cse39) (and .cse31 .cse1) (and .cse6 .cse7 (= ~e_wl~0 ~e_f~0) .cse9 .cse21 .cse22 .cse23 .cse31 .cse32 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse27 .cse28 .cse6 .cse7 .cse49 .cse9 .cse0 .cse30 .cse2 .cse10 .cse12 .cse33 .cse14 .cse15 .cse34 .cse35 .cse20 .cse21 .cse22 .cse38 .cse25 .cse26) (and .cse3 .cse27 .cse17 .cse6 .cse28 .cse7 .cse18 .cse9 .cse8 .cse30 .cse10 .cse45 .cse20 .cse21 .cse46 .cse22 .cse23 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse27 .cse41 .cse6 .cse28 .cse7 .cse18 .cse49 .cse9 .cse30 .cse20 .cse21 .cse22 .cse37 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse4 .cse6 .cse28 .cse0 .cse9 .cse29 .cse2 .cse11 .cse53 .cse31 .cse32 .cse33 .cse15 .cse34 .cse18 .cse36 .cse20 .cse22 .cse37 .cse54 .cse38 .cse39) (and .cse27 .cse4 .cse6 .cse28 .cse9 .cse0 .cse29 .cse2 .cse10 .cse53 .cse31 .cse12 .cse32 .cse33 .cse14 .cse15 .cse34 .cse35 .cse20 .cse21 .cse22 .cse38 .cse39) (and .cse4 .cse6 .cse28 .cse7 .cse49 .cse9 .cse0 .cse2 .cse10 .cse11 .cse53 .cse12 .cse33 .cse14 .cse15 .cse34 .cse18 .cse20 .cse21 .cse22 .cse38 .cse25 .cse26) (and .cse5 .cse51 .cse24 (or (and .cse3 .cse16 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse30 .cse10 .cse19 .cse11 .cse21 .cse22 .cse23 .cse38 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse30 .cse10 .cse45 .cse11 .cse46 .cse21 .cse22 .cse23 .cse38 .cse12 .cse25 .cse14 .cse26 .cse15)) .cse52) (and .cse3 .cse41 .cse6 .cse7 .cse18 .cse49 .cse9 .cse30 .cse10 .cse11 .cse21 .cse22 .cse23 .cse31 .cse44 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse40 .cse3 .cse6 .cse7 .cse8 .cse9 .cse43 .cse30 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse45 .cse46 .cse21 .cse47 .cse22 .cse23 .cse48 .cse38 .cse25 .cse26) (and .cse4 .cse6 .cse28 .cse7 .cse49 .cse0 .cse9 .cse2 .cse11 .cse53 .cse33 .cse15 .cse34 .cse18 .cse36 .cse20 .cse22 .cse37 .cse54 .cse38 .cse25 .cse26) (and .cse3 .cse28 .cse6 .cse7 .cse49 .cse0 .cse9 .cse30 .cse2 .cse11 .cse33 .cse14 .cse15 .cse34 .cse18 .cse36 .cse20 .cse21 .cse22 .cse37 .cse38 .cse25 .cse26) (and .cse3 .cse27 .cse4 .cse16 .cse17 .cse28 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse19 .cse20 .cse21 .cse22 .cse23 .cse12 .cse25 .cse14 .cse26 .cse15) (and .cse3 .cse6 .cse28 .cse9 .cse0 .cse29 .cse30 .cse2 .cse11 .cse31 .cse32 .cse33 .cse14 .cse15 .cse34 .cse18 .cse36 .cse20 .cse21 .cse22 .cse37 .cse38 .cse39) (and .cse27 .cse4 .cse6 .cse28 .cse0 .cse9 .cse29 .cse2 .cse53 .cse31 .cse32 .cse33 .cse15 .cse34 .cse35 .cse36 .cse20 .cse22 .cse37 .cse54 .cse38 .cse39)))) [2019-01-12 15:37:19,119 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 309) no Hoare annotation was computed. [2019-01-12 15:37:19,121 INFO L444 ceAbstractionStarter]: At program point L194-1(lines 175 215) the Hoare annotation is: (let ((.cse40 (+ ~t_b~0 1)) (.cse43 (+ ~t_b~0 2)) (.cse4 (= ~wl_pc~0 1)) (.cse10 (= ~e_f~0 ~e_e~0)) (.cse37 (= ~e_f~0 ~e_c~0)) (.cse21 (= ~c2_pc~0 1)) (.cse1 (= ~processed~0 0)) (.cse2 (= ~wb_i~0 1)) (.cse23 (= ~wb_pc~0 1)) (.cse3 (<= 2 ~wl_st~0)) (.cse29 (= ~wl_st~0 ~e_f~0)) (.cse5 (= 1 ~c2_i~0)) (.cse8 (<= 2 ~c1_st~0)) (.cse34 (<= 2 ~wb_st~0)) (.cse15 (<= 2 ~r_st~0)) (.cse16 (not (= 0 ~e_g~0))) (.cse17 (= 1 ~c1_i~0)) (.cse18 (<= ~c_req_up~0 0)) (.cse9 (= ~c1_pc~0 1)) (.cse19 (not (= ~e_e~0 1))) (.cse11 (not (= ~e_g~0 1))) (.cse20 (not (= 0 ~e_c~0))) (.cse12 (<= ~r_i~0 0))) (let ((.cse13 (= ~e_c~0 ~e_f~0)) (.cse33 (= ~wl_st~0 0)) (.cse35 (= ~wl_pc~0 0)) (.cse36 (= ~e_wl~0 ~e_c~0)) (.cse32 (or (and .cse2 .cse1 .cse3 .cse23 .cse4 .cse5 .cse8 .cse34 .cse15 .cse16 .cse17 .cse18 .cse9 .cse19 .cse10 .cse11 .cse20 .cse12 .cse37) (and .cse21 .cse1 .cse2 .cse23 .cse3 .cse29 .cse5 (= ~e_c~0 ~e_e~0) .cse8 .cse34 .cse15 .cse16 .cse17 .cse18 .cse9 .cse19 .cse11 .cse20 .cse12))) (.cse30 (<= .cse43 ~data~0)) (.cse31 (<= ~data~0 .cse43)) (.cse41 (<= .cse40 ~data~0)) (.cse28 (= ~wl_pc~0 2)) (.cse42 (<= ~data~0 .cse40)) (.cse22 (not (= ~e_f~0 1))) (.cse25 (not (= 0 ~e_e~0))) (.cse26 (<= 2 ~e_wl~0)) (.cse27 (not (= 0 ~e_f~0))) (.cse6 (<= ~t_b~0 ~data~0)) (.cse7 (<= ~data~0 ~t_b~0)) (.cse39 (= ~e_c~0 ~e_g~0)) (.cse0 (= ~wb_st~0 0)) (.cse14 (= ~wb_pc~0 0)) (.cse24 (= ~c1_st~0 0)) (.cse38 (= ~c1_pc~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 .cse21 .cse0 .cse22 .cse2 .cse1 .cse3 .cse23 .cse4 .cse5 .cse15 .cse16 .cse17 .cse24 .cse25 .cse26 .cse27 .cse9 .cse19 .cse11 .cse20 .cse12) (and .cse21 .cse0 .cse28 .cse2 .cse1 .cse3 .cse23 .cse5 .cse29 .cse8 .cse30 .cse15 .cse16 .cse31 .cse17 .cse25 .cse9 .cse19 .cse11 .cse20 .cse12) (and .cse32 .cse6 .cse7) (and .cse1 .cse6 (and .cse2 .cse23 .cse5 .cse33 .cse34 .cse15 .cse16 .cse17 .cse26 .cse18 .cse9 .cse35 .cse10 .cse11 .cse12 .cse36 .cse37) .cse7 .cse8) (and .cse2 .cse3 (= ~e_wl~0 ~e_f~0) .cse5 .cse16 .cse17 .cse25 .cse26 .cse35 .cse19 .cse11 .cse20 .cse12) (and .cse21 .cse22 .cse2 .cse3 .cse23 .cse4 .cse5 .cse8 .cse34 .cse15 .cse16 .cse17 .cse25 .cse26 .cse27 .cse9 .cse19 .cse11 .cse20 .cse12) (and .cse32 .cse26) (and (and .cse38 (or (and .cse21 .cse0 .cse14 .cse2 .cse5 .cse33 .cse15 .cse16 .cse17 .cse24 .cse18 .cse35 .cse10 .cse11 .cse12 .cse37 .cse36) (and .cse0 .cse2 .cse5 .cse33 .cse35 .cse10 .cse12 .cse13 .cse14 .cse15 .cse17 .cse24 .cse39 .cse18 .cse36))) .cse1 .cse26 .cse6 .cse7) (and .cse1 .cse6 (and (or (and .cse2 .cse5 .cse33 .cse34 .cse26 .cse35 .cse10 .cse12 .cse13 .cse23 .cse15 .cse17 .cse24 .cse39 .cse18 .cse36) (and .cse21 .cse2 .cse5 .cse33 .cse34 .cse26 .cse35 .cse10 .cse11 .cse12 .cse13 .cse23 .cse15 .cse16 .cse17 .cse24 .cse18 .cse36)) .cse38) .cse7) (and .cse21 .cse0 .cse22 .cse2 .cse1 .cse3 .cse23 .cse4 .cse5 .cse8 .cse15 .cse16 .cse17 .cse25 .cse26 .cse27 .cse9 .cse19 .cse11 .cse20 .cse12) (and (and .cse0 .cse14 .cse2 .cse5 .cse33 .cse15 .cse16 .cse17 .cse18 .cse9 .cse35 .cse10 .cse11 .cse12 .cse36 .cse37) .cse1 .cse26 .cse6 .cse7 .cse8) (and .cse32 .cse28) (and (and (<= .cse40 ~c_t~0) (<= ~c_t~0 .cse40) (or (and .cse21 .cse41 .cse28 .cse2 .cse3 .cse23 .cse29 .cse5 .cse8 .cse42 .cse34 .cse15 .cse16 .cse17 .cse25 .cse9 .cse19 .cse11 .cse20 .cse12) (and .cse21 .cse28 .cse2 .cse3 .cse23 .cse29 .cse5 .cse8 .cse30 .cse34 .cse31 .cse15 .cse16 .cse17 .cse25 .cse9 .cse19 .cse11 .cse20 .cse12))) (= ~c_req_up~0 1)) (and .cse21 .cse0 .cse41 .cse28 .cse2 .cse1 .cse3 .cse23 .cse5 .cse29 .cse42 .cse15 .cse16 .cse17 .cse24 .cse25 .cse9 .cse19 .cse11 .cse20 .cse12) (and .cse21 .cse22 .cse2 .cse1 .cse3 .cse23 .cse4 .cse5 .cse34 .cse15 .cse16 .cse17 .cse24 .cse25 .cse26 .cse27 .cse9 .cse19 .cse11 .cse20 .cse12) (and (and (or (and .cse21 .cse2 .cse3 .cse23 .cse4 .cse5 .cse34 .cse15 .cse16 .cse17 .cse24 .cse18 .cse19 .cse10 .cse11 .cse12 .cse37) (and .cse2 .cse3 .cse23 .cse4 .cse5 .cse34 .cse15 .cse17 .cse24 .cse39 .cse18 .cse10 .cse11 .cse12 .cse37)) .cse38) .cse1 .cse27 .cse6 .cse7) (and .cse1 .cse6 .cse7 (and (or (and .cse0 .cse14 .cse2 .cse3 .cse4 .cse5 .cse15 .cse17 .cse24 .cse39 .cse18 .cse10 .cse11 .cse20 .cse12 .cse37) (and .cse21 .cse0 .cse14 .cse2 .cse3 .cse4 .cse5 .cse15 .cse16 .cse17 .cse24 .cse18 .cse19 .cse10 .cse11 .cse20 .cse12 .cse37)) .cse38))))) [2019-01-12 15:37:19,126 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 66) no Hoare annotation was computed. [2019-01-12 15:37:19,127 INFO L448 ceAbstractionStarter]: For program point L657(lines 657 673) no Hoare annotation was computed. [2019-01-12 15:37:19,127 INFO L448 ceAbstractionStarter]: For program point L624-1(lines 535 675) no Hoare annotation was computed. [2019-01-12 15:37:19,127 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 367) no Hoare annotation was computed. [2019-01-12 15:37:19,127 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 535 675) no Hoare annotation was computed. [2019-01-12 15:37:19,128 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 464) no Hoare annotation was computed. [2019-01-12 15:37:19,128 INFO L444 ceAbstractionStarter]: At program point L262(lines 255 272) the Hoare annotation is: (let ((.cse27 (+ ~t_b~0 2))) (let ((.cse21 (= ~wb_st~0 0)) (.cse23 (= ~processed~0 0)) (.cse22 (= ~c2_st~0 0)) (.cse9 (<= 2 ~c1_st~0)) (.cse2 (= ~wl_pc~0 2)) (.cse19 (<= .cse27 ~data~0)) (.cse20 (<= ~data~0 .cse27)) (.cse14 (<= ~c_req_up~0 0)) (.cse0 (= ~c2_pc~0 1)) (.cse3 (= ~wb_i~0 1)) (.cse4 (<= 2 ~wl_st~0)) (.cse5 (= ~wb_pc~0 1)) (.cse24 (= ~wl_pc~0 1)) (.cse6 (= ~wl_st~0 ~e_f~0)) (.cse7 (= 1 ~c2_i~0)) (.cse8 (<= 2 ~c2_st~0)) (.cse10 (<= 2 ~wb_st~0)) (.cse11 (not (= 0 ~e_g~0))) (.cse12 (= 1 ~c1_i~0)) (.cse26 (= ~c1_st~0 0)) (.cse13 (not (= 0 ~e_e~0))) (.cse25 (<= 2 ~e_wl~0)) (.cse15 (= ~c1_pc~0 1)) (.cse16 (not (= ~e_g~0 1))) (.cse17 (not (= 0 ~e_c~0))) (.cse18 (<= ~r_i~0 0))) (or (let ((.cse1 (+ ~t_b~0 1))) (and (or (and .cse0 (<= .cse1 ~data~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~data~0 .cse1) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)) (<= ~d~0 .cse1) (<= .cse1 ~d~0) (<= .cse1 ~c_t~0) (<= .cse1 ~c~0) (<= ~c_t~0 .cse1) (<= ~c~0 .cse1))) (and .cse0 .cse21 .cse22 .cse23 .cse3 .cse24 .cse4 .cse5 .cse7 .cse6 .cse9 .cse11 .cse12 .cse13 .cse25 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse21 .cse3 .cse23 .cse4 .cse5 .cse24 .cse7 .cse6 .cse8 .cse11 .cse12 .cse26 .cse13 .cse25 .cse15 .cse16 .cse17 .cse18) (and .cse11 .cse12 .cse13 .cse3 .cse4 .cse25 (= ~e_wl~0 ~e_f~0) .cse7 (= ~wl_pc~0 0) .cse16 .cse17 .cse18) (and .cse0 .cse22 .cse3 .cse23 .cse4 .cse5 .cse24 .cse6 .cse7 .cse10 .cse11 .cse12 .cse26 .cse13 .cse25 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse21 .cse3 .cse23 .cse4 .cse5 .cse24 .cse7 .cse6 .cse8 .cse9 .cse11 .cse12 .cse13 .cse25 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse22 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse15 .cse16 .cse17 .cse18) (and .cse0 (not (= ~e_f~0 1)) .cse3 .cse4 .cse5 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 (not (= 0 ~e_f~0)) .cse15 .cse16 .cse17 .cse18) (and (<= .cse27 ~c_t~0) .cse0 .cse3 (<= .cse27 ~d~0) .cse4 .cse6 .cse7 (<= .cse27 ~c~0) .cse8 .cse9 .cse10 .cse15 .cse16 .cse18 (<= ~d~0 .cse27) .cse2 .cse5 .cse19 .cse20 .cse11 (<= ~c_t~0 .cse27) .cse12 .cse13 (<= ~c~0 .cse27) .cse14 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse26 .cse13 .cse25 .cse15 .cse16 .cse17 .cse18)))) [2019-01-12 15:37:19,128 INFO L448 ceAbstractionStarter]: For program point L296(lines 296 308) no Hoare annotation was computed. [2019-01-12 15:37:19,128 INFO L448 ceAbstractionStarter]: For program point L263(lines 255 272) no Hoare annotation was computed. [2019-01-12 15:37:19,128 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 205) no Hoare annotation was computed. [2019-01-12 15:37:19,128 INFO L448 ceAbstractionStarter]: For program point L197-1(lines 197 205) no Hoare annotation was computed. [2019-01-12 15:37:19,128 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 139) no Hoare annotation was computed. [2019-01-12 15:37:19,128 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 15:37:19,129 INFO L448 ceAbstractionStarter]: For program point L660(lines 660 672) no Hoare annotation was computed. [2019-01-12 15:37:19,129 INFO L448 ceAbstractionStarter]: For program point L495(lines 396 680) no Hoare annotation was computed. [2019-01-12 15:37:19,130 INFO L448 ceAbstractionStarter]: For program point L429-1(lines 396 680) no Hoare annotation was computed. [2019-01-12 15:37:19,130 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 337) no Hoare annotation was computed. [2019-01-12 15:37:19,130 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 268) no Hoare annotation was computed. [2019-01-12 15:37:19,130 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 202) no Hoare annotation was computed. [2019-01-12 15:37:19,130 INFO L448 ceAbstractionStarter]: For program point L496(lines 496 500) no Hoare annotation was computed. [2019-01-12 15:37:19,130 INFO L444 ceAbstractionStarter]: At program point L232-1(lines 220 247) the Hoare annotation is: (let ((.cse43 (+ ~t_b~0 1))) (let ((.cse31 (<= .cse43 ~c_t~0)) (.cse34 (<= .cse43 ~data~0)) (.cse37 (<= ~data~0 .cse43)) (.cse39 (<= ~c_t~0 .cse43)) (.cse32 (= ~wl_st~0 ~e_f~0)) (.cse33 (= ~c_req_up~0 1)) (.cse35 (= ~wl_pc~0 2)) (.cse13 (= ~c1_pc~0 0)) (.cse16 (= ~c1_st~0 0)) (.cse17 (= ~e_c~0 ~e_g~0)) (.cse22 (= ~wl_st~0 0)) (.cse25 (= ~wl_pc~0 0)) (.cse28 (= ~e_wl~0 ~e_c~0)) (.cse21 (= ~c2_pc~0 1)) (.cse41 (not (= ~e_f~0 1))) (.cse36 (= ~wb_pc~0 1)) (.cse23 (<= 2 ~c2_st~0)) (.cse38 (not (= 0 ~e_e~0))) (.cse24 (<= 2 ~e_wl~0)) (.cse42 (not (= 0 ~e_f~0))) (.cse0 (= ~c2_st~0 0)) (.cse1 (= ~wb_i~0 1)) (.cse2 (= ~processed~0 0)) (.cse3 (<= 2 ~wl_st~0)) (.cse4 (= ~wl_pc~0 1)) (.cse6 (= 1 ~c2_i~0)) (.cse5 (<= ~t_b~0 ~data~0)) (.cse7 (<= ~data~0 ~t_b~0)) (.cse29 (<= 2 ~c1_st~0)) (.cse8 (= ~c2_pc~0 0)) (.cse30 (= ~c1_pc~0 1)) (.cse9 (= ~e_f~0 ~e_e~0)) (.cse26 (not (= ~e_g~0 1))) (.cse10 (<= ~r_i~0 0)) (.cse11 (= ~e_c~0 ~e_f~0)) (.cse12 (= ~wb_pc~0 0)) (.cse14 (<= 2 ~r_st~0)) (.cse27 (not (= 0 ~e_g~0))) (.cse15 (= 1 ~c1_i~0)) (.cse18 (<= ~c_req_up~0 0)) (.cse19 (not (= ~e_e~0 1))) (.cse20 (not (= 0 ~e_c~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 .cse21 .cse1 .cse2 .cse6 .cse5 .cse22 .cse23 .cse7 .cse24 .cse25 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse18 .cse28) (and .cse21 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse23 .cse7 .cse29 .cse30 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14 .cse27 .cse15 .cse18 .cse19 .cse20) (and .cse21 .cse31 .cse1 .cse3 .cse32 .cse6 .cse23 .cse30 .cse33 .cse26 .cse10 .cse34 .cse35 .cse36 .cse37 .cse14 .cse27 .cse15 .cse16 .cse38 .cse39 .cse19 .cse20) (and .cse1 .cse3 (= ~e_wl~0 ~e_f~0) .cse6 .cse27 .cse15 .cse38 .cse24 .cse25 .cse19 .cse26 .cse20 .cse10) (and .cse21 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse18 .cse19 .cse20) (and .cse21 .cse0 .cse31 .cse1 .cse3 .cse32 .cse6 .cse29 .cse30 .cse33 .cse26 .cse10 .cse34 .cse35 .cse36 .cse37 .cse14 .cse27 .cse15 .cse38 .cse39 .cse19 .cse20) (and .cse21 .cse2 .cse1 .cse6 .cse5 .cse22 .cse23 .cse7 .cse29 .cse24 .cse30 .cse25 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14 .cse27 .cse15 .cse18 .cse28) (let ((.cse40 (+ ~t_b~0 2))) (and .cse21 (<= .cse40 ~c_t~0) .cse1 .cse3 .cse32 .cse6 .cse23 .cse29 .cse30 .cse33 .cse26 .cse10 .cse35 .cse36 (<= .cse40 ~data~0) .cse14 .cse27 (<= ~data~0 .cse40) (<= ~c_t~0 .cse40) .cse15 .cse38 .cse19 .cse20)) (and .cse21 .cse41 .cse1 .cse3 .cse36 .cse4 .cse6 .cse23 .cse14 .cse27 .cse15 .cse16 .cse38 .cse24 .cse42 .cse30 .cse19 .cse26 .cse20 .cse10) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse22 .cse7 .cse8 .cse24 .cse25 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28) (and .cse21 .cse41 .cse0 .cse1 .cse3 .cse36 .cse4 .cse6 .cse29 .cse14 .cse27 .cse15 .cse38 .cse24 .cse42 .cse30 .cse19 .cse26 .cse20 .cse10) (and .cse0 .cse2 .cse1 .cse6 .cse5 .cse22 .cse7 .cse29 .cse8 .cse24 .cse30 .cse25 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14 .cse27 .cse15 .cse18 .cse28) (and .cse21 .cse41 .cse1 .cse3 .cse36 .cse4 .cse6 .cse23 .cse29 .cse14 .cse27 .cse15 .cse38 .cse24 .cse42 .cse30 .cse19 .cse26 .cse20 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse29 .cse8 .cse30 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14 .cse27 .cse15 .cse18 .cse19 .cse20)))) [2019-01-12 15:37:19,133 INFO L448 ceAbstractionStarter]: For program point L629-1(lines 535 675) no Hoare annotation was computed. [2019-01-12 15:37:19,133 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 408) no Hoare annotation was computed. [2019-01-12 15:37:19,133 INFO L448 ceAbstractionStarter]: For program point L398-2(lines 396 680) no Hoare annotation was computed. [2019-01-12 15:37:19,133 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 307) no Hoare annotation was computed. [2019-01-12 15:37:19,135 INFO L448 ceAbstractionStarter]: For program point L233(line 233) no Hoare annotation was computed. [2019-01-12 15:37:19,135 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 138) no Hoare annotation was computed. [2019-01-12 15:37:19,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:37:19 BoogieIcfgContainer [2019-01-12 15:37:19,343 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:37:19,344 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:37:19,344 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:37:19,344 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:37:19,344 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:35:42" (3/4) ... [2019-01-12 15:37:19,352 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 15:37:19,377 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 15:37:19,378 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 15:37:19,574 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:37:19,574 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:37:19,575 INFO L168 Benchmark]: Toolchain (without parser) took 99189.15 ms. Allocated memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: 3.3 GB). Free memory was 951.3 MB in the beginning and 1.4 GB in the end (delta: -475.6 MB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-01-12 15:37:19,575 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:37:19,576 INFO L168 Benchmark]: CACSL2BoogieTranslator took 484.48 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 15:37:19,579 INFO L168 Benchmark]: Boogie Procedure Inliner took 151.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-01-12 15:37:19,579 INFO L168 Benchmark]: Boogie Preprocessor took 66.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:37:19,580 INFO L168 Benchmark]: RCFGBuilder took 1181.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:37:19,580 INFO L168 Benchmark]: TraceAbstraction took 97068.94 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.2 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -403.5 MB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2019-01-12 15:37:19,580 INFO L168 Benchmark]: Witness Printer took 230.42 ms. Allocated memory is still 4.3 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 66.6 MB). Peak memory consumption was 66.6 MB. Max. memory is 11.5 GB. [2019-01-12 15:37:19,587 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 484.48 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 151.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1181.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 97068.94 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.2 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -403.5 MB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. * Witness Printer took 230.42 ms. Allocated memory is still 4.3 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 66.6 MB). Peak memory consumption was 66.6 MB. Max. memory is 11.5 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: 1 == c2_i - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((t_b <= data && (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && e_c == e_e) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && data <= t_b) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && t_b + 1 <= c_t) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && t_b + 1 <= data) && wl_pc == 2) && wb_pc == 1) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_t <= t_b + 1) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_pc == 1 && wb_st == 0) && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && !(e_f == 1)) && wb_i == 1) && t_b + 2 <= d) && t_b + 2 <= c) && 1 == c2_i) && wl_st == 0) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && !(0 == e_f)) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && d <= t_b + 2) && wl_pc == 2) && wb_pc == 1) && t_b + 2 <= data) && data <= t_b + 2) && 2 <= r_st) && !(0 == e_g)) && c_t <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && wl_pc == 2) && wb_pc == 1) && t_b + 2 <= data) && data <= t_b + 2) && 2 <= r_st) && !(0 == e_g)) && c_t <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && !(e_e == 1)) && !(0 == e_c))) || (wl_pc == 2 && (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && e_c == e_e) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)))) || ((((((d <= t_b + 1 && t_b + 1 <= d) && t_b + 1 <= c_t) && (((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && wb_pc == 1) && 1 == c2_i) && wl_st == 0) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b + 1) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && !(0 == e_f)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wl_pc == 2) && wb_i == 1) && wb_pc == 1) && 1 == c2_i) && wl_st == 0) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && !(0 == e_f)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && t_b + 1 <= c) && c_t <= t_b + 1) && c <= t_b + 1)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_st == e_f) && t_b <= data) && 1 == c2_i) && data <= t_b) && 2 <= wb_st) && data <= t) && t <= data) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && wl_pc == 2) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((wb_st == 0 && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && data <= t_b) && c2_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((t_b + 1 <= c_t && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((((c2_pc == 1 && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b + 1) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && c_req_up == 1)) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && t_b <= data) && wl_st == 0) && e_c == e_e) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && wb_st == 0) && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && wl_st == e_f) && 2 <= c2_st) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((wb_st == 0 && c2_st == 0) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && data <= t_b) && 2 <= c1_st) && c2_pc == 0) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && wb_st == 0) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && 2 <= c2_st) && data <= t_b) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && !(e_f == 1)) && c2_st == 0) && processed == 0) && wb_i == 1) && wl_pc == 1) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && 2 <= c1_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && t_b + 1 <= data) && wl_pc == 2) && wb_pc == 1) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && c_t <= t_b + 1) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || (2 <= e_wl && (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && e_c == e_e) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)))) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && 1 == c2_i) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && wl_pc == 0) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && wb_st == 0) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && t_b <= data) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && wl_pc == 2) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && wl_st == e_f) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= r_st) && !(0 == e_g)) && data <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 1 == c2_i) && wl_st == 0) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((wb_st == 0 && c2_st == 0) && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && data <= t_b) && 2 <= c1_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && t_b <= data) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c2_pc == 0) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((t_b + 1 <= c_t && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b + 1) && 2 <= wb_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((((c2_pc == 1 && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= wb_st) && data <= t_b + 2) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && c <= t_b + 1)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && t_b + 2 <= c) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && wl_pc == 2) && wb_pc == 1) && t_b + 2 <= data) && data <= t_b + 2) && !(0 == e_g)) && c_t <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && c2_st == 0) && t_b + 1 <= data) && wl_pc == 2) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c1_st) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && e_wl == e_c)) || (((((((((((((((((((((wb_st == 0 && c2_st == 0) && wb_i == 1) && processed == 0) && t_b <= data) && 1 == c2_i) && wl_st == 0) && data <= t_b) && c2_pc == 0) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_wl == e_c) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((((((c2_pc == 0 && processed == 0) && 2 <= e_wl) && t_b <= data) && ((((((((((((((c2_st == 0 && wb_i == 1) && wb_pc == 1) && 1 == c2_i) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && e_f == e_e) && r_i <= 0) && !(0 == e_c)) && !(e_g == 1)) && e_f == e_c) && data <= t_b) && 2 <= c1_st) || ((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 1 == c2_i) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((wb_st == 0 && c2_st == 0) && wb_pc == 0) && wb_i == 1) && 1 == c2_i) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && e_f == e_e) && r_i <= 0) && !(e_g == 1)) && e_f == e_c) && c2_pc == 0) && processed == 0) && 2 <= e_wl) && !(0 == e_f)) && t_b <= data) && data <= t_b) && 2 <= c1_st)) || (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && wb_pc == 1) && 1 == c2_i) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && e_f == e_e) && r_i <= 0) && !(e_g == 1)) && e_f == e_c) && processed == 0) && 2 <= e_wl) && !(0 == e_f)) && t_b <= data) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st)) || ((((((((((((((((((((wb_st == 0 && c2_st == 0) && wb_i == 1) && processed == 0) && t_b <= data) && 1 == c2_i) && data <= t_b) && c2_pc == 0) && 2 <= e_wl) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && wb_pc == 0) && wb_i == 1) && 1 == c2_i) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && e_f == e_e) && r_i <= 0) && !(e_g == 1)) && e_f == e_c) && processed == 0) && 2 <= e_wl) && !(0 == e_f)) && t_b <= data) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st)) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && wb_pc == 0) && wb_i == 1) && 1 == c2_i) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && e_f == e_e) && r_i <= 0) && !(e_g == 1)) && e_f == e_c) && processed == 0) && 2 <= e_wl) && !(0 == e_f)) && t_b <= data) && c1_pc == 0) && 2 <= c2_st) && data <= t_b)) || (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && wb_pc == 1) && 1 == c2_i) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && e_f == e_e) && r_i <= 0) && !(e_g == 1)) && e_f == e_c) && processed == 0) && 2 <= e_wl) && !(0 == e_f)) && t_b <= data) && c1_pc == 0) && 2 <= c2_st) && data <= t_b) - InvariantResult [Line: 682]: Loop Invariant Derived loop invariant: 1 == c2_i - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((t_b <= data && (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && e_c == e_e) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && data <= t_b) || (((t_b + 1 <= c_t && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((((c2_pc == 1 && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b + 1) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && c_req_up == 1)) || ((((t_b + 1 <= c_t && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b + 1) && 2 <= wb_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((((c2_pc == 1 && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= wb_st) && data <= t_b + 2) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && c <= t_b + 1)) || (((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && wl_pc == 2) && wb_pc == 1) && t_b + 2 <= data) && data <= t_b + 2) && 2 <= r_st) && !(0 == e_g)) && c_t <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && !(e_e == 1)) && !(0 == e_c))) || (2 <= e_wl && (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && e_c == e_e) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)))) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && 1 == c2_i) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && wl_pc == 0) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (wl_pc == 2 && (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && e_c == e_e) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)))) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && t_b + 2 <= c) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && wl_pc == 2) && wb_pc == 1) && t_b + 2 <= data) && data <= t_b + 2) && !(0 == e_g)) && c_t <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c)) - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b + 1) && 2 <= wb_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_req_up <= 0) && c1_pc == 1) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || (((((((((((((((((((c2_pc == 1 && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= wb_st) && data <= t_b + 2) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_req_up <= 0) && c1_pc == 1) && !(e_g == 1)) && !(0 == e_c)) && 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) && c <= t_b + 1) || ((((((((((((((((((c2_pc == 1 && wb_st == 0) && c2_st == 0) && processed == 0) && wb_i == 1) && wl_pc == 1) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && wl_st == e_f) && 2 <= c1_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((c2_pc == 1 && wb_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && wl_st == e_f) && 2 <= c2_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((!(0 == e_g) && 1 == c1_i) && !(0 == e_e)) && wb_i == 1) && 2 <= wl_st) && 2 <= e_wl) && e_wl == e_f) && 1 == c2_i) && wl_pc == 0) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((c2_pc == 1 && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= wb_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((c2_pc == 1 && wb_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && wl_st == e_f) && 2 <= c2_st) && 2 <= c1_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((c2_pc == 1 && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c1_st) && 2 <= wb_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && wb_i == 1) && t_b + 2 <= d) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && t_b + 2 <= c) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && d <= t_b + 2) && wl_pc == 2) && wb_pc == 1) && t_b + 2 <= data) && data <= t_b + 2) && !(0 == e_g)) && c_t <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && c <= t_b + 2) && c_req_up <= 0) && !(0 == e_c))) || (((((((((((((((((c2_pc == 1 && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= wb_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && t_b + 1 <= c_t) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && t_b + 1 <= data) && wl_pc == 2) && wb_pc == 1) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_t <= t_b + 1) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_pc == 1 && wb_st == 0) && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && !(e_f == 1)) && wb_i == 1) && t_b + 2 <= d) && t_b + 2 <= c) && 1 == c2_i) && wl_st == 0) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && !(0 == e_f)) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && d <= t_b + 2) && wl_pc == 2) && wb_pc == 1) && t_b + 2 <= data) && data <= t_b + 2) && 2 <= r_st) && !(0 == e_g)) && c_t <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && !(e_f == 1)) && c2_st == 0) && processed == 0) && wb_i == 1) && wl_pc == 1) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && 2 <= c1_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && t_b + 1 <= data) && wl_pc == 2) && wb_pc == 1) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && c_t <= t_b + 1) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && 1 == c2_i) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && wl_pc == 0) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && wb_st == 0) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && t_b <= data) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((((d <= t_b + 1 && t_b + 1 <= d) && t_b + 1 <= c_t) && (((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && wb_pc == 1) && 1 == c2_i) && wl_st == 0) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b + 1) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && !(0 == e_f)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wl_pc == 2) && wb_i == 1) && wb_pc == 1) && 1 == c2_i) && wl_st == 0) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && !(0 == e_f)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && t_b + 1 <= c) && c_t <= t_b + 1) && c <= t_b + 1)) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && wl_pc == 2) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && wl_st == e_f) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= r_st) && !(0 == e_g)) && data <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 1 == c2_i) && wl_st == 0) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_wl == e_c)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_st == e_f) && t_b <= data) && 1 == c2_i) && data <= t_b) && 2 <= wb_st) && data <= t) && t <= data) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && wl_pc == 2) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((wb_st == 0 && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && data <= t_b) && c2_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((wb_st == 0 && c2_st == 0) && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && data <= t_b) && 2 <= c1_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && t_b <= data) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c2_pc == 0) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && t_b <= data) && wl_st == 0) && e_c == e_e) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((t_b + 1 <= c_t && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b + 1) && 2 <= wb_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((((c2_pc == 1 && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= wb_st) && data <= t_b + 2) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && c <= t_b + 1)) || ((((((((((((((((((((((c2_pc == 1 && wb_st == 0) && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && wl_st == e_f) && 2 <= c2_st) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((wb_st == 0 && c2_st == 0) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && data <= t_b) && 2 <= c1_st) && c2_pc == 0) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && t_b + 2 <= c) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && wl_pc == 2) && wb_pc == 1) && t_b + 2 <= data) && data <= t_b + 2) && !(0 == e_g)) && c_t <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_pc == 1 && wb_st == 0) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && 2 <= c2_st) && data <= t_b) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && c2_st == 0) && t_b + 1 <= data) && wl_pc == 2) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c1_st) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && e_wl == e_c)) || (((((((((((((((((((((wb_st == 0 && c2_st == 0) && wb_i == 1) && processed == 0) && t_b <= data) && 1 == c2_i) && wl_st == 0) && data <= t_b) && c2_pc == 0) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_wl == e_c) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((((t_b + 2 <= c_t && t_b + 2 <= data) && data <= t_b + 2) && c_t <= t_b + 2) && d <= t_b + 2) && wl_pc == 2) && ((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && wb_pc == 1) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) || (((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && wb_pc == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1))) || (((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wb_st) && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1))) || (((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && wb_pc == 1) && 2 <= c2_st) && 2 <= wb_st) && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)))) && c <= t_b + 2) && t_b + 2 <= d) && !(0 == e_f)) && t_b + 2 <= c) || ((((((d <= t_b + 1 && t_b + 1 <= d) && t_b + 1 <= c_t) && (((((data <= t_b + 1 && t_b + 1 <= data) && wl_pc == 2) && ((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && wb_pc == 1) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) || (((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && wb_pc == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1))) || (((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wb_st) && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1))) || (((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && wb_pc == 1) && 2 <= c2_st) && 2 <= wb_st) && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)))) && !(0 == e_f)) || ((((t_b + 2 <= data && data <= t_b + 2) && wl_pc == 2) && ((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && wb_pc == 1) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) || (((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && wb_pc == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1))) || (((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wb_st) && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1))) || (((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && wb_pc == 1) && 2 <= c2_st) && 2 <= wb_st) && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)))) && !(0 == e_f)))) && t_b + 1 <= c) && c_t <= t_b + 1) && c <= t_b + 1) - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((((c2_pc == 1 && wb_st == 0) && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && wl_st == e_f) && 2 <= c2_st) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && t_b + 1 <= data) && wl_pc == 2) && wb_pc == 1) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_t <= t_b + 1) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && wb_st == 0) && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_st == e_f) && t_b <= data) && 1 == c2_i) && data <= t_b) && 2 <= wb_st) && data <= t) && t <= data) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && wl_pc == 2) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && 1 == c2_i) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && wl_pc == 0) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && data <= t_b) && c2_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c)) || (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && e_wl == e_c)) || (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && t_b <= data) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && t_b + 1 <= data) && wl_pc == 2) && wb_pc == 1) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && c_t <= t_b + 1) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && 1 == c2_i) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && wl_pc == 0) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && 2 <= c2_st) && data <= t_b) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && t_b + 1 <= c_t) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && 2 <= c1_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && t_b + 1 <= data) && wl_pc == 2) && wb_pc == 1) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_t <= t_b + 1) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && t_b + 2 <= c_t) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && wl_pc == 2) && wb_pc == 1) && t_b + 2 <= data) && 2 <= r_st) && !(0 == e_g)) && data <= t_b + 2) && c_t <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 1 == c2_i) && wl_st == 0) && data <= t_b) && c2_pc == 0) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_wl == e_c)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c1_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((c2_st == 0 && processed == 0) && wb_i == 1) && 1 == c2_i) && t_b <= data) && wl_st == 0) && data <= t_b) && 2 <= c1_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && t_b <= data) && data <= t_b) && 2 <= c1_st) && c2_pc == 0) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c)) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((t_b <= data && (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && e_c == e_e) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && data <= t_b) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && t_b + 1 <= c_t) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && t_b + 1 <= data) && wl_pc == 2) && wb_pc == 1) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_t <= t_b + 1) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_pc == 1 && wb_st == 0) && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && !(e_f == 1)) && wb_i == 1) && t_b + 2 <= d) && t_b + 2 <= c) && 1 == c2_i) && wl_st == 0) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && !(0 == e_f)) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && d <= t_b + 2) && wl_pc == 2) && wb_pc == 1) && t_b + 2 <= data) && data <= t_b + 2) && 2 <= r_st) && !(0 == e_g)) && c_t <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (wl_pc == 2 && (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && e_c == e_e) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)))) || ((((((d <= t_b + 1 && t_b + 1 <= d) && t_b + 1 <= c_t) && (((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && wb_pc == 1) && 1 == c2_i) && wl_st == 0) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b + 1) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && !(0 == e_f)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wl_pc == 2) && wb_i == 1) && wb_pc == 1) && 1 == c2_i) && wl_st == 0) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && !(0 == e_f)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && t_b + 1 <= c) && c_t <= t_b + 1) && c <= t_b + 1)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_st == e_f) && t_b <= data) && 1 == c2_i) && data <= t_b) && 2 <= wb_st) && data <= t) && t <= data) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && wl_pc == 2) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((wb_st == 0 && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && data <= t_b) && c2_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((t_b + 1 <= c_t && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((((c2_pc == 1 && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b + 1) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && c_req_up == 1)) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && t_b <= data) && wl_st == 0) && e_c == e_e) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && wb_st == 0) && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && wl_st == e_f) && 2 <= c2_st) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((wb_st == 0 && c2_st == 0) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && data <= t_b) && 2 <= c1_st) && c2_pc == 0) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && wb_st == 0) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && 2 <= c2_st) && data <= t_b) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && !(e_f == 1)) && c2_st == 0) && processed == 0) && wb_i == 1) && wl_pc == 1) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && 2 <= c1_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && t_b + 1 <= data) && wl_pc == 2) && wb_pc == 1) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && c_t <= t_b + 1) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || (2 <= e_wl && (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && e_c == e_e) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)))) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && 1 == c2_i) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && wl_pc == 0) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && wb_st == 0) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && t_b <= data) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && wl_pc == 2) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && wl_st == e_f) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= r_st) && !(0 == e_g)) && data <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 1 == c2_i) && wl_st == 0) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((wb_st == 0 && c2_st == 0) && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && data <= t_b) && 2 <= c1_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && t_b <= data) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c2_pc == 0) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((t_b + 1 <= c_t && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b + 1) && 2 <= wb_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((((c2_pc == 1 && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= wb_st) && data <= t_b + 2) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && c <= t_b + 1)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && t_b + 2 <= c) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && wl_pc == 2) && wb_pc == 1) && t_b + 2 <= data) && data <= t_b + 2) && !(0 == e_g)) && c_t <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && c2_st == 0) && t_b + 1 <= data) && wl_pc == 2) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c1_st) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && e_wl == e_c)) || (((((((((((((((((((((wb_st == 0 && c2_st == 0) && wb_i == 1) && processed == 0) && t_b <= data) && 1 == c2_i) && wl_st == 0) && data <= t_b) && c2_pc == 0) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_wl == e_c) - InvariantResult [Line: 579]: Loop Invariant Derived loop invariant: (((((((t_b + 1 <= c_t && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b + 1) && 2 <= wb_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((((c2_pc == 1 && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= wb_st) && data <= t_b + 2) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && c <= t_b + 1) || (((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && 1 == c2_i) && e_c == e_e) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && t_b + 2 <= c) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && wl_pc == 2) && wb_pc == 1) && t_b + 2 <= data) && data <= t_b + 2) && !(0 == e_g)) && c_t <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && 1 == c2_i) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && wl_pc == 0) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c2_pc == 0 && processed == 0) && 2 <= e_wl) && t_b <= data) && ((((((((((((((c2_st == 0 && wb_i == 1) && wb_pc == 1) && 1 == c2_i) && wl_st == 0) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c) && e_f == e_c) && data <= t_b) || (((((processed == 0 && ((((((((((((((c2_pc == 1 && wb_st == 0) && wb_pc == 0) && wb_i == 1) && wl_pc == 1) && 2 <= wl_st) && 1 == c2_i) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_f == e_c) && !(0 == e_f)) && t_b <= data) && 2 <= c2_st) && data <= t_b)) || ((((((((((((((((((((c2_pc == 1 && wb_st == 0) && !(e_f == 1)) && c2_st == 0) && processed == 0) && wb_i == 1) && wl_pc == 1) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) && 2 <= e_wl)) || (2 <= e_wl && (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && e_c == e_e) && 2 <= c2_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && e_f == e_e) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) && e_f == e_c)))) || ((((((((((((((((((((c2_pc == 1 && wb_st == 0) && processed == 0) && wb_i == 1) && t_b <= data) && 1 == c2_i) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && 1 == c2_i) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && wl_pc == 0) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && wb_st == 0) && wl_pc == 2) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && wl_st == e_f) && 2 <= c2_st) && t_b + 2 <= data) && 2 <= r_st) && !(0 == e_g)) && data <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && wb_st == 0) && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((c2_pc == 0 && processed == 0) && t_b <= data) && (((((((((((((((c2_st == 0 && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && e_f == e_e) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) && e_f == e_c) && data <= t_b)) || ((((((((((((((((((((c2_pc == 1 && wb_st == 0) && c2_st == 0) && t_b + 1 <= data) && wl_pc == 2) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (wl_pc == 2 && (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && e_c == e_e) && 2 <= c2_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && e_f == e_e) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) && e_f == e_c)))) || ((((processed == 0 && t_b <= data) && (((((((((((((((c2_pc == 1 && wb_i == 1) && wb_pc == 1) && 1 == c2_i) && wl_st == 0) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && 2 <= e_wl) && c_req_up <= 0) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c) && e_f == e_c) && 2 <= c2_st) && data <= t_b)) || ((((((((((((((((((((wb_st == 0 && c2_st == 0) && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && data <= t_b) && c2_pc == 0) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || ((t_b <= data && (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && e_c == e_e) && 2 <= c2_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && e_f == e_e) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) && e_f == e_c))) && data <= t_b)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((t_b + 1 <= c_t && ((((((((((((((((((((c2_pc == 1 && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && data <= t_b + 1) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || (((((((((((((((((((c2_pc == 1 && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && t_b + 2 <= data) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && c_t <= t_b + 1) && c_req_up == 1)) || ((((((((((((((((((((wb_st == 0 && c2_st == 0) && wb_pc == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_f == e_c) && c2_pc == 0) && processed == 0) && !(0 == e_f)) && t_b <= data) && data <= t_b) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((((c2_pc == 1 && wb_st == 0) && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c1_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_st == e_f) && t_b <= data) && 1 == c2_i) && data <= t_b) && 2 <= wb_st) && data <= t) && t <= data) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && wl_pc == 2) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((c2_pc == 1 && wb_st == 0) && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && wl_st == e_f) && 2 <= c1_st) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && t_b + 1 <= data) && wl_pc == 2) && wb_pc == 1) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_t <= t_b + 1) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && 1 == c2_i) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && wl_pc == 0) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((t_b <= data && (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && e_c == e_e) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && data <= t_b) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && t_b + 1 <= c_t) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && t_b + 1 <= data) && wl_pc == 2) && wb_pc == 1) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_t <= t_b + 1) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_pc == 1 && wb_st == 0) && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && !(e_f == 1)) && wb_i == 1) && t_b + 2 <= d) && t_b + 2 <= c) && 1 == c2_i) && wl_st == 0) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && !(0 == e_f)) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && d <= t_b + 2) && wl_pc == 2) && wb_pc == 1) && t_b + 2 <= data) && data <= t_b + 2) && 2 <= r_st) && !(0 == e_g)) && c_t <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && wl_pc == 2) && wb_pc == 1) && t_b + 2 <= data) && data <= t_b + 2) && 2 <= r_st) && !(0 == e_g)) && c_t <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && !(e_e == 1)) && !(0 == e_c))) || (wl_pc == 2 && (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && e_c == e_e) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)))) || ((((((d <= t_b + 1 && t_b + 1 <= d) && t_b + 1 <= c_t) && (((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && wb_pc == 1) && 1 == c2_i) && wl_st == 0) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b + 1) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && !(0 == e_f)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wl_pc == 2) && wb_i == 1) && wb_pc == 1) && 1 == c2_i) && wl_st == 0) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && !(0 == e_f)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && t_b + 1 <= c) && c_t <= t_b + 1) && c <= t_b + 1)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_st == e_f) && t_b <= data) && 1 == c2_i) && data <= t_b) && 2 <= wb_st) && data <= t) && t <= data) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && wl_pc == 2) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((wb_st == 0 && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && data <= t_b) && c2_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((t_b + 1 <= c_t && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((((c2_pc == 1 && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b + 1) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && c_req_up == 1)) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && t_b <= data) && wl_st == 0) && e_c == e_e) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && wb_st == 0) && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && wl_st == e_f) && 2 <= c2_st) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((wb_st == 0 && c2_st == 0) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && data <= t_b) && 2 <= c1_st) && c2_pc == 0) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && wb_st == 0) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && 2 <= c2_st) && data <= t_b) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && !(e_f == 1)) && c2_st == 0) && processed == 0) && wb_i == 1) && wl_pc == 1) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && 2 <= c1_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && t_b + 1 <= data) && wl_pc == 2) && wb_pc == 1) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && c_t <= t_b + 1) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || (2 <= e_wl && (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && e_c == e_e) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)))) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && 1 == c2_i) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && wl_pc == 0) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && wb_st == 0) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && t_b <= data) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && wl_pc == 2) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && wl_st == e_f) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= r_st) && !(0 == e_g)) && data <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 1 == c2_i) && wl_st == 0) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((wb_st == 0 && c2_st == 0) && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && data <= t_b) && 2 <= c1_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && t_b <= data) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c2_pc == 0) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((t_b + 1 <= c_t && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b + 1) && 2 <= wb_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((((c2_pc == 1 && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= wb_st) && data <= t_b + 2) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && c <= t_b + 1)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && t_b + 2 <= c) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && wl_pc == 2) && wb_pc == 1) && t_b + 2 <= data) && data <= t_b + 2) && !(0 == e_g)) && c_t <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && c2_st == 0) && t_b + 1 <= data) && wl_pc == 2) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c1_st) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && e_wl == e_c)) || (((((((((((((((((((((wb_st == 0 && c2_st == 0) && wb_i == 1) && processed == 0) && t_b <= data) && 1 == c2_i) && wl_st == 0) && data <= t_b) && c2_pc == 0) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_wl == e_c) - InvariantResult [Line: 459]: Loop Invariant Derived loop invariant: (((((((((((((((((((((wb_st == 0 && c2_st == 0) && wb_i == 1) && processed == 0) && t_b <= data) && 1 == c2_i) && wl_st == 0) && data <= t_b) && c2_pc == 0) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_wl == e_c) || (((((((((((((wb_st == 0 && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && e_wl == e_f) && 1 == c2_i) && e_f == e_g) && 1 == c1_i) && c1_st == 0) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && !(0 == e_c)) && r_i <= 0) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((wb_st == 0 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && t_b <= data) && data <= t_b) && 2 <= c1_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c)) || ((((((((((((((((((((c2_pc == 1 && wb_st == 0) && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && wb_st == 0) && wl_pc == 2) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && wl_st == e_f) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= r_st) && !(0 == e_g)) && data <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((wb_i == 1 && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && e_f == e_e) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) && e_f == e_c) || ((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && e_c == e_e) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) && t_b <= data) && data <= t_b)) || ((((processed == 0 && t_b <= data) && (((((((((((((((wb_i == 1 && wb_pc == 1) && 1 == c2_i) && wl_st == 0) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && 2 <= e_wl) && c_req_up <= 0) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c) && e_f == e_c) && data <= t_b) && 2 <= c1_st)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && 1 == c2_i) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && wl_pc == 0) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((wb_i == 1 && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && e_f == e_e) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) && e_f == e_c) || ((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && e_c == e_e) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) && 2 <= e_wl)) || (((((c1_pc == 0 && (((((((((((((((((c2_pc == 1 && wb_st == 0) && wb_pc == 0) && wb_i == 1) && 1 == c2_i) && wl_st == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_f == e_c) && e_wl == e_c) || ((((((((((((((wb_st == 0 && wb_i == 1) && 1 == c2_i) && wl_st == 0) && wl_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_wl == e_c))) && processed == 0) && 2 <= e_wl) && t_b <= data) && data <= t_b)) || (((processed == 0 && t_b <= data) && ((((((((((((((((wb_i == 1 && 1 == c2_i) && wl_st == 0) && 2 <= wb_st) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_wl == e_c) || (((((((((((((((((c2_pc == 1 && wb_i == 1) && 1 == c2_i) && wl_st == 0) && 2 <= wb_st) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && e_wl == e_c)) && c1_pc == 0) && data <= t_b)) || ((((((((((((((((((((c2_pc == 1 && wb_st == 0) && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c1_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((wb_st == 0 && wb_pc == 0) && wb_i == 1) && 1 == c2_i) && wl_st == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c) && e_f == e_c) && processed == 0) && 2 <= e_wl) && t_b <= data) && data <= t_b) && 2 <= c1_st)) || ((((((((((((((((((((wb_i == 1 && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && e_f == e_e) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) && e_f == e_c) || ((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && e_c == e_e) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) && wl_pc == 2)) || (((t_b + 1 <= c_t && c_t <= t_b + 1) && ((((((((((((((((((((c2_pc == 1 && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c1_st) && data <= t_b + 1) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || (((((((((((((((((((c2_pc == 1 && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && c_req_up == 1)) || ((((((((((((((((((((c2_pc == 1 && wb_st == 0) && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && wl_st == e_f) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_f == e_c) || ((((((((((((((wb_i == 1 && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= wb_st) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_f == e_c)) && c1_pc == 0) && processed == 0) && !(0 == e_f)) && t_b <= data) && data <= t_b)) || (((processed == 0 && t_b <= data) && data <= t_b) && ((((((((((((((((wb_st == 0 && wb_pc == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_f == e_e) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) && e_f == e_c) || (((((((((((((((((c2_pc == 1 && wb_st == 0) && wb_pc == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && e_f == e_e) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) && e_f == e_c)) && c1_pc == 0) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((c2_pc == 1 && wl_pc == 2) && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && data <= t_b + 2) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((((c2_pc == 1 && t_b + 1 <= data) && wl_pc == 2) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && wl_st == e_f) && 2 <= c2_st) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && processed == 0) && wb_i == 1) && wb_pc == 1) && wl_pc == 1) && 2 <= wl_st) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && 1 == c2_i) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && wl_pc == 0) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && c2_st == 0) && t_b + 1 <= data) && wl_pc == 2) && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && 2 <= c1_st) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && processed == 0) && wb_i == 1) && wb_pc == 1) && wl_pc == 1) && 2 <= wl_st) && 1 == c2_i) && 2 <= c1_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) && 2 <= e_wl) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((t_b <= data && (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && e_c == e_e) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && data <= t_b) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && t_b + 1 <= c_t) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && t_b + 1 <= data) && wl_pc == 2) && wb_pc == 1) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_t <= t_b + 1) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_pc == 1 && wb_st == 0) && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && !(e_f == 1)) && wb_i == 1) && t_b + 2 <= d) && t_b + 2 <= c) && 1 == c2_i) && wl_st == 0) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && !(0 == e_f)) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && d <= t_b + 2) && wl_pc == 2) && wb_pc == 1) && t_b + 2 <= data) && data <= t_b + 2) && 2 <= r_st) && !(0 == e_g)) && c_t <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (wl_pc == 2 && (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && e_c == e_e) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)))) || ((((((d <= t_b + 1 && t_b + 1 <= d) && t_b + 1 <= c_t) && (((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && wb_pc == 1) && 1 == c2_i) && wl_st == 0) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b + 1) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && !(0 == e_f)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wl_pc == 2) && wb_i == 1) && wb_pc == 1) && 1 == c2_i) && wl_st == 0) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && !(0 == e_f)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && t_b + 1 <= c) && c_t <= t_b + 1) && c <= t_b + 1)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_st == e_f) && t_b <= data) && 1 == c2_i) && data <= t_b) && 2 <= wb_st) && data <= t) && t <= data) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && wl_pc == 2) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((wb_st == 0 && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && data <= t_b) && c2_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((t_b + 1 <= c_t && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((((c2_pc == 1 && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b + 1) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && c_req_up == 1)) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && t_b <= data) && wl_st == 0) && e_c == e_e) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && wb_st == 0) && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && wl_st == e_f) && 2 <= c2_st) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((wb_st == 0 && c2_st == 0) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && data <= t_b) && 2 <= c1_st) && c2_pc == 0) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && wb_st == 0) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && 2 <= c2_st) && data <= t_b) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && !(e_f == 1)) && c2_st == 0) && processed == 0) && wb_i == 1) && wl_pc == 1) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && 2 <= c1_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && t_b + 1 <= data) && wl_pc == 2) && wb_pc == 1) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && c_t <= t_b + 1) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || (2 <= e_wl && (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && wb_pc == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && e_c == e_e) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)))) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && 1 == c2_i) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && wl_pc == 0) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && wb_st == 0) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && t_b <= data) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && wl_pc == 2) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && 1 == c2_i) && wl_st == e_f) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= r_st) && !(0 == e_g)) && data <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 1 == c2_i) && wl_st == 0) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((wb_st == 0 && c2_st == 0) && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && data <= t_b) && 2 <= c1_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_pc == 1) && 1 == c2_i) && t_b <= data) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c2_pc == 0) && c1_pc == 1) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((t_b + 1 <= c_t && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && t_b + 1 <= data) && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b + 1) && 2 <= wb_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0) || ((((((((((((((((((((c2_pc == 1 && wl_pc == 2) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && t_b + 2 <= data) && 2 <= wb_st) && data <= t_b + 2) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0))) && c <= t_b + 1)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_pc == 1) && 1 == c2_i) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && 2 <= e_wl) && !(0 == e_f)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && wb_i == 1) && 2 <= wl_st) && wl_st == e_f) && 1 == c2_i) && t_b + 2 <= c) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && wl_pc == 2) && wb_pc == 1) && t_b + 2 <= data) && data <= t_b + 2) && !(0 == e_g)) && c_t <= t_b + 2) && 1 == c1_i) && !(0 == e_e)) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && wl_pc == 1) && t_b <= data) && 1 == c2_i) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && !(0 == e_c))) || (((((((((((((((((((((c2_pc == 1 && wb_st == 0) && c2_st == 0) && t_b + 1 <= data) && wl_pc == 2) && processed == 0) && wb_i == 1) && 2 <= wl_st) && wb_pc == 1) && wl_st == e_f) && 1 == c2_i) && 2 <= c1_st) && data <= t_b + 1) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && !(0 == e_e)) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && !(0 == e_c)) && r_i <= 0)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 1 == c2_i) && t_b <= data) && wl_st == 0) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && !(e_g == 1)) && r_i <= 0) && e_c == e_f) && wb_pc == 1) && c1_pc == 0) && 2 <= r_st) && !(0 == e_g)) && 1 == c1_i) && c1_st == 0) && c_req_up <= 0) && e_wl == e_c)) || (((((((((((((((((((((wb_st == 0 && c2_st == 0) && wb_i == 1) && processed == 0) && t_b <= data) && 1 == c2_i) && wl_st == 0) && data <= t_b) && c2_pc == 0) && 2 <= e_wl) && wl_pc == 0) && e_f == e_e) && r_i <= 0) && e_c == e_f) && wb_pc == 0) && c1_pc == 0) && 2 <= r_st) && 1 == c1_i) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_wl == e_c) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((((data <= t_b + 1 && ((((2 <= wb_st && ((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && c1_st == 0) && wb_i == 1) && wb_pc == 1) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) || ((2 <= wb_st && (((((((((c2_pc == 1 && !(e_f == 1)) && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && c1_st == 0) && wb_i == 1) && wb_pc == 1) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 2 <= c2_st)) || ((2 <= wb_st && (((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && wb_i == 1) && wb_pc == 1) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 2 <= c1_st)) || (((2 <= wb_st && ((((((((c2_pc == 1 && !(e_f == 1)) && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && wb_i == 1) && wb_pc == 1) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 2 <= c2_st) && 2 <= c1_st))) && t_b + 1 <= data) && wl_pc == 2) && !(0 == e_f)) || ((((t_b + 2 <= data && ((((2 <= wb_st && ((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && c1_st == 0) && wb_i == 1) && wb_pc == 1) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) || ((2 <= wb_st && (((((((((c2_pc == 1 && !(e_f == 1)) && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && c1_st == 0) && wb_i == 1) && wb_pc == 1) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 2 <= c2_st)) || ((2 <= wb_st && (((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && wb_i == 1) && wb_pc == 1) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 2 <= c1_st)) || (((2 <= wb_st && ((((((((c2_pc == 1 && !(e_f == 1)) && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && wb_i == 1) && wb_pc == 1) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 2 <= c2_st) && 2 <= c1_st))) && data <= t_b + 2) && wl_pc == 2) && !(0 == e_f))) || (((!(0 == e_f) && t_b <= data) && ((((((((c2_pc == 1 && 2 <= wb_st) && ((!(e_f == 1) && ((((((c2_st == 0 && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && wb_i == 1) && !(e_e == 1)) && !(e_g == 1)) && e_c == e_e) && c_req_up <= 0) && c1_pc == 1) && wb_pc == 1) && wl_pc == 1) && 2 <= c1_st) || ((((((c2_pc == 1 && 2 <= wb_st) && ((!(e_f == 1) && (((((2 <= r_st && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && wb_i == 1) && !(e_e == 1)) && !(e_g == 1)) && e_c == e_e) && c_req_up <= 0) && c1_pc == 1) && wb_pc == 1) && wl_pc == 1) && 2 <= c2_st) && 2 <= c1_st)) || ((((c2_pc == 1 && 2 <= wb_st) && ((!(e_f == 1) && (((((((c2_st == 0 && 2 <= r_st) && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && c1_st == 0) && wb_i == 1) && !(e_e == 1)) && !(e_g == 1)) && e_c == e_e) && c_req_up <= 0) && c1_pc == 1) && wb_pc == 1) && wl_pc == 1)) || (((((c2_pc == 1 && 2 <= wb_st) && (((((((((2 <= r_st && (((!(0 == e_g) && 1 == c2_i) && r_i <= 0) && !(0 == e_e)) && !(0 == e_c)) && 1 == c1_i) && c1_st == 0) && wb_i == 1) && !(e_e == 1)) && !(e_g == 1)) && e_c == e_e) && !(e_f == 1)) && c_req_up <= 0) && c1_pc == 1) && wb_pc == 1) && wl_pc == 1) && 2 <= c2_st))) && data <= t_b) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. SAFE Result, 96.7s OverallTime, 39 OverallIterations, 9 TraceHistogramMax, 23.5s AutomataDifference, 0.0s DeadEndRemovalTime, 56.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 8551 SDtfs, 7312 SDslu, 8889 SDs, 0 SdLazy, 1078 SolverSat, 238 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 566 GetRequests, 470 SyntacticMatches, 8 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 5.3s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 10.9s AutomataMinimizationTime, 39 MinimizatonAttempts, 10550 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 1179 NumberOfFragments, 26609 HoareAnnotationTreeSize, 20 FomulaSimplifications, 366947 FormulaSimplificationTreeSizeReduction, 4.9s HoareSimplificationTime, 20 FomulaSimplificationsInter, 391221 FormulaSimplificationTreeSizeReductionInter, 51.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s 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, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...