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/20170304-DifficultPathPrograms/sum03.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:38:39,541 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:38:39,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:38:39,560 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:38:39,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:38:39,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:38:39,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:38:39,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:38:39,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:38:39,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:38:39,571 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:38:39,571 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:38:39,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:38:39,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:38:39,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:38:39,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:38:39,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:38:39,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:38:39,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:38:39,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:38:39,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:38:39,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:38:39,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:38:39,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:38:39,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:38:39,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:38:39,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:38:39,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:38:39,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:38:39,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:38:39,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:38:39,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:38:39,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:38:39,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:38:39,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:38:39,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:38:39,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:38:39,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:38:39,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:38:39,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:38:39,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:38:39,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:38:39,636 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:38:39,640 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:38:39,641 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:38:39,642 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:38:39,643 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum03.i_3.bpl [2019-08-04 21:38:39,643 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum03.i_3.bpl' [2019-08-04 21:38:39,680 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:38:39,682 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:38:39,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:39,683 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:38:39,683 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:38:39,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (1/1) ... [2019-08-04 21:38:39,709 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (1/1) ... [2019-08-04 21:38:39,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:39,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:38:39,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:38:39,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:38:39,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (1/1) ... [2019-08-04 21:38:39,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (1/1) ... [2019-08-04 21:38:39,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (1/1) ... [2019-08-04 21:38:39,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (1/1) ... [2019-08-04 21:38:39,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (1/1) ... [2019-08-04 21:38:39,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (1/1) ... [2019-08-04 21:38:39,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (1/1) ... [2019-08-04 21:38:39,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:38:39,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:38:39,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:38:39,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:38:39,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory: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-04 21:38:39,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:38:39,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:38:40,100 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:38:40,101 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-04 21:38:40,102 INFO L202 PluginConnector]: Adding new model sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:40 BoogieIcfgContainer [2019-08-04 21:38:40,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:38:40,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:38:40,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:38:40,107 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:38:40,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (1/2) ... [2019-08-04 21:38:40,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd4bc05 and model type sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:38:40, skipping insertion in model container [2019-08-04 21:38:40,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:40" (2/2) ... [2019-08-04 21:38:40,110 INFO L109 eAbstractionObserver]: Analyzing ICFG sum03.i_3.bpl [2019-08-04 21:38:40,131 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:38:40,147 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:38:40,187 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:38:40,230 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:38:40,231 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:38:40,231 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:38:40,232 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:38:40,232 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:38:40,232 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:38:40,233 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:38:40,234 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:38:40,235 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:38:40,249 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-04 21:38:40,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:38:40,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:40,258 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:38:40,261 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:40,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:40,267 INFO L82 PathProgramCache]: Analyzing trace with hash 947037, now seen corresponding path program 1 times [2019-08-04 21:38:40,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:40,389 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:38:40,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:40,496 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-04 21:38:40,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:40,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:40,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:38:40,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:38:40,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:40,516 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-08-04 21:38:40,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:40,581 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:38:40,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:38:40,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:38:40,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:40,595 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:38:40,596 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:38:40,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:40,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:38:40,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-04 21:38:40,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:38:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:38:40,633 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-08-04 21:38:40,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:40,634 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:38:40,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:38:40,635 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:38:40,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:38:40,635 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:40,635 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-04 21:38:40,636 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:40,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:40,637 INFO L82 PathProgramCache]: Analyzing trace with hash 910168357, now seen corresponding path program 1 times [2019-08-04 21:38:40,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:40,677 WARN L254 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-04 21:38:40,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:40,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:40,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:40,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:38:40,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:38:40,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:38:40,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:40,976 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-04 21:38:41,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:41,104 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:38:41,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:38:41,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-04 21:38:41,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:41,107 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:38:41,108 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:38:41,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:38:41,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:38:41,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-04 21:38:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:38:41,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:38:41,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-08-04 21:38:41,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:41,117 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:38:41,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:38:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:38:41,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:38:41,118 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:41,118 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-08-04 21:38:41,119 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:41,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:41,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1501471507, now seen corresponding path program 2 times [2019-08-04 21:38:41,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:41,179 WARN L254 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-04 21:38:41,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:41,657 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-08-04 21:38:41,665 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:41,774 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:41,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:41,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:38:41,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:38:41,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:38:41,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:38:41,799 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-08-04 21:38:42,006 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2019-08-04 21:38:42,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:42,228 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:38:42,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:38:42,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-04 21:38:42,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:42,229 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:38:42,230 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:38:42,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:38:42,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:38:42,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-04 21:38:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:38:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:38:42,234 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-04 21:38:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:42,235 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:38:42,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:38:42,235 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:38:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:38:42,235 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:42,235 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2019-08-04 21:38:42,236 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:42,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:42,236 INFO L82 PathProgramCache]: Analyzing trace with hash 194959029, now seen corresponding path program 3 times [2019-08-04 21:38:42,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:42,321 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-04 21:38:42,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:42,741 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-08-04 21:38:42,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:42,825 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:42,875 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:42,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:42,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:38:42,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:38:42,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:38:42,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:38:42,877 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-08-04 21:38:43,152 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2019-08-04 21:38:43,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:43,331 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-04 21:38:43,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:38:43,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-04 21:38:43,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:43,332 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:38:43,333 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:38:43,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:38:43,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:38:43,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-04 21:38:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:38:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:38:43,337 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-04 21:38:43,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:43,337 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:38:43,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:38:43,337 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:38:43,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:38:43,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:43,338 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2019-08-04 21:38:43,339 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:43,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:43,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1622868355, now seen corresponding path program 4 times [2019-08-04 21:38:43,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:43,389 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-04 21:38:43,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:43,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:43,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:43,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:43,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:38:43,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:38:43,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:38:43,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:38:43,651 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 9 states. [2019-08-04 21:38:43,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:43,825 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-04 21:38:43,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:38:43,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-08-04 21:38:43,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:43,828 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:38:43,828 INFO L226 Difference]: Without dead ends: 16 [2019-08-04 21:38:43,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:38:43,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-04 21:38:43,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-08-04 21:38:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:38:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-04 21:38:43,831 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-04 21:38:43,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:43,832 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-04 21:38:43,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:38:43,832 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-04 21:38:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:38:43,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:43,833 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2019-08-04 21:38:43,833 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:43,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:43,834 INFO L82 PathProgramCache]: Analyzing trace with hash -503294907, now seen corresponding path program 5 times [2019-08-04 21:38:43,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:43,888 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-04 21:38:43,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:44,265 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:44,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:44,360 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:44,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:44,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:38:44,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:38:44,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:38:44,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:38:44,362 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 10 states. [2019-08-04 21:38:44,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:44,662 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-04 21:38:44,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:38:44,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-08-04 21:38:44,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:44,664 INFO L225 Difference]: With dead ends: 18 [2019-08-04 21:38:44,664 INFO L226 Difference]: Without dead ends: 18 [2019-08-04 21:38:44,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:38:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-04 21:38:44,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-04 21:38:44,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:38:44,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-04 21:38:44,668 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-04 21:38:44,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:44,668 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-04 21:38:44,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:38:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-04 21:38:44,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:38:44,669 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:44,669 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2019-08-04 21:38:44,670 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:44,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:44,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1664964621, now seen corresponding path program 6 times [2019-08-04 21:38:44,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:44,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-04 21:38:44,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:44,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:45,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:45,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:45,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:38:45,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:38:45,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:38:45,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:38:45,199 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 11 states. [2019-08-04 21:38:46,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:46,180 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-04 21:38:46,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:38:46,180 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-08-04 21:38:46,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:46,181 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:38:46,181 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:38:46,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:38:46,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:38:46,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-08-04 21:38:46,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:38:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-04 21:38:46,184 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-08-04 21:38:46,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:46,185 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-04 21:38:46,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:38:46,185 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-04 21:38:46,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:38:46,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:46,186 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2019-08-04 21:38:46,186 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:46,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:46,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1991734827, now seen corresponding path program 7 times [2019-08-04 21:38:46,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:46,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-04 21:38:46,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:46,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:46,927 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:46,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:46,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:38:46,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:38:46,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:38:46,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:38:46,955 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-08-04 21:38:47,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:47,309 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-04 21:38:47,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:38:47,312 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-08-04 21:38:47,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:47,312 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:38:47,312 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:38:47,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:38:47,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:38:47,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-04 21:38:47,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:38:47,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-04 21:38:47,316 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-08-04 21:38:47,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:47,316 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-04 21:38:47,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:38:47,317 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-04 21:38:47,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:38:47,317 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:47,317 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2019-08-04 21:38:47,318 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:47,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:47,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1498311069, now seen corresponding path program 8 times [2019-08-04 21:38:47,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:47,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-04 21:38:47,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:47,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:47,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:38:47,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:38:47,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:38:47,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:38:47,932 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 13 states. [2019-08-04 21:38:48,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:48,220 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-04 21:38:48,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:38:48,222 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-08-04 21:38:48,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:48,223 INFO L225 Difference]: With dead ends: 24 [2019-08-04 21:38:48,223 INFO L226 Difference]: Without dead ends: 24 [2019-08-04 21:38:48,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:38:48,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-04 21:38:48,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-08-04 21:38:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:38:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-04 21:38:48,227 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-08-04 21:38:48,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:48,227 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-04 21:38:48,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:38:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-04 21:38:48,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:38:48,228 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:48,229 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2019-08-04 21:38:48,229 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:48,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:48,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1062958949, now seen corresponding path program 9 times [2019-08-04 21:38:48,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:48,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-04 21:38:48,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:48,886 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:48,907 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:48,934 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:48,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:48,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:38:48,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:38:48,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:38:48,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:38:48,936 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 14 states. [2019-08-04 21:38:49,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:49,467 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-04 21:38:49,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:38:49,467 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-08-04 21:38:49,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:49,468 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:38:49,469 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:38:49,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:38:49,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:38:49,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-08-04 21:38:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:38:49,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-04 21:38:49,473 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-08-04 21:38:49,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:49,474 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-04 21:38:49,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:38:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-04 21:38:49,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:38:49,475 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:49,475 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2019-08-04 21:38:49,475 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:49,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:49,476 INFO L82 PathProgramCache]: Analyzing trace with hash -698600659, now seen corresponding path program 10 times [2019-08-04 21:38:49,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-04 21:38:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-04 21:38:49,608 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-04 21:38:49,637 INFO L202 PluginConnector]: Adding new model sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:38:49 BoogieIcfgContainer [2019-08-04 21:38:49,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:38:49,639 INFO L168 Benchmark]: Toolchain (without parser) took 9957.38 ms. Allocated memory was 141.0 MB in the beginning and 233.3 MB in the end (delta: 92.3 MB). Free memory was 111.5 MB in the beginning and 191.0 MB in the end (delta: -79.5 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:49,640 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory is still 112.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-04 21:38:49,641 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.61 ms. Allocated memory is still 141.0 MB. Free memory was 111.0 MB in the beginning and 109.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:49,641 INFO L168 Benchmark]: Boogie Preprocessor took 20.22 ms. Allocated memory is still 141.0 MB. Free memory was 109.8 MB in the beginning and 108.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:49,642 INFO L168 Benchmark]: RCFGBuilder took 364.27 ms. Allocated memory is still 141.0 MB. Free memory was 108.5 MB in the beginning and 97.0 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:49,643 INFO L168 Benchmark]: TraceAbstraction took 9533.29 ms. Allocated memory was 141.0 MB in the beginning and 233.3 MB in the end (delta: 92.3 MB). Free memory was 96.6 MB in the beginning and 191.0 MB in the end (delta: -94.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-04 21:38:49,648 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.20 ms. Allocated memory is still 141.0 MB. Free memory is still 112.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.61 ms. Allocated memory is still 141.0 MB. Free memory was 111.0 MB in the beginning and 109.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.22 ms. Allocated memory is still 141.0 MB. Free memory was 109.8 MB in the beginning and 108.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 364.27 ms. Allocated memory is still 141.0 MB. Free memory was 108.5 MB in the beginning and 97.0 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9533.29 ms. Allocated memory was 141.0 MB in the beginning and 233.3 MB in the end (delta: 92.3 MB). Free memory was 96.6 MB in the beginning and 191.0 MB in the end (delta: -94.4 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 54]: assertion can be violated assertion can be violated We found a FailurePath: [L14] havoc main_#res; [L15] havoc main_#t~nondet0, main_#t~nondet1, main_#t~post2, main_~sn~5, main_~loop1~5, main_~n1~5, main_~x~5; [L16] main_~sn~5 := 0; [L17] main_~loop1~5 := main_#t~nondet0; [L18] havoc main_#t~nondet0; [L19] main_~n1~5 := main_#t~nondet1; [L20] havoc main_#t~nondet1; [L21] main_~x~5 := 0; VAL [main_~loop1~5=2, main_~n1~5=3, main_~sn~5=0, main_~x~5=0] [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=2, main_~x~5=1] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=2, main_~x~5=1] [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=4, main_~x~5=2] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=4, main_~x~5=2] [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=6, main_~x~5=3] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=6, main_~x~5=3] [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=8, main_~x~5=4] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=8, main_~x~5=4] [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=10, main_~x~5=5] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=10, main_~x~5=5] [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=12, main_~x~5=6] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=12, main_~x~5=6] [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=14, main_~x~5=7] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=14, main_~x~5=7] [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=16, main_~x~5=8] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=16, main_~x~5=8] [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=18, main_~x~5=9] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=18, main_~x~5=9] [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=10] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=10] [L25] assume !false; [L34] assume !(main_~x~5 % 4294967296 < 10); [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=11] [L47] assume __VERIFIER_assert_~cond == 0; [L48] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=11] [L54] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~loop1~5=2, main_~n1~5=3, main_~sn~5=20, main_~x~5=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNSAFE Result, 9.4s OverallTime, 11 OverallIterations, 11 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 31 SDslu, 295 SDs, 0 SdLazy, 801 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=10, 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, 10 MinimizatonAttempts, 10 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 15654 SizeOfPredicates, 56 NumberOfNonLiveVariables, 560 ConjunctsInSsa, 278 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 0/330 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...