java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.cil.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:00:05,099 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:00:05,101 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:00:05,114 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:00:05,115 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:00:05,116 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:00:05,117 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:00:05,119 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:00:05,121 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:00:05,122 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:00:05,122 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:00:05,123 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:00:05,124 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:00:05,125 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:00:05,126 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:00:05,127 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:00:05,128 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:00:05,130 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:00:05,133 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:00:05,135 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:00:05,137 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:00:05,138 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:00:05,141 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:00:05,141 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:00:05,142 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:00:05,146 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:00:05,147 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:00:05,148 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:00:05,153 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:00:05,154 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:00:05,154 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:00:05,158 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:00:05,159 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:00:05,159 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:00:05,160 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:00:05,161 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:00:05,161 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 18:00:05,193 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:00:05,193 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:00:05,197 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:00:05,197 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:00:05,197 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:00:05,198 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:00:05,198 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:00:05,198 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:00:05,198 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:00:05,198 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:00:05,199 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:00:05,199 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:00:05,199 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:00:05,201 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:00:05,201 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:00:05,201 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:00:05,203 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:00:05,203 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:00:05,203 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:00:05,203 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:00:05,203 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:00:05,204 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:00:05,204 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:00:05,204 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:00:05,204 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:00:05,204 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:00:05,205 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:00:05,207 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:00:05,207 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:00:05,207 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:00:05,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:00:05,208 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:00:05,208 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:00:05,208 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:00:05,208 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:00:05,208 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:00:05,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:00:05,209 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:00:05,209 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:00:05,265 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:00:05,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:00:05,286 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:00:05,288 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:00:05,289 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:00:05,290 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.cil.c_21.bpl [2018-12-03 18:00:05,290 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.cil.c_21.bpl' [2018-12-03 18:00:05,419 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:00:05,421 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:00:05,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:00:05,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:00:05,423 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:00:05,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (1/1) ... [2018-12-03 18:00:05,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (1/1) ... [2018-12-03 18:00:05,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:00:05,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:00:05,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:00:05,470 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:00:05,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (1/1) ... [2018-12-03 18:00:05,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (1/1) ... [2018-12-03 18:00:05,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (1/1) ... [2018-12-03 18:00:05,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (1/1) ... [2018-12-03 18:00:05,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (1/1) ... [2018-12-03 18:00:05,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (1/1) ... [2018-12-03 18:00:05,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (1/1) ... [2018-12-03 18:00:05,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:00:05,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:00:05,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:00:05,510 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:00:05,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (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 18:00:05,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 18:00:05,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 18:00:06,229 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 18:00:06,230 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 18:00:06,231 INFO L202 PluginConnector]: Adding new model s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:00:06 BoogieIcfgContainer [2018-12-03 18:00:06,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:00:06,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:00:06,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:00:06,238 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:00:06,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (1/2) ... [2018-12-03 18:00:06,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa389cd and model type s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:00:06, skipping insertion in model container [2018-12-03 18:00:06,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:00:06" (2/2) ... [2018-12-03 18:00:06,242 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil.c_21.bpl [2018-12-03 18:00:06,252 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:00:06,262 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:00:06,280 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:00:06,323 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:00:06,323 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:00:06,323 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:00:06,324 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:00:06,324 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:00:06,324 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:00:06,324 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:00:06,324 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:00:06,346 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-12-03 18:00:06,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:00:06,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:06,357 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:06,360 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:06,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:06,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1918575661, now seen corresponding path program 1 times [2018-12-03 18:00:06,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:06,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:06,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:06,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:06,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:06,610 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 18:00:06,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:06,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:00:06,612 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:06,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:06,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:06,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:06,633 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2018-12-03 18:00:06,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:06,947 INFO L93 Difference]: Finished difference Result 51 states and 85 transitions. [2018-12-03 18:00:06,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:06,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 18:00:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:06,964 INFO L225 Difference]: With dead ends: 51 [2018-12-03 18:00:06,965 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 18:00:06,969 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 18:00:06,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 18:00:07,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 18:00:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 18:00:07,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 48 transitions. [2018-12-03 18:00:07,053 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 48 transitions. Word has length 10 [2018-12-03 18:00:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:07,054 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 48 transitions. [2018-12-03 18:00:07,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 48 transitions. [2018-12-03 18:00:07,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 18:00:07,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:07,059 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:07,063 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:07,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:07,063 INFO L82 PathProgramCache]: Analyzing trace with hash -469243037, now seen corresponding path program 1 times [2018-12-03 18:00:07,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:07,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:07,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:07,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:07,066 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:00:07,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:07,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:00:07,231 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:07,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:07,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:07,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:07,234 INFO L87 Difference]: Start difference. First operand 30 states and 48 transitions. Second operand 3 states. [2018-12-03 18:00:07,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:07,461 INFO L93 Difference]: Finished difference Result 73 states and 119 transitions. [2018-12-03 18:00:07,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:07,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-03 18:00:07,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:07,463 INFO L225 Difference]: With dead ends: 73 [2018-12-03 18:00:07,464 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 18:00:07,465 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 18:00:07,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 18:00:07,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 18:00:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 18:00:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2018-12-03 18:00:07,484 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 19 [2018-12-03 18:00:07,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:07,484 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 70 transitions. [2018-12-03 18:00:07,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:07,484 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2018-12-03 18:00:07,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 18:00:07,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:07,486 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:07,486 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:07,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:07,487 INFO L82 PathProgramCache]: Analyzing trace with hash -215353290, now seen corresponding path program 1 times [2018-12-03 18:00:07,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:07,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:07,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:07,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:07,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:00:07,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:07,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:00:07,588 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:07,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:07,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:07,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:07,590 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. Second operand 3 states. [2018-12-03 18:00:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:07,896 INFO L93 Difference]: Finished difference Result 100 states and 161 transitions. [2018-12-03 18:00:07,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:07,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 18:00:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:07,899 INFO L225 Difference]: With dead ends: 100 [2018-12-03 18:00:07,899 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 18:00:07,900 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 18:00:07,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 18:00:07,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 18:00:07,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 18:00:07,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 91 transitions. [2018-12-03 18:00:07,917 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 91 transitions. Word has length 22 [2018-12-03 18:00:07,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:07,918 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 91 transitions. [2018-12-03 18:00:07,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:07,918 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 91 transitions. [2018-12-03 18:00:07,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 18:00:07,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:07,919 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:07,920 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:07,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:07,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1101636687, now seen corresponding path program 1 times [2018-12-03 18:00:07,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:07,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:07,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:07,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:07,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 18:00:07,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:07,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:00:07,993 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:07,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:07,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:07,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:07,995 INFO L87 Difference]: Start difference. First operand 57 states and 91 transitions. Second operand 3 states. [2018-12-03 18:00:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:08,475 INFO L93 Difference]: Finished difference Result 119 states and 191 transitions. [2018-12-03 18:00:08,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:08,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-03 18:00:08,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:08,477 INFO L225 Difference]: With dead ends: 119 [2018-12-03 18:00:08,477 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 18:00:08,478 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 18:00:08,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 18:00:08,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 18:00:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 18:00:08,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 97 transitions. [2018-12-03 18:00:08,492 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 97 transitions. Word has length 27 [2018-12-03 18:00:08,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:08,492 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 97 transitions. [2018-12-03 18:00:08,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:08,492 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 97 transitions. [2018-12-03 18:00:08,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 18:00:08,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:08,494 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:08,494 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:08,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:08,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1650874841, now seen corresponding path program 1 times [2018-12-03 18:00:08,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:08,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:08,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:08,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:08,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:08,592 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 18:00:08,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:08,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:00:08,593 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:08,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:08,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:08,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:08,595 INFO L87 Difference]: Start difference. First operand 63 states and 97 transitions. Second operand 3 states. [2018-12-03 18:00:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:08,743 INFO L93 Difference]: Finished difference Result 130 states and 201 transitions. [2018-12-03 18:00:08,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:08,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 18:00:08,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:08,746 INFO L225 Difference]: With dead ends: 130 [2018-12-03 18:00:08,746 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 18:00:08,748 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 18:00:08,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 18:00:08,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 18:00:08,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 18:00:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2018-12-03 18:00:08,761 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 34 [2018-12-03 18:00:08,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:08,761 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2018-12-03 18:00:08,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2018-12-03 18:00:08,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 18:00:08,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:08,763 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:08,764 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:08,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:08,764 INFO L82 PathProgramCache]: Analyzing trace with hash -23931843, now seen corresponding path program 1 times [2018-12-03 18:00:08,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:08,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:08,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:08,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:08,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 18:00:08,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:08,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:00:08,859 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:08,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:08,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:08,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:08,861 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand 3 states. [2018-12-03 18:00:09,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:09,064 INFO L93 Difference]: Finished difference Result 151 states and 224 transitions. [2018-12-03 18:00:09,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:09,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 18:00:09,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:09,066 INFO L225 Difference]: With dead ends: 151 [2018-12-03 18:00:09,066 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 18:00:09,067 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 18:00:09,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 18:00:09,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 18:00:09,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 18:00:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 122 transitions. [2018-12-03 18:00:09,082 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 122 transitions. Word has length 34 [2018-12-03 18:00:09,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:09,082 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 122 transitions. [2018-12-03 18:00:09,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:09,083 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 122 transitions. [2018-12-03 18:00:09,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 18:00:09,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:09,084 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:09,085 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:09,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:09,085 INFO L82 PathProgramCache]: Analyzing trace with hash -870093467, now seen corresponding path program 1 times [2018-12-03 18:00:09,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:09,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:09,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:09,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:09,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:09,160 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-03 18:00:09,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:09,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:00:09,161 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:09,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:09,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:09,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:09,162 INFO L87 Difference]: Start difference. First operand 83 states and 122 transitions. Second operand 3 states. [2018-12-03 18:00:09,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:09,310 INFO L93 Difference]: Finished difference Result 169 states and 249 transitions. [2018-12-03 18:00:09,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:09,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-03 18:00:09,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:09,312 INFO L225 Difference]: With dead ends: 169 [2018-12-03 18:00:09,312 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 18:00:09,313 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 18:00:09,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 18:00:09,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 18:00:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 18:00:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2018-12-03 18:00:09,330 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 38 [2018-12-03 18:00:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:09,330 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2018-12-03 18:00:09,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:09,331 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2018-12-03 18:00:09,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 18:00:09,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:09,332 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:09,333 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:09,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:09,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1006859965, now seen corresponding path program 1 times [2018-12-03 18:00:09,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:09,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:09,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:09,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:09,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-03 18:00:09,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:09,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:09,446 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:09,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:09,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:09,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:09,448 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. Second operand 3 states. [2018-12-03 18:00:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:09,697 INFO L93 Difference]: Finished difference Result 252 states and 353 transitions. [2018-12-03 18:00:09,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:09,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-03 18:00:09,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:09,703 INFO L225 Difference]: With dead ends: 252 [2018-12-03 18:00:09,703 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 18:00:09,705 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 18:00:09,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 18:00:09,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-12-03 18:00:09,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-03 18:00:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 230 transitions. [2018-12-03 18:00:09,758 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 230 transitions. Word has length 41 [2018-12-03 18:00:09,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:09,758 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 230 transitions. [2018-12-03 18:00:09,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 230 transitions. [2018-12-03 18:00:09,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 18:00:09,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:09,765 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:09,766 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:09,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:09,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1429561791, now seen corresponding path program 1 times [2018-12-03 18:00:09,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:09,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:09,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:09,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:09,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:09,895 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 18:00:09,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:09,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:09,896 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:09,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:09,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:09,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:09,897 INFO L87 Difference]: Start difference. First operand 166 states and 230 transitions. Second operand 3 states. [2018-12-03 18:00:10,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:10,103 INFO L93 Difference]: Finished difference Result 240 states and 334 transitions. [2018-12-03 18:00:10,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:10,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-03 18:00:10,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:10,106 INFO L225 Difference]: With dead ends: 240 [2018-12-03 18:00:10,107 INFO L226 Difference]: Without dead ends: 238 [2018-12-03 18:00:10,107 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 18:00:10,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-12-03 18:00:10,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-12-03 18:00:10,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-12-03 18:00:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 330 transitions. [2018-12-03 18:00:10,148 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 330 transitions. Word has length 41 [2018-12-03 18:00:10,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:10,149 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 330 transitions. [2018-12-03 18:00:10,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:10,149 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 330 transitions. [2018-12-03 18:00:10,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 18:00:10,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:10,152 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 7, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:10,152 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:10,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:10,153 INFO L82 PathProgramCache]: Analyzing trace with hash -159729293, now seen corresponding path program 1 times [2018-12-03 18:00:10,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:10,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:10,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:10,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:10,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-03 18:00:10,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:10,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:10,258 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:10,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:10,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:10,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:10,259 INFO L87 Difference]: Start difference. First operand 237 states and 330 transitions. Second operand 3 states. [2018-12-03 18:00:10,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:10,708 INFO L93 Difference]: Finished difference Result 473 states and 659 transitions. [2018-12-03 18:00:10,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:10,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-12-03 18:00:10,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:10,714 INFO L225 Difference]: With dead ends: 473 [2018-12-03 18:00:10,714 INFO L226 Difference]: Without dead ends: 237 [2018-12-03 18:00:10,715 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 18:00:10,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-12-03 18:00:10,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-12-03 18:00:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-12-03 18:00:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 324 transitions. [2018-12-03 18:00:10,743 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 324 transitions. Word has length 91 [2018-12-03 18:00:10,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:10,744 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 324 transitions. [2018-12-03 18:00:10,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:10,744 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 324 transitions. [2018-12-03 18:00:10,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 18:00:10,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:10,746 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 8, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:10,746 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:10,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:10,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2023902907, now seen corresponding path program 1 times [2018-12-03 18:00:10,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:10,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:10,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:10,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:10,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-12-03 18:00:10,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:10,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:10,852 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:10,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:10,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:10,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:10,853 INFO L87 Difference]: Start difference. First operand 237 states and 324 transitions. Second operand 3 states. [2018-12-03 18:00:11,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:11,052 INFO L93 Difference]: Finished difference Result 473 states and 647 transitions. [2018-12-03 18:00:11,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:11,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-12-03 18:00:11,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:11,056 INFO L225 Difference]: With dead ends: 473 [2018-12-03 18:00:11,056 INFO L226 Difference]: Without dead ends: 237 [2018-12-03 18:00:11,057 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 18:00:11,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-12-03 18:00:11,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-12-03 18:00:11,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-12-03 18:00:11,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 318 transitions. [2018-12-03 18:00:11,088 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 318 transitions. Word has length 100 [2018-12-03 18:00:11,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:11,089 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 318 transitions. [2018-12-03 18:00:11,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:11,089 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 318 transitions. [2018-12-03 18:00:11,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 18:00:11,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:11,091 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 9, 7, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:11,091 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:11,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:11,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1040365903, now seen corresponding path program 1 times [2018-12-03 18:00:11,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:11,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:11,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:11,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:11,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:11,256 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-12-03 18:00:11,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:11,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:11,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:11,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:11,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:11,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:11,258 INFO L87 Difference]: Start difference. First operand 237 states and 318 transitions. Second operand 3 states. [2018-12-03 18:00:11,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:11,555 INFO L93 Difference]: Finished difference Result 500 states and 668 transitions. [2018-12-03 18:00:11,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:11,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-12-03 18:00:11,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:11,558 INFO L225 Difference]: With dead ends: 500 [2018-12-03 18:00:11,558 INFO L226 Difference]: Without dead ends: 264 [2018-12-03 18:00:11,559 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 18:00:11,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-12-03 18:00:11,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-12-03 18:00:11,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-12-03 18:00:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 345 transitions. [2018-12-03 18:00:11,591 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 345 transitions. Word has length 109 [2018-12-03 18:00:11,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:11,591 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 345 transitions. [2018-12-03 18:00:11,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 345 transitions. [2018-12-03 18:00:11,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-03 18:00:11,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:11,593 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 10, 8, 6, 4, 3, 3, 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 18:00:11,594 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:11,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:11,594 INFO L82 PathProgramCache]: Analyzing trace with hash -2115374141, now seen corresponding path program 1 times [2018-12-03 18:00:11,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:11,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:11,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:11,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:11,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-12-03 18:00:11,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:11,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:11,712 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:11,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:11,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:11,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:11,714 INFO L87 Difference]: Start difference. First operand 264 states and 345 transitions. Second operand 3 states. [2018-12-03 18:00:11,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:11,998 INFO L93 Difference]: Finished difference Result 557 states and 728 transitions. [2018-12-03 18:00:12,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:12,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2018-12-03 18:00:12,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:12,002 INFO L225 Difference]: With dead ends: 557 [2018-12-03 18:00:12,003 INFO L226 Difference]: Without dead ends: 294 [2018-12-03 18:00:12,004 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 18:00:12,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-03 18:00:12,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2018-12-03 18:00:12,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-03 18:00:12,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 375 transitions. [2018-12-03 18:00:12,036 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 375 transitions. Word has length 118 [2018-12-03 18:00:12,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:12,037 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 375 transitions. [2018-12-03 18:00:12,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:12,037 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 375 transitions. [2018-12-03 18:00:12,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 18:00:12,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:12,039 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 11, 9, 7, 5, 4, 3, 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] [2018-12-03 18:00:12,039 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:12,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:12,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1302152706, now seen corresponding path program 1 times [2018-12-03 18:00:12,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:12,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:12,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:12,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:12,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 339 proven. 5 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-12-03 18:00:12,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:00:12,258 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:00:12,259 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 129 with the following transitions: [2018-12-03 18:00:12,262 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [36], [40], [42], [46], [48], [50], [54], [56], [60], [62], [64], [68], [70], [74], [76], [78], [83], [85], [89], [91], [95], [97] [2018-12-03 18:00:12,396 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:00:12,396 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:00:14,285 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 18:00:19,954 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Incompatible matrices at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) 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) Caused by: java.lang.IllegalArgumentException: Incompatible matrices at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctMatrix.checkCompatibility(OctMatrix.java:564) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctMatrix.elementwiseRelation(OctMatrix.java:488) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctDomainState.isSubsetOf(OctDomainState.java:601) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctDomainState.isSubsetOf(OctDomainState.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainState.isSubsetOfInternally(CompoundDomainState.java:211) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainState.isStrictSubsetOf(CompoundDomainState.java:293) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainState.isSubsetOf(CompoundDomainState.java:283) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainState.isSubsetOf(CompoundDomainState.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainState.isSubsetOf(ArrayDomainState.java:909) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainState.isSubsetOf(ArrayDomainState.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.getMaximalElements(DisjunctiveAbstractState.java:588) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.reduce(DisjunctiveAbstractState.java:565) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:538) 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) ... 20 more [2018-12-03 18:00:19,960 INFO L168 Benchmark]: Toolchain (without parser) took 14539.87 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 45.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-12-03 18:00:19,962 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 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 18:00:19,963 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.56 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 18:00:19,963 INFO L168 Benchmark]: Boogie Preprocessor took 39.94 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 18:00:19,964 INFO L168 Benchmark]: RCFGBuilder took 721.22 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 18:00:19,965 INFO L168 Benchmark]: TraceAbstraction took 13725.97 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-12-03 18:00:19,970 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.24 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 46.56 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 39.94 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 721.22 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13725.97 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Incompatible matrices de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Incompatible matrices: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...