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/toy/tooDifficultLoopInvariant/Luxembourg-WithArrays.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-299a4a8 [2018-12-04 12:00:38,880 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-04 12:00:38,882 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-04 12:00:38,900 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-04 12:00:38,900 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-04 12:00:38,902 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-04 12:00:38,903 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-04 12:00:38,905 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-04 12:00:38,908 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-04 12:00:38,909 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-04 12:00:38,911 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-04 12:00:38,911 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-04 12:00:38,913 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-04 12:00:38,914 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-04 12:00:38,923 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-04 12:00:38,924 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-04 12:00:38,927 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-04 12:00:38,929 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-04 12:00:38,931 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-04 12:00:38,934 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-04 12:00:38,935 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-04 12:00:38,937 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-04 12:00:38,941 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-04 12:00:38,941 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-04 12:00:38,941 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-04 12:00:38,942 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-04 12:00:38,944 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-04 12:00:38,946 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-04 12:00:38,947 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-04 12:00:38,950 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-04 12:00:38,950 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-04 12:00:38,951 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-04 12:00:38,952 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-04 12:00:38,952 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-04 12:00:38,953 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-04 12:00:38,954 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-04 12:00:38,954 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 [2018-12-04 12:00:38,967 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-04 12:00:38,968 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-04 12:00:38,968 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-04 12:00:38,969 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-04 12:00:38,969 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-04 12:00:38,969 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-04 12:00:38,969 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-04 12:00:38,969 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-04 12:00:38,970 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-04 12:00:38,970 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-04 12:00:38,970 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-04 12:00:38,970 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-04 12:00:38,970 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-04 12:00:38,970 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-04 12:00:38,971 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-04 12:00:38,971 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-04 12:00:38,971 INFO L133 SettingsManager]: * Use SBE=true [2018-12-04 12:00:38,972 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-04 12:00:38,972 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-04 12:00:38,972 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-04 12:00:38,972 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-04 12:00:38,972 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-04 12:00:38,973 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-04 12:00:38,973 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-04 12:00:38,973 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-04 12:00:38,973 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-04 12:00:38,973 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-04 12:00:38,973 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-04 12:00:38,974 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-04 12:00:38,974 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-04 12:00:38,974 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-04 12:00:38,974 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-04 12:00:38,974 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-04 12:00:38,975 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-04 12:00:38,975 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-04 12:00:38,975 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-04 12:00:38,975 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-04 12:00:38,975 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-04 12:00:38,976 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-04 12:00:38,976 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-04 12:00:39,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-04 12:00:39,043 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-04 12:00:39,050 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-04 12:00:39,051 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-04 12:00:39,052 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-04 12:00:39,053 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-WithArrays.bpl [2018-12-04 12:00:39,053 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-WithArrays.bpl' [2018-12-04 12:00:39,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-04 12:00:39,098 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-04 12:00:39,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-04 12:00:39,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-04 12:00:39,101 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-04 12:00:39,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:39" (1/1) ... [2018-12-04 12:00:39,129 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:39" (1/1) ... [2018-12-04 12:00:39,138 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-04 12:00:39,138 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-04 12:00:39,138 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-04 12:00:39,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-04 12:00:39,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-04 12:00:39,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-04 12:00:39,144 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-04 12:00:39,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:39" (1/1) ... [2018-12-04 12:00:39,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:39" (1/1) ... [2018-12-04 12:00:39,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:39" (1/1) ... [2018-12-04 12:00:39,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:39" (1/1) ... [2018-12-04 12:00:39,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:39" (1/1) ... [2018-12-04 12:00:39,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:39" (1/1) ... [2018-12-04 12:00:39,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:39" (1/1) ... [2018-12-04 12:00:39,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-04 12:00:39,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-04 12:00:39,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-04 12:00:39,168 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-04 12:00:39,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:39" (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-04 12:00:39,233 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-04 12:00:39,233 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-04 12:00:39,234 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-04 12:00:39,483 INFO L272 CfgBuilder]: Using library mode [2018-12-04 12:00:39,483 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-04 12:00:39,483 INFO L202 PluginConnector]: Adding new model Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 12:00:39 BoogieIcfgContainer [2018-12-04 12:00:39,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-04 12:00:39,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-04 12:00:39,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-04 12:00:39,488 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-04 12:00:39,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:39" (1/2) ... [2018-12-04 12:00:39,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e348ac1 and model type Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 12:00:39, skipping insertion in model container [2018-12-04 12:00:39,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 12:00:39" (2/2) ... [2018-12-04 12:00:39,492 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg-WithArrays.bpl [2018-12-04 12:00:39,503 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-04 12:00:39,514 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-04 12:00:39,533 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-04 12:00:39,575 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-04 12:00:39,575 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-04 12:00:39,576 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-04 12:00:39,576 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-04 12:00:39,576 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-04 12:00:39,576 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-04 12:00:39,576 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-04 12:00:39,577 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-04 12:00:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-04 12:00:39,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-04 12:00:39,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:39,602 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-04 12:00:39,604 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:39,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:39,611 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-12-04 12:00:39,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:39,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:39,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:39,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:39,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:40,043 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-12-04 12:00:40,047 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-04 12:00:40,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 12:00:40,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-04 12:00:40,050 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 12:00:40,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-04 12:00:40,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-04 12:00:40,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 12:00:40,070 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-04 12:00:40,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:40,141 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-12-04 12:00:40,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-04 12:00:40,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-04 12:00:40,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:40,155 INFO L225 Difference]: With dead ends: 13 [2018-12-04 12:00:40,155 INFO L226 Difference]: Without dead ends: 5 [2018-12-04 12:00:40,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 12:00:40,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-04 12:00:40,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-04 12:00:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-04 12:00:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-04 12:00:40,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-04 12:00:40,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:40,192 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-04 12:00:40,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-04 12:00:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-04 12:00:40,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-04 12:00:40,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:40,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-04 12:00:40,194 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:40,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:40,194 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-12-04 12:00:40,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:40,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:40,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:40,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:40,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:40,467 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-12-04 12:00:40,560 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-04 12:00:40,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:40,561 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:40,562 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-04 12:00:40,564 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [9] [2018-12-04 12:00:40,615 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-04 12:00:40,615 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-04 12:00:41,792 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-04 12:00:41,793 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-04 12:00:41,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:41,844 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-04 12:00:42,620 INFO L219 lantSequenceWeakener]: Could never weaken! [2018-12-04 12:00:42,620 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-04 12:00:42,681 INFO L418 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2018-12-04 12:00:42,681 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-04 12:00:42,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-04 12:00:42,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2018-12-04 12:00:42,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 12:00:42,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-04 12:00:42,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-04 12:00:42,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 12:00:42,685 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 3 states. [2018-12-04 12:00:43,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:43,321 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2018-12-04 12:00:43,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-04 12:00:43,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-04 12:00:43,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:43,322 INFO L225 Difference]: With dead ends: 5 [2018-12-04 12:00:43,323 INFO L226 Difference]: Without dead ends: 0 [2018-12-04 12:00:43,324 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 12:00:43,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-04 12:00:43,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-04 12:00:43,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-04 12:00:43,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-04 12:00:43,325 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2018-12-04 12:00:43,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:43,325 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-04 12:00:43,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-04 12:00:43,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-04 12:00:43,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-04 12:00:43,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-04 12:00:43,372 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 11 30) no Hoare annotation was computed. [2018-12-04 12:00:43,373 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-12-04 12:00:43,373 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 11 30) no Hoare annotation was computed. [2018-12-04 12:00:43,373 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 30) no Hoare annotation was computed. [2018-12-04 12:00:43,373 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 27) no Hoare annotation was computed. [2018-12-04 12:00:43,374 INFO L444 ceAbstractionStarter]: At program point L21-1(lines 21 28) the Hoare annotation is: (exists ((v_v_2_1 Int) (v_b_2_1 Int) (v_b_3_1 Int) (v_v_5_1 Int) (v_b_0_1 Int) (v_b_1_1 Int)) (let ((.cse2 (+ main_x 1)) (.cse4 (+ v_v_2_1 v_v_5_1)) (.cse7 (+ v_v_2_1 1000)) (.cse0 (+ v_b_0_1 1)) (.cse6 (* 2 v_v_5_1)) (.cse1 (* 2 v_v_2_1)) (.cse5 (+ v_b_2_1 1)) (.cse3 (+ main_y 1))) (and (<= .cse0 v_b_1_1) (<= .cse1 0) (<= v_b_1_1 .cse2) (<= .cse3 v_b_3_1) (<= (+ v_b_3_1 1) v_b_1_1) (<= 1000 .cse4) (<= (+ v_b_2_1 2) v_b_1_1) (<= v_b_3_1 .cse3) (<= v_b_3_1 .cse5) (<= .cse6 2000) (<= .cse7 v_v_5_1) (<= v_b_3_1 main_x) (<= main_y v_b_2_1) (<= .cse2 v_b_1_1) (<= (+ main_y 2) v_b_1_1) (<= .cse5 main_x) (<= .cse3 v_b_0_1) (<= v_b_3_1 v_b_0_1) (<= v_b_0_1 main_x) (<= .cse4 1000) (<= v_v_5_1 .cse7) (<= v_b_1_1 .cse0) (forall ((v_idx_34 Int) (v_idx_35 Int) (v_idx_32 Int) (v_idx_33 Int) (v_idx_31 Int)) (or (< v_idx_32 v_b_2_1) (<= v_b_3_1 v_idx_32) (< v_idx_35 v_b_1_1) (<= v_b_0_1 v_idx_33) (< v_idx_33 v_b_3_1) (<= v_b_2_1 v_idx_31) (< v_idx_34 v_b_0_1) (let ((.cse11 (select main_a v_idx_32)) (.cse13 (select main_a v_idx_34))) (let ((.cse12 (+ .cse13 1000)) (.cse10 (* 2 .cse13)) (.cse8 (+ .cse13 .cse11)) (.cse9 (* 2 .cse11))) (and (<= .cse8 1000) (<= .cse9 2000) (<= 0 .cse10) (<= .cse11 .cse12) (<= .cse12 .cse11) (<= .cse10 0) (<= 1000 .cse8) (<= 2000 .cse9)))) (<= v_b_1_1 v_idx_34))) (<= .cse5 v_b_0_1) (<= 2000 .cse6) (<= v_b_2_1 main_y) (<= 0 .cse1) (<= .cse5 v_b_3_1) (<= main_x v_b_0_1) (<= .cse3 main_x)))) [2018-12-04 12:00:43,403 INFO L202 PluginConnector]: Adding new model Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.12 12:00:43 BoogieIcfgContainer [2018-12-04 12:00:43,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-04 12:00:43,407 INFO L168 Benchmark]: Toolchain (without parser) took 4310.09 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: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. [2018-12-04 12:00:43,409 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-04 12:00:43,412 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-04 12:00:43,412 INFO L168 Benchmark]: Boogie Preprocessor took 24.64 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-04 12:00:43,413 INFO L168 Benchmark]: RCFGBuilder took 315.47 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-04 12:00:43,414 INFO L168 Benchmark]: TraceAbstraction took 3922.13 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: 169.1 MB). Peak memory consumption was 169.1 MB. Max. memory is 7.1 GB. [2018-12-04 12:00:43,419 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 43.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.64 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 315.47 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 3922.13 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: 169.1 MB). Peak memory consumption was 169.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: 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: 21]: Loop Invariant Derived loop invariant: (exists v_v_2_1 : int, v_b_2_1 : int, v_b_3_1 : int, v_v_5_1 : int, v_b_0_1 : int, v_b_1_1 : int :: ((((((((((((((((((((((((((((v_b_0_1 + 1 <= v_b_1_1 && 2 * v_v_2_1 <= 0) && v_b_1_1 <= x + 1) && y + 1 <= v_b_3_1) && v_b_3_1 + 1 <= v_b_1_1) && 1000 <= v_v_2_1 + v_v_5_1) && v_b_2_1 + 2 <= v_b_1_1) && v_b_3_1 <= y + 1) && v_b_3_1 <= v_b_2_1 + 1) && 2 * v_v_5_1 <= 2000) && v_v_2_1 + 1000 <= v_v_5_1) && v_b_3_1 <= x) && y <= v_b_2_1) && x + 1 <= v_b_1_1) && y + 2 <= v_b_1_1) && v_b_2_1 + 1 <= x) && y + 1 <= v_b_0_1) && v_b_3_1 <= v_b_0_1) && v_b_0_1 <= x) && v_v_2_1 + v_v_5_1 <= 1000) && v_v_5_1 <= v_v_2_1 + 1000) && v_b_1_1 <= v_b_0_1 + 1) && (forall v_idx_34 : int, v_idx_35 : int, v_idx_32 : int, v_idx_33 : int, v_idx_31 : int :: (((((((v_idx_32 < v_b_2_1 || v_b_3_1 <= v_idx_32) || v_idx_35 < v_b_1_1) || v_b_0_1 <= v_idx_33) || v_idx_33 < v_b_3_1) || v_b_2_1 <= v_idx_31) || v_idx_34 < v_b_0_1) || (((((((a[v_idx_34] + a[v_idx_32] <= 1000 && 2 * a[v_idx_32] <= 2000) && 0 <= 2 * a[v_idx_34]) && a[v_idx_32] <= a[v_idx_34] + 1000) && a[v_idx_34] + 1000 <= a[v_idx_32]) && 2 * a[v_idx_34] <= 0) && 1000 <= a[v_idx_34] + a[v_idx_32]) && 2000 <= 2 * a[v_idx_32])) || v_b_1_1 <= v_idx_34)) && v_b_2_1 + 1 <= v_b_0_1) && 2000 <= 2 * v_v_5_1) && v_b_2_1 <= y) && 0 <= 2 * v_v_2_1) && v_b_2_1 + 1 <= v_b_3_1) && x <= v_b_0_1) && y + 1 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 3.8s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 7 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.0 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 226 HoareAnnotationTreeSize, 1 FomulaSimplifications, 237 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 88 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...