java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-08 14:01:38,195 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 14:01:38,204 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 14:01:38,222 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 14:01:38,223 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 14:01:38,224 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 14:01:38,225 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 14:01:38,227 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 14:01:38,229 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 14:01:38,230 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 14:01:38,232 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 14:01:38,233 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 14:01:38,234 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 14:01:38,235 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 14:01:38,241 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 14:01:38,242 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 14:01:38,243 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 14:01:38,248 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 14:01:38,257 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 14:01:38,259 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 14:01:38,260 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 14:01:38,263 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 14:01:38,266 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 14:01:38,266 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 14:01:38,268 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 14:01:38,269 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 14:01:38,271 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 14:01:38,272 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 14:01:38,272 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 14:01:38,276 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 14:01:38,276 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 14:01:38,277 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 14:01:38,277 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 14:01:38,279 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 14:01:38,280 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 14:01:38,281 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 14:01:38,282 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-08 14:01:38,304 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 14:01:38,305 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 14:01:38,306 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 14:01:38,306 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 14:01:38,306 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 14:01:38,307 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 14:01:38,307 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 14:01:38,307 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 14:01:38,308 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-08 14:01:38,308 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 14:01:38,308 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-08 14:01:38,308 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-08 14:01:38,308 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 14:01:38,309 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 14:01:38,309 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 14:01:38,311 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 14:01:38,311 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 14:01:38,311 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 14:01:38,311 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 14:01:38,312 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 14:01:38,312 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 14:01:38,312 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 14:01:38,312 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 14:01:38,312 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 14:01:38,314 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 14:01:38,315 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 14:01:38,315 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 14:01:38,315 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 14:01:38,315 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 14:01:38,315 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 14:01:38,316 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 14:01:38,316 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 14:01:38,316 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 14:01:38,316 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 14:01:38,316 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 14:01:38,317 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 14:01:38,317 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 14:01:38,317 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 14:01:38,317 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 14:01:38,317 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 14:01:38,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 14:01:38,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 14:01:38,393 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 14:01:38,395 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 14:01:38,396 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 14:01:38,397 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl [2019-01-08 14:01:38,397 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl' [2019-01-08 14:01:38,446 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 14:01:38,448 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 14:01:38,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 14:01:38,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 14:01:38,449 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 14:01:38,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:01:38" (1/1) ... [2019-01-08 14:01:38,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:01:38" (1/1) ... [2019-01-08 14:01:38,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 14:01:38,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 14:01:38,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 14:01:38,512 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 14:01:38,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:01:38" (1/1) ... [2019-01-08 14:01:38,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:01:38" (1/1) ... [2019-01-08 14:01:38,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:01:38" (1/1) ... [2019-01-08 14:01:38,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:01:38" (1/1) ... [2019-01-08 14:01:38,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:01:38" (1/1) ... [2019-01-08 14:01:38,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:01:38" (1/1) ... [2019-01-08 14:01:38,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:01:38" (1/1) ... [2019-01-08 14:01:38,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 14:01:38,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 14:01:38,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 14:01:38,541 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 14:01:38,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:01:38" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-08 14:01:38,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 14:01:38,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 14:01:38,785 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 14:01:38,785 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-08 14:01:38,790 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:01:38 BoogieIcfgContainer [2019-01-08 14:01:38,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 14:01:38,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 14:01:38,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 14:01:38,796 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 14:01:38,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:01:38" (1/2) ... [2019-01-08 14:01:38,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d0043e and model type speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 02:01:38, skipping insertion in model container [2019-01-08 14:01:38,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:01:38" (2/2) ... [2019-01-08 14:01:38,800 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-2-limited.bpl [2019-01-08 14:01:38,810 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 14:01:38,820 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-08 14:01:38,839 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-08 14:01:38,880 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 14:01:38,881 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 14:01:38,881 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 14:01:38,881 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 14:01:38,881 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 14:01:38,881 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 14:01:38,882 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 14:01:38,882 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 14:01:38,901 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-08 14:01:38,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-08 14:01:38,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:38,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-08 14:01:38,918 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:38,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:38,925 INFO L82 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2019-01-08 14:01:38,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:38,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:38,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:38,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:38,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:39,094 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-08 14:01:39,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:01:39,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-08 14:01:39,096 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:01:39,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:01:39,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:01:39,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:01:39,114 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-08 14:01:39,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:39,267 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-01-08 14:01:39,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:01:39,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-08 14:01:39,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:39,296 INFO L225 Difference]: With dead ends: 13 [2019-01-08 14:01:39,297 INFO L226 Difference]: Without dead ends: 8 [2019-01-08 14:01:39,300 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-08 14:01:39,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-08 14:01:39,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2019-01-08 14:01:39,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-08 14:01:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-01-08 14:01:39,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 2 [2019-01-08 14:01:39,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:39,339 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-08 14:01:39,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:01:39,339 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-01-08 14:01:39,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:01:39,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:39,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:01:39,340 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:39,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:39,341 INFO L82 PathProgramCache]: Analyzing trace with hash 29988, now seen corresponding path program 1 times [2019-01-08 14:01:39,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:39,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:39,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:39,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:39,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:39,500 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-08 14:01:39,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:39,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:39,502 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:01:39,504 INFO L207 CegarAbsIntRunner]: [0], [6], [11] [2019-01-08 14:01:39,559 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:01:39,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:01:39,671 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:01:39,672 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 26 root evaluator evaluations with a maximum evaluation depth of 3. Performed 26 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:01:39,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:39,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:01:39,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:39,681 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-08 14:01:39,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:39,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:01:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:39,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:39,770 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-08 14:01:39,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:01:39,803 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-08 14:01:39,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:01:39,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:01:39,857 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-08 14:01:39,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-01-08 14:01:39,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:01:39,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:01:39,913 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-08 14:01:39,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:01:39,973 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-08 14:01:39,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-08 14:01:40,007 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-08 14:01:40,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:40,033 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-08 14:01:40,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:01:40,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-08 14:01:40,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:01:40,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:01:40,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:01:40,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:01:40,055 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-01-08 14:01:40,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:40,221 INFO L93 Difference]: Finished difference Result 10 states and 17 transitions. [2019-01-08 14:01:40,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 14:01:40,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-08 14:01:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:40,222 INFO L225 Difference]: With dead ends: 10 [2019-01-08 14:01:40,222 INFO L226 Difference]: Without dead ends: 9 [2019-01-08 14:01:40,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:01:40,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-08 14:01:40,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-01-08 14:01:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-08 14:01:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2019-01-08 14:01:40,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 13 transitions. Word has length 3 [2019-01-08 14:01:40,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:40,227 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 13 transitions. [2019-01-08 14:01:40,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:01:40,228 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 13 transitions. [2019-01-08 14:01:40,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:01:40,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:40,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:01:40,229 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:40,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:40,230 INFO L82 PathProgramCache]: Analyzing trace with hash 30050, now seen corresponding path program 1 times [2019-01-08 14:01:40,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:40,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:40,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:40,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:40,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:40,544 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-01-08 14:01:40,568 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-08 14:01:40,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:40,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:40,569 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:01:40,570 INFO L207 CegarAbsIntRunner]: [0], [8], [11] [2019-01-08 14:01:40,571 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:01:40,571 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:01:40,576 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:01:40,577 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 26 root evaluator evaluations with a maximum evaluation depth of 3. Performed 26 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:01:40,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:40,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:01:40,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:40,579 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-08 14:01:40,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:40,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:01:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:40,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:40,617 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-08 14:01:40,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:01:40,626 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-08 14:01:40,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:01:40,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:01:40,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:01:40,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-01-08 14:01:40,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:01:40,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:01:40,702 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-08 14:01:40,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:01:40,721 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-08 14:01:40,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-08 14:01:40,756 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-08 14:01:40,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:40,805 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-08 14:01:40,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:40,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:01:40,825 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:40,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:01:40,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:01:40,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:01:40,827 INFO L87 Difference]: Start difference. First operand 7 states and 13 transitions. Second operand 6 states. [2019-01-08 14:01:41,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:41,035 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2019-01-08 14:01:41,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:01:41,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-08 14:01:41,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:41,037 INFO L225 Difference]: With dead ends: 17 [2019-01-08 14:01:41,037 INFO L226 Difference]: Without dead ends: 14 [2019-01-08 14:01:41,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-08 14:01:41,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-08 14:01:41,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2019-01-08 14:01:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-08 14:01:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2019-01-08 14:01:41,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 21 transitions. Word has length 3 [2019-01-08 14:01:41,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:41,044 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 21 transitions. [2019-01-08 14:01:41,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:01:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 21 transitions. [2019-01-08 14:01:41,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:01:41,045 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:41,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:01:41,045 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:41,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:41,046 INFO L82 PathProgramCache]: Analyzing trace with hash 929546, now seen corresponding path program 1 times [2019-01-08 14:01:41,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:41,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:41,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:41,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:41,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:41,274 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-08 14:01:41,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:41,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:41,275 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:01:41,275 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [11] [2019-01-08 14:01:41,277 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:01:41,277 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:01:41,282 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:01:41,283 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 28 root evaluator evaluations with a maximum evaluation depth of 3. Performed 28 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:01:41,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:41,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:01:41,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:41,283 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-08 14:01:41,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:41,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:01:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:41,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:41,328 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-08 14:01:41,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:01:41,337 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-08 14:01:41,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:01:41,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:01:41,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:01:41,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-01-08 14:01:41,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:01:41,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:01:41,493 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-08 14:01:41,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:01:41,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:01:41,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-08 14:01:41,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:01:41,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:01:41,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:01:41,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:01:41,847 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-08 14:01:41,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:01:41,890 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-08 14:01:41,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-08 14:01:41,915 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-08 14:01:41,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:41,982 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-08 14:01:42,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:42,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:01:42,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:42,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:01:42,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:01:42,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:01:42,002 INFO L87 Difference]: Start difference. First operand 10 states and 21 transitions. Second operand 8 states. [2019-01-08 14:01:42,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:42,164 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2019-01-08 14:01:42,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:01:42,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:01:42,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:42,165 INFO L225 Difference]: With dead ends: 18 [2019-01-08 14:01:42,165 INFO L226 Difference]: Without dead ends: 15 [2019-01-08 14:01:42,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:01:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-08 14:01:42,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 6. [2019-01-08 14:01:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-08 14:01:42,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-01-08 14:01:42,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 4 [2019-01-08 14:01:42,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:42,170 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-08 14:01:42,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:01:42,171 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-01-08 14:01:42,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:01:42,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:42,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:01:42,172 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:42,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:42,172 INFO L82 PathProgramCache]: Analyzing trace with hash 931594, now seen corresponding path program 1 times [2019-01-08 14:01:42,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:42,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:42,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:42,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:42,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:42,325 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-08 14:01:42,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:42,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:42,326 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:01:42,326 INFO L207 CegarAbsIntRunner]: [0], [8], [12], [13] [2019-01-08 14:01:42,330 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:01:42,330 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:01:42,337 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:01:42,337 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 28 root evaluator evaluations with a maximum evaluation depth of 3. Performed 28 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:01:42,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:42,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:01:42,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:42,338 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-08 14:01:42,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:42,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:01:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:42,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:42,363 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-08 14:01:42,370 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-08 14:01:42,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:01:42,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:01:42,389 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-08 14:01:42,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-01-08 14:01:42,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:01:42,400 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-08 14:01:42,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:01:42,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:01:42,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-08 14:01:42,413 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-08 14:01:42,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:42,440 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-08 14:01:42,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:01:42,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-08 14:01:42,461 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:01:42,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:01:42,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:01:42,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:01:42,462 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-01-08 14:01:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:42,502 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2019-01-08 14:01:42,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 14:01:42,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-08 14:01:42,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:42,503 INFO L225 Difference]: With dead ends: 12 [2019-01-08 14:01:42,503 INFO L226 Difference]: Without dead ends: 10 [2019-01-08 14:01:42,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:01:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-08 14:01:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2019-01-08 14:01:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-08 14:01:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2019-01-08 14:01:42,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 4 [2019-01-08 14:01:42,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:42,509 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 14 transitions. [2019-01-08 14:01:42,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:01:42,509 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 14 transitions. [2019-01-08 14:01:42,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:01:42,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:42,510 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-08 14:01:42,510 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:42,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:42,511 INFO L82 PathProgramCache]: Analyzing trace with hash 28814048, now seen corresponding path program 1 times [2019-01-08 14:01:42,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:42,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:42,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:42,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:42,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:42,612 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-08 14:01:42,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:01:42,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-08 14:01:42,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:01:42,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:01:42,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:01:42,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-08 14:01:42,614 INFO L87 Difference]: Start difference. First operand 8 states and 14 transitions. Second operand 4 states. [2019-01-08 14:01:42,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:42,646 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2019-01-08 14:01:42,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:01:42,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-08 14:01:42,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:42,647 INFO L225 Difference]: With dead ends: 11 [2019-01-08 14:01:42,647 INFO L226 Difference]: Without dead ends: 9 [2019-01-08 14:01:42,648 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-08 14:01:42,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-08 14:01:42,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-08 14:01:42,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-08 14:01:42,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2019-01-08 14:01:42,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 16 transitions. Word has length 5 [2019-01-08 14:01:42,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:42,654 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 16 transitions. [2019-01-08 14:01:42,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:01:42,654 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-01-08 14:01:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:01:42,654 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:42,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:01:42,655 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:42,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:42,655 INFO L82 PathProgramCache]: Analyzing trace with hash 28873630, now seen corresponding path program 1 times [2019-01-08 14:01:42,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:42,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:42,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:42,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:42,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:42,882 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 14 [2019-01-08 14:01:42,932 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-08 14:01:42,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:42,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:42,933 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:01:42,933 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [12], [13] [2019-01-08 14:01:42,934 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:01:42,935 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:01:42,940 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:01:42,940 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 30 root evaluator evaluations with a maximum evaluation depth of 3. Performed 30 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:01:42,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:42,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:01:42,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:42,941 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-08 14:01:42,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:42,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:01:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:42,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:42,991 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-08 14:01:43,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:01:43,004 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-08 14:01:43,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:01:43,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:01:43,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:01:43,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-01-08 14:01:43,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:01:43,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:01:43,054 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-08 14:01:43,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:01:43,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:01:43,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-08 14:01:43,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:01:43,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:01:43,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:01:43,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:01:43,088 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-08 14:01:43,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:01:43,134 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-08 14:01:43,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-08 14:01:43,168 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-08 14:01:43,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:43,195 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-08 14:01:43,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:43,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-08 14:01:43,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:43,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:01:43,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:01:43,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:01:43,215 INFO L87 Difference]: Start difference. First operand 9 states and 16 transitions. Second operand 9 states. [2019-01-08 14:01:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:43,307 INFO L93 Difference]: Finished difference Result 12 states and 22 transitions. [2019-01-08 14:01:43,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:01:43,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-08 14:01:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:43,308 INFO L225 Difference]: With dead ends: 12 [2019-01-08 14:01:43,308 INFO L226 Difference]: Without dead ends: 0 [2019-01-08 14:01:43,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:01:43,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-08 14:01:43,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-08 14:01:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-08 14:01:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-08 14:01:43,310 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-01-08 14:01:43,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:43,310 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-08 14:01:43,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:01:43,310 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-08 14:01:43,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-08 14:01:43,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-08 14:01:43,625 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2019-01-08 14:01:43,628 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-08 14:01:43,629 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-08 14:01:43,629 INFO L444 ceAbstractionStarter]: At program point L26-1(lines 25 31) the Hoare annotation is: (let ((.cse0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)) (.cse1 (let ((.cse3 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1))) (.cse2 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))) (or (and (<= 1 .cse2) .cse3) (and .cse3 (= 0 .cse2)))))) (or (and (<= (+ .cse0 1) 0) .cse1) (and (= 0 .cse0) .cse1))) [2019-01-08 14:01:43,629 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 33) no Hoare annotation was computed. [2019-01-08 14:01:43,629 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 36) no Hoare annotation was computed. [2019-01-08 14:01:43,629 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 34) no Hoare annotation was computed. [2019-01-08 14:01:43,630 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-08 14:01:43,642 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 02:01:43 BoogieIcfgContainer [2019-01-08 14:01:43,642 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-08 14:01:43,643 INFO L168 Benchmark]: Toolchain (without parser) took 5195.87 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 681.6 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -589.4 MB). Peak memory consumption was 92.1 MB. Max. memory is 7.1 GB. [2019-01-08 14:01:43,644 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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. [2019-01-08 14:01:43,644 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.47 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. [2019-01-08 14:01:43,645 INFO L168 Benchmark]: Boogie Preprocessor took 28.70 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. [2019-01-08 14:01:43,645 INFO L168 Benchmark]: RCFGBuilder took 250.06 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-08 14:01:43,646 INFO L168 Benchmark]: TraceAbstraction took 4850.24 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 681.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -610.6 MB). Peak memory consumption was 71.0 MB. Max. memory is 7.1 GB. [2019-01-08 14:01:43,649 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.25 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 62.47 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 28.70 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 250.06 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4850.24 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 681.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -610.6 MB). Peak memory consumption was 71.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 34]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 33]: 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: 25]: Loop Invariant Derived loop invariant: (#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && ((1 <= #memory_int[p2 := #memory_int[p2] + -1][p1] && !(p2 == p1)) || (!(p2 == p1) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]))) || (0 == #memory_int[p1 := #memory_int[p1] + 1][p2] && ((1 <= #memory_int[p2 := #memory_int[p2] + -1][p1] && !(p2 == p1)) || (!(p2 == p1) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. SAFE Result, 4.7s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 13 SDtfs, 34 SDslu, 1 SDs, 0 SdLazy, 161 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.9s 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, 0.2s 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, 99 HoareAnnotationTreeSize, 1 FomulaSimplifications, 634 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 532 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 47 ConstructedInterpolants, 6 QuantifiedInterpolants, 1633 SizeOfPredicates, 5 NumberOfNonLiveVariables, 74 ConjunctsInSsa, 21 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...