java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:50:03,443 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:50:03,446 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:50:03,458 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:50:03,458 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:50:03,460 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:50:03,461 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:50:03,463 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:50:03,464 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:50:03,466 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:50:03,467 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:50:03,468 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:50:03,469 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:50:03,470 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:50:03,474 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:50:03,475 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:50:03,476 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:50:03,481 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:50:03,487 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:50:03,489 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:50:03,492 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:50:03,493 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:50:03,496 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:50:03,498 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:50:03,498 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:50:03,499 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:50:03,500 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:50:03,501 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:50:03,502 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:50:03,503 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:50:03,506 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:50:03,507 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:50:03,508 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:50:03,508 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:50:03,511 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:50:03,512 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:50:03,513 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:50:03,535 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:50:03,535 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:50:03,537 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:50:03,538 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:50:03,538 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:50:03,538 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:50:03,538 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:50:03,538 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:50:03,602 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:50:03,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:50:03,626 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:50:03,628 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:50:03,629 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:50:03,629 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_3.bpl [2018-07-25 08:50:03,630 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_3.bpl' [2018-07-25 08:50:03,690 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:50:03,692 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:50:03,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:50:03,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:50:03,693 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:50:03,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/1) ... [2018-07-25 08:50:03,726 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/1) ... [2018-07-25 08:50:03,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:50:03,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:50:03,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:50:03,734 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:50:03,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/1) ... [2018-07-25 08:50:03,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/1) ... [2018-07-25 08:50:03,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/1) ... [2018-07-25 08:50:03,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/1) ... [2018-07-25 08:50:03,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/1) ... [2018-07-25 08:50:03,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/1) ... [2018-07-25 08:50:03,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/1) ... [2018-07-25 08:50:03,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:50:03,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:50:03,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:50:03,754 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:50:03,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/1) ... [2018-07-25 08:50:03,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 08:50:03,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 08:50:03,966 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 08:50:03,967 INFO L202 PluginConnector]: Adding new model sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:50:03 BoogieIcfgContainer [2018-07-25 08:50:03,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:50:03,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:50:03,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:50:03,972 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:50:03,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/2) ... [2018-07-25 08:50:03,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f5c7c and model type sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:50:03, skipping insertion in model container [2018-07-25 08:50:03,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:50:03" (2/2) ... [2018-07-25 08:50:03,976 INFO L112 eAbstractionObserver]: Analyzing ICFG sum04.i_3.bpl [2018-07-25 08:50:03,986 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:50:03,995 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 08:50:04,043 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:50:04,044 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:50:04,045 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:50:04,045 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:50:04,045 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:50:04,045 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:50:04,046 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:50:04,046 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:50:04,046 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:50:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-25 08:50:04,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 08:50:04,069 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:04,070 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 08:50:04,072 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:04,077 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-07-25 08:50:04,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:04,154 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:50:04,154 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:50:04,158 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:50:04,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:50:04,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:50:04,173 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-25 08:50:04,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:04,196 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-07-25 08:50:04,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:50:04,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-25 08:50:04,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:04,210 INFO L225 Difference]: With dead ends: 10 [2018-07-25 08:50:04,210 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 08:50:04,213 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:50:04,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 08:50:04,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 08:50:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 08:50:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 08:50:04,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-25 08:50:04,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:04,250 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 08:50:04,250 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:50:04,251 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 08:50:04,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:50:04,251 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:04,251 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-25 08:50:04,252 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:04,252 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-07-25 08:50:04,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:04,277 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:04,277 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 08:50:04,279 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:50:04,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:50:04,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:50:04,281 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-07-25 08:50:04,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:04,299 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 08:50:04,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:50:04,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-25 08:50:04,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:04,301 INFO L225 Difference]: With dead ends: 11 [2018-07-25 08:50:04,301 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 08:50:04,302 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:50:04,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 08:50:04,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 08:50:04,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 08:50:04,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 08:50:04,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-25 08:50:04,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:04,306 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 08:50:04,307 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:50:04,307 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 08:50:04,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:50:04,307 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:04,308 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-25 08:50:04,308 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:04,308 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-07-25 08:50:04,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:04,361 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:04,361 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:50:04,362 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:50:04,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:50:04,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:50:04,363 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-07-25 08:50:04,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:04,384 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 08:50:04,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:50:04,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-25 08:50:04,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:04,386 INFO L225 Difference]: With dead ends: 13 [2018-07-25 08:50:04,386 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 08:50:04,386 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:50:04,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 08:50:04,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 08:50:04,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 08:50:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 08:50:04,390 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-25 08:50:04,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:04,391 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 08:50:04,391 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:50:04,391 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 08:50:04,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:50:04,392 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:04,392 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-25 08:50:04,392 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:04,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-07-25 08:50:04,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:04,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:04,458 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:04,458 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:50:04,461 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:50:04,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:50:04,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:50:04,462 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-07-25 08:50:04,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:04,482 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 08:50:04,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:50:04,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-07-25 08:50:04,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:04,483 INFO L225 Difference]: With dead ends: 15 [2018-07-25 08:50:04,483 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 08:50:04,484 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:50:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 08:50:04,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 08:50:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 08:50:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 08:50:04,488 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-25 08:50:04,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:04,488 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 08:50:04,489 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:50:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 08:50:04,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:50:04,489 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:04,490 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-25 08:50:04,490 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:04,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-07-25 08:50:04,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:04,542 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:04,542 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:04,542 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:50:04,543 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:50:04,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:50:04,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:50:04,544 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-07-25 08:50:04,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:04,559 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 08:50:04,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 08:50:04,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-25 08:50:04,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:04,560 INFO L225 Difference]: With dead ends: 17 [2018-07-25 08:50:04,560 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 08:50:04,561 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:50:04,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 08:50:04,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 08:50:04,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 08:50:04,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 08:50:04,565 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-25 08:50:04,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:04,566 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 08:50:04,566 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:50:04,566 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 08:50:04,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:50:04,567 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:04,567 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-25 08:50:04,567 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:04,568 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-07-25 08:50:04,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:04,611 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:04,611 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:04,611 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:50:04,612 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:50:04,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:50:04,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:50:04,613 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-07-25 08:50:04,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:04,630 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 08:50:04,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 08:50:04,631 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-25 08:50:04,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:04,631 INFO L225 Difference]: With dead ends: 19 [2018-07-25 08:50:04,632 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 08:50:04,632 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:50:04,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 08:50:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 08:50:04,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 08:50:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 08:50:04,639 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-07-25 08:50:04,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:04,640 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 08:50:04,640 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:50:04,640 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 08:50:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:50:04,641 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:04,641 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-07-25 08:50:04,641 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:04,642 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-07-25 08:50:04,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:04,687 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:04,687 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:50:04,687 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:50:04,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:50:04,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:50:04,688 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-07-25 08:50:04,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:04,709 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 08:50:04,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:50:04,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 08:50:04,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:04,711 INFO L225 Difference]: With dead ends: 21 [2018-07-25 08:50:04,711 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 08:50:04,712 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:50:04,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 08:50:04,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 08:50:04,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 08:50:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 08:50:04,716 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-07-25 08:50:04,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:04,717 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 08:50:04,717 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:50:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 08:50:04,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:50:04,718 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:04,718 INFO L354 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-25 08:50:04,719 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:04,719 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-07-25 08:50:04,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:04,768 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:04,768 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:04,773 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:50:04,774 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:50:04,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:50:04,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:50:04,775 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-07-25 08:50:04,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:04,806 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 08:50:04,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:50:04,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 08:50:04,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:04,808 INFO L225 Difference]: With dead ends: 23 [2018-07-25 08:50:04,808 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 08:50:04,809 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:50:04,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 08:50:04,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 08:50:04,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 08:50:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 08:50:04,821 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-07-25 08:50:04,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:04,821 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 08:50:04,821 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:50:04,821 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 08:50:04,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:50:04,822 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:04,822 INFO L354 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-07-25 08:50:04,823 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:04,823 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-07-25 08:50:04,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:04,964 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:04,964 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:50:04,964 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:50:04,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:50:04,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:50:04,965 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-07-25 08:50:05,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:05,058 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 08:50:05,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:50:05,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:50:05,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:05,060 INFO L225 Difference]: With dead ends: 25 [2018-07-25 08:50:05,061 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 08:50:05,061 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:50:05,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 08:50:05,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 08:50:05,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 08:50:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 08:50:05,077 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-07-25 08:50:05,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:05,077 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 08:50:05,077 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:50:05,077 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 08:50:05,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:50:05,083 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:05,083 INFO L354 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-07-25 08:50:05,083 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:05,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-07-25 08:50:05,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:05,136 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:05,137 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:50:05,137 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-07-25 08:50:05,137 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:50:05,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:50:05,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:50:05,139 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 11 states. [2018-07-25 08:50:05,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:05,172 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 08:50:05,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:50:05,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-07-25 08:50:05,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:05,173 INFO L225 Difference]: With dead ends: 23 [2018-07-25 08:50:05,173 INFO L226 Difference]: Without dead ends: 0 [2018-07-25 08:50:05,176 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:50:05,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-25 08:50:05,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-25 08:50:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-25 08:50:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-25 08:50:05,177 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-07-25 08:50:05,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:05,178 INFO L472 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-25 08:50:05,178 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:50:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-25 08:50:05,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-25 08:50:05,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-25 08:50:05,269 INFO L418 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 1 38) the Hoare annotation is: false [2018-07-25 08:50:05,269 INFO L425 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 38) the Hoare annotation is: true [2018-07-25 08:50:05,270 INFO L422 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 38) no Hoare annotation was computed. [2018-07-25 08:50:05,270 INFO L418 ceAbstractionStarter]: At program point L28(lines 28 36) the Hoare annotation is: false [2018-07-25 08:50:05,272 INFO L418 ceAbstractionStarter]: At program point L18(lines 18 29) the Hoare annotation is: (or (and (<= 1 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~sn~4 0) (<= 0 ULTIMATE.start_main_~sn~4) (<= ULTIMATE.start_main_~i~4 1)) (and (<= 3 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~i~4 3) (<= 4 ULTIMATE.start_main_~sn~4) (<= ULTIMATE.start_main_~sn~4 4)) (and (<= 9 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~sn~4 16) (<= 16 ULTIMATE.start_main_~sn~4)) (and (<= ULTIMATE.start_main_~sn~4 10) (<= 6 ULTIMATE.start_main_~i~4) (<= 10 ULTIMATE.start_main_~sn~4) (<= ULTIMATE.start_main_~i~4 6)) (and (<= ULTIMATE.start_main_~sn~4 6) (<= ULTIMATE.start_main_~i~4 4) (<= 6 ULTIMATE.start_main_~sn~4) (<= 4 ULTIMATE.start_main_~i~4)) (and (<= 2 ULTIMATE.start_main_~sn~4) (<= 2 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~i~4 2) (<= ULTIMATE.start_main_~sn~4 2)) (and (<= 8 ULTIMATE.start_main_~sn~4) (<= ULTIMATE.start_main_~i~4 5) (<= 5 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~sn~4 8)) (and (<= ULTIMATE.start_main_~i~4 7) (<= ULTIMATE.start_main_~sn~4 12) (<= 7 ULTIMATE.start_main_~i~4) (<= 12 ULTIMATE.start_main_~sn~4)) (and (<= ULTIMATE.start_main_~sn~4 14) (<= ULTIMATE.start_main_~i~4 8) (<= 8 ULTIMATE.start_main_~i~4) (<= 14 ULTIMATE.start_main_~sn~4))) [2018-07-25 08:50:05,272 INFO L418 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 37) the Hoare annotation is: false [2018-07-25 08:50:05,274 INFO L418 ceAbstractionStarter]: At program point L35(lines 15 35) the Hoare annotation is: (or (and (<= 1 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~sn~4 0) (<= 0 ULTIMATE.start_main_~sn~4) (<= ULTIMATE.start_main_~i~4 1)) (and (<= 3 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~i~4 3) (<= 4 ULTIMATE.start_main_~sn~4) (<= ULTIMATE.start_main_~sn~4 4)) (and (<= 9 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~sn~4 16) (<= 16 ULTIMATE.start_main_~sn~4)) (and (<= ULTIMATE.start_main_~sn~4 10) (<= 6 ULTIMATE.start_main_~i~4) (<= 10 ULTIMATE.start_main_~sn~4) (<= ULTIMATE.start_main_~i~4 6)) (and (<= ULTIMATE.start_main_~sn~4 6) (<= ULTIMATE.start_main_~i~4 4) (<= 6 ULTIMATE.start_main_~sn~4) (<= 4 ULTIMATE.start_main_~i~4)) (and (<= 2 ULTIMATE.start_main_~sn~4) (<= 2 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~i~4 2) (<= ULTIMATE.start_main_~sn~4 2)) (and (<= 8 ULTIMATE.start_main_~sn~4) (<= ULTIMATE.start_main_~i~4 5) (<= 5 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~sn~4 8)) (and (<= ULTIMATE.start_main_~i~4 7) (<= ULTIMATE.start_main_~sn~4 12) (<= 7 ULTIMATE.start_main_~i~4) (<= 12 ULTIMATE.start_main_~sn~4)) (and (<= ULTIMATE.start_main_~sn~4 14) (<= ULTIMATE.start_main_~i~4 8) (<= 8 ULTIMATE.start_main_~i~4) (<= 14 ULTIMATE.start_main_~sn~4))) [2018-07-25 08:50:05,288 INFO L202 PluginConnector]: Adding new model sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:50:05 BoogieIcfgContainer [2018-07-25 08:50:05,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:50:05,289 INFO L168 Benchmark]: Toolchain (without parser) took 1598.55 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-07-25 08:50:05,291 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:50:05,292 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:50:05,292 INFO L168 Benchmark]: Boogie Preprocessor took 19.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:50:05,293 INFO L168 Benchmark]: RCFGBuilder took 213.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 08:50:05,294 INFO L168 Benchmark]: TraceAbstraction took 1320.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-07-25 08:50:05,298 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 213.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1320.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((((((((1 <= main_~i~4 && main_~sn~4 <= 0) && 0 <= main_~sn~4) && main_~i~4 <= 1) || (((3 <= main_~i~4 && main_~i~4 <= 3) && 4 <= main_~sn~4) && main_~sn~4 <= 4)) || ((9 <= main_~i~4 && main_~sn~4 <= 16) && 16 <= main_~sn~4)) || (((main_~sn~4 <= 10 && 6 <= main_~i~4) && 10 <= main_~sn~4) && main_~i~4 <= 6)) || (((main_~sn~4 <= 6 && main_~i~4 <= 4) && 6 <= main_~sn~4) && 4 <= main_~i~4)) || (((2 <= main_~sn~4 && 2 <= main_~i~4) && main_~i~4 <= 2) && main_~sn~4 <= 2)) || (((8 <= main_~sn~4 && main_~i~4 <= 5) && 5 <= main_~i~4) && main_~sn~4 <= 8)) || (((main_~i~4 <= 7 && main_~sn~4 <= 12) && 7 <= main_~i~4) && 12 <= main_~sn~4)) || (((main_~sn~4 <= 14 && main_~i~4 <= 8) && 8 <= main_~i~4) && 14 <= main_~sn~4) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((((((((1 <= main_~i~4 && main_~sn~4 <= 0) && 0 <= main_~sn~4) && main_~i~4 <= 1) || (((3 <= main_~i~4 && main_~i~4 <= 3) && 4 <= main_~sn~4) && main_~sn~4 <= 4)) || ((9 <= main_~i~4 && main_~sn~4 <= 16) && 16 <= main_~sn~4)) || (((main_~sn~4 <= 10 && 6 <= main_~i~4) && 10 <= main_~sn~4) && main_~i~4 <= 6)) || (((main_~sn~4 <= 6 && main_~i~4 <= 4) && 6 <= main_~sn~4) && 4 <= main_~i~4)) || (((2 <= main_~sn~4 && 2 <= main_~i~4) && main_~i~4 <= 2) && main_~sn~4 <= 2)) || (((8 <= main_~sn~4 && main_~i~4 <= 5) && 5 <= main_~i~4) && main_~sn~4 <= 8)) || (((main_~i~4 <= 7 && main_~sn~4 <= 12) && 7 <= main_~i~4) && 12 <= main_~sn~4)) || (((main_~sn~4 <= 14 && main_~i~4 <= 8) && 8 <= main_~i~4) && 14 <= main_~sn~4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 1.2s OverallTime, 10 OverallIterations, 10 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 54 SDtfs, 0 SDslu, 162 SDs, 0 SdLazy, 196 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=9, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 24 NumberOfFragments, 234 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 6354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 90/330 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sum04.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-50-05-313.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sum04.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-50-05-313.csv Received shutdown request...