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_oct.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 19:15:29,916 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 19:15:29,918 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 19:15:29,936 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 19:15:29,936 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 19:15:29,938 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 19:15:29,939 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 19:15:29,943 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 19:15:29,946 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 19:15:29,946 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 19:15:29,947 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 19:15:29,948 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 19:15:29,950 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 19:15:29,951 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 19:15:29,959 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 19:15:29,959 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 19:15:29,962 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 19:15:29,964 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 19:15:29,969 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 19:15:29,971 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 19:15:29,974 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 19:15:29,975 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 19:15:29,977 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 19:15:29,978 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 19:15:29,978 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 19:15:29,979 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 19:15:29,980 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 19:15:29,981 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 19:15:29,984 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 19:15:29,985 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 19:15:29,986 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 19:15:29,986 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 19:15:29,986 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 19:15:29,988 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 19:15:29,989 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 19:15:29,989 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 19:15:29,990 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 19:15:30,008 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 19:15:30,008 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 19:15:30,009 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 19:15:30,009 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 19:15:30,010 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 19:15:30,010 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 19:15:30,010 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 19:15:30,010 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 19:15:30,011 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 19:15:30,011 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 19:15:30,011 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 19:15:30,011 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 19:15:30,011 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 19:15:30,011 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 19:15:30,012 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 19:15:30,012 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 19:15:30,012 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 19:15:30,013 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 19:15:30,013 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 19:15:30,013 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 19:15:30,013 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 19:15:30,013 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 19:15:30,014 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 19:15:30,014 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 19:15:30,014 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 19:15:30,014 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 19:15:30,014 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 19:15:30,014 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 19:15:30,015 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 19:15:30,015 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 19:15:30,015 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 19:15:30,015 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 19:15:30,016 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 19:15:30,016 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 19:15:30,016 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 19:15:30,016 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 19:15:30,017 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 19:15:30,017 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 19:15:30,017 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 19:15:30,017 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 19:15:30,048 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 19:15:30,060 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 19:15:30,064 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 19:15:30,066 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 19:15:30,066 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 19:15:30,067 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 19:15:30,067 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 19:15:30,150 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 19:15:30,151 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 19:15:30,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 19:15:30,152 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 19:15:30,152 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 19:15:30,169 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 07:15:30" (1/1) ... [2018-12-03 19:15:30,185 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 07:15:30" (1/1) ... [2018-12-03 19:15:30,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 19:15:30,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 19:15:30,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 19:15:30,206 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 19:15:30,219 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 07:15:30" (1/1) ... [2018-12-03 19:15:30,219 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 07:15:30" (1/1) ... [2018-12-03 19:15:30,223 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 07:15:30" (1/1) ... [2018-12-03 19:15:30,232 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 07:15:30" (1/1) ... [2018-12-03 19:15:30,253 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 07:15:30" (1/1) ... [2018-12-03 19:15:30,258 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 07:15:30" (1/1) ... [2018-12-03 19:15:30,266 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 07:15:30" (1/1) ... [2018-12-03 19:15:30,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 19:15:30,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 19:15:30,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 19:15:30,274 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 19:15:30,275 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 07:15:30" (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 19:15:30,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 19:15:30,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 19:15:31,142 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 19:15:31,142 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 19:15:31,143 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 07:15:31 BoogieIcfgContainer [2018-12-03 19:15:31,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 19:15:31,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 19:15:31,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 19:15:31,148 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 19:15:31,149 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 07:15:30" (1/2) ... [2018-12-03 19:15:31,150 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 07:15:31, skipping insertion in model container [2018-12-03 19:15:31,150 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 07:15:31" (2/2) ... [2018-12-03 19:15:31,152 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-12-03 19:15:31,163 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 19:15:31,171 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 19:15:31,190 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 19:15:31,226 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 19:15:31,226 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 19:15:31,227 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 19:15:31,227 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 19:15:31,227 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 19:15:31,227 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 19:15:31,227 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 19:15:31,228 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 19:15:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-12-03 19:15:31,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 19:15:31,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:15:31,253 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 19:15:31,255 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:15:31,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:31,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-12-03 19:15:31,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:15:31,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:31,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:31,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:31,327 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:15:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:31,521 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 19:15:31,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:15:31,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:15:31,524 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:15:31,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:15:31,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:15:31,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:15:31,544 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-12-03 19:15:31,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:15:31,610 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-12-03 19:15:31,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:15:31,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 19:15:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:15:31,626 INFO L225 Difference]: With dead ends: 57 [2018-12-03 19:15:31,629 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 19:15:31,639 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 19:15:31,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 19:15:31,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-12-03 19:15:31,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 19:15:31,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-12-03 19:15:31,685 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-12-03 19:15:31,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:15:31,685 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-12-03 19:15:31,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:15:31,686 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-12-03 19:15:31,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 19:15:31,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:15:31,687 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 19:15:31,687 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:15:31,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:31,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-12-03 19:15:31,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:15:31,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:31,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:31,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:31,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:15:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:31,863 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 19:15:31,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:15:31,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:15:31,869 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:15:31,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:15:31,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:15:31,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:15:31,872 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-12-03 19:15:31,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:15:31,903 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-12-03 19:15:31,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:15:31,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 19:15:31,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:15:31,908 INFO L225 Difference]: With dead ends: 103 [2018-12-03 19:15:31,909 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 19:15:31,910 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 19:15:31,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 19:15:31,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-12-03 19:15:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 19:15:31,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-12-03 19:15:31,950 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-12-03 19:15:31,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:15:31,951 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-12-03 19:15:31,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:15:31,951 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-12-03 19:15:31,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 19:15:31,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:15:31,952 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 19:15:31,953 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:15:31,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:31,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-12-03 19:15:31,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:15:31,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:31,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:31,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:31,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:15:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:32,128 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 19:15:32,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:15:32,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 19:15:32,129 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:15:32,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 19:15:32,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 19:15:32,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 19:15:32,131 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-12-03 19:15:32,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:15:32,322 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-12-03 19:15:32,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 19:15:32,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-03 19:15:32,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:15:32,327 INFO L225 Difference]: With dead ends: 141 [2018-12-03 19:15:32,327 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 19:15:32,330 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 19:15:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 19:15:32,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-12-03 19:15:32,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 19:15:32,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-12-03 19:15:32,387 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-12-03 19:15:32,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:15:32,389 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-12-03 19:15:32,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 19:15:32,389 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-12-03 19:15:32,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 19:15:32,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:15:32,390 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 19:15:32,391 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:15:32,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:32,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-12-03 19:15:32,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:15:32,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:32,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:32,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:32,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:15:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:32,522 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 19:15:32,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:15:32,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:15:32,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:15:32,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:15:32,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:15:32,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:15:32,524 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-12-03 19:15:32,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:15:32,616 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-12-03 19:15:32,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:15:32,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 19:15:32,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:15:32,618 INFO L225 Difference]: With dead ends: 183 [2018-12-03 19:15:32,619 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 19:15:32,620 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 19:15:32,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 19:15:32,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 19:15:32,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 19:15:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-12-03 19:15:32,645 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-12-03 19:15:32,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:15:32,646 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-12-03 19:15:32,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:15:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-12-03 19:15:32,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 19:15:32,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:15:32,648 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 19:15:32,648 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:15:32,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:32,649 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-12-03 19:15:32,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:15:32,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:32,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:32,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:32,651 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:15:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:33,003 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 19:15:33,008 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 19:15:33,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:15:33,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:15:33,009 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:15:33,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:15:33,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:15:33,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:15:33,011 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-12-03 19:15:33,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:15:33,113 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-12-03 19:15:33,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:15:33,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 19:15:33,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:15:33,117 INFO L225 Difference]: With dead ends: 321 [2018-12-03 19:15:33,117 INFO L226 Difference]: Without dead ends: 215 [2018-12-03 19:15:33,118 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 19:15:33,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-03 19:15:33,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-12-03 19:15:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-03 19:15:33,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-12-03 19:15:33,193 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-12-03 19:15:33,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:15:33,193 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-12-03 19:15:33,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:15:33,194 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-12-03 19:15:33,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 19:15:33,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:15:33,197 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 19:15:33,197 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:15:33,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:33,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-12-03 19:15:33,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:15:33,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:33,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:33,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:33,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:15:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:33,451 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 19:15:33,457 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 19:15:33,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:15:33,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:15:33,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:15:33,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:15:33,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:15:33,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:15:33,459 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-12-03 19:15:33,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:15:33,588 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-12-03 19:15:33,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:15:33,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 19:15:33,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:15:33,592 INFO L225 Difference]: With dead ends: 633 [2018-12-03 19:15:33,592 INFO L226 Difference]: Without dead ends: 423 [2018-12-03 19:15:33,594 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 19:15:33,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-03 19:15:33,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-12-03 19:15:33,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 19:15:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-12-03 19:15:33,678 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-12-03 19:15:33,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:15:33,679 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-12-03 19:15:33,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:15:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-12-03 19:15:33,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 19:15:33,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:15:33,685 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 19:15:33,685 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:15:33,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:33,686 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-12-03 19:15:33,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:15:33,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:33,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:33,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:33,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:15:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:33,813 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 19:15:33,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:15:33,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:15:33,814 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:15:33,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:15:33,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:15:33,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:15:33,815 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-12-03 19:15:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:15:34,020 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-12-03 19:15:34,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:15:34,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 19:15:34,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:15:34,025 INFO L225 Difference]: With dead ends: 1257 [2018-12-03 19:15:34,026 INFO L226 Difference]: Without dead ends: 839 [2018-12-03 19:15:34,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:15:34,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-12-03 19:15:34,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-12-03 19:15:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-12-03 19:15:34,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-12-03 19:15:34,164 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-12-03 19:15:34,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:15:34,165 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-12-03 19:15:34,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:15:34,165 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-12-03 19:15:34,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 19:15:34,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:15:34,168 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 19:15:34,168 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:15:34,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:34,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-12-03 19:15:34,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:15:34,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:34,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:34,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:34,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:15:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:34,521 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 19:15:34,526 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 19:15:34,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:15:34,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:15:34,527 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:15:34,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:15:34,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:15:34,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:15:34,529 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-12-03 19:15:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:15:34,897 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-12-03 19:15:34,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:15:34,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 19:15:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:15:34,908 INFO L225 Difference]: With dead ends: 2505 [2018-12-03 19:15:34,908 INFO L226 Difference]: Without dead ends: 1671 [2018-12-03 19:15:34,910 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 19:15:34,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-12-03 19:15:35,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-12-03 19:15:35,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-12-03 19:15:35,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-12-03 19:15:35,182 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-12-03 19:15:35,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:15:35,182 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-12-03 19:15:35,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:15:35,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-12-03 19:15:35,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 19:15:35,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:15:35,186 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 19:15:35,189 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:15:35,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:15:35,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-12-03 19:15:35,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:15:35,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:35,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:15:35,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:15:35,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:15:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:15:35,479 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 19:15:35,506 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 19:15:35,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:15:35,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:15:35,508 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-12-03 19:15:35,510 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 19:15:35,581 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 19:15:35,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 19:15:37,887 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 19:16:50,166 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 19:16:50,167 INFO L272 AbstractInterpreter]: Visited 26 different actions 446 times. Merged at 25 different actions 321 times. Widened at 14 different actions 78 times. Found 106 fixpoints after 16 different actions. Largest state had 0 variables. [2018-12-03 19:16:50,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:16:50,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 19:16:50,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:16:50,183 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 19:16:50,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:16:50,194 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:16:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:16:50,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:16:50,648 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 19:16:50,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:16:51,022 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 19:16:51,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:16:51,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2018-12-03 19:16:51,060 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:16:51,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 19:16:51,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 19:16:51,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 19:16:51,062 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-12-03 19:16:51,296 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 19:16:51,645 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 19:16:52,448 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 19:16:52,689 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-03 19:16:53,127 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 19:16:54,549 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 19:16:54,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:16:54,769 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-12-03 19:16:54,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 19:16:54,770 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-12-03 19:16:54,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:16:54,785 INFO L225 Difference]: With dead ends: 4801 [2018-12-03 19:16:54,785 INFO L226 Difference]: Without dead ends: 3135 [2018-12-03 19:16:54,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-12-03 19:16:54,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-12-03 19:16:55,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-12-03 19:16:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-12-03 19:16:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-12-03 19:16:55,159 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-12-03 19:16:55,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:16:55,159 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-12-03 19:16:55,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 19:16:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-12-03 19:16:55,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 19:16:55,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:16:55,167 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 19:16:55,167 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:16:55,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:16:55,168 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-12-03 19:16:55,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:16:55,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:16:55,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:16:55,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:16:55,170 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:16:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:16:55,389 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 19:16:55,394 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 19:16:55,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:16:55,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:16:55,394 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:16:55,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:16:55,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:16:55,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:16:55,396 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-12-03 19:16:55,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:16:55,812 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-12-03 19:16:55,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:16:55,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 19:16:55,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:16:55,822 INFO L225 Difference]: With dead ends: 4873 [2018-12-03 19:16:55,823 INFO L226 Difference]: Without dead ends: 2215 [2018-12-03 19:16:55,827 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 19:16:55,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-12-03 19:16:56,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-12-03 19:16:56,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-12-03 19:16:56,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-12-03 19:16:56,130 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-12-03 19:16:56,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:16:56,131 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-12-03 19:16:56,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:16:56,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-12-03 19:16:56,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 19:16:56,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:16:56,134 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 19:16:56,134 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:16:56,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:16:56,134 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-12-03 19:16:56,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:16:56,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:16:56,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:16:56,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:16:56,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:16:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:16:56,214 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 19:16:56,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:16:56,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:16:56,214 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:16:56,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:16:56,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:16:56,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:16:56,216 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-12-03 19:16:56,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:16:56,255 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-12-03 19:16:56,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:16:56,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 19:16:56,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:16:56,256 INFO L225 Difference]: With dead ends: 1799 [2018-12-03 19:16:56,256 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 19:16:56,258 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 19:16:56,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 19:16:56,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 19:16:56,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 19:16:56,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 19:16:56,259 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-12-03 19:16:56,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:16:56,259 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 19:16:56,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:16:56,259 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 19:16:56,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 19:16:56,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 19:16:56,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,384 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 40 [2018-12-03 19:16:56,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,660 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 48 [2018-12-03 19:16:56,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,818 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 40 [2018-12-03 19:16:56,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,924 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 42 [2018-12-03 19:16:56,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:56,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,375 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 48 [2018-12-03 19:16:57,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:57,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:16:58,680 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-12-03 19:16:59,791 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 19:17:00,076 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 19:17:00,254 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 19:17:00,459 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-03 19:17:00,629 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 19:17:00,748 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-12-03 19:17:00,860 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-03 19:17:00,987 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 19:17:01,159 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 19:17:01,314 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 19:17:01,483 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-03 19:17:01,599 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-03 19:17:01,719 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 19:17:01,722 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 19:17:01,723 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 19:17:01,723 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 19:17:01,723 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 19:17:01,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-12-03 19:17:01,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-12-03 19:17:01,723 INFO L444 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-12-03 19:17:01,724 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 19:17:01,724 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 19:17:01,724 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 19:17:01,724 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 19:17:01,725 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-12-03 19:17:01,725 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-12-03 19:17:01,725 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 19:17:01,725 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 19:17:01,725 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 19:17:01,726 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 19:17:01,726 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 19:17:01,726 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 19:17:01,726 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 19:17:01,727 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 19:17:01,750 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 07:17:01 BoogieIcfgContainer [2018-12-03 19:17:01,750 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 19:17:01,751 INFO L168 Benchmark]: Toolchain (without parser) took 91600.70 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: -2.0 GB). Peak memory consumption was 651.2 MB. Max. memory is 7.1 GB. [2018-12-03 19:17:01,752 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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 19:17:01,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.40 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 19:17:01,753 INFO L168 Benchmark]: Boogie Preprocessor took 67.27 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 19:17:01,754 INFO L168 Benchmark]: RCFGBuilder took 869.89 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 19:17:01,754 INFO L168 Benchmark]: TraceAbstraction took 90605.38 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.1 GB). Peak memory consumption was 598.3 MB. Max. memory is 7.1 GB. [2018-12-03 19:17:01,758 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.20 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 53.40 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 67.27 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 869.89 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 90605.38 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.1 GB). Peak memory consumption was 598.3 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, 90.5s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 5.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 3.3s 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, 74.6s 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.2s HoareSimplificationTime, 17 FomulaSimplificationsInter, 200 FormulaSimplificationTreeSizeReductionInter, 4.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s 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...