java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-08 13:51:48,983 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 13:51:48,986 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 13:51:48,998 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 13:51:48,999 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 13:51:49,000 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 13:51:49,002 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 13:51:49,004 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 13:51:49,005 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 13:51:49,006 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 13:51:49,007 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 13:51:49,008 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 13:51:49,009 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 13:51:49,010 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 13:51:49,011 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 13:51:49,012 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 13:51:49,013 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 13:51:49,015 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 13:51:49,017 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 13:51:49,019 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 13:51:49,020 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 13:51:49,022 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 13:51:49,024 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 13:51:49,024 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 13:51:49,024 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 13:51:49,025 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 13:51:49,026 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 13:51:49,027 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 13:51:49,028 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 13:51:49,029 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 13:51:49,030 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 13:51:49,030 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 13:51:49,031 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 13:51:49,031 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 13:51:49,032 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 13:51:49,033 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 13:51:49,033 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-08 13:51:49,047 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 13:51:49,047 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 13:51:49,048 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 13:51:49,048 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 13:51:49,048 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 13:51:49,048 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 13:51:49,049 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 13:51:49,049 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 13:51:49,049 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-08 13:51:49,049 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 13:51:49,049 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-08 13:51:49,050 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-08 13:51:49,050 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 13:51:49,050 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 13:51:49,051 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 13:51:49,051 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 13:51:49,051 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 13:51:49,051 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 13:51:49,052 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 13:51:49,052 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 13:51:49,052 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 13:51:49,052 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 13:51:49,052 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 13:51:49,053 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 13:51:49,053 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 13:51:49,053 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 13:51:49,053 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 13:51:49,053 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 13:51:49,053 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 13:51:49,054 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 13:51:49,054 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 13:51:49,054 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 13:51:49,054 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 13:51:49,055 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 13:51:49,055 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 13:51:49,055 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 13:51:49,055 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 13:51:49,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 13:51:49,056 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 13:51:49,056 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 13:51:49,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 13:51:49,101 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 13:51:49,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 13:51:49,107 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 13:51:49,108 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 13:51:49,109 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl [2019-01-08 13:51:49,110 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl' [2019-01-08 13:51:49,203 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 13:51:49,205 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 13:51:49,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 13:51:49,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 13:51:49,206 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 13:51:49,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,247 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 13:51:49,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 13:51:49,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 13:51:49,262 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 13:51:49,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 13:51:49,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 13:51:49,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 13:51:49,321 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 13:51:49,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 13:51:49,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 13:51:49,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 13:51:49,789 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 13:51:49,790 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-08 13:51:49,791 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 01:51:49 BoogieIcfgContainer [2019-01-08 13:51:49,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 13:51:49,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 13:51:49,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 13:51:49,810 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 13:51:49,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/2) ... [2019-01-08 13:51:49,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@529ce84a and model type eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 01:51:49, skipping insertion in model container [2019-01-08 13:51:49,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 01:51:49" (2/2) ... [2019-01-08 13:51:49,819 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01.i_6.bpl [2019-01-08 13:51:49,845 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 13:51:49,866 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-08 13:51:49,906 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-08 13:51:49,948 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 13:51:49,948 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 13:51:49,948 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 13:51:49,948 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 13:51:49,949 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 13:51:49,949 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 13:51:49,949 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 13:51:49,949 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 13:51:49,966 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-08 13:51:49,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 13:51:49,976 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:49,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 13:51:49,983 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:49,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:49,991 INFO L82 PathProgramCache]: Analyzing trace with hash 28790350, now seen corresponding path program 1 times [2019-01-08 13:51:49,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:50,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:50,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:50,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:50,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:50,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 13:51:50,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-08 13:51:50,247 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 13:51:50,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 13:51:50,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 13:51:50,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-08 13:51:50,269 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2019-01-08 13:51:50,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:50,425 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2019-01-08 13:51:50,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 13:51:50,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-08 13:51:50,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:50,441 INFO L225 Difference]: With dead ends: 15 [2019-01-08 13:51:50,441 INFO L226 Difference]: Without dead ends: 11 [2019-01-08 13:51:50,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-08 13:51:50,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-08 13:51:50,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2019-01-08 13:51:50,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-08 13:51:50,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-01-08 13:51:50,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 5 [2019-01-08 13:51:50,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:50,487 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-08 13:51:50,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 13:51:50,487 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2019-01-08 13:51:50,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 13:51:50,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:50,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 13:51:50,488 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:50,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:50,489 INFO L82 PathProgramCache]: Analyzing trace with hash 892498710, now seen corresponding path program 1 times [2019-01-08 13:51:50,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:50,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:50,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:50,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:50,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:50,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:50,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:50,818 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:50,819 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 13:51:50,821 INFO L207 CegarAbsIntRunner]: [0], [5], [12], [20], [22], [30] [2019-01-08 13:51:50,865 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 13:51:50,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 13:51:50,954 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-08 13:51:50,957 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 131 root evaluator evaluations with a maximum evaluation depth of 3. Performed 131 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 0 variables. [2019-01-08 13:51:50,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:50,963 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-08 13:51:50,991 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 40% of their original sizes. [2019-01-08 13:51:50,992 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-08 13:51:50,999 INFO L420 sIntCurrentIteration]: We unified 5 AI predicates to 5 [2019-01-08 13:51:50,999 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-08 13:51:51,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-08 13:51:51,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-01-08 13:51:51,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 13:51:51,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 13:51:51,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 13:51:51,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 13:51:51,003 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 3 states. [2019-01-08 13:51:51,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:51,157 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2019-01-08 13:51:51,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 13:51:51,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-08 13:51:51,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:51,158 INFO L225 Difference]: With dead ends: 15 [2019-01-08 13:51:51,158 INFO L226 Difference]: Without dead ends: 9 [2019-01-08 13:51:51,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 13:51:51,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-08 13:51:51,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-08 13:51:51,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-08 13:51:51,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-01-08 13:51:51,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 6 [2019-01-08 13:51:51,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:51,164 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-08 13:51:51,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 13:51:51,164 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-01-08 13:51:51,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 13:51:51,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:51,165 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 13:51:51,166 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:51,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:51,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1948209421, now seen corresponding path program 1 times [2019-01-08 13:51:51,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:51,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:51,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:51,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:51,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:51,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 13:51:51,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 13:51:51,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-08 13:51:51,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 13:51:51,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 13:51:51,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 13:51:51,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 13:51:51,270 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 3 states. [2019-01-08 13:51:51,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:51,272 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-01-08 13:51:51,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 13:51:51,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-08 13:51:51,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:51,273 INFO L225 Difference]: With dead ends: 9 [2019-01-08 13:51:51,273 INFO L226 Difference]: Without dead ends: 0 [2019-01-08 13:51:51,275 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 [2019-01-08 13:51:51,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-08 13:51:51,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-08 13:51:51,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-08 13:51:51,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-08 13:51:51,277 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-01-08 13:51:51,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:51,277 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-08 13:51:51,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 13:51:51,278 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-08 13:51:51,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-08 13:51:51,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-08 13:51:51,462 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2019-01-08 13:51:51,514 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 176) no Hoare annotation was computed. [2019-01-08 13:51:51,514 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 175) no Hoare annotation was computed. [2019-01-08 13:51:51,515 INFO L444 ceAbstractionStarter]: At program point L155(lines 155 174) the Hoare annotation is: false [2019-01-08 13:51:51,515 INFO L444 ceAbstractionStarter]: At program point L114(lines 97 114) the Hoare annotation is: (and (= ULTIMATE.start_main_~edgecount~4 20) (= ULTIMATE.start_main_~nodecount~4 5) (<= ULTIMATE.start_main_~i~4 ULTIMATE.start_main_~source~4) (<= ULTIMATE.start_main_~source~4 ULTIMATE.start_main_~i~4) (= ULTIMATE.start_main_~i~4 0)) [2019-01-08 13:51:51,515 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 176) no Hoare annotation was computed. [2019-01-08 13:51:51,515 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 176) no Hoare annotation was computed. [2019-01-08 13:51:51,515 INFO L444 ceAbstractionStarter]: At program point L144(lines 123 145) the Hoare annotation is: false [2019-01-08 13:51:51,516 INFO L444 ceAbstractionStarter]: At program point L173(lines 127 173) the Hoare annotation is: false [2019-01-08 13:51:51,516 INFO L444 ceAbstractionStarter]: At program point L163(lines 106 163) the Hoare annotation is: false [2019-01-08 13:51:51,523 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 01:51:51 BoogieIcfgContainer [2019-01-08 13:51:51,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-08 13:51:51,525 INFO L168 Benchmark]: Toolchain (without parser) took 2320.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2019-01-08 13:51:51,526 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 13:51:51,527 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 13:51:51,528 INFO L168 Benchmark]: Boogie Preprocessor took 58.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 13:51:51,528 INFO L168 Benchmark]: RCFGBuilder took 477.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2019-01-08 13:51:51,529 INFO L168 Benchmark]: TraceAbstraction took 1724.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2019-01-08 13:51:51,534 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.23 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 55.35 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 58.73 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 477.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1724.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 123]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((main_~edgecount~4 == 20 && main_~nodecount~4 == 5) && main_~i~4 <= main_~source~4) && main_~source~4 <= main_~i~4) && main_~i~4 == 0 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. SAFE Result, 1.5s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 12 SDtfs, 13 SDslu, 1 SDs, 0 SdLazy, 14 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.0 AbsIntAvgWeakeningVarsNumRemoved, 0.4 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 6 NumberOfFragments, 20 HoareAnnotationTreeSize, 5 FomulaSimplifications, 8 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 223 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...