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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:41:04,560 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:41:04,562 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:41:04,580 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:41:04,581 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:41:04,582 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:41:04,583 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:41:04,585 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:41:04,588 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:41:04,589 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:41:04,591 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:41:04,591 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:41:04,592 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:41:04,594 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:41:04,602 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:41:04,604 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:41:04,605 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:41:04,606 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:41:04,608 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:41:04,610 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:41:04,611 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:41:04,612 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:41:04,614 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:41:04,614 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:41:04,614 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:41:04,615 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:41:04,616 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:41:04,617 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:41:04,618 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:41:04,619 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:41:04,619 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:41:04,620 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:41:04,620 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:41:04,620 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:41:04,621 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:41:04,622 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:41:04,622 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:41:04,635 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:41:04,635 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:41:04,636 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:41:04,636 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:41:04,637 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:41:04,637 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:41:04,637 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:41:04,637 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:41:04,637 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:41:04,638 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:41:04,638 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:41:04,638 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:41:04,638 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:41:04,638 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:41:04,639 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:41:04,639 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:41:04,639 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:41:04,640 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:41:04,640 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:41:04,640 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:41:04,640 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:41:04,640 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:41:04,641 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:41:04,641 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:41:04,641 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:41:04,641 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:41:04,641 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:41:04,641 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:41:04,642 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:41:04,642 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:41:04,642 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:41:04,642 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:41:04,643 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:41:04,643 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:41:04,643 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:41:04,643 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:41:04,643 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:41:04,644 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:41:04,644 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:41:04,644 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:41:04,644 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:41:04,687 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:41:04,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:41:04,711 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:41:04,713 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:41:04,714 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:41:04,715 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl [2018-12-03 15:41:04,715 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl' [2018-12-03 15:41:04,806 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:41:04,807 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:41:04,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:04,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:41:04,809 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:41:04,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:04" (1/1) ... [2018-12-03 15:41:04,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:04" (1/1) ... [2018-12-03 15:41:04,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:04,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:41:04,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:41:04,867 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:41:04,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:04" (1/1) ... [2018-12-03 15:41:04,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:04" (1/1) ... [2018-12-03 15:41:04,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:04" (1/1) ... [2018-12-03 15:41:04,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:04" (1/1) ... [2018-12-03 15:41:04,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:04" (1/1) ... [2018-12-03 15:41:04,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:04" (1/1) ... [2018-12-03 15:41:04,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:04" (1/1) ... [2018-12-03 15:41:04,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:41:04,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:41:04,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:41:04,930 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:41:04,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:04" (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 15:41:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:41:05,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:41:05,555 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:41:05,555 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:41:05,556 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:05 BoogieIcfgContainer [2018-12-03 15:41:05,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:41:05,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:41:05,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:41:05,561 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:41:05,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:04" (1/2) ... [2018-12-03 15:41:05,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d19467f and model type s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:41:05, skipping insertion in model container [2018-12-03 15:41:05,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:05" (2/2) ... [2018-12-03 15:41:05,565 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil.c_19.bpl [2018-12-03 15:41:05,575 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:41:05,587 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:41:05,606 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:41:05,651 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:41:05,652 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:41:05,652 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:41:05,652 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:41:05,652 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:41:05,653 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:41:05,653 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:41:05,653 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:41:05,671 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-12-03 15:41:05,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:41:05,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:05,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:05,682 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:05,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:05,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1918382949, now seen corresponding path program 1 times [2018-12-03 15:41:05,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:05,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:05,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:05,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:05,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:05,917 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 15:41:05,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:05,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:05,920 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:05,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:05,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:05,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:05,940 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-12-03 15:41:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:06,159 INFO L93 Difference]: Finished difference Result 37 states and 62 transitions. [2018-12-03 15:41:06,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:06,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 15:41:06,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:06,176 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:41:06,176 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:41:06,180 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 15:41:06,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:41:06,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 15:41:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:41:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2018-12-03 15:41:06,223 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 10 [2018-12-03 15:41:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:06,224 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-12-03 15:41:06,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. [2018-12-03 15:41:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:41:06,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:06,225 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:06,226 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:06,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:06,226 INFO L82 PathProgramCache]: Analyzing trace with hash -688967491, now seen corresponding path program 1 times [2018-12-03 15:41:06,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:06,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:06,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:06,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:06,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:06,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:06,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:06,345 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:06,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:06,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:06,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:06,348 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand 3 states. [2018-12-03 15:41:06,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:06,613 INFO L93 Difference]: Finished difference Result 41 states and 65 transitions. [2018-12-03 15:41:06,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:06,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-03 15:41:06,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:06,615 INFO L225 Difference]: With dead ends: 41 [2018-12-03 15:41:06,615 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:41:06,616 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 15:41:06,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:41:06,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 15:41:06,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:41:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2018-12-03 15:41:06,623 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 13 [2018-12-03 15:41:06,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:06,624 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2018-12-03 15:41:06,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2018-12-03 15:41:06,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:41:06,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:06,625 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:06,626 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:06,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:06,627 INFO L82 PathProgramCache]: Analyzing trace with hash 485156347, now seen corresponding path program 1 times [2018-12-03 15:41:06,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:06,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:06,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:06,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:06,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:41:06,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:06,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:06,724 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:06,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:06,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:06,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:06,725 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 3 states. [2018-12-03 15:41:06,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:06,891 INFO L93 Difference]: Finished difference Result 50 states and 75 transitions. [2018-12-03 15:41:06,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:06,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 15:41:06,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:06,893 INFO L225 Difference]: With dead ends: 50 [2018-12-03 15:41:06,893 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:41:06,895 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 15:41:06,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:41:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 15:41:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 15:41:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2018-12-03 15:41:06,902 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 17 [2018-12-03 15:41:06,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:06,902 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2018-12-03 15:41:06,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:06,902 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2018-12-03 15:41:06,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:41:06,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:06,903 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:06,904 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:06,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:06,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1400979255, now seen corresponding path program 1 times [2018-12-03 15:41:06,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:06,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:06,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:06,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:06,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:07,025 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 15:41:07,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:07,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:07,026 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:07,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:07,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:07,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:07,027 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 3 states. [2018-12-03 15:41:07,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:07,181 INFO L93 Difference]: Finished difference Result 74 states and 108 transitions. [2018-12-03 15:41:07,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:07,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-03 15:41:07,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:07,183 INFO L225 Difference]: With dead ends: 74 [2018-12-03 15:41:07,183 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 15:41:07,184 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 15:41:07,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 15:41:07,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-12-03 15:41:07,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 15:41:07,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2018-12-03 15:41:07,194 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 24 [2018-12-03 15:41:07,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:07,195 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2018-12-03 15:41:07,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:07,195 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2018-12-03 15:41:07,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:41:07,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:07,196 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:07,197 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:07,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:07,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1854060543, now seen corresponding path program 1 times [2018-12-03 15:41:07,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:07,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:07,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:07,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:07,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 15:41:07,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:07,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:07,368 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:07,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:07,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:07,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:07,370 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 3 states. [2018-12-03 15:41:07,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:07,557 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2018-12-03 15:41:07,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:07,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 15:41:07,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:07,559 INFO L225 Difference]: With dead ends: 92 [2018-12-03 15:41:07,559 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 15:41:07,560 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 15:41:07,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 15:41:07,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 15:41:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 15:41:07,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2018-12-03 15:41:07,573 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 30 [2018-12-03 15:41:07,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:07,573 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2018-12-03 15:41:07,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2018-12-03 15:41:07,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 15:41:07,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:07,576 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:07,578 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:07,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:07,578 INFO L82 PathProgramCache]: Analyzing trace with hash 122269039, now seen corresponding path program 1 times [2018-12-03 15:41:07,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:07,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:07,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:07,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:07,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:07,685 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:41:07,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:07,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:07,685 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:07,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:07,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:07,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:07,687 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand 3 states. [2018-12-03 15:41:07,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:07,794 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2018-12-03 15:41:07,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:07,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-03 15:41:07,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:07,797 INFO L225 Difference]: With dead ends: 71 [2018-12-03 15:41:07,798 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 15:41:07,798 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 15:41:07,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 15:41:07,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2018-12-03 15:41:07,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 15:41:07,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2018-12-03 15:41:07,809 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 37 [2018-12-03 15:41:07,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:07,810 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2018-12-03 15:41:07,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2018-12-03 15:41:07,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 15:41:07,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:07,812 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:07,812 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:07,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:07,813 INFO L82 PathProgramCache]: Analyzing trace with hash -827312127, now seen corresponding path program 1 times [2018-12-03 15:41:07,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:07,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:07,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:07,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:07,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:41:07,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:07,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:07,914 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:07,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:07,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:07,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:07,915 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand 3 states. [2018-12-03 15:41:08,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:08,254 INFO L93 Difference]: Finished difference Result 161 states and 250 transitions. [2018-12-03 15:41:08,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:08,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-03 15:41:08,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:08,258 INFO L225 Difference]: With dead ends: 161 [2018-12-03 15:41:08,262 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 15:41:08,263 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 15:41:08,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 15:41:08,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 15:41:08,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 15:41:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2018-12-03 15:41:08,279 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 44 [2018-12-03 15:41:08,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:08,279 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2018-12-03 15:41:08,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:08,280 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2018-12-03 15:41:08,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 15:41:08,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:08,282 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:08,282 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:08,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:08,285 INFO L82 PathProgramCache]: Analyzing trace with hash -520844702, now seen corresponding path program 1 times [2018-12-03 15:41:08,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:08,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:08,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:08,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:08,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:08,424 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-03 15:41:08,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:08,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:08,425 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:08,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:08,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:08,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:08,427 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand 3 states. [2018-12-03 15:41:08,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:08,780 INFO L93 Difference]: Finished difference Result 205 states and 297 transitions. [2018-12-03 15:41:08,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:08,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-03 15:41:08,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:08,782 INFO L225 Difference]: With dead ends: 205 [2018-12-03 15:41:08,782 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 15:41:08,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:08,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 15:41:08,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 15:41:08,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 15:41:08,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2018-12-03 15:41:08,813 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 56 [2018-12-03 15:41:08,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:08,814 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2018-12-03 15:41:08,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:08,814 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2018-12-03 15:41:08,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 15:41:08,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:08,819 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:08,821 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:08,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:08,821 INFO L82 PathProgramCache]: Analyzing trace with hash 743728902, now seen corresponding path program 1 times [2018-12-03 15:41:08,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:08,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:08,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:08,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:08,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:08,959 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-03 15:41:08,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:08,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:08,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:08,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:08,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:08,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:08,961 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 3 states. [2018-12-03 15:41:09,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:09,132 INFO L93 Difference]: Finished difference Result 240 states and 339 transitions. [2018-12-03 15:41:09,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:09,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-03 15:41:09,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:09,135 INFO L225 Difference]: With dead ends: 240 [2018-12-03 15:41:09,135 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 15:41:09,136 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 15:41:09,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 15:41:09,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-03 15:41:09,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 15:41:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 180 transitions. [2018-12-03 15:41:09,155 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 180 transitions. Word has length 65 [2018-12-03 15:41:09,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:09,156 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 180 transitions. [2018-12-03 15:41:09,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:09,156 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 180 transitions. [2018-12-03 15:41:09,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 15:41:09,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:09,158 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 6, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:09,158 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:09,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:09,159 INFO L82 PathProgramCache]: Analyzing trace with hash 77382112, now seen corresponding path program 1 times [2018-12-03 15:41:09,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:09,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:09,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:09,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:09,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-12-03 15:41:09,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:09,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:09,263 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:09,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:09,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:09,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:09,265 INFO L87 Difference]: Start difference. First operand 135 states and 180 transitions. Second operand 3 states. [2018-12-03 15:41:09,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:09,551 INFO L93 Difference]: Finished difference Result 297 states and 399 transitions. [2018-12-03 15:41:09,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:09,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-12-03 15:41:09,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:09,555 INFO L225 Difference]: With dead ends: 297 [2018-12-03 15:41:09,555 INFO L226 Difference]: Without dead ends: 165 [2018-12-03 15:41:09,556 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 15:41:09,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-03 15:41:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-12-03 15:41:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 15:41:09,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 210 transitions. [2018-12-03 15:41:09,593 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 210 transitions. Word has length 74 [2018-12-03 15:41:09,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:09,594 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 210 transitions. [2018-12-03 15:41:09,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:09,594 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 210 transitions. [2018-12-03 15:41:09,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 15:41:09,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:09,600 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 7, 6, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:09,600 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:09,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:09,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1320054553, now seen corresponding path program 1 times [2018-12-03 15:41:09,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:09,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:09,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:09,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:09,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:09,727 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-12-03 15:41:09,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:09,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:09,728 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:09,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:09,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:09,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:09,731 INFO L87 Difference]: Start difference. First operand 165 states and 210 transitions. Second operand 3 states. [2018-12-03 15:41:09,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:09,966 INFO L93 Difference]: Finished difference Result 360 states and 465 transitions. [2018-12-03 15:41:09,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:09,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-03 15:41:09,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:09,969 INFO L225 Difference]: With dead ends: 360 [2018-12-03 15:41:09,969 INFO L226 Difference]: Without dead ends: 198 [2018-12-03 15:41:09,970 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 15:41:09,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-03 15:41:09,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-12-03 15:41:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-12-03 15:41:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 243 transitions. [2018-12-03 15:41:09,990 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 243 transitions. Word has length 84 [2018-12-03 15:41:09,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:09,990 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 243 transitions. [2018-12-03 15:41:09,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 243 transitions. [2018-12-03 15:41:09,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 15:41:09,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:09,992 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 8, 7, 6, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:09,992 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:09,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:09,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1153559737, now seen corresponding path program 1 times [2018-12-03 15:41:09,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:09,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:09,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:09,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:09,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-12-03 15:41:10,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:10,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:10,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:10,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:10,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:10,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:10,091 INFO L87 Difference]: Start difference. First operand 198 states and 243 transitions. Second operand 3 states. [2018-12-03 15:41:10,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:10,225 INFO L93 Difference]: Finished difference Result 429 states and 548 transitions. [2018-12-03 15:41:10,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:10,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-12-03 15:41:10,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:10,228 INFO L225 Difference]: With dead ends: 429 [2018-12-03 15:41:10,228 INFO L226 Difference]: Without dead ends: 234 [2018-12-03 15:41:10,229 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 15:41:10,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-03 15:41:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-12-03 15:41:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-12-03 15:41:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 279 transitions. [2018-12-03 15:41:10,248 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 279 transitions. Word has length 95 [2018-12-03 15:41:10,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:10,248 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 279 transitions. [2018-12-03 15:41:10,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:10,248 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 279 transitions. [2018-12-03 15:41:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 15:41:10,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:10,250 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 9, 8, 7, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:10,250 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:10,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:10,251 INFO L82 PathProgramCache]: Analyzing trace with hash -580341928, now seen corresponding path program 1 times [2018-12-03 15:41:10,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:10,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:10,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:10,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:10,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:10,446 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 200 proven. 5 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-12-03 15:41:10,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:10,446 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:10,448 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2018-12-03 15:41:10,450 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [36], [40], [42], [46], [48], [52], [54], [58], [60], [62], [67], [69], [73], [75], [79], [81] [2018-12-03 15:41:10,508 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:10,509 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:11,129 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inappropriate decl info at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:240) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.Boogie2SmtSymbolTableTmpVars.getBoogieVar(Boogie2SmtSymbolTableTmpVars.java:112) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.getBoogieVar(NonrelationalStatementProcessor.java:581) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.visit(NonrelationalStatementProcessor.java:520) at de.uni_freiburg.informatik.ultimate.boogie.BoogieVisitor.processExpression(BoogieVisitor.java:369) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processExpression(NonrelationalStatementProcessor.java:221) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleSingleAssignment(NonrelationalStatementProcessor.java:348) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssignment(NonrelationalStatementProcessor.java:294) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:191) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:176) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:145) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:373) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:364) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:127) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainToolkit.handleStatementBySubdomain(ArrayDomainToolkit.java:159) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainStatementProcessor.processSingleAssignment(ArrayDomainStatementProcessor.java:136) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainStatementProcessor.processAssignment(ArrayDomainStatementProcessor.java:76) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainStatementProcessor.process(ArrayDomainStatementProcessor.java:43) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainPostOperator.handleInternalTransition(ArrayDomainPostOperator.java:120) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainPostOperator.apply(ArrayDomainPostOperator.java:70) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainPostOperator.apply(ArrayDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:536) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:220) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-03 15:41:11,135 INFO L168 Benchmark]: Toolchain (without parser) took 6328.62 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 649.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -647.1 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:11,139 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:41:11,139 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.50 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:41:11,140 INFO L168 Benchmark]: Boogie Preprocessor took 62.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:41:11,140 INFO L168 Benchmark]: RCFGBuilder took 626.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:11,141 INFO L168 Benchmark]: TraceAbstraction took 5577.08 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 649.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -678.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:41:11,147 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.50 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 626.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5577.08 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 649.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -678.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inappropriate decl info de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inappropriate decl info: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:240) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...