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/abstractInterpretation/regression/open/comp/non-unary-affine-expressions.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:09:27,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:09:27,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:09:27,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:09:27,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:09:27,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:09:27,336 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:09:27,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:09:27,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:09:27,340 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:09:27,341 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:09:27,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:09:27,342 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:09:27,343 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:09:27,344 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:09:27,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:09:27,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:09:27,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:09:27,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:09:27,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:09:27,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:09:27,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:09:27,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:09:27,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:09:27,359 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:09:27,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:09:27,360 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:09:27,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:09:27,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:09:27,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:09:27,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:09:27,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:09:27,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:09:27,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:09:27,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:09:27,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:09:27,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:09:27,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:09:27,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:09:27,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:09:27,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:09:27,401 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:09:27,414 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:09:27,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:09:27,419 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:09:27,420 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:09:27,421 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/open/comp/non-unary-affine-expressions.bpl [2019-08-05 11:09:27,421 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/open/comp/non-unary-affine-expressions.bpl' [2019-08-05 11:09:27,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:09:27,460 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:09:27,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:09:27,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:09:27,462 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:09:27,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "non-unary-affine-expressions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (1/1) ... [2019-08-05 11:09:27,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "non-unary-affine-expressions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (1/1) ... [2019-08-05 11:09:27,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:09:27,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:09:27,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:09:27,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:09:27,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "non-unary-affine-expressions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (1/1) ... [2019-08-05 11:09:27,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "non-unary-affine-expressions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (1/1) ... [2019-08-05 11:09:27,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "non-unary-affine-expressions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (1/1) ... [2019-08-05 11:09:27,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "non-unary-affine-expressions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (1/1) ... [2019-08-05 11:09:27,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "non-unary-affine-expressions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (1/1) ... [2019-08-05 11:09:27,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "non-unary-affine-expressions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (1/1) ... [2019-08-05 11:09:27,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "non-unary-affine-expressions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (1/1) ... [2019-08-05 11:09:27,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:09:27,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:09:27,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:09:27,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:09:27,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "non-unary-affine-expressions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (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 11:09:27,611 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:09:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:09:27,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:09:28,182 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:09:28,182 INFO L283 CfgBuilder]: Removed 8 assume(true) statements. [2019-08-05 11:09:28,184 INFO L202 PluginConnector]: Adding new model non-unary-affine-expressions.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:09:28 BoogieIcfgContainer [2019-08-05 11:09:28,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:09:28,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:09:28,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:09:28,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:09:28,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "non-unary-affine-expressions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:27" (1/2) ... [2019-08-05 11:09:28,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a610831 and model type non-unary-affine-expressions.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:09:28, skipping insertion in model container [2019-08-05 11:09:28,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "non-unary-affine-expressions.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:09:28" (2/2) ... [2019-08-05 11:09:28,206 INFO L109 eAbstractionObserver]: Analyzing ICFG non-unary-affine-expressions.bpl [2019-08-05 11:09:28,217 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:09:28,226 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-08-05 11:09:28,245 INFO L252 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-08-05 11:09:28,274 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:09:28,275 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:09:28,275 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:09:28,275 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:09:28,275 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:09:28,275 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:09:28,276 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:09:28,276 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:09:28,276 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:09:28,290 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-08-05 11:09:28,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 11:09:28,298 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:28,299 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 11:09:28,301 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:28,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:28,307 INFO L82 PathProgramCache]: Analyzing trace with hash 962, now seen corresponding path program 1 times [2019-08-05 11:09:28,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:28,387 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:09:28,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:28,429 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 11:09:28,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:09:28,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:09:28,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:09:28,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:09:28,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:09:28,449 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-08-05 11:09:28,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:28,479 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2019-08-05 11:09:28,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:09:28,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 11:09:28,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:28,492 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:09:28,492 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:09:28,494 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 11:09:28,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:09:28,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:09:28,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:09:28,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2019-08-05 11:09:28,529 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 2 [2019-08-05 11:09:28,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:28,530 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2019-08-05 11:09:28,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:09:28,530 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2019-08-05 11:09:28,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:09:28,531 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:28,531 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:09:28,532 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:28,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:28,533 INFO L82 PathProgramCache]: Analyzing trace with hash 926256, now seen corresponding path program 1 times [2019-08-05 11:09:28,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:28,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:09:28,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:28,582 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 11:09:28,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:09:28,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:09:28,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:09:28,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:09:28,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:09:28,585 INFO L87 Difference]: Start difference. First operand 15 states and 14 transitions. Second operand 3 states. [2019-08-05 11:09:28,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:28,601 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2019-08-05 11:09:28,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:09:28,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 11:09:28,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:28,604 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:09:28,605 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:09:28,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 11:09:28,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:09:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:09:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:09:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 12 transitions. [2019-08-05 11:09:28,608 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 12 transitions. Word has length 4 [2019-08-05 11:09:28,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:28,609 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 12 transitions. [2019-08-05 11:09:28,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:09:28,609 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2019-08-05 11:09:28,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:09:28,610 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:28,610 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:09:28,611 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:28,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:28,614 INFO L82 PathProgramCache]: Analyzing trace with hash 890133827, now seen corresponding path program 1 times [2019-08-05 11:09:28,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:28,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:09:28,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:28,652 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 11:09:28,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:09:28,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:09:28,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:09:28,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:09:28,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:09:28,655 INFO L87 Difference]: Start difference. First operand 13 states and 12 transitions. Second operand 3 states. [2019-08-05 11:09:28,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:28,696 INFO L93 Difference]: Finished difference Result 11 states and 10 transitions. [2019-08-05 11:09:28,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:09:28,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-08-05 11:09:28,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:28,697 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:09:28,697 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:09:28,698 INFO L628 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-08-05 11:09:28,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:09:28,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:09:28,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:09:28,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 10 transitions. [2019-08-05 11:09:28,701 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 10 transitions. Word has length 6 [2019-08-05 11:09:28,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:28,701 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 10 transitions. [2019-08-05 11:09:28,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:09:28,702 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 10 transitions. [2019-08-05 11:09:28,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:09:28,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:28,703 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:28,703 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:28,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:28,704 INFO L82 PathProgramCache]: Analyzing trace with hash 720117598, now seen corresponding path program 1 times [2019-08-05 11:09:28,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:28,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:09:28,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:28,751 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 11:09:28,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:09:28,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:09:28,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:09:28,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:09:28,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:09:28,753 INFO L87 Difference]: Start difference. First operand 11 states and 10 transitions. Second operand 3 states. [2019-08-05 11:09:28,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:28,767 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2019-08-05 11:09:28,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:09:28,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 11:09:28,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:28,768 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:09:28,769 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:09:28,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 11:09:28,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:09:28,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:09:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:09:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:09:28,770 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2019-08-05 11:09:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:28,771 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:09:28,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:09:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:09:28,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:09:28,777 INFO L202 PluginConnector]: Adding new model non-unary-affine-expressions.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:09:28 BoogieIcfgContainer [2019-08-05 11:09:28,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:09:28,780 INFO L168 Benchmark]: Toolchain (without parser) took 1319.17 ms. Allocated memory is still 133.7 MB. Free memory was 111.2 MB in the beginning and 66.1 MB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:28,782 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 133.7 MB. Free memory was 112.4 MB in the beginning and 112.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:09:28,783 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.31 ms. Allocated memory is still 133.7 MB. Free memory was 111.2 MB in the beginning and 108.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:28,784 INFO L168 Benchmark]: Boogie Preprocessor took 20.78 ms. Allocated memory is still 133.7 MB. Free memory was 108.8 MB in the beginning and 107.9 MB in the end (delta: 901.0 kB). Peak memory consumption was 901.0 kB. Max. memory is 7.1 GB. [2019-08-05 11:09:28,785 INFO L168 Benchmark]: RCFGBuilder took 643.87 ms. Allocated memory is still 133.7 MB. Free memory was 107.7 MB in the beginning and 95.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:28,786 INFO L168 Benchmark]: TraceAbstraction took 592.16 ms. Allocated memory is still 133.7 MB. Free memory was 95.4 MB in the beginning and 66.1 MB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:28,790 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.27 ms. Allocated memory is still 133.7 MB. Free memory was 112.4 MB in the beginning and 112.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.31 ms. Allocated memory is still 133.7 MB. Free memory was 111.2 MB in the beginning and 108.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.78 ms. Allocated memory is still 133.7 MB. Free memory was 108.8 MB in the beginning and 107.9 MB in the end (delta: 901.0 kB). Peak memory consumption was 901.0 kB. Max. memory is 7.1 GB. * RCFGBuilder took 643.87 ms. Allocated memory is still 133.7 MB. Free memory was 107.7 MB in the beginning and 95.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 592.16 ms. Allocated memory is still 133.7 MB. Free memory was 95.4 MB in the beginning and 66.1 MB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 24]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 31]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 32]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 15]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 16]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 23]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 8 error locations. SAFE Result, 0.5s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 38 SDtfs, 29 SDslu, 12 SDs, 0 SdLazy, 7 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 217 SizeOfPredicates, 0 NumberOfNonLiveVariables, 36 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...