java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 17:33:58,302 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:33:58,307 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:33:58,323 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:33:58,323 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:33:58,324 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:33:58,325 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:33:58,327 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:33:58,328 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:33:58,329 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:33:58,330 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:33:58,330 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:33:58,331 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:33:58,332 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:33:58,333 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:33:58,334 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:33:58,335 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:33:58,337 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:33:58,339 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:33:58,340 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:33:58,341 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:33:58,343 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:33:58,345 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:33:58,345 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:33:58,346 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:33:58,346 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:33:58,347 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:33:58,348 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:33:58,349 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:33:58,350 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:33:58,350 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:33:58,351 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:33:58,351 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:33:58,351 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:33:58,352 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:33:58,353 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:33:58,354 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-31 17:33:58,369 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:33:58,370 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:33:58,371 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:33:58,371 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:33:58,372 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:33:58,372 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:33:58,372 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:33:58,372 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:33:58,372 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:33:58,372 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 17:33:58,375 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 17:33:58,376 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:33:58,376 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:33:58,377 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:33:58,377 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:33:58,377 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:33:58,377 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:33:58,377 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:33:58,378 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:33:58,379 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:33:58,379 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:33:58,379 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:33:58,379 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:33:58,379 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:33:58,380 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:33:58,380 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:33:58,380 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:33:58,380 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:33:58,380 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:33:58,381 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:33:58,381 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:33:58,382 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:33:58,382 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:33:58,382 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:33:58,382 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:33:58,382 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:33:58,383 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:33:58,383 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:33:58,383 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:33:58,433 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:33:58,445 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:33:58,448 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:33:58,449 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:33:58,450 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:33:58,451 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl [2019-01-31 17:33:58,451 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl' [2019-01-31 17:33:58,481 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:33:58,483 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:33:58,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:33:58,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:33:58,484 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:33:58,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:33:58" (1/1) ... [2019-01-31 17:33:58,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:33:58" (1/1) ... [2019-01-31 17:33:58,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:33:58,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:33:58,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:33:58,536 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:33:58,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:33:58" (1/1) ... [2019-01-31 17:33:58,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:33:58" (1/1) ... [2019-01-31 17:33:58,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:33:58" (1/1) ... [2019-01-31 17:33:58,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:33:58" (1/1) ... [2019-01-31 17:33:58,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:33:58" (1/1) ... [2019-01-31 17:33:58,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:33:58" (1/1) ... [2019-01-31 17:33:58,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:33:58" (1/1) ... [2019-01-31 17:33:58,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:33:58,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:33:58,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:33:58,558 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:33:58,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:33:58" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:33:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 17:33:58,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 17:33:58,842 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 17:33:58,843 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-31 17:33:58,844 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:33:58 BoogieIcfgContainer [2019-01-31 17:33:58,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:33:58,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:33:58,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:33:58,848 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:33:58,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:33:58" (1/2) ... [2019-01-31 17:33:58,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36556df6 and model type speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:33:58, skipping insertion in model container [2019-01-31 17:33:58,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:33:58" (2/2) ... [2019-01-31 17:33:58,852 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-2-unlimited.bpl [2019-01-31 17:33:58,861 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:33:58,868 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-31 17:33:58,885 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-31 17:33:58,921 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:33:58,921 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:33:58,921 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:33:58,921 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:33:58,922 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:33:58,923 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:33:58,923 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:33:58,923 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:33:58,942 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-31 17:33:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 17:33:58,953 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:33:58,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 17:33:58,959 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:33:58,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:33:58,967 INFO L82 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2019-01-31 17:33:58,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:33:59,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:33:59,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:33:59,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:33:59,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:33:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:33:59,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:33:59,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:33:59,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:33:59,121 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:33:59,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:33:59,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:33:59,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:33:59,137 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-31 17:33:59,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:33:59,317 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-01-31 17:33:59,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:33:59,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 17:33:59,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:33:59,335 INFO L225 Difference]: With dead ends: 13 [2019-01-31 17:33:59,335 INFO L226 Difference]: Without dead ends: 8 [2019-01-31 17:33:59,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:33:59,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-31 17:33:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2019-01-31 17:33:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 17:33:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-01-31 17:33:59,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 2 [2019-01-31 17:33:59,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:33:59,376 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-31 17:33:59,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:33:59,377 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-01-31 17:33:59,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:33:59,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:33:59,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:33:59,378 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:33:59,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:33:59,379 INFO L82 PathProgramCache]: Analyzing trace with hash 29988, now seen corresponding path program 1 times [2019-01-31 17:33:59,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:33:59,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:33:59,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:33:59,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:33:59,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:33:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:33:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:33:59,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:33:59,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:33:59,475 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:33:59,476 INFO L207 CegarAbsIntRunner]: [0], [6], [11] [2019-01-31 17:33:59,534 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:33:59,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:00,550 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:00,552 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:34:00,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:00,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:00,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:00,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:00,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:00,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:00,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:00,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-31 17:34:00,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-31 17:34:00,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:00,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:00,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:00,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-01-31 17:34:01,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:01,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-31 17:34:01,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:01,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:01,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-31 17:34:01,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:01,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:01,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:01,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:34:01,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-01-31 17:34:01,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:01,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:34:01,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:34:01,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-31 17:34:01,070 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-01-31 17:34:01,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:01,156 INFO L93 Difference]: Finished difference Result 10 states and 17 transitions. [2019-01-31 17:34:01,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:34:01,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 17:34:01,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:01,158 INFO L225 Difference]: With dead ends: 10 [2019-01-31 17:34:01,159 INFO L226 Difference]: Without dead ends: 9 [2019-01-31 17:34:01,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-31 17:34:01,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-31 17:34:01,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-01-31 17:34:01,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 17:34:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2019-01-31 17:34:01,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 13 transitions. Word has length 3 [2019-01-31 17:34:01,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:01,165 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 13 transitions. [2019-01-31 17:34:01,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:34:01,165 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 13 transitions. [2019-01-31 17:34:01,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:34:01,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:01,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:34:01,166 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:01,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:01,167 INFO L82 PathProgramCache]: Analyzing trace with hash 30050, now seen corresponding path program 1 times [2019-01-31 17:34:01,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:01,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:01,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:01,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:01,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:01,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:01,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:01,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:01,276 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:34:01,276 INFO L207 CegarAbsIntRunner]: [0], [8], [11] [2019-01-31 17:34:01,277 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:01,277 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:04,062 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:04,063 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:34:04,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:04,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:04,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:04,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:04,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:04,085 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:04,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:04,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-31 17:34:04,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-31 17:34:04,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:04,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:04,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-31 17:34:04,394 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:04,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:04,411 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-01-31 17:34:04,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:04,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:34:04,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:04,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:04,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-01-31 17:34:04,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:04,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:04,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:04,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:04,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:34:04,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:04,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:34:04,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:34:04,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:34:04,566 INFO L87 Difference]: Start difference. First operand 7 states and 13 transitions. Second operand 6 states. [2019-01-31 17:34:04,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:04,834 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2019-01-31 17:34:04,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:34:04,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:34:04,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:04,835 INFO L225 Difference]: With dead ends: 17 [2019-01-31 17:34:04,835 INFO L226 Difference]: Without dead ends: 14 [2019-01-31 17:34:04,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:34:04,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-31 17:34:04,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2019-01-31 17:34:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 17:34:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2019-01-31 17:34:04,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 21 transitions. Word has length 3 [2019-01-31 17:34:04,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:04,840 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 21 transitions. [2019-01-31 17:34:04,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:34:04,840 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 21 transitions. [2019-01-31 17:34:04,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:34:04,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:04,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:34:04,841 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:04,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:04,841 INFO L82 PathProgramCache]: Analyzing trace with hash 929546, now seen corresponding path program 1 times [2019-01-31 17:34:04,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:04,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:04,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:04,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:04,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:04,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:04,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:04,915 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:34:04,915 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [11] [2019-01-31 17:34:04,917 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:04,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:05,267 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:05,267 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:34:05,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:05,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:05,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:05,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:05,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:05,285 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:05,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:05,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-31 17:34:05,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:05,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-31 17:34:05,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-31 17:34:05,350 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:05,358 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:05,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:05,369 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-01-31 17:34:05,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:05,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-31 17:34:05,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:05,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:05,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-31 17:34:05,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:05,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:05,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:05,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:05,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:34:05,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:05,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:05,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-01-31 17:34:05,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:05,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:05,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:05,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:34:05,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:05,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:34:05,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:34:05,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:34:05,879 INFO L87 Difference]: Start difference. First operand 10 states and 21 transitions. Second operand 8 states. [2019-01-31 17:34:06,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:06,016 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2019-01-31 17:34:06,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:34:06,017 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:34:06,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:06,018 INFO L225 Difference]: With dead ends: 18 [2019-01-31 17:34:06,018 INFO L226 Difference]: Without dead ends: 15 [2019-01-31 17:34:06,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:34:06,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-31 17:34:06,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 6. [2019-01-31 17:34:06,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 17:34:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-01-31 17:34:06,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 4 [2019-01-31 17:34:06,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:06,022 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-31 17:34:06,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:34:06,022 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-01-31 17:34:06,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:34:06,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:06,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:34:06,023 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:06,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:06,023 INFO L82 PathProgramCache]: Analyzing trace with hash 931594, now seen corresponding path program 1 times [2019-01-31 17:34:06,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:06,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:06,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:06,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:06,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:06,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:06,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:06,057 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:34:06,057 INFO L207 CegarAbsIntRunner]: [0], [8], [12], [13] [2019-01-31 17:34:06,059 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:06,059 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:08,101 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:08,101 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:34:08,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:08,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:08,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:08,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:08,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:08,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:08,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:08,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-31 17:34:08,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-31 17:34:08,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:08,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:08,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:08,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-01-31 17:34:08,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:08,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-31 17:34:08,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:08,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:08,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-31 17:34:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:08,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:08,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:34:08,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-31 17:34:08,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:08,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:34:08,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:34:08,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:34:08,236 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-01-31 17:34:08,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:08,288 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2019-01-31 17:34:08,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:34:08,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 17:34:08,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:08,289 INFO L225 Difference]: With dead ends: 12 [2019-01-31 17:34:08,290 INFO L226 Difference]: Without dead ends: 10 [2019-01-31 17:34:08,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:34:08,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-31 17:34:08,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2019-01-31 17:34:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 17:34:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2019-01-31 17:34:08,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 4 [2019-01-31 17:34:08,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:08,300 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 14 transitions. [2019-01-31 17:34:08,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:34:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 14 transitions. [2019-01-31 17:34:08,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:34:08,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:08,301 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-31 17:34:08,301 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:08,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:08,301 INFO L82 PathProgramCache]: Analyzing trace with hash 28814048, now seen corresponding path program 1 times [2019-01-31 17:34:08,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:08,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:08,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:08,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:08,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:34:08,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:34:08,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 17:34:08,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:08,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:34:08,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:34:08,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:34:08,370 INFO L87 Difference]: Start difference. First operand 8 states and 14 transitions. Second operand 4 states. [2019-01-31 17:34:08,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:08,390 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2019-01-31 17:34:08,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:34:08,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 17:34:08,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:08,391 INFO L225 Difference]: With dead ends: 11 [2019-01-31 17:34:08,391 INFO L226 Difference]: Without dead ends: 9 [2019-01-31 17:34:08,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:34:08,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-31 17:34:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-31 17:34:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-31 17:34:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2019-01-31 17:34:08,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 16 transitions. Word has length 5 [2019-01-31 17:34:08,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:08,396 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 16 transitions. [2019-01-31 17:34:08,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:34:08,396 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-01-31 17:34:08,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:34:08,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:08,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:34:08,397 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:08,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:08,397 INFO L82 PathProgramCache]: Analyzing trace with hash 28873630, now seen corresponding path program 1 times [2019-01-31 17:34:08,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:08,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:08,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:08,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:08,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:08,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:08,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:08,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:08,471 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:34:08,471 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [12], [13] [2019-01-31 17:34:08,474 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:08,474 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:08,775 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:08,776 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:34:08,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:08,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:08,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:08,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:08,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:08,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:08,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:08,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-31 17:34:08,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:08,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-31 17:34:08,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-31 17:34:08,832 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:08,844 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:08,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:08,856 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-01-31 17:34:08,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:08,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:34:08,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:08,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:08,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-31 17:34:08,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:08,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:08,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:08,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:08,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:34:08,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:08,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:08,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-31 17:34:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:08,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:09,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:09,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:34:09,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:09,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:34:09,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:34:09,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:34:09,018 INFO L87 Difference]: Start difference. First operand 9 states and 16 transitions. Second operand 8 states. [2019-01-31 17:34:09,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:09,098 INFO L93 Difference]: Finished difference Result 12 states and 22 transitions. [2019-01-31 17:34:09,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:34:09,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:34:09,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:09,100 INFO L225 Difference]: With dead ends: 12 [2019-01-31 17:34:09,100 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 17:34:09,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:34:09,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 17:34:09,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 17:34:09,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 17:34:09,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 17:34:09,101 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-01-31 17:34:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:09,101 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 17:34:09,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:34:09,102 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 17:34:09,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 17:34:09,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 17:34:09,477 WARN L181 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2019-01-31 17:34:09,480 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-31 17:34:09,480 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2019-01-31 17:34:09,480 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-31 17:34:09,481 INFO L444 ceAbstractionStarter]: At program point L24-1(lines 23 29) the Hoare annotation is: (let ((.cse2 (select |#memory_int| ULTIMATE.start_main_p1))) (let ((.cse0 (let ((.cse3 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))) (or (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 .cse3)) (and (= .cse2 0) (= 0 .cse3))))) (.cse1 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse2 1)) ULTIMATE.start_main_p2))) (or (and .cse0 (= 0 .cse1)) (and .cse0 (<= (+ .cse1 1) 0))))) [2019-01-31 17:34:09,481 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 31) no Hoare annotation was computed. [2019-01-31 17:34:09,481 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 34) no Hoare annotation was computed. [2019-01-31 17:34:09,481 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 32) no Hoare annotation was computed. [2019-01-31 17:34:09,492 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:34:09 BoogieIcfgContainer [2019-01-31 17:34:09,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 17:34:09,493 INFO L168 Benchmark]: Toolchain (without parser) took 11011.15 ms. Allocated memory was 141.6 MB in the beginning and 502.3 MB in the end (delta: 360.7 MB). Free memory was 109.1 MB in the beginning and 147.3 MB in the end (delta: -38.2 MB). Peak memory consumption was 322.6 MB. Max. memory is 7.1 GB. [2019-01-31 17:34:09,494 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.6 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 17:34:09,495 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.20 ms. Allocated memory is still 141.6 MB. Free memory was 108.9 MB in the beginning and 106.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-01-31 17:34:09,496 INFO L168 Benchmark]: Boogie Preprocessor took 21.14 ms. Allocated memory is still 141.6 MB. Free memory was 106.9 MB in the beginning and 105.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-31 17:34:09,496 INFO L168 Benchmark]: RCFGBuilder took 286.58 ms. Allocated memory is still 141.6 MB. Free memory was 105.6 MB in the beginning and 96.8 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. [2019-01-31 17:34:09,497 INFO L168 Benchmark]: TraceAbstraction took 10647.35 ms. Allocated memory was 141.6 MB in the beginning and 502.3 MB in the end (delta: 360.7 MB). Free memory was 96.6 MB in the beginning and 147.3 MB in the end (delta: -50.7 MB). Peak memory consumption was 310.0 MB. Max. memory is 7.1 GB. [2019-01-31 17:34:09,501 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.6 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.20 ms. Allocated memory is still 141.6 MB. Free memory was 108.9 MB in the beginning and 106.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.14 ms. Allocated memory is still 141.6 MB. Free memory was 106.9 MB in the beginning and 105.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 286.58 ms. Allocated memory is still 141.6 MB. Free memory was 105.6 MB in the beginning and 96.8 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10647.35 ms. Allocated memory was 141.6 MB in the beginning and 502.3 MB in the end (delta: 360.7 MB). Free memory was 96.6 MB in the beginning and 147.3 MB in the end (delta: -50.7 MB). Peak memory consumption was 310.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 31]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 32]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((!(p1 == p2) && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (#memory_int[p1] == 0 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1])) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) || (((!(p1 == p2) && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (#memory_int[p1] == 0 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1])) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. SAFE Result, 10.5s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 13 SDtfs, 31 SDslu, 1 SDs, 0 SdLazy, 175 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.5s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 8 NumberOfFragments, 101 HoareAnnotationTreeSize, 1 FomulaSimplifications, 594 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 561 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 47 ConstructedInterpolants, 4 QuantifiedInterpolants, 1521 SizeOfPredicates, 11 NumberOfNonLiveVariables, 69 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 9/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...