java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:42:34,185 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:42:34,187 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:42:34,199 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:42:34,199 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:42:34,200 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:42:34,202 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:42:34,203 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:42:34,205 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:42:34,206 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:42:34,207 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:42:34,207 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:42:34,208 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:42:34,209 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:42:34,212 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:42:34,213 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:42:34,214 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:42:34,216 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:42:34,218 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:42:34,220 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:42:34,227 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:42:34,230 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:42:34,234 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:42:34,234 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:42:34,235 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:42:34,236 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:42:34,236 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:42:34,240 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:42:34,240 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:42:34,243 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:42:34,243 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:42:34,244 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:42:34,244 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:42:34,244 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:42:34,245 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:42:34,246 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:42:34,246 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:42:34,260 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:42:34,260 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:42:34,262 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:42:34,262 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:42:34,262 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:42:34,265 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:42:34,266 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:42:34,266 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:42:34,266 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:42:34,266 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:42:34,266 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:42:34,267 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:42:34,267 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:42:34,267 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:42:34,267 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:42:34,268 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:42:34,268 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:42:34,268 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:42:34,269 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:42:34,269 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:42:34,269 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:42:34,269 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:42:34,269 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:42:34,269 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:42:34,270 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:42:34,270 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:42:34,270 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:42:34,270 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:42:34,270 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:42:34,270 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:42:34,272 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:42:34,272 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:42:34,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:42:34,273 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:42:34,273 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:42:34,273 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:42:34,273 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:42:34,273 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:42:34,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:42:34,274 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:42:34,274 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:42:34,318 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:42:34,328 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:42:34,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:42:34,333 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:42:34,333 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:42:34,334 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-12-03 16:42:34,334 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl' [2018-12-03 16:42:34,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:42:34,399 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:42:34,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:42:34,400 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:42:34,400 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:42:34,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:34" (1/1) ... [2018-12-03 16:42:34,434 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:34" (1/1) ... [2018-12-03 16:42:34,452 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:42:34,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:42:34,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:42:34,453 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:42:34,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:34" (1/1) ... [2018-12-03 16:42:34,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:34" (1/1) ... [2018-12-03 16:42:34,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:34" (1/1) ... [2018-12-03 16:42:34,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:34" (1/1) ... [2018-12-03 16:42:34,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:34" (1/1) ... [2018-12-03 16:42:34,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:34" (1/1) ... [2018-12-03 16:42:34,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:34" (1/1) ... [2018-12-03 16:42:34,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:42:34,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:42:34,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:42:34,517 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:42:34,521 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:34" (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 [2018-12-03 16:42:34,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:42:34,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:42:35,404 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:42:35,405 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:42:35,405 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:35 BoogieIcfgContainer [2018-12-03 16:42:35,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:42:35,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:42:35,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:42:35,410 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:42:35,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:34" (1/2) ... [2018-12-03 16:42:35,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556d74fa and model type pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:42:35, skipping insertion in model container [2018-12-03 16:42:35,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:35" (2/2) ... [2018-12-03 16:42:35,414 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-12-03 16:42:35,424 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:42:35,434 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:42:35,453 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:42:35,489 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:42:35,490 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:42:35,490 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:42:35,490 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:42:35,490 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:42:35,491 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:42:35,491 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:42:35,491 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:42:35,510 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-12-03 16:42:35,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:42:35,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:35,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:35,526 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:35,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:35,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-12-03 16:42:35,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:35,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:35,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:35,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:35,595 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:35,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:35,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:35,899 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:35,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:35,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:35,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:35,925 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-12-03 16:42:35,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:35,972 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-12-03 16:42:35,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:35,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 16:42:35,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:35,987 INFO L225 Difference]: With dead ends: 57 [2018-12-03 16:42:35,987 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:42:35,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:36,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:42:36,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-12-03 16:42:36,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 16:42:36,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-12-03 16:42:36,043 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-12-03 16:42:36,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:36,043 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-12-03 16:42:36,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-12-03 16:42:36,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:42:36,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:36,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:36,045 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:36,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:36,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-12-03 16:42:36,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:36,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:36,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:36,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:36,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:36,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:36,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:36,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:36,227 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:36,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:36,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:36,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:36,236 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-12-03 16:42:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:36,295 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-12-03 16:42:36,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:36,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 16:42:36,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:36,299 INFO L225 Difference]: With dead ends: 103 [2018-12-03 16:42:36,299 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 16:42:36,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:36,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 16:42:36,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-12-03 16:42:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 16:42:36,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-12-03 16:42:36,323 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-12-03 16:42:36,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:36,323 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-12-03 16:42:36,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:36,324 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-12-03 16:42:36,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:42:36,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:36,325 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:36,325 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:36,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:36,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-12-03 16:42:36,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:36,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:36,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:36,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:36,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:36,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:36,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:42:36,546 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:36,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:42:36,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:42:36,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:42:36,548 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-12-03 16:42:36,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:36,717 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-12-03 16:42:36,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:42:36,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-03 16:42:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:36,722 INFO L225 Difference]: With dead ends: 141 [2018-12-03 16:42:36,722 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 16:42:36,723 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 [2018-12-03 16:42:36,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 16:42:36,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-12-03 16:42:36,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 16:42:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-12-03 16:42:36,753 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-12-03 16:42:36,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:36,754 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-12-03 16:42:36,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:42:36,754 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-12-03 16:42:36,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:42:36,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:36,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:36,755 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:36,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:36,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-12-03 16:42:36,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:36,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:36,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:36,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:36,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:36,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:36,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:36,908 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:36,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:36,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:36,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:36,912 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-12-03 16:42:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:37,025 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-12-03 16:42:37,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:37,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 16:42:37,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:37,028 INFO L225 Difference]: With dead ends: 183 [2018-12-03 16:42:37,028 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 16:42:37,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:37,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 16:42:37,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 16:42:37,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 16:42:37,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-12-03 16:42:37,057 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-12-03 16:42:37,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:37,058 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-12-03 16:42:37,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:37,059 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-12-03 16:42:37,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:42:37,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:37,061 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:37,061 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:37,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:37,062 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-12-03 16:42:37,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:37,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:37,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:37,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:37,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:37,407 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:42:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:37,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:37,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:37,413 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:37,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:37,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:37,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:37,414 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-12-03 16:42:37,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:37,517 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-12-03 16:42:37,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:37,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 16:42:37,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:37,520 INFO L225 Difference]: With dead ends: 321 [2018-12-03 16:42:37,520 INFO L226 Difference]: Without dead ends: 215 [2018-12-03 16:42:37,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:37,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-03 16:42:37,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-12-03 16:42:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-03 16:42:37,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-12-03 16:42:37,592 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-12-03 16:42:37,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:37,593 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-12-03 16:42:37,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:37,593 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-12-03 16:42:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:42:37,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:37,595 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:37,596 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:37,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:37,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-12-03 16:42:37,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:37,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:37,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:37,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:37,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:37,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:37,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:37,811 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:37,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:37,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:37,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:37,812 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-12-03 16:42:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:37,938 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-12-03 16:42:37,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:37,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 16:42:37,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:37,942 INFO L225 Difference]: With dead ends: 633 [2018-12-03 16:42:37,942 INFO L226 Difference]: Without dead ends: 423 [2018-12-03 16:42:37,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:37,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-03 16:42:38,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-12-03 16:42:38,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 16:42:38,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-12-03 16:42:38,023 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-12-03 16:42:38,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:38,025 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-12-03 16:42:38,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:38,026 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-12-03 16:42:38,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:42:38,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:38,032 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:38,032 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:38,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:38,033 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-12-03 16:42:38,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:38,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:38,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:38,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:38,036 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:38,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:38,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:38,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:38,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:38,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:38,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:38,235 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-12-03 16:42:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:38,435 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-12-03 16:42:38,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:38,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 16:42:38,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:38,445 INFO L225 Difference]: With dead ends: 1257 [2018-12-03 16:42:38,445 INFO L226 Difference]: Without dead ends: 839 [2018-12-03 16:42:38,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:38,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-12-03 16:42:38,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-12-03 16:42:38,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-12-03 16:42:38,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-12-03 16:42:38,594 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-12-03 16:42:38,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:38,596 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-12-03 16:42:38,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-12-03 16:42:38,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:42:38,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:38,603 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-03 16:42:38,603 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:38,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:38,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-12-03 16:42:38,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:38,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:38,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:38,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:38,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:38,921 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:42:38,926 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:38,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:38,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:38,927 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:38,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:38,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:38,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:38,928 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-12-03 16:42:39,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:39,280 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-12-03 16:42:39,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:39,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 16:42:39,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:39,290 INFO L225 Difference]: With dead ends: 2505 [2018-12-03 16:42:39,291 INFO L226 Difference]: Without dead ends: 1671 [2018-12-03 16:42:39,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:39,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-12-03 16:42:39,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-12-03 16:42:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-12-03 16:42:39,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-12-03 16:42:39,574 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-12-03 16:42:39,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:39,574 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-12-03 16:42:39,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:39,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-12-03 16:42:39,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:42:39,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:39,580 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-03 16:42:39,580 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:39,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:39,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-12-03 16:42:39,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:39,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:39,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:39,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:39,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:39,876 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 16:42:39,909 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:39,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:39,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:39,911 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-12-03 16:42:39,913 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50], [54], [56], [58], [62], [64], [66] [2018-12-03 16:42:39,963 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:42:39,963 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:42:42,267 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:42:42,269 INFO L272 AbstractInterpreter]: Visited 26 different actions 247 times. Merged at 25 different actions 159 times. Widened at 18 different actions 35 times. Found 59 fixpoints after 17 different actions. Largest state had 0 variables. [2018-12-03 16:42:42,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:42,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:42:42,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:42,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-12-03 16:42:42,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:42,337 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:42:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:42,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:42:42,828 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:43,227 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:42:43,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:43,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2018-12-03 16:42:43,262 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:43,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:42:43,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:42:43,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:42:43,266 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-12-03 16:42:43,751 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 16:42:46,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:46,237 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-12-03 16:42:46,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:42:46,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-12-03 16:42:46,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:46,252 INFO L225 Difference]: With dead ends: 4801 [2018-12-03 16:42:46,253 INFO L226 Difference]: Without dead ends: 3135 [2018-12-03 16:42:46,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:42:46,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-12-03 16:42:46,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-12-03 16:42:46,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-12-03 16:42:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-12-03 16:42:46,625 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-12-03 16:42:46,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:46,625 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-12-03 16:42:46,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:42:46,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-12-03 16:42:46,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 16:42:46,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:46,630 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:42:46,631 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:46,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:46,631 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-12-03 16:42:46,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:46,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:46,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:46,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:46,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:46,871 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:42:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:42:46,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:46,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:46,878 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:46,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:46,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:46,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:46,879 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-12-03 16:42:47,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:47,292 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-12-03 16:42:47,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:47,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 16:42:47,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:47,303 INFO L225 Difference]: With dead ends: 4873 [2018-12-03 16:42:47,303 INFO L226 Difference]: Without dead ends: 2215 [2018-12-03 16:42:47,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:47,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-12-03 16:42:47,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-12-03 16:42:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-12-03 16:42:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-12-03 16:42:47,622 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-12-03 16:42:47,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:47,623 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-12-03 16:42:47,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:47,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-12-03 16:42:47,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 16:42:47,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:47,627 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 16:42:47,627 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:47,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:47,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-12-03 16:42:47,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:47,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:47,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:42:47,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:47,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-03 16:42:47,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:47,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:47,714 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:47,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:47,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:47,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:47,715 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-12-03 16:42:47,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:47,765 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-12-03 16:42:47,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:47,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 16:42:47,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:47,765 INFO L225 Difference]: With dead ends: 1799 [2018-12-03 16:42:47,766 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:42:47,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:47,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:42:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:42:47,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:42:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:42:47,769 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-12-03 16:42:47,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:47,770 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:42:47,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:47,770 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:42:47,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:42:47,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:42:47,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,917 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 40 [2018-12-03 16:42:47,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:47,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,265 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 48 [2018-12-03 16:42:48,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,451 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 40 [2018-12-03 16:42:48,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,569 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 42 [2018-12-03 16:42:48,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,732 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 27 [2018-12-03 16:42:48,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,093 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 48 [2018-12-03 16:42:49,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:49,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,260 WARN L180 SmtUtils]: Spent 994.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-12-03 16:42:50,557 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 16:42:50,779 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 16:42:50,925 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 16:42:51,165 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-03 16:42:51,288 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 16:42:51,405 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-12-03 16:42:51,608 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 16:42:51,764 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 16:42:51,947 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 16:42:52,110 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-03 16:42:52,222 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-03 16:42:52,347 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 16:42:52,351 INFO L444 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (let ((.cse8 (div ~mode3 256))) (let ((.cse0 (= ~mode3 (* 256 .cse8))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~send2 127)) (.cse4 (< 0 (+ (div ~send2 256) 1))) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7) (and (and (not (= ~p2_old ~nomsg)) .cse2 .cse4 .cse6) (<= 1 ~mode3) (<= .cse8 0)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7)))) [2018-12-03 16:42:52,351 INFO L444 ceAbstractionStarter]: At program point L539(lines 364 539) the Hoare annotation is: (let ((.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse2 (div ~mode2 256)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode3 (* 256 .cse4)) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse2)) .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-12-03 16:42:52,351 INFO L444 ceAbstractionStarter]: At program point L436(lines 436 446) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 16:42:52,352 INFO L444 ceAbstractionStarter]: At program point L416(lines 416 426) the Hoare annotation is: (let ((.cse8 (div ~mode3 256))) (let ((.cse0 (= ~mode3 (* 256 .cse8))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~send2 127)) (.cse4 (< 0 (+ (div ~send2 256) 1))) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7) (and (and (not (= ~p2_old ~nomsg)) .cse2 .cse4 .cse6) (<= 1 ~mode3) (<= .cse8 0)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7)))) [2018-12-03 16:42:52,352 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-12-03 16:42:52,352 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-12-03 16:42:52,352 INFO L444 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-12-03 16:42:52,352 INFO L444 ceAbstractionStarter]: At program point L371(lines 371 383) the Hoare annotation is: (let ((.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse2 (div ~mode2 256)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode3 (* 256 .cse4)) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse2)) .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-12-03 16:42:52,352 INFO L444 ceAbstractionStarter]: At program point L491(lines 485 492) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 16:42:52,352 INFO L444 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0)) [2018-12-03 16:42:52,352 INFO L444 ceAbstractionStarter]: At program point L388(lines 382 389) the Hoare annotation is: (let ((.cse2 (div ~mode2 256)) (.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode2 (* 256 .cse2)) (and (= ~mode3 (* 256 .cse4)) .cse0 .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256))))))) [2018-12-03 16:42:52,352 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-12-03 16:42:52,353 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-12-03 16:42:52,353 INFO L444 ceAbstractionStarter]: At program point L471(lines 464 472) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 16:42:52,353 INFO L444 ceAbstractionStarter]: At program point L393(lines 393 403) the Hoare annotation is: (let ((.cse2 (div ~mode2 256)) (.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode2 (* 256 .cse2)) (and (= ~mode3 (* 256 .cse4)) .cse0 .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256))))))) [2018-12-03 16:42:52,353 INFO L444 ceAbstractionStarter]: At program point L451(lines 445 452) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 16:42:52,354 INFO L444 ceAbstractionStarter]: At program point L509(lines 509 516) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse6 (<= (div ~mode3 256) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse3 .cse4 .cse5 .cse7 .cse6))) [2018-12-03 16:42:52,354 INFO L444 ceAbstractionStarter]: At program point L476(lines 476 486) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 16:42:52,354 INFO L444 ceAbstractionStarter]: At program point L530(lines 530 537) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0)) [2018-12-03 16:42:52,354 INFO L444 ceAbstractionStarter]: At program point L431(lines 425 432) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 16:42:52,355 INFO L444 ceAbstractionStarter]: At program point L456(lines 456 465) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse7 (<= (div ~mode3 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse2 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse2 1)) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-12-03 16:42:52,379 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:42:52 BoogieIcfgContainer [2018-12-03 16:42:52,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:42:52,380 INFO L168 Benchmark]: Toolchain (without parser) took 17981.57 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -585.4 MB). Peak memory consumption was 768.4 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:52,381 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:42:52,381 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:42:52,382 INFO L168 Benchmark]: Boogie Preprocessor took 62.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:42:52,383 INFO L168 Benchmark]: RCFGBuilder took 889.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:52,383 INFO L168 Benchmark]: TraceAbstraction took 16972.38 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -638.3 MB). Peak memory consumption was 715.5 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:52,387 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 889.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16972.38 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -638.3 MB). Peak memory consumption was 715.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 541]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || (~mode2 == 256 * (~mode2 / 256) && (((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || (((((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && 1 <= ~mode3) && ~mode3 / 256 <= 0)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || (~mode2 == 256 * (~mode2 / 256) && (((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((assert_~arg == 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0 - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 364]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 402]: Loop Invariant Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || (((((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && 1 <= ~mode3) && ~mode3 / 256 <= 0)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 425]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 16.8s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 4.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1388 HoareAnnotationTreeSize, 17 FomulaSimplifications, 81143 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 17 FomulaSimplificationsInter, 200 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 429 ConstructedInterpolants, 12 QuantifiedInterpolants, 63939 SizeOfPredicates, 1 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 274/304 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...