java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/cggmp2005.c.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:26:04,363 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:26:04,365 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:26:04,378 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:26:04,379 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:26:04,380 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:26:04,381 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:26:04,383 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:26:04,385 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:26:04,386 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:26:04,387 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:26:04,387 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:26:04,388 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:26:04,389 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:26:04,390 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:26:04,391 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:26:04,392 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:26:04,394 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:26:04,396 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:26:04,398 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:26:04,399 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:26:04,400 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:26:04,402 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:26:04,403 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:26:04,403 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:26:04,404 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:26:04,405 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:26:04,407 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:26:04,411 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:26:04,412 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:26:04,412 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:26:04,413 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:26:04,413 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:26:04,413 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:26:04,415 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:26:04,416 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:26:04,416 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:26:04,442 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:26:04,443 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:26:04,444 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:26:04,444 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:26:04,445 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:26:04,445 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:26:04,445 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:26:04,445 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:26:04,446 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:26:04,446 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:26:04,446 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:26:04,446 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:26:04,446 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:26:04,447 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:26:04,447 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:26:04,447 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:26:04,448 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:26:04,449 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:26:04,449 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:26:04,449 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:26:04,450 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:26:04,450 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:26:04,450 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:26:04,450 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:26:04,450 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:26:04,452 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:26:04,452 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:26:04,452 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:26:04,452 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:26:04,453 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:26:04,453 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:26:04,453 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:26:04,454 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:26:04,454 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:26:04,454 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:26:04,454 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:26:04,454 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:26:04,455 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:26:04,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:26:04,455 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:26:04,455 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:26:04,497 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:26:04,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:26:04,511 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:26:04,513 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:26:04,513 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:26:04,514 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/cggmp2005.c.i_3.bpl [2018-12-03 16:26:04,514 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/cggmp2005.c.i_3.bpl' [2018-12-03 16:26:04,553 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:26:04,555 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:26:04,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:26:04,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:26:04,556 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:26:04,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "cggmp2005.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:26:04" (1/1) ... [2018-12-03 16:26:04,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "cggmp2005.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:26:04" (1/1) ... [2018-12-03 16:26:04,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:26:04,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:26:04,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:26:04,593 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:26:04,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "cggmp2005.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:26:04" (1/1) ... [2018-12-03 16:26:04,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "cggmp2005.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:26:04" (1/1) ... [2018-12-03 16:26:04,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "cggmp2005.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:26:04" (1/1) ... [2018-12-03 16:26:04,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "cggmp2005.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:26:04" (1/1) ... [2018-12-03 16:26:04,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "cggmp2005.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:26:04" (1/1) ... [2018-12-03 16:26:04,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "cggmp2005.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:26:04" (1/1) ... [2018-12-03 16:26:04,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "cggmp2005.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:26:04" (1/1) ... [2018-12-03 16:26:04,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:26:04,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:26:04,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:26:04,615 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:26:04,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "cggmp2005.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:26:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:26:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:26:04,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:26:04,841 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:26:04,841 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:26:04,841 INFO L202 PluginConnector]: Adding new model cggmp2005.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:26:04 BoogieIcfgContainer [2018-12-03 16:26:04,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:26:04,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:26:04,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:26:04,847 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:26:04,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "cggmp2005.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:26:04" (1/2) ... [2018-12-03 16:26:04,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df9260b and model type cggmp2005.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:26:04, skipping insertion in model container [2018-12-03 16:26:04,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "cggmp2005.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:26:04" (2/2) ... [2018-12-03 16:26:04,850 INFO L112 eAbstractionObserver]: Analyzing ICFG cggmp2005.c.i_3.bpl [2018-12-03 16:26:04,860 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:26:04,871 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:26:04,888 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:26:04,919 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:26:04,919 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:26:04,920 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:26:04,920 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:26:04,920 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:26:04,920 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:26:04,921 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:26:04,921 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:26:04,936 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 16:26:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:26:04,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:04,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:26:04,953 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:04,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:04,959 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 16:26:04,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:05,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:05,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:05,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:05,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:05,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:05,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:26:05,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:26:05,099 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:26:05,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:26:05,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:26:05,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:26:05,117 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 16:26:05,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:05,171 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 16:26:05,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:26:05,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:26:05,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:05,184 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:26:05,184 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 16:26:05,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:26:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 16:26:05,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 16:26:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 16:26:05,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 16:26:05,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 16:26:05,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:05,224 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 16:26:05,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:26:05,224 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 16:26:05,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:26:05,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:05,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:26:05,225 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:05,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:05,226 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 16:26:05,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:05,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:05,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:05,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:05,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:05,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:05,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:05,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:05,339 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 16:26:05,342 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 16:26:05,391 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:26:05,391 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:26:05,558 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:26:05,560 INFO L272 AbstractInterpreter]: Visited 4 different actions 11 times. Merged at 3 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:26:05,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:05,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:26:05,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:05,606 INFO L192 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 [2018-12-03 16:26:05,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:05,625 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:05,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:05,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:05,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:05,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:05,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2018-12-03 16:26:05,882 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:05,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:26:05,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:26:05,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:26:05,884 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2018-12-03 16:26:05,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:05,905 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 16:26:05,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:26:05,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-03 16:26:05,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:05,907 INFO L225 Difference]: With dead ends: 8 [2018-12-03 16:26:05,907 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 16:26:05,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:26:05,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 16:26:05,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 16:26:05,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:26:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 16:26:05,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 16:26:05,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:05,913 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 16:26:05,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:26:05,914 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 16:26:05,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:26:05,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:05,914 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 16:26:05,915 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:05,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:05,915 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 16:26:05,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:05,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:05,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:05,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:05,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:06,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:06,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:06,064 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:06,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:06,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:06,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:26:06,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:06,078 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:06,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:26:06,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:06,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:06,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:06,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:06,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:06,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2018-12-03 16:26:06,512 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:06,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:26:06,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:26:06,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:26:06,513 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 8 states. [2018-12-03 16:26:06,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:06,557 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 16:26:06,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:26:06,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-03 16:26:06,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:06,558 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:26:06,558 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:26:06,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:26:06,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:26:06,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 16:26:06,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:26:06,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 16:26:06,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 16:26:06,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:06,563 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 16:26:06,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:26:06,563 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 16:26:06,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:26:06,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:06,563 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 16:26:06,564 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:06,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:06,564 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-03 16:26:06,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:06,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:06,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:06,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:06,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:06,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:06,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:06,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:06,651 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:06,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:06,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:06,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:26:06,663 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:06,663 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:06,677 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:06,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:06,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:06,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:06,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:06,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:26:06,907 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:06,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:26:06,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:26:06,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:26:06,909 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 10 states. [2018-12-03 16:26:06,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:06,943 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 16:26:06,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:26:06,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-03 16:26:06,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:06,944 INFO L225 Difference]: With dead ends: 10 [2018-12-03 16:26:06,944 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 16:26:06,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:26:06,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 16:26:06,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 16:26:06,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:26:06,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 16:26:06,948 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 16:26:06,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:06,948 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 16:26:06,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:26:06,949 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 16:26:06,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:26:06,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:06,949 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 16:26:06,950 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:06,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:06,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-03 16:26:06,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:06,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:06,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:06,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:06,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:07,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:07,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:07,106 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:07,107 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:07,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:07,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:07,108 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:26:07,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:07,116 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:07,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:07,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:07,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:07,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:07,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 16:26:07,204 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:07,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:26:07,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:26:07,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:26:07,206 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 16:26:07,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:07,258 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 16:26:07,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:26:07,260 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:26:07,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:07,261 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:26:07,261 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 16:26:07,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:26:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 16:26:07,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 16:26:07,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:26:07,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 16:26:07,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 16:26:07,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:07,265 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 16:26:07,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:26:07,266 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 16:26:07,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:26:07,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:07,266 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 16:26:07,267 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:07,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:07,267 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-03 16:26:07,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:07,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:07,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:07,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:07,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:07,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:26:07,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:26:07,606 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:26:07,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:26:07,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:26:07,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:26:07,608 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2018-12-03 16:26:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:07,699 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 16:26:07,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:26:07,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 16:26:07,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:07,700 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:26:07,700 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:26:07,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:26:07,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:26:07,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:26:07,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:26:07,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:26:07,701 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2018-12-03 16:26:07,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:07,702 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:26:07,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:26:07,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:26:07,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:26:07,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:26:07,855 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-12-03 16:26:07,862 INFO L444 ceAbstractionStarter]: At program point L33(lines 15 33) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~j~4 (+ ULTIMATE.start_main_~i~4 3)) (<= ULTIMATE.start_main_~i~4 5) (<= 8 ULTIMATE.start_main_~j~4)) (and (<= 10 ULTIMATE.start_main_~j~4) (<= ULTIMATE.start_main_~j~4 (+ ULTIMATE.start_main_~i~4 9)) (<= ULTIMATE.start_main_~i~4 1)) (and (<= ULTIMATE.start_main_~j~4 6) (<= 6 ULTIMATE.start_main_~j~4) (<= (+ ULTIMATE.start_main_~j~4 3) ULTIMATE.start_main_~i~4)) (and (<= ULTIMATE.start_main_~i~4 3) (<= ULTIMATE.start_main_~j~4 (+ ULTIMATE.start_main_~i~4 6)) (<= 9 ULTIMATE.start_main_~j~4)) (and (<= 7 ULTIMATE.start_main_~j~4) (<= ULTIMATE.start_main_~i~4 7) (<= ULTIMATE.start_main_~j~4 ULTIMATE.start_main_~i~4))) [2018-12-03 16:26:07,862 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 36) no Hoare annotation was computed. [2018-12-03 16:26:07,862 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 36) no Hoare annotation was computed. [2018-12-03 16:26:07,862 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 36) no Hoare annotation was computed. [2018-12-03 16:26:07,863 INFO L444 ceAbstractionStarter]: At program point L28(lines 28 34) the Hoare annotation is: false [2018-12-03 16:26:07,863 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 35) no Hoare annotation was computed. [2018-12-03 16:26:07,874 INFO L202 PluginConnector]: Adding new model cggmp2005.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:26:07 BoogieIcfgContainer [2018-12-03 16:26:07,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:26:07,875 INFO L168 Benchmark]: Toolchain (without parser) took 3322.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 171.9 MB). Peak memory consumption was 171.9 MB. Max. memory is 7.1 GB. [2018-12-03 16:26:07,877 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.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. [2018-12-03 16:26:07,877 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:26:07,878 INFO L168 Benchmark]: Boogie Preprocessor took 21.54 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:26:07,879 INFO L168 Benchmark]: RCFGBuilder took 227.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 16:26:07,879 INFO L168 Benchmark]: TraceAbstraction took 3032.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 150.7 MB). Peak memory consumption was 150.7 MB. Max. memory is 7.1 GB. [2018-12-03 16:26:07,884 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 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 36.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.54 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 227.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3032.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 150.7 MB). Peak memory consumption was 150.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 35]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (((((main_~j~4 <= main_~i~4 + 3 && main_~i~4 <= 5) && 8 <= main_~j~4) || ((10 <= main_~j~4 && main_~j~4 <= main_~i~4 + 9) && main_~i~4 <= 1)) || ((main_~j~4 <= 6 && 6 <= main_~j~4) && main_~j~4 + 3 <= main_~i~4)) || ((main_~i~4 <= 3 && main_~j~4 <= main_~i~4 + 6) && 9 <= main_~j~4)) || ((7 <= main_~j~4 && main_~i~4 <= 7) && main_~j~4 <= main_~i~4) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 2.9s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 16 SDtfs, 0 SDslu, 16 SDs, 0 SdLazy, 69 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 60 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 17 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 1483 SizeOfPredicates, 9 NumberOfNonLiveVariables, 106 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 15/75 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...