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 -i ../../../trunk/examples/programs/toy/InvariantChecking/showcase/ArrayInitialization01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:31:10,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:31:10,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:31:11,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:31:11,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:31:11,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:31:11,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:31:11,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:31:11,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:31:11,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:31:11,032 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:31:11,033 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:31:11,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:31:11,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:31:11,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:31:11,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:31:11,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:31:11,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:31:11,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:31:11,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:31:11,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:31:11,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:31:11,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:31:11,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:31:11,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:31:11,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:31:11,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:31:11,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:31:11,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:31:11,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:31:11,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:31:11,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:31:11,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:31:11,074 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:31:11,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:31:11,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:31:11,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:31:11,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:31:11,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:31:11,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:31:11,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:31:11,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:31:11,140 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:31:11,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:31:11,147 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:31:11,147 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:31:11,149 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/InvariantChecking/showcase/ArrayInitialization01.bpl [2019-08-05 10:31:11,149 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/InvariantChecking/showcase/ArrayInitialization01.bpl' [2019-08-05 10:31:11,185 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:31:11,187 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:31:11,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:31:11,188 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:31:11,188 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:31:11,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInitialization01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:11" (1/1) ... [2019-08-05 10:31:11,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInitialization01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:11" (1/1) ... [2019-08-05 10:31:11,225 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:31:11,226 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:31:11,226 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:31:11,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:31:11,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:31:11,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:31:11,230 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:31:11,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInitialization01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:11" (1/1) ... [2019-08-05 10:31:11,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInitialization01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:11" (1/1) ... [2019-08-05 10:31:11,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInitialization01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:11" (1/1) ... [2019-08-05 10:31:11,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInitialization01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:11" (1/1) ... [2019-08-05 10:31:11,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInitialization01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:11" (1/1) ... [2019-08-05 10:31:11,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInitialization01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:11" (1/1) ... [2019-08-05 10:31:11,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInitialization01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:11" (1/1) ... [2019-08-05 10:31:11,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:31:11,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:31:11,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:31:11,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:31:11,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInitialization01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:11" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:31:11,327 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:31:11,327 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:31:11,328 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:31:11,600 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:31:11,600 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:31:11,601 INFO L202 PluginConnector]: Adding new model ArrayInitialization01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:31:11 BoogieIcfgContainer [2019-08-05 10:31:11,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:31:11,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:31:11,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:31:11,606 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:31:11,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInitialization01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:11" (1/2) ... [2019-08-05 10:31:11,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e2f930 and model type ArrayInitialization01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:31:11, skipping insertion in model container [2019-08-05 10:31:11,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInitialization01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:31:11" (2/2) ... [2019-08-05 10:31:11,609 INFO L109 eAbstractionObserver]: Analyzing ICFG ArrayInitialization01.bpl [2019-08-05 10:31:11,618 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:31:11,624 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:31:11,638 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:31:11,662 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:31:11,663 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:31:11,663 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:31:11,663 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:31:11,663 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:31:11,663 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:31:11,664 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:31:11,664 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:31:11,664 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:31:11,678 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 10:31:11,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:31:11,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:11,688 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:31:11,691 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONINVARIANTandASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:11,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:11,696 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-08-05 10:31:11,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:11,774 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:31:11,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:11,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:31:11,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:31:11,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:31:11,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:31:11,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:31:11,876 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-08-05 10:31:12,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:12,016 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:31:12,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:31:12,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:31:12,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:12,030 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:31:12,030 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:31:12,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:31:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:31:12,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:31:12,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:31:12,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:31:12,064 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 2 [2019-08-05 10:31:12,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:12,065 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:31:12,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:31:12,065 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:31:12,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:31:12,065 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:12,066 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:31:12,066 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONINVARIANTandASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:12,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:12,067 INFO L82 PathProgramCache]: Analyzing trace with hash 926592, now seen corresponding path program 1 times [2019-08-05 10:31:12,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:12,090 WARN L254 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:31:12,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:12,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:31:12,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:12,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:31:12,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:31:12,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:31:12,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:12,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:12,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:31:12,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:31:12,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:31:12,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:31:12,321 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 4 states. [2019-08-05 10:31:12,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:12,396 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:31:12,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:31:12,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:31:12,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:12,398 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:31:12,398 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:31:12,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:31:12,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:31:12,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 9. [2019-08-05 10:31:12,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:31:12,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:31:12,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2019-08-05 10:31:12,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:12,402 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:31:12,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:31:12,403 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:31:12,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:31:12,403 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:12,403 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1] [2019-08-05 10:31:12,404 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONINVARIANTandASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:12,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:12,404 INFO L82 PathProgramCache]: Analyzing trace with hash 890456061, now seen corresponding path program 2 times [2019-08-05 10:31:12,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:12,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:31:12,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:12,548 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:31:12,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-08-05 10:31:12,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:12,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-08-05 10:31:12,638 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:12,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:12,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2019-08-05 10:31:12,663 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:12,818 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 10:31:12,819 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:31:12,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 45 [2019-08-05 10:31:12,821 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:13,074 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2019-08-05 10:31:13,074 INFO L567 ElimStorePlain]: treesize reduction 27, result has 69.7 percent of original size [2019-08-05 10:31:13,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-08-05 10:31:13,076 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:97, output treesize:62 [2019-08-05 10:31:13,210 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-08-05 10:31:13,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:31:13,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:31:13,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:31:13,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:31:13,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:31:13,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:31:13,214 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2019-08-05 10:31:13,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:13,242 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:31:13,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:31:13,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:31:13,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:13,243 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:31:13,243 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:31:13,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:31:13,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:31:13,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 10:31:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:31:13,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:31:13,247 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 6 [2019-08-05 10:31:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:13,247 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:31:13,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:31:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:31:13,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:31:13,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:13,248 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:31:13,249 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONINVARIANTandASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:13,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:13,249 INFO L82 PathProgramCache]: Analyzing trace with hash 890456130, now seen corresponding path program 1 times [2019-08-05 10:31:13,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:13,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:31:13,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:13,327 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:31:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:31:13,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:31:13,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:31:13,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:31:13,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:31:13,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:31:13,362 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2019-08-05 10:31:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:13,379 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:31:13,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:31:13,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 10:31:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:13,381 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:31:13,381 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:31:13,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-08-05 10:31:13,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:31:13,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:31:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:31:13,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:31:13,382 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-08-05 10:31:13,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:13,382 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:31:13,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:31:13,383 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:31:13,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:31:13,387 INFO L202 PluginConnector]: Adding new model ArrayInitialization01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:31:13 BoogieIcfgContainer [2019-08-05 10:31:13,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:31:13,389 INFO L168 Benchmark]: Toolchain (without parser) took 2202.20 ms. Allocated memory was 141.0 MB in the beginning and 176.2 MB in the end (delta: 35.1 MB). Free memory was 110.6 MB in the beginning and 113.0 MB in the end (delta: -2.4 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:31:13,390 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory is still 111.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:31:13,391 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.36 ms. Allocated memory is still 141.0 MB. Free memory was 110.2 MB in the beginning and 108.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:31:13,392 INFO L168 Benchmark]: Boogie Preprocessor took 25.93 ms. Allocated memory is still 141.0 MB. Free memory was 108.5 MB in the beginning and 107.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:31:13,393 INFO L168 Benchmark]: RCFGBuilder took 346.15 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 97.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:31:13,394 INFO L168 Benchmark]: TraceAbstraction took 1784.67 ms. Allocated memory was 141.0 MB in the beginning and 176.2 MB in the end (delta: 35.1 MB). Free memory was 97.3 MB in the beginning and 113.0 MB in the end (delta: -15.7 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:31:13,398 INFO L335 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.22 ms. Allocated memory is still 141.0 MB. Free memory is still 111.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.36 ms. Allocated memory is still 141.0 MB. Free memory was 110.2 MB in the beginning and 108.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.93 ms. Allocated memory is still 141.0 MB. Free memory was 108.5 MB in the beginning and 107.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 346.15 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 97.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1784.67 ms. Allocated memory was 141.0 MB in the beginning and 176.2 MB in the end (delta: 35.1 MB). Free memory was 97.3 MB in the beginning and 113.0 MB in the end (delta: -15.7 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: loop invariant is valid and assertion always holds For all program executions holds that loop invariant is valid and assertion always holds at this location - PositiveResult [Line: 25]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. SAFE Result, 1.7s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9 SDtfs, 10 SDslu, 0 SDs, 0 SdLazy, 40 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 730 SizeOfPredicates, 1 NumberOfNonLiveVariables, 63 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 6/7 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...