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-0ed9222-m [2019-01-11 14:19:58,115 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 14:19:58,116 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 14:19:58,129 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 14:19:58,129 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 14:19:58,130 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 14:19:58,131 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 14:19:58,133 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 14:19:58,135 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 14:19:58,136 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 14:19:58,137 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 14:19:58,137 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 14:19:58,138 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 14:19:58,139 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 14:19:58,140 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 14:19:58,141 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 14:19:58,142 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 14:19:58,144 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 14:19:58,146 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 14:19:58,148 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 14:19:58,149 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 14:19:58,150 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 14:19:58,152 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 14:19:58,153 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 14:19:58,153 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 14:19:58,154 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 14:19:58,155 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 14:19:58,156 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 14:19:58,157 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 14:19:58,158 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 14:19:58,158 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 14:19:58,159 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 14:19:58,159 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 14:19:58,159 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 14:19:58,160 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 14:19:58,161 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 14:19:58,161 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-11 14:19:58,174 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 14:19:58,175 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 14:19:58,175 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 14:19:58,176 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 14:19:58,176 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 14:19:58,176 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 14:19:58,176 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 14:19:58,176 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 14:19:58,177 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 14:19:58,177 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 14:19:58,177 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 14:19:58,177 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 14:19:58,177 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 14:19:58,178 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 14:19:58,178 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 14:19:58,178 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 14:19:58,179 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 14:19:58,179 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 14:19:58,179 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 14:19:58,179 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 14:19:58,180 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 14:19:58,180 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 14:19:58,180 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 14:19:58,180 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 14:19:58,180 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 14:19:58,181 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 14:19:58,181 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 14:19:58,181 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 14:19:58,181 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 14:19:58,181 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 14:19:58,182 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 14:19:58,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:19:58,182 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 14:19:58,182 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 14:19:58,183 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 14:19:58,183 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 14:19:58,183 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 14:19:58,183 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 14:19:58,183 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 14:19:58,183 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 14:19:58,213 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 14:19:58,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 14:19:58,234 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 14:19:58,236 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 14:19:58,237 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 14:19:58,237 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-11 14:19:58,238 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl' [2019-01-11 14:19:58,285 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 14:19:58,287 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 14:19:58,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 14:19:58,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 14:19:58,288 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 14:19:58,306 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 11.01 02:19:58" (1/1) ... [2019-01-11 14:19:58,318 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 11.01 02:19:58" (1/1) ... [2019-01-11 14:19:58,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 14:19:58,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 14:19:58,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 14:19:58,346 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 14:19:58,358 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 11.01 02:19:58" (1/1) ... [2019-01-11 14:19:58,358 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 11.01 02:19:58" (1/1) ... [2019-01-11 14:19:58,359 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 11.01 02:19:58" (1/1) ... [2019-01-11 14:19:58,360 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 11.01 02:19:58" (1/1) ... [2019-01-11 14:19:58,363 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 11.01 02:19:58" (1/1) ... [2019-01-11 14:19:58,366 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 11.01 02:19:58" (1/1) ... [2019-01-11 14:19:58,367 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 11.01 02:19:58" (1/1) ... [2019-01-11 14:19:58,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 14:19:58,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 14:19:58,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 14:19:58,370 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 14:19:58,373 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 11.01 02:19: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: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-11 14:19:58,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 14:19:58,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 14:19:58,622 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 14:19:58,623 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 14:19:58,624 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:19:58 BoogieIcfgContainer [2019-01-11 14:19:58,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 14:19:58,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 14:19:58,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 14:19:58,628 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 14:19:58,629 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 11.01 02:19:58" (1/2) ... [2019-01-11 14:19:58,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dae1ed9 and model type speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:19:58, skipping insertion in model container [2019-01-11 14:19:58,630 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 11.01 02:19:58" (2/2) ... [2019-01-11 14:19:58,632 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-2-limited.bpl [2019-01-11 14:19:58,641 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 14:19:58,648 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-11 14:19:58,665 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-11 14:19:58,697 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 14:19:58,697 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 14:19:58,697 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 14:19:58,697 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 14:19:58,697 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 14:19:58,698 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 14:19:58,698 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 14:19:58,698 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 14:19:58,713 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-11 14:19:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-11 14:19:58,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:19:58,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-11 14:19:58,723 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:19:58,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:19:58,732 INFO L82 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2019-01-11 14:19:58,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:19:58,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:58,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:19:58,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:58,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:19:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:19:58,911 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-11 14:19:58,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:19:58,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 14:19:58,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:19:58,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:19:58,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:19:58,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:19:58,930 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-11 14:19:59,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:19:59,078 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-01-11 14:19:59,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:19:59,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-11 14:19:59,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:19:59,094 INFO L225 Difference]: With dead ends: 13 [2019-01-11 14:19:59,095 INFO L226 Difference]: Without dead ends: 8 [2019-01-11 14:19:59,098 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-11 14:19:59,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-11 14:19:59,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2019-01-11 14:19:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-11 14:19:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-01-11 14:19:59,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 2 [2019-01-11 14:19:59,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:19:59,146 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-11 14:19:59,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:19:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-01-11 14:19:59,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:19:59,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:19:59,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:19:59,149 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:19:59,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:19:59,149 INFO L82 PathProgramCache]: Analyzing trace with hash 29988, now seen corresponding path program 1 times [2019-01-11 14:19:59,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:19:59,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:59,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:19:59,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:59,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:19:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:19:59,349 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-11 14:19:59,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:59,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:19:59,351 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:19:59,358 INFO L207 CegarAbsIntRunner]: [0], [6], [11] [2019-01-11 14:19:59,406 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:19:59,407 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:19:59,492 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:19:59,493 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-11 14:19:59,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:19:59,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:19:59,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:59,498 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-11 14:19:59,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:19:59,518 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:19:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:19:59,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:19:59,604 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-11 14:19:59,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:59,616 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-11 14:19:59,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:19:59,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:19:59,666 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-11 14:19:59,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-01-11 14:19:59,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:59,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:19:59,703 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-11 14:19:59,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:19:59,756 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-11 14:19:59,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-11 14:19:59,797 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-11 14:19:59,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:19:59,823 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-11 14:19:59,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:19:59,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 14:19:59,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:19:59,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:19:59,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:19:59,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:19:59,844 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-01-11 14:19:59,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:19:59,982 INFO L93 Difference]: Finished difference Result 10 states and 17 transitions. [2019-01-11 14:19:59,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:19:59,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-11 14:19:59,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:19:59,983 INFO L225 Difference]: With dead ends: 10 [2019-01-11 14:19:59,983 INFO L226 Difference]: Without dead ends: 9 [2019-01-11 14:19:59,984 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-11 14:19:59,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-11 14:19:59,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-01-11 14:19:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-11 14:19:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2019-01-11 14:19:59,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 13 transitions. Word has length 3 [2019-01-11 14:19:59,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:19:59,988 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 13 transitions. [2019-01-11 14:19:59,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:19:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 13 transitions. [2019-01-11 14:19:59,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:19:59,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:19:59,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:19:59,989 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:19:59,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:19:59,990 INFO L82 PathProgramCache]: Analyzing trace with hash 30050, now seen corresponding path program 1 times [2019-01-11 14:19:59,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:19:59,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:59,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:19:59,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:59,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:19:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:00,159 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-01-11 14:20:00,171 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-11 14:20:00,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:00,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:00,172 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:20:00,172 INFO L207 CegarAbsIntRunner]: [0], [8], [11] [2019-01-11 14:20:00,173 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:00,173 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:00,178 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:00,178 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-11 14:20:00,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:00,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:00,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:00,179 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-11 14:20:00,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:00,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:00,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:00,208 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-11 14:20:00,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:00,214 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-11 14:20:00,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:00,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:00,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:00,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-01-11 14:20:00,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:00,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:00,286 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-11 14:20:00,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:00,301 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-11 14:20:00,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-11 14:20:00,359 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-11 14:20:00,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:00,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-11 14:20:00,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:00,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:20:00,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:00,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:20:00,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:20:00,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:20:00,436 INFO L87 Difference]: Start difference. First operand 7 states and 13 transitions. Second operand 6 states. [2019-01-11 14:20:00,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:00,530 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2019-01-11 14:20:00,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:20:00,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 14:20:00,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:00,532 INFO L225 Difference]: With dead ends: 17 [2019-01-11 14:20:00,533 INFO L226 Difference]: Without dead ends: 14 [2019-01-11 14:20:00,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:20:00,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-11 14:20:00,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2019-01-11 14:20:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-11 14:20:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2019-01-11 14:20:00,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 21 transitions. Word has length 3 [2019-01-11 14:20:00,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:00,538 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 21 transitions. [2019-01-11 14:20:00,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:20:00,538 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 21 transitions. [2019-01-11 14:20:00,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:20:00,539 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:00,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:20:00,539 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:00,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:00,540 INFO L82 PathProgramCache]: Analyzing trace with hash 929546, now seen corresponding path program 1 times [2019-01-11 14:20:00,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:00,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:00,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:00,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:00,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:00,755 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-11 14:20:00,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:00,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:00,756 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:20:00,757 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [11] [2019-01-11 14:20:00,759 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:00,759 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:00,764 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:00,764 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-11 14:20:00,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:00,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:00,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:00,765 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-11 14:20:00,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:00,773 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:00,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:00,789 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-11 14:20:00,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:00,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-11 14:20:00,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:00,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:00,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:00,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-01-11 14:20:00,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:00,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:00,892 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-11 14:20:00,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:00,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:00,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-11 14:20:01,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:01,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:01,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:01,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:01,226 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-11 14:20:01,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:01,373 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-11 14:20:01,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-11 14:20:01,432 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-11 14:20:01,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:01,497 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-11 14:20:01,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:01,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:20:01,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:01,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:20:01,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:20:01,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:20:01,517 INFO L87 Difference]: Start difference. First operand 10 states and 21 transitions. Second operand 8 states. [2019-01-11 14:20:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:01,736 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2019-01-11 14:20:01,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:20:01,737 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:20:01,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:01,738 INFO L225 Difference]: With dead ends: 18 [2019-01-11 14:20:01,738 INFO L226 Difference]: Without dead ends: 15 [2019-01-11 14:20:01,739 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-11 14:20:01,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-11 14:20:01,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 6. [2019-01-11 14:20:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-11 14:20:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-01-11 14:20:01,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 4 [2019-01-11 14:20:01,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:01,743 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-11 14:20:01,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:20:01,744 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-01-11 14:20:01,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:20:01,744 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:01,744 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:20:01,745 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:01,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:01,745 INFO L82 PathProgramCache]: Analyzing trace with hash 931594, now seen corresponding path program 1 times [2019-01-11 14:20:01,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:01,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:01,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:01,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:01,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:01,875 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-11 14:20:01,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:01,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:01,876 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:20:01,876 INFO L207 CegarAbsIntRunner]: [0], [8], [12], [13] [2019-01-11 14:20:01,879 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:01,879 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:01,887 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:01,888 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-11 14:20:01,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:01,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:01,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:01,888 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-11 14:20:01,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:01,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:01,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:01,912 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-11 14:20:01,921 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-11 14:20:01,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:01,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:01,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-11 14:20:01,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-01-11 14:20:01,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:01,949 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-11 14:20:01,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:01,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:01,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-11 14:20:01,965 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-11 14:20:01,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:01,995 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-11 14:20:02,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:20:02,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 14:20:02,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:20:02,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:20:02,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:20:02,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:20:02,014 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-01-11 14:20:02,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:02,044 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2019-01-11 14:20:02,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:20:02,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 14:20:02,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:02,046 INFO L225 Difference]: With dead ends: 12 [2019-01-11 14:20:02,046 INFO L226 Difference]: Without dead ends: 10 [2019-01-11 14:20:02,046 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-11 14:20:02,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-11 14:20:02,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2019-01-11 14:20:02,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-11 14:20:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2019-01-11 14:20:02,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 4 [2019-01-11 14:20:02,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:02,051 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 14 transitions. [2019-01-11 14:20:02,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:20:02,052 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 14 transitions. [2019-01-11 14:20:02,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:20:02,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:02,052 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-11 14:20:02,053 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:02,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:02,053 INFO L82 PathProgramCache]: Analyzing trace with hash 28814048, now seen corresponding path program 1 times [2019-01-11 14:20:02,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:02,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:02,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:02,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:02,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:02,160 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-11 14:20:02,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:20:02,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 14:20:02,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:20:02,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:20:02,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:20:02,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 14:20:02,162 INFO L87 Difference]: Start difference. First operand 8 states and 14 transitions. Second operand 4 states. [2019-01-11 14:20:02,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:02,187 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2019-01-11 14:20:02,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:20:02,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 14:20:02,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:02,188 INFO L225 Difference]: With dead ends: 11 [2019-01-11 14:20:02,188 INFO L226 Difference]: Without dead ends: 9 [2019-01-11 14:20:02,189 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-11 14:20:02,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-11 14:20:02,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-11 14:20:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-11 14:20:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2019-01-11 14:20:02,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 16 transitions. Word has length 5 [2019-01-11 14:20:02,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:02,194 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 16 transitions. [2019-01-11 14:20:02,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:20:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-01-11 14:20:02,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:20:02,195 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:02,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:20:02,195 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:02,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:02,195 INFO L82 PathProgramCache]: Analyzing trace with hash 28873630, now seen corresponding path program 1 times [2019-01-11 14:20:02,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:02,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:02,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:02,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:02,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:02,375 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-11 14:20:02,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:02,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:02,376 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:20:02,376 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [12], [13] [2019-01-11 14:20:02,377 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:02,377 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:02,381 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:02,382 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-11 14:20:02,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:02,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:02,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:02,382 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-11 14:20:02,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:02,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:02,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:02,408 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-11 14:20:02,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:02,415 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-11 14:20:02,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:02,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:02,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:02,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-01-11 14:20:02,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:02,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:02,472 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-11 14:20:02,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:02,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:02,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-11 14:20:02,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:02,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:02,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:02,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:02,516 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-11 14:20:02,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:02,555 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-11 14:20:02,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-11 14:20:02,588 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-11 14:20:02,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:02,620 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-11 14:20:02,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:02,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-11 14:20:02,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:02,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:20:02,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:20:02,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:20:02,641 INFO L87 Difference]: Start difference. First operand 9 states and 16 transitions. Second operand 9 states. [2019-01-11 14:20:02,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:02,730 INFO L93 Difference]: Finished difference Result 12 states and 22 transitions. [2019-01-11 14:20:02,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:20:02,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-11 14:20:02,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:02,732 INFO L225 Difference]: With dead ends: 12 [2019-01-11 14:20:02,732 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 14:20:02,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:20:02,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 14:20:02,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 14:20:02,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 14:20:02,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 14:20:02,733 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-01-11 14:20:02,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:02,733 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 14:20:02,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:20:02,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 14:20:02,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 14:20:02,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 14:20:02,930 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2019-01-11 14:20:02,933 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-11 14:20:02,933 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 33) no Hoare annotation was computed. [2019-01-11 14:20:02,933 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-11 14:20:02,934 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-11 14:20:02,934 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 36) no Hoare annotation was computed. [2019-01-11 14:20:02,934 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 34) no Hoare annotation was computed. [2019-01-11 14:20:02,934 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-11 14:20:02,945 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 02:20:02 BoogieIcfgContainer [2019-01-11 14:20:02,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 14:20:02,946 INFO L168 Benchmark]: Toolchain (without parser) took 4659.75 ms. Allocated memory was 135.8 MB in the beginning and 205.5 MB in the end (delta: 69.7 MB). Free memory was 102.1 MB in the beginning and 101.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 70.8 MB. Max. memory is 7.1 GB. [2019-01-11 14:20:02,947 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 135.8 MB. Free memory is still 103.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 14:20:02,947 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.95 ms. Allocated memory is still 135.8 MB. Free memory was 101.9 MB in the beginning and 99.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-01-11 14:20:02,948 INFO L168 Benchmark]: Boogie Preprocessor took 23.55 ms. Allocated memory is still 135.8 MB. Free memory was 99.9 MB in the beginning and 98.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-11 14:20:02,949 INFO L168 Benchmark]: RCFGBuilder took 255.02 ms. Allocated memory is still 135.8 MB. Free memory was 98.6 MB in the beginning and 89.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-01-11 14:20:02,949 INFO L168 Benchmark]: TraceAbstraction took 4319.79 ms. Allocated memory was 135.8 MB in the beginning and 205.5 MB in the end (delta: 69.7 MB). Free memory was 89.2 MB in the beginning and 101.0 MB in the end (delta: -11.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 7.1 GB. [2019-01-11 14:20:02,953 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 135.8 MB. Free memory is still 103.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.95 ms. Allocated memory is still 135.8 MB. Free memory was 101.9 MB in the beginning and 99.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 23.55 ms. Allocated memory is still 135.8 MB. Free memory was 99.9 MB in the beginning and 98.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 255.02 ms. Allocated memory is still 135.8 MB. Free memory was 98.6 MB in the beginning and 89.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4319.79 ms. Allocated memory was 135.8 MB in the beginning and 205.5 MB in the end (delta: 69.7 MB). Free memory was 89.2 MB in the beginning and 101.0 MB in the end (delta: -11.9 MB). Peak memory consumption was 57.9 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.2s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s 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.5s 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.1s 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.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s 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...