java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-07 22:10:19,419 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 22:10:19,421 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 22:10:19,441 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 22:10:19,443 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 22:10:19,444 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 22:10:19,446 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 22:10:19,449 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 22:10:19,450 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 22:10:19,454 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 22:10:19,458 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 22:10:19,458 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 22:10:19,459 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 22:10:19,461 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 22:10:19,463 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 22:10:19,464 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 22:10:19,466 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 22:10:19,468 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 22:10:19,479 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 22:10:19,483 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 22:10:19,484 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 22:10:19,485 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 22:10:19,491 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 22:10:19,491 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 22:10:19,492 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 22:10:19,493 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 22:10:19,494 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 22:10:19,495 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 22:10:19,499 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 22:10:19,500 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 22:10:19,500 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 22:10:19,503 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 22:10:19,503 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 22:10:19,503 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 22:10:19,505 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 22:10:19,506 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 22:10:19,506 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-07 22:10:19,532 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 22:10:19,533 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 22:10:19,534 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 22:10:19,534 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 22:10:19,534 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 22:10:19,535 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 22:10:19,535 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 22:10:19,535 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 22:10:19,536 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 22:10:19,536 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-07 22:10:19,536 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-07 22:10:19,536 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 22:10:19,536 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 22:10:19,537 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 22:10:19,537 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 22:10:19,539 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 22:10:19,539 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 22:10:19,539 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 22:10:19,540 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 22:10:19,540 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 22:10:19,540 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 22:10:19,540 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 22:10:19,540 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 22:10:19,542 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 22:10:19,542 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 22:10:19,543 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 22:10:19,543 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 22:10:19,543 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 22:10:19,543 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 22:10:19,544 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 22:10:19,544 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 22:10:19,544 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 22:10:19,544 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 22:10:19,545 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 22:10:19,545 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 22:10:19,545 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 22:10:19,545 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 22:10:19,546 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 22:10:19,546 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 22:10:19,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 22:10:19,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 22:10:19,637 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 22:10:19,639 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 22:10:19,641 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 22:10:19,642 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl [2019-01-07 22:10:19,642 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2019-01-07 22:10:19,689 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 22:10:19,691 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 22:10:19,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 22:10:19,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 22:10:19,692 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 22:10:19,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:19" (1/1) ... [2019-01-07 22:10:19,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:19" (1/1) ... [2019-01-07 22:10:19,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 22:10:19,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 22:10:19,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 22:10:19,756 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 22:10:19,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:19" (1/1) ... [2019-01-07 22:10:19,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:19" (1/1) ... [2019-01-07 22:10:19,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:19" (1/1) ... [2019-01-07 22:10:19,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:19" (1/1) ... [2019-01-07 22:10:19,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:19" (1/1) ... [2019-01-07 22:10:19,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:19" (1/1) ... [2019-01-07 22:10:19,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:19" (1/1) ... [2019-01-07 22:10:19,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 22:10:19,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 22:10:19,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 22:10:19,792 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 22:10:19,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 22:10:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 22:10:19,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 22:10:20,142 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 22:10:20,142 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-07 22:10:20,143 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 10:10:20 BoogieIcfgContainer [2019-01-07 22:10:20,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 22:10:20,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 22:10:20,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 22:10:20,148 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 22:10:20,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:19" (1/2) ... [2019-01-07 22:10:20,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7362b3f3 and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 10:10:20, skipping insertion in model container [2019-01-07 22:10:20,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 10:10:20" (2/2) ... [2019-01-07 22:10:20,152 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2019-01-07 22:10:20,163 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 22:10:20,173 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-07 22:10:20,193 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-07 22:10:20,230 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 22:10:20,231 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 22:10:20,231 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 22:10:20,231 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 22:10:20,231 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 22:10:20,231 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 22:10:20,232 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 22:10:20,232 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 22:10:20,250 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-07 22:10:20,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-07 22:10:20,257 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:20,258 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-07 22:10:20,261 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:20,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:20,269 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-01-07 22:10:20,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:20,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:20,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:20,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:20,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:20,518 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-07 22:10:20,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 22:10:20,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 22:10:20,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:10:20,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 22:10:20,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 22:10:20,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 22:10:20,558 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-07 22:10:20,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:20,735 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-01-07 22:10:20,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 22:10:20,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 22:10:20,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:20,752 INFO L225 Difference]: With dead ends: 21 [2019-01-07 22:10:20,752 INFO L226 Difference]: Without dead ends: 16 [2019-01-07 22:10:20,756 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-07 22:10:20,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-07 22:10:20,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-01-07 22:10:20,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-07 22:10:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-01-07 22:10:20,795 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-01-07 22:10:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:20,797 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-01-07 22:10:20,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 22:10:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-01-07 22:10:20,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 22:10:20,798 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:20,798 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 22:10:20,799 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:20,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:20,799 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-01-07 22:10:20,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:20,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:20,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:20,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:20,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:20,999 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-07 22:10:21,044 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-07 22:10:21,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:21,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:21,046 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 22:10:21,048 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-01-07 22:10:21,109 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:10:21,109 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:10:31,663 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-07 22:10:31,665 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 22:10:31,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:31,671 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-07 22:10:32,113 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 68.75% of their original sizes. [2019-01-07 22:10:32,114 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-07 22:10:34,402 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_79 Int) (v_idx_87 Int) (v_idx_85 Int) (v_idx_86 Int) (v_idx_83 Int) (v_idx_84 Int) (v_idx_81 Int) (v_idx_82 Int) (v_idx_80 Int)) (exists ((v_b_130_1 Int) (v_b_131_1 Int) (v_v_1300_1 Int) (v_b_132_1 Int) (v_b_133_1 Int) (v_v_1304_1 Int) (v_v_1298_1 Int) (v_v_1305_1 Int) (v_v_1302_1 Int) (v_v_1306_1 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 3)) (.cse3 (+ v_b_131_1 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1)) (.cse2 (+ c_ULTIMATE.start_main_p1 2)) (.cse5 (+ v_b_130_1 1)) (.cse7 (+ v_b_130_1 2)) (.cse4 (+ v_b_132_1 1)) (.cse6 (+ c_ULTIMATE.start_main_p4 1))) (and (<= .cse0 v_b_133_1) (or (< v_idx_83 v_b_131_1) (<= v_b_132_1 v_idx_83) (= (select |c_#memory_int| v_idx_83) v_v_1302_1)) (<= v_v_1305_1 0) (<= .cse1 v_b_130_1) (<= .cse2 v_b_132_1) (or (<= c_ULTIMATE.start_main_p4 v_idx_85) (= (select |c_#memory_int| v_idx_85) v_v_1304_1) (< v_idx_85 v_b_133_1)) (<= .cse3 v_b_133_1) (<= v_b_133_1 c_ULTIMATE.start_main_p4) (<= .cse4 c_ULTIMATE.start_main_p4) (<= v_b_131_1 v_b_132_1) (<= (* 2 v_v_1305_1) 0) (<= .cse0 c_ULTIMATE.start_main_p4) (or (<= c_ULTIMATE.start_main_p1 v_idx_79) (= (select |c_#memory_int| v_idx_79) v_v_1298_1)) (<= .cse5 v_b_132_1) (<= .cse3 c_ULTIMATE.start_main_p4) (or (= (select |c_#memory_int| v_idx_86) v_v_1305_1) (<= .cse6 v_idx_86) (< v_idx_86 c_ULTIMATE.start_main_p4)) (or (< v_idx_81 .cse1) (= (select |c_#memory_int| v_idx_81) v_v_1300_1) (<= v_b_130_1 v_idx_81)) (or (<= .cse1 v_idx_80) (= 0 (select |c_#memory_int| v_idx_80)) (< v_idx_80 c_ULTIMATE.start_main_p1)) (<= .cse7 c_ULTIMATE.start_main_p4) (<= .cse5 v_b_131_1) (<= .cse2 v_b_131_1) (<= v_b_133_1 .cse4) (<= v_b_131_1 .cse5) (<= .cse7 v_b_133_1) (<= .cse4 v_b_133_1) (or (< v_idx_82 v_b_130_1) (<= v_b_131_1 v_idx_82) (= 0 (select |c_#memory_int| v_idx_82))) (or (<= v_b_133_1 v_idx_84) (< v_idx_84 v_b_132_1) (= 0 (select |c_#memory_int| v_idx_84))) (or (= (select |c_#memory_int| v_idx_87) v_v_1306_1) (< v_idx_87 .cse6)))))) is different from false [2019-01-07 22:10:36,970 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_89 Int) (v_idx_88 Int) (v_idx_96 Int) (v_idx_94 Int) (v_idx_95 Int) (v_idx_92 Int) (v_idx_93 Int) (v_idx_90 Int) (v_idx_91 Int)) (exists ((v_b_130_1 Int) (v_b_131_1 Int) (v_b_134_1 Int) (v_v_1300_1 Int) (v_b_135_1 Int) (v_b_132_1 Int) (v_b_133_1 Int) (v_v_1304_1 Int) (v_v_1298_1 Int) (v_v_1305_1 Int) (v_v_1302_1 Int) (v_v_1306_1 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 3)) (.cse4 (+ v_b_131_1 1)) (.cse2 (+ v_b_134_1 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p1 2)) (.cse6 (+ v_b_130_1 1)) (.cse7 (+ v_b_130_1 2)) (.cse5 (+ v_b_132_1 1))) (and (<= .cse0 v_b_133_1) (or (= (select |c_#memory_int| v_idx_94) v_v_1304_1) (<= v_b_134_1 v_idx_94) (< v_idx_94 v_b_133_1)) (<= v_v_1305_1 0) (<= .cse1 v_b_130_1) (<= v_b_135_1 .cse2) (or (< v_idx_90 .cse1) (<= v_b_130_1 v_idx_90) (= (select |c_#memory_int| v_idx_90) v_v_1300_1)) (<= .cse0 v_b_134_1) (<= .cse3 v_b_132_1) (or (<= c_ULTIMATE.start_main_p1 v_idx_88) (= (select |c_#memory_int| v_idx_88) v_v_1298_1)) (<= .cse4 v_b_133_1) (<= .cse4 v_b_134_1) (<= (+ v_b_130_1 3) v_b_135_1) (<= v_b_131_1 v_b_132_1) (<= .cse2 v_b_135_1) (<= (* 2 v_v_1305_1) 0) (or (= (select |c_#memory_int| v_idx_96) v_v_1306_1) (< v_idx_96 v_b_135_1)) (or (< v_idx_93 v_b_132_1) (<= v_b_133_1 v_idx_93) (= 0 (select |c_#memory_int| v_idx_93))) (or (< v_idx_89 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_89)) (<= .cse1 v_idx_89)) (<= (+ v_b_131_1 2) v_b_135_1) (<= .cse5 v_b_134_1) (<= (+ v_b_132_1 2) v_b_135_1) (<= .cse6 v_b_132_1) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_135_1) (<= .cse7 v_b_134_1) (<= .cse6 v_b_131_1) (<= .cse3 v_b_131_1) (<= v_b_133_1 .cse5) (<= (+ v_b_133_1 1) v_b_135_1) (<= v_b_131_1 .cse6) (<= .cse7 v_b_133_1) (<= v_b_133_1 v_b_134_1) (or (= 0 (select |c_#memory_int| v_idx_91)) (< v_idx_91 v_b_130_1) (<= v_b_131_1 v_idx_91)) (or (<= v_b_132_1 v_idx_92) (< v_idx_92 v_b_131_1) (= (select |c_#memory_int| v_idx_92) v_v_1302_1)) (<= .cse5 v_b_133_1) (or (= (select |c_#memory_int| v_idx_95) v_v_1305_1) (<= v_b_135_1 v_idx_95) (< v_idx_95 v_b_134_1)))))) is different from false [2019-01-07 22:10:37,099 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-07 22:10:37,099 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-07 22:10:37,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-07 22:10:37,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-07 22:10:37,100 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:10:37,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 22:10:37,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 22:10:37,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-01-07 22:10:37,102 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 4 states. [2019-01-07 22:10:39,416 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_79 Int) (v_idx_87 Int) (v_idx_85 Int) (v_idx_86 Int) (v_idx_83 Int) (v_idx_84 Int) (v_idx_81 Int) (v_idx_82 Int) (v_idx_80 Int)) (exists ((v_b_130_1 Int) (v_b_131_1 Int) (v_v_1300_1 Int) (v_b_132_1 Int) (v_b_133_1 Int) (v_v_1304_1 Int) (v_v_1298_1 Int) (v_v_1305_1 Int) (v_v_1302_1 Int) (v_v_1306_1 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 3)) (.cse3 (+ v_b_131_1 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1)) (.cse2 (+ c_ULTIMATE.start_main_p1 2)) (.cse5 (+ v_b_130_1 1)) (.cse7 (+ v_b_130_1 2)) (.cse4 (+ v_b_132_1 1)) (.cse6 (+ c_ULTIMATE.start_main_p4 1))) (and (<= .cse0 v_b_133_1) (or (< v_idx_83 v_b_131_1) (<= v_b_132_1 v_idx_83) (= (select |c_#memory_int| v_idx_83) v_v_1302_1)) (<= v_v_1305_1 0) (<= .cse1 v_b_130_1) (<= .cse2 v_b_132_1) (or (<= c_ULTIMATE.start_main_p4 v_idx_85) (= (select |c_#memory_int| v_idx_85) v_v_1304_1) (< v_idx_85 v_b_133_1)) (<= .cse3 v_b_133_1) (<= v_b_133_1 c_ULTIMATE.start_main_p4) (<= .cse4 c_ULTIMATE.start_main_p4) (<= v_b_131_1 v_b_132_1) (<= (* 2 v_v_1305_1) 0) (<= .cse0 c_ULTIMATE.start_main_p4) (or (<= c_ULTIMATE.start_main_p1 v_idx_79) (= (select |c_#memory_int| v_idx_79) v_v_1298_1)) (<= .cse5 v_b_132_1) (<= .cse3 c_ULTIMATE.start_main_p4) (or (= (select |c_#memory_int| v_idx_86) v_v_1305_1) (<= .cse6 v_idx_86) (< v_idx_86 c_ULTIMATE.start_main_p4)) (or (< v_idx_81 .cse1) (= (select |c_#memory_int| v_idx_81) v_v_1300_1) (<= v_b_130_1 v_idx_81)) (or (<= .cse1 v_idx_80) (= 0 (select |c_#memory_int| v_idx_80)) (< v_idx_80 c_ULTIMATE.start_main_p1)) (<= .cse7 c_ULTIMATE.start_main_p4) (<= .cse5 v_b_131_1) (<= .cse2 v_b_131_1) (<= v_b_133_1 .cse4) (<= v_b_131_1 .cse5) (<= .cse7 v_b_133_1) (<= .cse4 v_b_133_1) (or (< v_idx_82 v_b_130_1) (<= v_b_131_1 v_idx_82) (= 0 (select |c_#memory_int| v_idx_82))) (or (<= v_b_133_1 v_idx_84) (< v_idx_84 v_b_132_1) (= 0 (select |c_#memory_int| v_idx_84))) (or (= (select |c_#memory_int| v_idx_87) v_v_1306_1) (< v_idx_87 .cse6)))))) (forall ((v_idx_89 Int) (v_idx_88 Int) (v_idx_96 Int) (v_idx_94 Int) (v_idx_95 Int) (v_idx_92 Int) (v_idx_93 Int) (v_idx_90 Int) (v_idx_91 Int)) (exists ((v_b_130_1 Int) (v_b_131_1 Int) (v_b_134_1 Int) (v_v_1300_1 Int) (v_b_135_1 Int) (v_b_132_1 Int) (v_b_133_1 Int) (v_v_1304_1 Int) (v_v_1298_1 Int) (v_v_1305_1 Int) (v_v_1302_1 Int) (v_v_1306_1 Int)) (let ((.cse8 (+ c_ULTIMATE.start_main_p1 3)) (.cse12 (+ v_b_131_1 1)) (.cse10 (+ v_b_134_1 1)) (.cse9 (+ c_ULTIMATE.start_main_p1 1)) (.cse11 (+ c_ULTIMATE.start_main_p1 2)) (.cse14 (+ v_b_130_1 1)) (.cse15 (+ v_b_130_1 2)) (.cse13 (+ v_b_132_1 1))) (and (<= .cse8 v_b_133_1) (or (= (select |c_#memory_int| v_idx_94) v_v_1304_1) (<= v_b_134_1 v_idx_94) (< v_idx_94 v_b_133_1)) (<= v_v_1305_1 0) (<= .cse9 v_b_130_1) (<= v_b_135_1 .cse10) (or (< v_idx_90 .cse9) (<= v_b_130_1 v_idx_90) (= (select |c_#memory_int| v_idx_90) v_v_1300_1)) (<= .cse8 v_b_134_1) (<= .cse11 v_b_132_1) (or (<= c_ULTIMATE.start_main_p1 v_idx_88) (= (select |c_#memory_int| v_idx_88) v_v_1298_1)) (<= .cse12 v_b_133_1) (<= .cse12 v_b_134_1) (<= (+ v_b_130_1 3) v_b_135_1) (<= v_b_131_1 v_b_132_1) (<= .cse10 v_b_135_1) (<= (* 2 v_v_1305_1) 0) (or (= (select |c_#memory_int| v_idx_96) v_v_1306_1) (< v_idx_96 v_b_135_1)) (or (< v_idx_93 v_b_132_1) (<= v_b_133_1 v_idx_93) (= 0 (select |c_#memory_int| v_idx_93))) (or (< v_idx_89 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_89)) (<= .cse9 v_idx_89)) (<= (+ v_b_131_1 2) v_b_135_1) (<= .cse13 v_b_134_1) (<= (+ v_b_132_1 2) v_b_135_1) (<= .cse14 v_b_132_1) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_135_1) (<= .cse15 v_b_134_1) (<= .cse14 v_b_131_1) (<= .cse11 v_b_131_1) (<= v_b_133_1 .cse13) (<= (+ v_b_133_1 1) v_b_135_1) (<= v_b_131_1 .cse14) (<= .cse15 v_b_133_1) (<= v_b_133_1 v_b_134_1) (or (= 0 (select |c_#memory_int| v_idx_91)) (< v_idx_91 v_b_130_1) (<= v_b_131_1 v_idx_91)) (or (<= v_b_132_1 v_idx_92) (< v_idx_92 v_b_131_1) (= (select |c_#memory_int| v_idx_92) v_v_1302_1)) (<= .cse13 v_b_133_1) (or (= (select |c_#memory_int| v_idx_95) v_v_1305_1) (<= v_b_135_1 v_idx_95) (< v_idx_95 v_b_134_1))))))) is different from false [2019-01-07 22:11:04,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:11:04,285 INFO L93 Difference]: Finished difference Result 12 states and 23 transitions. [2019-01-07 22:11:04,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 22:11:04,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 22:11:04,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:11:04,286 INFO L225 Difference]: With dead ends: 12 [2019-01-07 22:11:04,287 INFO L226 Difference]: Without dead ends: 11 [2019-01-07 22:11:04,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-01-07 22:11:04,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-07 22:11:04,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-07 22:11:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-07 22:11:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2019-01-07 22:11:04,296 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 22 transitions. Word has length 3 [2019-01-07 22:11:04,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:11:04,297 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 22 transitions. [2019-01-07 22:11:04,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 22:11:04,297 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 22 transitions. [2019-01-07 22:11:04,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 22:11:04,298 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:11:04,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 22:11:04,298 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:11:04,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:04,300 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-01-07 22:11:04,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:11:04,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:04,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:11:04,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:04,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:11:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:04,423 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-07 22:11:04,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 22:11:04,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 22:11:04,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:11:04,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 22:11:04,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 22:11:04,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 22:11:04,427 INFO L87 Difference]: Start difference. First operand 11 states and 22 transitions. Second operand 3 states. [2019-01-07 22:11:04,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:11:04,639 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2019-01-07 22:11:04,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 22:11:04,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 22:11:04,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:11:04,641 INFO L225 Difference]: With dead ends: 17 [2019-01-07 22:11:04,641 INFO L226 Difference]: Without dead ends: 16 [2019-01-07 22:11:04,641 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-07 22:11:04,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-07 22:11:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2019-01-07 22:11:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 22:11:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 23 transitions. [2019-01-07 22:11:04,650 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 23 transitions. Word has length 3 [2019-01-07 22:11:04,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:11:04,651 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 23 transitions. [2019-01-07 22:11:04,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 22:11:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 23 transitions. [2019-01-07 22:11:04,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 22:11:04,652 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:11:04,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 22:11:04,654 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:11:04,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:04,654 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-01-07 22:11:04,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:11:04,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:04,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:11:04,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:04,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:11:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:04,814 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-07 22:11:04,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:04,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:11:04,815 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 22:11:04,815 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-01-07 22:11:04,817 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:11:04,817 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:11:10,703 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-07 22:11:10,704 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 22:11:10,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:10,704 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-07 22:11:10,990 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 75% of their original sizes. [2019-01-07 22:11:10,990 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-07 22:11:13,407 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_179 Int) (v_idx_180 Int) (v_idx_181 Int) (v_idx_182 Int) (v_idx_183 Int) (v_idx_177 Int) (v_idx_178 Int) (v_idx_175 Int) (v_idx_176 Int)) (exists ((v_b_134_2 Int) (v_v_1148_2 Int) (v_b_137_2 Int) (v_b_138_2 Int) (v_v_1144_2 Int) (v_b_135_2 Int) (v_v_1145_2 Int) (v_v_1146_2 Int) (v_b_136_2 Int) (v_v_1150_2 Int) (v_b_139_2 Int) (v_v_1152_2 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 2)) (.cse5 (+ v_b_134_2 2)) (.cse4 (+ v_b_135_2 1)) (.cse3 (+ v_b_136_2 1)) (.cse2 (+ v_b_134_2 1)) (.cse7 (+ v_b_138_2 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 3)) (.cse6 (+ c_ULTIMATE.start_main_p1 1))) (and (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_2) (<= .cse0 v_b_135_2) (<= (+ v_b_136_2 2) v_b_139_2) (<= .cse1 v_b_137_2) (or (< v_idx_183 v_b_139_2) (= (select |c_#memory_int| v_idx_183) v_v_1152_2)) (<= .cse2 v_b_135_2) (or (<= v_b_139_2 v_idx_182) (= 0 (select |c_#memory_int| v_idx_182)) (< v_idx_182 v_b_138_2)) (or (= (select |c_#memory_int| v_idx_178) 0) (< v_idx_178 v_b_134_2) (<= v_b_135_2 v_idx_178)) (<= 0 (* 2 v_v_1145_2)) (<= v_b_135_2 v_b_136_2) (<= v_b_137_2 .cse3) (<= .cse4 v_b_138_2) (<= (+ v_b_137_2 1) v_b_139_2) (<= (+ v_b_135_2 2) v_b_139_2) (<= (+ v_b_134_2 3) v_b_139_2) (<= .cse0 v_b_136_2) (<= v_b_135_2 .cse2) (<= .cse5 v_b_137_2) (or (= (select |c_#memory_int| v_idx_176) v_v_1145_2) (< v_idx_176 c_ULTIMATE.start_main_p1) (<= .cse6 v_idx_176)) (<= .cse5 v_b_138_2) (<= .cse4 v_b_137_2) (or (< v_idx_177 .cse6) (= (select |c_#memory_int| v_idx_177) v_v_1146_2) (<= v_b_134_2 v_idx_177)) (<= v_b_137_2 v_b_138_2) (or (< v_idx_181 v_b_137_2) (<= v_b_138_2 v_idx_181) (= (select |c_#memory_int| v_idx_181) v_v_1150_2)) (<= .cse3 v_b_137_2) (or (= (select |c_#memory_int| v_idx_179) v_v_1148_2) (<= v_b_136_2 v_idx_179) (< v_idx_179 v_b_135_2)) (<= .cse3 v_b_138_2) (<= v_b_139_2 .cse7) (or (<= c_ULTIMATE.start_main_p1 v_idx_175) (= (select |c_#memory_int| v_idx_175) v_v_1144_2)) (<= .cse2 v_b_136_2) (<= .cse7 v_b_139_2) (or (< v_idx_180 v_b_136_2) (<= v_b_137_2 v_idx_180) (= (select |c_#memory_int| v_idx_180) 0)) (<= .cse1 v_b_138_2) (<= .cse6 v_b_134_2) (<= 0 v_v_1145_2))))) is different from false [2019-01-07 22:11:16,089 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_191 Int) (v_idx_192 Int) (v_idx_190 Int) (v_idx_184 Int) (v_idx_185 Int) (v_idx_188 Int) (v_idx_189 Int) (v_idx_186 Int) (v_idx_187 Int)) (exists ((v_v_1148_2 Int) (v_b_134_2 Int) (v_b_137_2 Int) (v_b_138_2 Int) (v_v_1144_2 Int) (v_b_135_2 Int) (v_v_1145_2 Int) (v_b_136_2 Int) (v_v_1146_2 Int) (v_v_1150_2 Int) (v_b_139_2 Int) (v_v_1152_2 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 2)) (.cse6 (+ v_b_134_2 2)) (.cse5 (+ v_b_135_2 1)) (.cse4 (+ v_b_136_2 1)) (.cse3 (+ v_b_134_2 1)) (.cse7 (+ v_b_138_2 1)) (.cse2 (+ c_ULTIMATE.start_main_p1 3)) (.cse1 (+ c_ULTIMATE.start_main_p1 1))) (and (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_2) (<= .cse0 v_b_135_2) (or (< v_idx_185 c_ULTIMATE.start_main_p1) (<= .cse1 v_idx_185) (= (select |c_#memory_int| v_idx_185) v_v_1145_2)) (<= (+ v_b_136_2 2) v_b_139_2) (<= .cse2 v_b_137_2) (<= .cse3 v_b_135_2) (<= 0 (* 2 v_v_1145_2)) (<= v_b_135_2 v_b_136_2) (or (< v_idx_192 v_b_139_2) (= (select |c_#memory_int| v_idx_192) v_v_1152_2)) (<= v_b_137_2 .cse4) (<= .cse5 v_b_138_2) (<= (+ v_b_137_2 1) v_b_139_2) (<= (+ v_b_135_2 2) v_b_139_2) (<= (+ v_b_134_2 3) v_b_139_2) (<= .cse0 v_b_136_2) (<= v_b_135_2 .cse3) (<= .cse6 v_b_137_2) (or (<= c_ULTIMATE.start_main_p1 v_idx_184) (= (select |c_#memory_int| v_idx_184) v_v_1144_2)) (<= .cse6 v_b_138_2) (<= .cse5 v_b_137_2) (or (< v_idx_187 v_b_134_2) (= 0 (select |c_#memory_int| v_idx_187)) (<= v_b_135_2 v_idx_187)) (or (<= v_b_136_2 v_idx_188) (= (select |c_#memory_int| v_idx_188) v_v_1148_2) (< v_idx_188 v_b_135_2)) (<= v_b_137_2 v_b_138_2) (<= .cse4 v_b_137_2) (or (<= v_b_138_2 v_idx_190) (< v_idx_190 v_b_137_2) (= (select |c_#memory_int| v_idx_190) v_v_1150_2)) (<= .cse4 v_b_138_2) (<= v_b_139_2 .cse7) (or (<= v_b_139_2 v_idx_191) (< v_idx_191 v_b_138_2) (= (select |c_#memory_int| v_idx_191) 0)) (or (= (select |c_#memory_int| v_idx_189) 0) (< v_idx_189 v_b_136_2) (<= v_b_137_2 v_idx_189)) (<= .cse3 v_b_136_2) (or (< v_idx_186 .cse1) (<= v_b_134_2 v_idx_186) (= (select |c_#memory_int| v_idx_186) v_v_1146_2)) (<= .cse7 v_b_139_2) (<= .cse2 v_b_138_2) (<= .cse1 v_b_134_2) (<= 0 v_v_1145_2))))) is different from false [2019-01-07 22:11:17,643 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-07 22:11:17,643 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-07 22:11:17,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-07 22:11:17,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-07 22:11:17,644 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:11:17,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 22:11:17,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 22:11:17,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-01-07 22:11:17,645 INFO L87 Difference]: Start difference. First operand 12 states and 23 transitions. Second operand 4 states. [2019-01-07 22:11:20,310 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_191 Int) (v_idx_192 Int) (v_idx_190 Int) (v_idx_184 Int) (v_idx_185 Int) (v_idx_188 Int) (v_idx_189 Int) (v_idx_186 Int) (v_idx_187 Int)) (exists ((v_v_1148_2 Int) (v_b_134_2 Int) (v_b_137_2 Int) (v_b_138_2 Int) (v_v_1144_2 Int) (v_b_135_2 Int) (v_v_1145_2 Int) (v_b_136_2 Int) (v_v_1146_2 Int) (v_v_1150_2 Int) (v_b_139_2 Int) (v_v_1152_2 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 2)) (.cse6 (+ v_b_134_2 2)) (.cse5 (+ v_b_135_2 1)) (.cse4 (+ v_b_136_2 1)) (.cse3 (+ v_b_134_2 1)) (.cse7 (+ v_b_138_2 1)) (.cse2 (+ c_ULTIMATE.start_main_p1 3)) (.cse1 (+ c_ULTIMATE.start_main_p1 1))) (and (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_2) (<= .cse0 v_b_135_2) (or (< v_idx_185 c_ULTIMATE.start_main_p1) (<= .cse1 v_idx_185) (= (select |c_#memory_int| v_idx_185) v_v_1145_2)) (<= (+ v_b_136_2 2) v_b_139_2) (<= .cse2 v_b_137_2) (<= .cse3 v_b_135_2) (<= 0 (* 2 v_v_1145_2)) (<= v_b_135_2 v_b_136_2) (or (< v_idx_192 v_b_139_2) (= (select |c_#memory_int| v_idx_192) v_v_1152_2)) (<= v_b_137_2 .cse4) (<= .cse5 v_b_138_2) (<= (+ v_b_137_2 1) v_b_139_2) (<= (+ v_b_135_2 2) v_b_139_2) (<= (+ v_b_134_2 3) v_b_139_2) (<= .cse0 v_b_136_2) (<= v_b_135_2 .cse3) (<= .cse6 v_b_137_2) (or (<= c_ULTIMATE.start_main_p1 v_idx_184) (= (select |c_#memory_int| v_idx_184) v_v_1144_2)) (<= .cse6 v_b_138_2) (<= .cse5 v_b_137_2) (or (< v_idx_187 v_b_134_2) (= 0 (select |c_#memory_int| v_idx_187)) (<= v_b_135_2 v_idx_187)) (or (<= v_b_136_2 v_idx_188) (= (select |c_#memory_int| v_idx_188) v_v_1148_2) (< v_idx_188 v_b_135_2)) (<= v_b_137_2 v_b_138_2) (<= .cse4 v_b_137_2) (or (<= v_b_138_2 v_idx_190) (< v_idx_190 v_b_137_2) (= (select |c_#memory_int| v_idx_190) v_v_1150_2)) (<= .cse4 v_b_138_2) (<= v_b_139_2 .cse7) (or (<= v_b_139_2 v_idx_191) (< v_idx_191 v_b_138_2) (= (select |c_#memory_int| v_idx_191) 0)) (or (= (select |c_#memory_int| v_idx_189) 0) (< v_idx_189 v_b_136_2) (<= v_b_137_2 v_idx_189)) (<= .cse3 v_b_136_2) (or (< v_idx_186 .cse1) (<= v_b_134_2 v_idx_186) (= (select |c_#memory_int| v_idx_186) v_v_1146_2)) (<= .cse7 v_b_139_2) (<= .cse2 v_b_138_2) (<= .cse1 v_b_134_2) (<= 0 v_v_1145_2))))) (forall ((v_idx_179 Int) (v_idx_180 Int) (v_idx_181 Int) (v_idx_182 Int) (v_idx_183 Int) (v_idx_177 Int) (v_idx_178 Int) (v_idx_175 Int) (v_idx_176 Int)) (exists ((v_b_134_2 Int) (v_v_1148_2 Int) (v_b_137_2 Int) (v_b_138_2 Int) (v_v_1144_2 Int) (v_b_135_2 Int) (v_v_1145_2 Int) (v_v_1146_2 Int) (v_b_136_2 Int) (v_v_1150_2 Int) (v_b_139_2 Int) (v_v_1152_2 Int)) (let ((.cse8 (+ c_ULTIMATE.start_main_p1 2)) (.cse13 (+ v_b_134_2 2)) (.cse12 (+ v_b_135_2 1)) (.cse11 (+ v_b_136_2 1)) (.cse10 (+ v_b_134_2 1)) (.cse15 (+ v_b_138_2 1)) (.cse9 (+ c_ULTIMATE.start_main_p1 3)) (.cse14 (+ c_ULTIMATE.start_main_p1 1))) (and (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_2) (<= .cse8 v_b_135_2) (<= (+ v_b_136_2 2) v_b_139_2) (<= .cse9 v_b_137_2) (or (< v_idx_183 v_b_139_2) (= (select |c_#memory_int| v_idx_183) v_v_1152_2)) (<= .cse10 v_b_135_2) (or (<= v_b_139_2 v_idx_182) (= 0 (select |c_#memory_int| v_idx_182)) (< v_idx_182 v_b_138_2)) (or (= (select |c_#memory_int| v_idx_178) 0) (< v_idx_178 v_b_134_2) (<= v_b_135_2 v_idx_178)) (<= 0 (* 2 v_v_1145_2)) (<= v_b_135_2 v_b_136_2) (<= v_b_137_2 .cse11) (<= .cse12 v_b_138_2) (<= (+ v_b_137_2 1) v_b_139_2) (<= (+ v_b_135_2 2) v_b_139_2) (<= (+ v_b_134_2 3) v_b_139_2) (<= .cse8 v_b_136_2) (<= v_b_135_2 .cse10) (<= .cse13 v_b_137_2) (or (= (select |c_#memory_int| v_idx_176) v_v_1145_2) (< v_idx_176 c_ULTIMATE.start_main_p1) (<= .cse14 v_idx_176)) (<= .cse13 v_b_138_2) (<= .cse12 v_b_137_2) (or (< v_idx_177 .cse14) (= (select |c_#memory_int| v_idx_177) v_v_1146_2) (<= v_b_134_2 v_idx_177)) (<= v_b_137_2 v_b_138_2) (or (< v_idx_181 v_b_137_2) (<= v_b_138_2 v_idx_181) (= (select |c_#memory_int| v_idx_181) v_v_1150_2)) (<= .cse11 v_b_137_2) (or (= (select |c_#memory_int| v_idx_179) v_v_1148_2) (<= v_b_136_2 v_idx_179) (< v_idx_179 v_b_135_2)) (<= .cse11 v_b_138_2) (<= v_b_139_2 .cse15) (or (<= c_ULTIMATE.start_main_p1 v_idx_175) (= (select |c_#memory_int| v_idx_175) v_v_1144_2)) (<= .cse10 v_b_136_2) (<= .cse15 v_b_139_2) (or (< v_idx_180 v_b_136_2) (<= v_b_137_2 v_idx_180) (= (select |c_#memory_int| v_idx_180) 0)) (<= .cse9 v_b_138_2) (<= .cse14 v_b_134_2) (<= 0 v_v_1145_2)))))) is different from false [2019-01-07 22:11:33,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:11:33,340 INFO L93 Difference]: Finished difference Result 14 states and 29 transitions. [2019-01-07 22:11:33,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 22:11:33,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 22:11:33,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:11:33,341 INFO L225 Difference]: With dead ends: 14 [2019-01-07 22:11:33,341 INFO L226 Difference]: Without dead ends: 13 [2019-01-07 22:11:33,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-01-07 22:11:33,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-07 22:11:33,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-07 22:11:33,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 22:11:33,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 23 transitions. [2019-01-07 22:11:33,348 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 23 transitions. Word has length 3 [2019-01-07 22:11:33,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:11:33,348 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 23 transitions. [2019-01-07 22:11:33,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 22:11:33,349 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 23 transitions. [2019-01-07 22:11:33,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 22:11:33,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:11:33,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 22:11:33,350 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:11:33,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:33,350 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-01-07 22:11:33,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:11:33,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:33,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:11:33,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:33,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:11:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:33,447 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-07 22:11:33,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:33,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:11:33,448 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 22:11:33,448 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-01-07 22:11:33,449 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:11:33,450 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:11:39,805 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-07 22:11:39,806 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 22:11:39,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:39,806 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-07 22:11:40,082 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 68.75% of their original sizes. [2019-01-07 22:11:40,082 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-07 22:11:42,536 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_278 Int) (v_idx_279 Int) (v_idx_272 Int) (v_idx_273 Int) (v_idx_271 Int) (v_idx_276 Int) (v_idx_277 Int) (v_idx_274 Int) (v_idx_275 Int)) (exists ((v_v_1146_3 Int) (v_v_1147_3 Int) (v_v_1148_3 Int) (v_b_136_3 Int) (v_b_137_3 Int) (v_v_1144_3 Int) (v_v_1150_3 Int) (v_b_138_3 Int) (v_b_139_3 Int) (v_v_1152_3 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 3)) (.cse1 (+ c_ULTIMATE.start_main_p2 1)) (.cse2 (+ c_ULTIMATE.start_main_p2 2)) (.cse4 (+ v_b_136_3 1)) (.cse3 (+ v_b_138_3 1)) (.cse5 (+ c_ULTIMATE.start_main_p1 1))) (and (<= .cse0 v_b_138_3) (or (< v_idx_274 c_ULTIMATE.start_main_p2) (<= .cse1 v_idx_274) (= (select |c_#memory_int| v_idx_274) v_v_1147_3)) (<= .cse0 v_b_137_3) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_3) (<= v_v_1147_3 0) (or (= (select |c_#memory_int| v_idx_279) v_v_1152_3) (< v_idx_279 v_b_139_3)) (<= .cse2 v_b_138_3) (or (= (select |c_#memory_int| v_idx_275) v_v_1148_3) (<= v_b_136_3 v_idx_275) (< v_idx_275 .cse1)) (<= .cse3 v_b_139_3) (<= (* 2 v_v_1147_3) 0) (<= v_b_137_3 v_b_138_3) (or (= (select |c_#memory_int| v_idx_271) v_v_1144_3) (<= c_ULTIMATE.start_main_p1 v_idx_271)) (<= .cse1 v_b_136_3) (or (<= v_b_137_3 v_idx_276) (= 0 (select |c_#memory_int| v_idx_276)) (< v_idx_276 v_b_136_3)) (<= (+ v_b_137_3 1) v_b_139_3) (<= .cse4 v_b_138_3) (<= (+ c_ULTIMATE.start_main_p2 3) v_b_139_3) (<= .cse4 v_b_137_3) (or (= (select |c_#memory_int| v_idx_277) v_v_1150_3) (< v_idx_277 v_b_137_3) (<= v_b_138_3 v_idx_277)) (or (<= v_b_139_3 v_idx_278) (< v_idx_278 v_b_138_3) (= 0 (select |c_#memory_int| v_idx_278))) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_136_3) (<= .cse2 v_b_137_3) (<= v_b_137_3 .cse4) (<= v_b_139_3 .cse3) (or (< v_idx_273 .cse5) (= (select |c_#memory_int| v_idx_273) v_v_1146_3) (<= c_ULTIMATE.start_main_p2 v_idx_273)) (<= (+ v_b_136_3 2) v_b_139_3) (<= .cse5 c_ULTIMATE.start_main_p2) (or (= (select |c_#memory_int| v_idx_272) 0) (<= .cse5 v_idx_272) (< v_idx_272 c_ULTIMATE.start_main_p1)))))) is different from false [2019-01-07 22:11:45,218 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_280 Int) (v_idx_283 Int) (v_idx_284 Int) (v_idx_281 Int) (v_idx_282 Int) (v_idx_287 Int) (v_idx_288 Int) (v_idx_285 Int) (v_idx_286 Int)) (exists ((v_v_1146_3 Int) (v_v_1147_3 Int) (v_v_1148_3 Int) (v_b_136_3 Int) (v_b_137_3 Int) (v_b_134_3 Int) (v_v_1144_3 Int) (v_b_135_3 Int) (v_v_1150_3 Int) (v_b_138_3 Int) (v_b_139_3 Int) (v_v_1152_3 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p1 3)) (.cse3 (+ v_b_134_3 1)) (.cse0 (+ v_b_135_3 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 2)) (.cse6 (+ v_b_134_3 2)) (.cse2 (+ c_ULTIMATE.start_main_p1 1)) (.cse7 (+ v_b_136_3 1)) (.cse5 (+ v_b_138_3 1))) (and (<= .cse0 v_b_138_3) (or (= 0 (select |c_#memory_int| v_idx_285)) (< v_idx_285 v_b_136_3) (<= v_b_137_3 v_idx_285)) (<= .cse1 v_b_138_3) (or (= (select |c_#memory_int| v_idx_283) v_v_1147_3) (<= v_b_135_3 v_idx_283) (< v_idx_283 v_b_134_3)) (<= .cse2 v_b_134_3) (<= .cse1 v_b_137_3) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_3) (<= v_b_135_3 .cse3) (<= .cse4 v_b_135_3) (<= v_v_1147_3 0) (<= (+ v_b_135_3 2) v_b_139_3) (<= .cse5 v_b_139_3) (<= .cse3 v_b_135_3) (<= .cse6 v_b_137_3) (<= (+ v_b_134_3 3) v_b_139_3) (<= (* 2 v_v_1147_3) 0) (<= v_b_137_3 v_b_138_3) (<= .cse3 v_b_136_3) (or (<= .cse2 v_idx_281) (< v_idx_281 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_281))) (<= v_b_135_3 v_b_136_3) (or (= (select |c_#memory_int| v_idx_286) v_v_1150_3) (< v_idx_286 v_b_137_3) (<= v_b_138_3 v_idx_286)) (<= (+ v_b_137_3 1) v_b_139_3) (<= .cse7 v_b_138_3) (<= .cse7 v_b_137_3) (<= .cse0 v_b_137_3) (or (<= c_ULTIMATE.start_main_p1 v_idx_280) (= (select |c_#memory_int| v_idx_280) v_v_1144_3)) (<= .cse4 v_b_136_3) (<= .cse6 v_b_138_3) (or (< v_idx_282 .cse2) (<= v_b_134_3 v_idx_282) (= (select |c_#memory_int| v_idx_282) v_v_1146_3)) (or (< v_idx_288 v_b_139_3) (= (select |c_#memory_int| v_idx_288) v_v_1152_3)) (<= v_b_137_3 .cse7) (<= v_b_139_3 .cse5) (or (<= v_b_139_3 v_idx_287) (= 0 (select |c_#memory_int| v_idx_287)) (< v_idx_287 v_b_138_3)) (or (= (select |c_#memory_int| v_idx_284) v_v_1148_3) (< v_idx_284 v_b_135_3) (<= v_b_136_3 v_idx_284)) (<= (+ v_b_136_3 2) v_b_139_3))))) is different from false [2019-01-07 22:11:45,479 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-07 22:11:45,479 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-07 22:11:45,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-07 22:11:45,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-07 22:11:45,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:11:45,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 22:11:45,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 22:11:45,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-01-07 22:11:45,481 INFO L87 Difference]: Start difference. First operand 12 states and 23 transitions. Second operand 4 states. [2019-01-07 22:11:48,038 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_280 Int) (v_idx_283 Int) (v_idx_284 Int) (v_idx_281 Int) (v_idx_282 Int) (v_idx_287 Int) (v_idx_288 Int) (v_idx_285 Int) (v_idx_286 Int)) (exists ((v_v_1146_3 Int) (v_v_1147_3 Int) (v_v_1148_3 Int) (v_b_136_3 Int) (v_b_137_3 Int) (v_b_134_3 Int) (v_v_1144_3 Int) (v_b_135_3 Int) (v_v_1150_3 Int) (v_b_138_3 Int) (v_b_139_3 Int) (v_v_1152_3 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p1 3)) (.cse3 (+ v_b_134_3 1)) (.cse0 (+ v_b_135_3 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 2)) (.cse6 (+ v_b_134_3 2)) (.cse2 (+ c_ULTIMATE.start_main_p1 1)) (.cse7 (+ v_b_136_3 1)) (.cse5 (+ v_b_138_3 1))) (and (<= .cse0 v_b_138_3) (or (= 0 (select |c_#memory_int| v_idx_285)) (< v_idx_285 v_b_136_3) (<= v_b_137_3 v_idx_285)) (<= .cse1 v_b_138_3) (or (= (select |c_#memory_int| v_idx_283) v_v_1147_3) (<= v_b_135_3 v_idx_283) (< v_idx_283 v_b_134_3)) (<= .cse2 v_b_134_3) (<= .cse1 v_b_137_3) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_3) (<= v_b_135_3 .cse3) (<= .cse4 v_b_135_3) (<= v_v_1147_3 0) (<= (+ v_b_135_3 2) v_b_139_3) (<= .cse5 v_b_139_3) (<= .cse3 v_b_135_3) (<= .cse6 v_b_137_3) (<= (+ v_b_134_3 3) v_b_139_3) (<= (* 2 v_v_1147_3) 0) (<= v_b_137_3 v_b_138_3) (<= .cse3 v_b_136_3) (or (<= .cse2 v_idx_281) (< v_idx_281 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_281))) (<= v_b_135_3 v_b_136_3) (or (= (select |c_#memory_int| v_idx_286) v_v_1150_3) (< v_idx_286 v_b_137_3) (<= v_b_138_3 v_idx_286)) (<= (+ v_b_137_3 1) v_b_139_3) (<= .cse7 v_b_138_3) (<= .cse7 v_b_137_3) (<= .cse0 v_b_137_3) (or (<= c_ULTIMATE.start_main_p1 v_idx_280) (= (select |c_#memory_int| v_idx_280) v_v_1144_3)) (<= .cse4 v_b_136_3) (<= .cse6 v_b_138_3) (or (< v_idx_282 .cse2) (<= v_b_134_3 v_idx_282) (= (select |c_#memory_int| v_idx_282) v_v_1146_3)) (or (< v_idx_288 v_b_139_3) (= (select |c_#memory_int| v_idx_288) v_v_1152_3)) (<= v_b_137_3 .cse7) (<= v_b_139_3 .cse5) (or (<= v_b_139_3 v_idx_287) (= 0 (select |c_#memory_int| v_idx_287)) (< v_idx_287 v_b_138_3)) (or (= (select |c_#memory_int| v_idx_284) v_v_1148_3) (< v_idx_284 v_b_135_3) (<= v_b_136_3 v_idx_284)) (<= (+ v_b_136_3 2) v_b_139_3))))) (forall ((v_idx_278 Int) (v_idx_279 Int) (v_idx_272 Int) (v_idx_273 Int) (v_idx_271 Int) (v_idx_276 Int) (v_idx_277 Int) (v_idx_274 Int) (v_idx_275 Int)) (exists ((v_v_1146_3 Int) (v_v_1147_3 Int) (v_v_1148_3 Int) (v_b_136_3 Int) (v_b_137_3 Int) (v_v_1144_3 Int) (v_v_1150_3 Int) (v_b_138_3 Int) (v_b_139_3 Int) (v_v_1152_3 Int)) (let ((.cse8 (+ c_ULTIMATE.start_main_p1 3)) (.cse9 (+ c_ULTIMATE.start_main_p2 1)) (.cse10 (+ c_ULTIMATE.start_main_p2 2)) (.cse12 (+ v_b_136_3 1)) (.cse11 (+ v_b_138_3 1)) (.cse13 (+ c_ULTIMATE.start_main_p1 1))) (and (<= .cse8 v_b_138_3) (or (< v_idx_274 c_ULTIMATE.start_main_p2) (<= .cse9 v_idx_274) (= (select |c_#memory_int| v_idx_274) v_v_1147_3)) (<= .cse8 v_b_137_3) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_3) (<= v_v_1147_3 0) (or (= (select |c_#memory_int| v_idx_279) v_v_1152_3) (< v_idx_279 v_b_139_3)) (<= .cse10 v_b_138_3) (or (= (select |c_#memory_int| v_idx_275) v_v_1148_3) (<= v_b_136_3 v_idx_275) (< v_idx_275 .cse9)) (<= .cse11 v_b_139_3) (<= (* 2 v_v_1147_3) 0) (<= v_b_137_3 v_b_138_3) (or (= (select |c_#memory_int| v_idx_271) v_v_1144_3) (<= c_ULTIMATE.start_main_p1 v_idx_271)) (<= .cse9 v_b_136_3) (or (<= v_b_137_3 v_idx_276) (= 0 (select |c_#memory_int| v_idx_276)) (< v_idx_276 v_b_136_3)) (<= (+ v_b_137_3 1) v_b_139_3) (<= .cse12 v_b_138_3) (<= (+ c_ULTIMATE.start_main_p2 3) v_b_139_3) (<= .cse12 v_b_137_3) (or (= (select |c_#memory_int| v_idx_277) v_v_1150_3) (< v_idx_277 v_b_137_3) (<= v_b_138_3 v_idx_277)) (or (<= v_b_139_3 v_idx_278) (< v_idx_278 v_b_138_3) (= 0 (select |c_#memory_int| v_idx_278))) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_136_3) (<= .cse10 v_b_137_3) (<= v_b_137_3 .cse12) (<= v_b_139_3 .cse11) (or (< v_idx_273 .cse13) (= (select |c_#memory_int| v_idx_273) v_v_1146_3) (<= c_ULTIMATE.start_main_p2 v_idx_273)) (<= (+ v_b_136_3 2) v_b_139_3) (<= .cse13 c_ULTIMATE.start_main_p2) (or (= (select |c_#memory_int| v_idx_272) 0) (<= .cse13 v_idx_272) (< v_idx_272 c_ULTIMATE.start_main_p1))))))) is different from false [2019-01-07 22:12:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:12:02,528 INFO L93 Difference]: Finished difference Result 14 states and 29 transitions. [2019-01-07 22:12:02,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 22:12:02,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 22:12:02,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:12:02,529 INFO L225 Difference]: With dead ends: 14 [2019-01-07 22:12:02,529 INFO L226 Difference]: Without dead ends: 13 [2019-01-07 22:12:02,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-01-07 22:12:02,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-07 22:12:02,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-07 22:12:02,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 22:12:02,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 23 transitions. [2019-01-07 22:12:02,538 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 23 transitions. Word has length 3 [2019-01-07 22:12:02,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:12:02,538 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 23 transitions. [2019-01-07 22:12:02,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 22:12:02,539 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 23 transitions. [2019-01-07 22:12:02,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 22:12:02,539 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:12:02,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 22:12:02,540 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:12:02,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:12:02,540 INFO L82 PathProgramCache]: Analyzing trace with hash 30244, now seen corresponding path program 1 times [2019-01-07 22:12:02,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:12:02,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:02,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:12:02,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:02,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:12:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:12:02,750 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-01-07 22:12:02,760 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-07 22:12:02,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:12:02,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:12:02,761 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 22:12:02,762 INFO L207 CegarAbsIntRunner]: [0], [14], [19] [2019-01-07 22:12:02,763 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:12:02,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:12:07,607 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-07 22:12:07,607 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 22:12:07,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:12:07,608 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-07 22:12:07,856 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 68.75% of their original sizes. [2019-01-07 22:12:07,856 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-07 22:12:10,344 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_368 Int) (v_idx_369 Int) (v_idx_367 Int) (v_idx_371 Int) (v_idx_372 Int) (v_idx_370 Int) (v_idx_375 Int) (v_idx_373 Int) (v_idx_374 Int)) (exists ((v_v_1149_4 Int) (v_v_1146_4 Int) (v_v_1148_4 Int) (v_b_135_4 Int) (v_v_1152_4 Int) (v_b_134_4 Int) (v_v_1144_4 Int) (v_b_139_4 Int) (v_v_1150_4 Int) (v_b_138_4 Int)) (let ((.cse2 (+ c_ULTIMATE.start_main_p1 1)) (.cse1 (+ v_b_138_4 1)) (.cse4 (+ v_b_134_4 1)) (.cse0 (+ c_ULTIMATE.start_main_p3 1)) (.cse3 (+ c_ULTIMATE.start_main_p1 2))) (and (or (<= c_ULTIMATE.start_main_p3 v_idx_371) (< v_idx_371 v_b_135_4) (= (select |c_#memory_int| v_idx_371) v_v_1148_4)) (<= (+ c_ULTIMATE.start_main_p3 2) v_b_139_4) (<= (+ c_ULTIMATE.start_main_p1 3) v_b_138_4) (or (= (select |c_#memory_int| v_idx_372) v_v_1149_4) (< v_idx_372 c_ULTIMATE.start_main_p3) (<= .cse0 v_idx_372)) (<= v_b_135_4 c_ULTIMATE.start_main_p3) (<= .cse1 v_b_139_4) (or (<= v_b_139_4 v_idx_374) (= 0 (select |c_#memory_int| v_idx_374)) (< v_idx_374 v_b_138_4)) (<= (+ v_b_134_4 3) v_b_139_4) (<= 0 v_v_1149_4) (<= .cse2 v_b_134_4) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_4) (or (= (select |c_#memory_int| v_idx_373) v_v_1150_4) (< v_idx_373 .cse0) (<= v_b_138_4 v_idx_373)) (<= .cse3 c_ULTIMATE.start_main_p3) (<= .cse4 v_b_135_4) (<= v_b_135_4 .cse4) (or (<= v_b_135_4 v_idx_370) (< v_idx_370 v_b_134_4) (= 0 (select |c_#memory_int| v_idx_370))) (or (= (select |c_#memory_int| v_idx_369) v_v_1146_4) (< v_idx_369 .cse2) (<= v_b_134_4 v_idx_369)) (or (= 0 (select |c_#memory_int| v_idx_368)) (<= .cse2 v_idx_368) (< v_idx_368 c_ULTIMATE.start_main_p1)) (<= v_b_139_4 .cse1) (<= (+ v_b_135_4 2) v_b_139_4) (<= 0 (* 2 v_v_1149_4)) (<= (+ v_b_134_4 2) v_b_138_4) (<= .cse4 c_ULTIMATE.start_main_p3) (<= (+ v_b_135_4 1) v_b_138_4) (or (= (select |c_#memory_int| v_idx_375) v_v_1152_4) (< v_idx_375 v_b_139_4)) (or (<= c_ULTIMATE.start_main_p1 v_idx_367) (= (select |c_#memory_int| v_idx_367) v_v_1144_4)) (<= .cse0 v_b_138_4) (<= .cse3 v_b_135_4))))) is different from false [2019-01-07 22:12:12,647 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_379 Int) (v_idx_377 Int) (v_idx_378 Int) (v_idx_382 Int) (v_idx_383 Int) (v_idx_380 Int) (v_idx_381 Int) (v_idx_376 Int) (v_idx_384 Int)) (exists ((v_v_1149_4 Int) (v_v_1146_4 Int) (v_v_1148_4 Int) (v_b_135_4 Int) (v_v_1152_4 Int) (v_b_136_4 Int) (v_b_134_4 Int) (v_v_1144_4 Int) (v_b_139_4 Int) (v_b_137_4 Int) (v_v_1150_4 Int) (v_b_138_4 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p1 3)) (.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse4 (+ v_b_134_4 1)) (.cse3 (+ v_b_138_4 1)) (.cse2 (+ v_b_134_4 2)) (.cse6 (+ v_b_136_4 1)) (.cse7 (+ v_b_135_4 1)) (.cse5 (+ c_ULTIMATE.start_main_p1 2))) (and (or (<= v_b_134_4 v_idx_378) (< v_idx_378 .cse0) (= (select |c_#memory_int| v_idx_378) v_v_1146_4)) (or (<= .cse0 v_idx_377) (< v_idx_377 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_377))) (<= (+ v_b_137_4 1) v_b_139_4) (<= .cse1 v_b_138_4) (<= .cse2 v_b_137_4) (or (< v_idx_379 v_b_134_4) (<= v_b_135_4 v_idx_379) (= 0 (select |c_#memory_int| v_idx_379))) (<= .cse1 v_b_137_4) (or (< v_idx_380 v_b_135_4) (= (select |c_#memory_int| v_idx_380) v_v_1148_4) (<= v_b_136_4 v_idx_380)) (or (= 0 (select |c_#memory_int| v_idx_383)) (< v_idx_383 v_b_138_4) (<= v_b_139_4 v_idx_383)) (<= .cse3 v_b_139_4) (<= (+ v_b_134_4 3) v_b_139_4) (<= 0 v_v_1149_4) (or (= (select |c_#memory_int| v_idx_384) v_v_1152_4) (< v_idx_384 v_b_139_4)) (<= .cse0 v_b_134_4) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_4) (<= v_b_135_4 v_b_136_4) (or (= (select |c_#memory_int| v_idx_381) v_v_1149_4) (< v_idx_381 v_b_136_4) (<= v_b_137_4 v_idx_381)) (<= .cse4 v_b_135_4) (<= v_b_135_4 .cse4) (<= .cse4 v_b_136_4) (<= .cse5 v_b_136_4) (or (<= c_ULTIMATE.start_main_p1 v_idx_376) (= (select |c_#memory_int| v_idx_376) v_v_1144_4)) (<= v_b_137_4 .cse6) (<= .cse6 v_b_137_4) (<= v_b_139_4 .cse3) (<= (+ v_b_135_4 2) v_b_139_4) (<= 0 (* 2 v_v_1149_4)) (<= (+ v_b_136_4 2) v_b_139_4) (<= v_b_137_4 v_b_138_4) (<= .cse7 v_b_137_4) (<= .cse2 v_b_138_4) (<= .cse6 v_b_138_4) (<= .cse7 v_b_138_4) (or (= (select |c_#memory_int| v_idx_382) v_v_1150_4) (<= v_b_138_4 v_idx_382) (< v_idx_382 v_b_137_4)) (<= .cse5 v_b_135_4))))) is different from false [2019-01-07 22:12:12,689 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-07 22:12:12,689 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-07 22:12:12,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-07 22:12:12,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-07 22:12:12,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:12:12,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 22:12:12,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 22:12:12,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-01-07 22:12:12,691 INFO L87 Difference]: Start difference. First operand 12 states and 23 transitions. Second operand 4 states. [2019-01-07 22:12:15,237 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_379 Int) (v_idx_377 Int) (v_idx_378 Int) (v_idx_382 Int) (v_idx_383 Int) (v_idx_380 Int) (v_idx_381 Int) (v_idx_376 Int) (v_idx_384 Int)) (exists ((v_v_1149_4 Int) (v_v_1146_4 Int) (v_v_1148_4 Int) (v_b_135_4 Int) (v_v_1152_4 Int) (v_b_136_4 Int) (v_b_134_4 Int) (v_v_1144_4 Int) (v_b_139_4 Int) (v_b_137_4 Int) (v_v_1150_4 Int) (v_b_138_4 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p1 3)) (.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse4 (+ v_b_134_4 1)) (.cse3 (+ v_b_138_4 1)) (.cse2 (+ v_b_134_4 2)) (.cse6 (+ v_b_136_4 1)) (.cse7 (+ v_b_135_4 1)) (.cse5 (+ c_ULTIMATE.start_main_p1 2))) (and (or (<= v_b_134_4 v_idx_378) (< v_idx_378 .cse0) (= (select |c_#memory_int| v_idx_378) v_v_1146_4)) (or (<= .cse0 v_idx_377) (< v_idx_377 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_377))) (<= (+ v_b_137_4 1) v_b_139_4) (<= .cse1 v_b_138_4) (<= .cse2 v_b_137_4) (or (< v_idx_379 v_b_134_4) (<= v_b_135_4 v_idx_379) (= 0 (select |c_#memory_int| v_idx_379))) (<= .cse1 v_b_137_4) (or (< v_idx_380 v_b_135_4) (= (select |c_#memory_int| v_idx_380) v_v_1148_4) (<= v_b_136_4 v_idx_380)) (or (= 0 (select |c_#memory_int| v_idx_383)) (< v_idx_383 v_b_138_4) (<= v_b_139_4 v_idx_383)) (<= .cse3 v_b_139_4) (<= (+ v_b_134_4 3) v_b_139_4) (<= 0 v_v_1149_4) (or (= (select |c_#memory_int| v_idx_384) v_v_1152_4) (< v_idx_384 v_b_139_4)) (<= .cse0 v_b_134_4) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_4) (<= v_b_135_4 v_b_136_4) (or (= (select |c_#memory_int| v_idx_381) v_v_1149_4) (< v_idx_381 v_b_136_4) (<= v_b_137_4 v_idx_381)) (<= .cse4 v_b_135_4) (<= v_b_135_4 .cse4) (<= .cse4 v_b_136_4) (<= .cse5 v_b_136_4) (or (<= c_ULTIMATE.start_main_p1 v_idx_376) (= (select |c_#memory_int| v_idx_376) v_v_1144_4)) (<= v_b_137_4 .cse6) (<= .cse6 v_b_137_4) (<= v_b_139_4 .cse3) (<= (+ v_b_135_4 2) v_b_139_4) (<= 0 (* 2 v_v_1149_4)) (<= (+ v_b_136_4 2) v_b_139_4) (<= v_b_137_4 v_b_138_4) (<= .cse7 v_b_137_4) (<= .cse2 v_b_138_4) (<= .cse6 v_b_138_4) (<= .cse7 v_b_138_4) (or (= (select |c_#memory_int| v_idx_382) v_v_1150_4) (<= v_b_138_4 v_idx_382) (< v_idx_382 v_b_137_4)) (<= .cse5 v_b_135_4))))) (forall ((v_idx_368 Int) (v_idx_369 Int) (v_idx_367 Int) (v_idx_371 Int) (v_idx_372 Int) (v_idx_370 Int) (v_idx_375 Int) (v_idx_373 Int) (v_idx_374 Int)) (exists ((v_v_1149_4 Int) (v_v_1146_4 Int) (v_v_1148_4 Int) (v_b_135_4 Int) (v_v_1152_4 Int) (v_b_134_4 Int) (v_v_1144_4 Int) (v_b_139_4 Int) (v_v_1150_4 Int) (v_b_138_4 Int)) (let ((.cse10 (+ c_ULTIMATE.start_main_p1 1)) (.cse9 (+ v_b_138_4 1)) (.cse12 (+ v_b_134_4 1)) (.cse8 (+ c_ULTIMATE.start_main_p3 1)) (.cse11 (+ c_ULTIMATE.start_main_p1 2))) (and (or (<= c_ULTIMATE.start_main_p3 v_idx_371) (< v_idx_371 v_b_135_4) (= (select |c_#memory_int| v_idx_371) v_v_1148_4)) (<= (+ c_ULTIMATE.start_main_p3 2) v_b_139_4) (<= (+ c_ULTIMATE.start_main_p1 3) v_b_138_4) (or (= (select |c_#memory_int| v_idx_372) v_v_1149_4) (< v_idx_372 c_ULTIMATE.start_main_p3) (<= .cse8 v_idx_372)) (<= v_b_135_4 c_ULTIMATE.start_main_p3) (<= .cse9 v_b_139_4) (or (<= v_b_139_4 v_idx_374) (= 0 (select |c_#memory_int| v_idx_374)) (< v_idx_374 v_b_138_4)) (<= (+ v_b_134_4 3) v_b_139_4) (<= 0 v_v_1149_4) (<= .cse10 v_b_134_4) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_4) (or (= (select |c_#memory_int| v_idx_373) v_v_1150_4) (< v_idx_373 .cse8) (<= v_b_138_4 v_idx_373)) (<= .cse11 c_ULTIMATE.start_main_p3) (<= .cse12 v_b_135_4) (<= v_b_135_4 .cse12) (or (<= v_b_135_4 v_idx_370) (< v_idx_370 v_b_134_4) (= 0 (select |c_#memory_int| v_idx_370))) (or (= (select |c_#memory_int| v_idx_369) v_v_1146_4) (< v_idx_369 .cse10) (<= v_b_134_4 v_idx_369)) (or (= 0 (select |c_#memory_int| v_idx_368)) (<= .cse10 v_idx_368) (< v_idx_368 c_ULTIMATE.start_main_p1)) (<= v_b_139_4 .cse9) (<= (+ v_b_135_4 2) v_b_139_4) (<= 0 (* 2 v_v_1149_4)) (<= (+ v_b_134_4 2) v_b_138_4) (<= .cse12 c_ULTIMATE.start_main_p3) (<= (+ v_b_135_4 1) v_b_138_4) (or (= (select |c_#memory_int| v_idx_375) v_v_1152_4) (< v_idx_375 v_b_139_4)) (or (<= c_ULTIMATE.start_main_p1 v_idx_367) (= (select |c_#memory_int| v_idx_367) v_v_1144_4)) (<= .cse8 v_b_138_4) (<= .cse11 v_b_135_4)))))) is different from false [2019-01-07 22:12:29,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:12:29,977 INFO L93 Difference]: Finished difference Result 14 states and 29 transitions. [2019-01-07 22:12:29,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 22:12:29,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 22:12:29,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:12:29,978 INFO L225 Difference]: With dead ends: 14 [2019-01-07 22:12:29,978 INFO L226 Difference]: Without dead ends: 13 [2019-01-07 22:12:29,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-01-07 22:12:29,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-07 22:12:29,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-07 22:12:29,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 22:12:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 23 transitions. [2019-01-07 22:12:29,987 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 23 transitions. Word has length 3 [2019-01-07 22:12:29,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:12:29,987 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 23 transitions. [2019-01-07 22:12:29,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 22:12:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 23 transitions. [2019-01-07 22:12:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 22:12:29,988 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:12:29,988 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-01-07 22:12:29,989 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:12:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:12:29,989 INFO L82 PathProgramCache]: Analyzing trace with hash 939412, now seen corresponding path program 2 times [2019-01-07 22:12:29,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:12:29,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:29,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:12:29,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:29,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:12:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:12:30,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 22:12:30,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:12:30,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:12:30,078 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:12:30,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:12:30,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:12:30,079 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-07 22:12:30,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:12:30,092 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:12:30,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-07 22:12:30,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:12:30,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:12:30,140 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 15 treesize of output 18 [2019-01-07 22:12:30,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,183 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-07 22:12:30,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-07 22:12:30,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-07 22:12:30,222 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 22:12:30,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:12:30,390 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:12:30,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:12:30,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 22:12:30,644 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-07 22:12:30,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-07 22:12:30,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:12:30,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 22:12:30,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 22:12:30,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:30,874 INFO L303 Elim1Store]: Index analysis took 126 ms [2019-01-07 22:12:30,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-01-07 22:12:30,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:12:30,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 22:12:30,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-07 22:12:30,947 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-07 22:12:30,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:12:30,980 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-07 22:12:31,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:12:31,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-07 22:12:31,002 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:12:31,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 22:12:31,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 22:12:31,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-07 22:12:31,002 INFO L87 Difference]: Start difference. First operand 12 states and 23 transitions. Second operand 7 states. [2019-01-07 22:12:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:12:31,381 INFO L93 Difference]: Finished difference Result 37 states and 58 transitions. [2019-01-07 22:12:31,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 22:12:31,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-01-07 22:12:31,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:12:31,383 INFO L225 Difference]: With dead ends: 37 [2019-01-07 22:12:31,383 INFO L226 Difference]: Without dead ends: 33 [2019-01-07 22:12:31,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 22:12:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-07 22:12:31,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 16. [2019-01-07 22:12:31,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-07 22:12:31,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 36 transitions. [2019-01-07 22:12:31,396 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 36 transitions. Word has length 4 [2019-01-07 22:12:31,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:12:31,396 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 36 transitions. [2019-01-07 22:12:31,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 22:12:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 36 transitions. [2019-01-07 22:12:31,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 22:12:31,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:12:31,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 22:12:31,398 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:12:31,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:12:31,398 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-01-07 22:12:31,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:12:31,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:31,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:12:31,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:31,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:12:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:12:31,528 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-07 22:12:31,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:12:31,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:12:31,528 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 22:12:31,529 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-01-07 22:12:31,531 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:12:31,531 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:12:40,326 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-07 22:12:40,326 INFO L272 AbstractInterpreter]: Visited 4 different actions 16 times. Merged at 2 different actions 8 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 22:12:40,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:12:40,327 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-07 22:12:40,765 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 62.5% of their original sizes. [2019-01-07 22:12:40,766 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-07 22:12:40,826 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-07 22:12:40,827 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner$AbsIntCurrentIteration.getPredicateFromStates(CegarAbsIntRunner.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner$AbsIntCurrentIteration.lambda$0(CegarAbsIntRunner.java:441) at java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:193) at java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1382) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner$AbsIntCurrentIteration.unifyPredicates(CegarAbsIntRunner.java:442) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner$AbsIntCurrentIteration.createInterpolantGenerator(CegarAbsIntRunner.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner$AbsIntCurrentIteration.getInterpolantGenerator(CegarAbsIntRunner.java:389) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.getInterpolantGenerator(CegarAbsIntRunner.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:384) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) ... 20 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 45 more [2019-01-07 22:12:40,831 INFO L168 Benchmark]: Toolchain (without parser) took 141141.81 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -505.3 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-01-07 22:12:40,833 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 22:12:40,834 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.20 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-07 22:12:40,834 INFO L168 Benchmark]: Boogie Preprocessor took 30.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-07 22:12:40,834 INFO L168 Benchmark]: RCFGBuilder took 352.01 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-07 22:12:40,835 INFO L168 Benchmark]: TraceAbstraction took 140686.54 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -526.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-01-07 22:12:40,844 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.20 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 30.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. * RCFGBuilder took 352.01 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 140686.54 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -526.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...