java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-56c9370 [2018-07-23 15:32:26,504 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 15:32:26,506 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 15:32:26,522 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 15:32:26,522 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 15:32:26,523 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 15:32:26,525 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 15:32:26,526 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 15:32:26,528 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 15:32:26,529 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 15:32:26,530 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 15:32:26,530 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 15:32:26,531 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 15:32:26,532 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 15:32:26,533 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 15:32:26,534 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 15:32:26,535 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 15:32:26,537 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 15:32:26,539 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 15:32:26,540 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 15:32:26,541 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 15:32:26,543 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 15:32:26,545 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 15:32:26,545 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 15:32:26,546 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 15:32:26,546 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 15:32:26,547 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 15:32:26,548 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 15:32:26,549 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 15:32:26,550 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 15:32:26,551 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 15:32:26,551 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 15:32:26,551 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 15:32:26,552 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 15:32:26,553 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 15:32:26,553 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 15:32:26,554 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 15:32:26,568 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 15:32:26,568 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 15:32:26,569 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 15:32:26,569 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 15:32:26,569 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 15:32:26,570 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 15:32:26,570 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 15:32:26,570 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 15:32:26,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 15:32:26,636 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 15:32:26,641 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 15:32:26,642 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 15:32:26,643 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 15:32:26,644 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl [2018-07-23 15:32:26,644 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl' [2018-07-23 15:32:26,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 15:32:26,695 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 15:32:26,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 15:32:26,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 15:32:26,696 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 15:32:26,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:32:26" (1/1) ... [2018-07-23 15:32:26,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:32:26" (1/1) ... [2018-07-23 15:32:26,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:32:26" (1/1) ... [2018-07-23 15:32:26,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:32:26" (1/1) ... [2018-07-23 15:32:26,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:32:26" (1/1) ... [2018-07-23 15:32:26,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:32:26" (1/1) ... [2018-07-23 15:32:26,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:32:26" (1/1) ... [2018-07-23 15:32:26,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 15:32:26,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 15:32:26,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 15:32:26,751 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 15:32:26,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:32:26" (1/1) ... [2018-07-23 15:32:26,834 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-07-23 15:32:26,834 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-23 15:32:26,834 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-23 15:32:26,960 INFO L258 CfgBuilder]: Using library mode [2018-07-23 15:32:26,961 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:32:26 BoogieIcfgContainer [2018-07-23 15:32:26,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 15:32:26,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 15:32:26,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 15:32:26,966 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 15:32:26,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:32:26" (1/2) ... [2018-07-23 15:32:26,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26800df8 and model type Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 03:32:26, skipping insertion in model container [2018-07-23 15:32:26,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:32:26" (2/2) ... [2018-07-23 15:32:26,970 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg-sophisticated.bpl [2018-07-23 15:32:26,980 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 15:32:26,989 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 15:32:27,037 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 15:32:27,038 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 15:32:27,038 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 15:32:27,038 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 15:32:27,038 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 15:32:27,039 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 15:32:27,039 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 15:32:27,039 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 15:32:27,039 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 15:32:27,054 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-23 15:32:27,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-23 15:32:27,063 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:32:27,064 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-23 15:32:27,065 INFO L414 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:32:27,070 INFO L82 PathProgramCache]: Analyzing trace with hash 30240, now seen corresponding path program 1 times [2018-07-23 15:32:27,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:32:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:32:27,141 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-23 15:32:27,144 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:32:27,145 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 15:32:27,150 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:32:27,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:32:27,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:32:27,169 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-23 15:32:27,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:32:27,198 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-07-23 15:32:27,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:32:27,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-23 15:32:27,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:32:27,211 INFO L225 Difference]: With dead ends: 13 [2018-07-23 15:32:27,211 INFO L226 Difference]: Without dead ends: 5 [2018-07-23 15:32:27,215 INFO L573 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-23 15:32:27,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-23 15:32:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-23 15:32:27,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-23 15:32:27,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-23 15:32:27,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-23 15:32:27,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:32:27,251 INFO L471 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-23 15:32:27,251 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:32:27,251 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-23 15:32:27,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 15:32:27,252 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:32:27,252 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 15:32:27,253 INFO L414 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:32:27,253 INFO L82 PathProgramCache]: Analyzing trace with hash 945112, now seen corresponding path program 1 times [2018-07-23 15:32:27,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:32:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:32:27,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:32:27,290 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:32:27,290 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 15:32:27,293 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:32:27,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:32:27,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:32:27,294 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-07-23 15:32:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:32:27,309 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-23 15:32:27,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 15:32:27,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-23 15:32:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:32:27,310 INFO L225 Difference]: With dead ends: 8 [2018-07-23 15:32:27,311 INFO L226 Difference]: Without dead ends: 6 [2018-07-23 15:32:27,312 INFO L573 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-23 15:32:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-23 15:32:27,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-23 15:32:27,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-23 15:32:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-23 15:32:27,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-23 15:32:27,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:32:27,316 INFO L471 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-23 15:32:27,316 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:32:27,316 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-23 15:32:27,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-23 15:32:27,317 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:32:27,317 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-23 15:32:27,317 INFO L414 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:32:27,317 INFO L82 PathProgramCache]: Analyzing trace with hash 29306144, now seen corresponding path program 2 times [2018-07-23 15:32:27,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:32:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:32:27,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:32:27,372 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:32:27,373 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 15:32:27,373 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 15:32:27,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 15:32:27,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:32:27,374 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-07-23 15:32:27,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:32:27,390 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-23 15:32:27,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 15:32:27,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-23 15:32:27,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:32:27,391 INFO L225 Difference]: With dead ends: 9 [2018-07-23 15:32:27,391 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 15:32:27,392 INFO L573 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-23 15:32:27,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 15:32:27,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-23 15:32:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 15:32:27,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 15:32:27,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-23 15:32:27,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:32:27,395 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 15:32:27,395 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 15:32:27,396 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 15:32:27,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 15:32:27,396 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:32:27,396 INFO L353 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-23 15:32:27,397 INFO L414 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:32:27,397 INFO L82 PathProgramCache]: Analyzing trace with hash 908498136, now seen corresponding path program 3 times [2018-07-23 15:32:27,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:32:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:32:27,469 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-23 15:32:27,470 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:32:27,470 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 15:32:27,470 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 15:32:27,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 15:32:27,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:32:27,471 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-23 15:32:27,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:32:27,484 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-23 15:32:27,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 15:32:27,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 15:32:27,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:32:27,485 INFO L225 Difference]: With dead ends: 10 [2018-07-23 15:32:27,485 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 15:32:27,486 INFO L573 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-23 15:32:27,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 15:32:27,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-23 15:32:27,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-23 15:32:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-23 15:32:27,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-23 15:32:27,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:32:27,490 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-23 15:32:27,490 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 15:32:27,490 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-23 15:32:27,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 15:32:27,491 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:32:27,491 INFO L353 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-23 15:32:27,492 INFO L414 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:32:27,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1901321184, now seen corresponding path program 4 times [2018-07-23 15:32:27,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:32:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:32:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:32:27,678 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:32:27,678 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:32:27,679 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:32:27,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:32:27,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:32:27,682 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-23 15:32:27,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:32:27,716 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-23 15:32:27,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 15:32:27,716 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-23 15:32:27,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:32:27,717 INFO L225 Difference]: With dead ends: 11 [2018-07-23 15:32:27,717 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 15:32:27,718 INFO L573 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-23 15:32:27,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 15:32:27,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-23 15:32:27,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 15:32:27,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 15:32:27,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-23 15:32:27,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:32:27,724 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 15:32:27,725 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:32:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 15:32:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:32:27,725 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:32:27,725 INFO L353 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-23 15:32:27,726 INFO L414 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:32:27,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1188593112, now seen corresponding path program 5 times [2018-07-23 15:32:27,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:32:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:32:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:32:27,859 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:32:27,859 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:32:27,860 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:32:27,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:32:27,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:32:27,861 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-07-23 15:32:27,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:32:27,873 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 15:32:27,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 15:32:27,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 15:32:27,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:32:27,874 INFO L225 Difference]: With dead ends: 12 [2018-07-23 15:32:27,874 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 15:32:27,875 INFO L573 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-23 15:32:27,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 15:32:27,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-23 15:32:27,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-23 15:32:27,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-23 15:32:27,879 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-23 15:32:27,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:32:27,879 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-23 15:32:27,879 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:32:27,879 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-23 15:32:27,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 15:32:27,880 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:32:27,880 INFO L353 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-23 15:32:27,880 INFO L414 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:32:27,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1808311520, now seen corresponding path program 6 times [2018-07-23 15:32:27,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:32:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:32:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:32:28,179 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:32:28,179 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:32:28,179 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:32:28,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:32:28,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:32:28,180 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-07-23 15:32:28,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:32:28,191 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 15:32:28,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 15:32:28,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-23 15:32:28,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:32:28,192 INFO L225 Difference]: With dead ends: 13 [2018-07-23 15:32:28,192 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 15:32:28,193 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:32:28,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 15:32:28,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 15:32:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 15:32:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 15:32:28,197 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-23 15:32:28,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:32:28,197 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 15:32:28,198 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:32:28,198 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 15:32:28,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:32:28,198 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:32:28,199 INFO L353 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-23 15:32:28,199 INFO L414 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:32:28,199 INFO L82 PathProgramCache]: Analyzing trace with hash -223074600, now seen corresponding path program 7 times [2018-07-23 15:32:28,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:32:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:32:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:32:28,714 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:32:28,714 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:32:28,714 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:32:28,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:32:28,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:32:28,718 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-07-23 15:32:28,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:32:28,729 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-23 15:32:28,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:32:28,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-07-23 15:32:28,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:32:28,730 INFO L225 Difference]: With dead ends: 14 [2018-07-23 15:32:28,730 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 15:32:28,731 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:32:28,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 15:32:28,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-23 15:32:28,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-23 15:32:28,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-23 15:32:28,735 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-23 15:32:28,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:32:28,738 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-23 15:32:28,738 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:32:28,738 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-23 15:32:28,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 15:32:28,739 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:32:28,739 INFO L353 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-23 15:32:28,740 INFO L414 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:32:28,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1674629664, now seen corresponding path program 8 times [2018-07-23 15:32:28,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:32:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:32:29,677 WARN L169 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 3 [2018-07-23 15:32:29,988 WARN L169 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 3 [2018-07-23 15:32:30,324 WARN L169 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 3 [2018-07-23 15:32:30,606 WARN L169 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 3 [2018-07-23 15:32:30,615 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:32:30,616 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:32:30,616 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:32:30,617 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:32:30,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:32:30,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:32:30,622 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-07-23 15:32:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:32:30,642 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 15:32:30,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 15:32:30,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-07-23 15:32:30,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:32:30,643 INFO L225 Difference]: With dead ends: 15 [2018-07-23 15:32:30,643 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 15:32:30,644 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:32:30,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 15:32:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 15:32:30,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 15:32:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 15:32:30,651 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-23 15:32:30,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:32:30,651 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 15:32:30,651 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:32:30,651 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 15:32:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 15:32:30,652 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:32:30,652 INFO L353 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-23 15:32:30,653 INFO L414 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:32:30,653 INFO L82 PathProgramCache]: Analyzing trace with hash 373919704, now seen corresponding path program 9 times [2018-07-23 15:32:30,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:32:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:32:32,913 WARN L169 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 300 DAG size of output: 3 [2018-07-23 15:32:34,097 WARN L169 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 339 DAG size of output: 3 [2018-07-23 15:32:34,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:32:34,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:32:34,837 WARN L169 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 353 DAG size of output: 3 [2018-07-23 15:32:35,733 WARN L169 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 319 DAG size of output: 3 [2018-07-23 15:32:36,161 WARN L169 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 3 [2018-07-23 15:32:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:32:36,171 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:32:36,171 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:32:36,171 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:32:36,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:32:36,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:32:36,173 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-07-23 15:32:36,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:32:36,190 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-23 15:32:36,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:32:36,190 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-07-23 15:32:36,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:32:36,192 INFO L225 Difference]: With dead ends: 16 [2018-07-23 15:32:36,192 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 15:32:36,193 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:32:36,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 15:32:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-23 15:32:36,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-23 15:32:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-23 15:32:36,198 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-23 15:32:36,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:32:36,198 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-23 15:32:36,199 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:32:36,199 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-23 15:32:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:32:36,201 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:32:36,201 INFO L353 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-23 15:32:36,201 INFO L414 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:32:36,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1293383392, now seen corresponding path program 10 times [2018-07-23 15:32:36,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:32:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:32:37,195 WARN L169 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 3 [2018-07-23 15:32:42,321 WARN L169 SmtUtils]: Spent 4.51 s on a formula simplification. DAG size of input: 588 DAG size of output: 3 [2018-07-23 15:32:46,737 WARN L169 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 675 DAG size of output: 3 [2018-07-23 15:32:47,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:32:48,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:32:48,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:32:49,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:32:50,265 WARN L169 SmtUtils]: Spent 3.24 s on a formula simplification. DAG size of input: 729 DAG size of output: 3 [2018-07-23 15:32:53,321 WARN L169 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 715 DAG size of output: 3 [2018-07-23 15:32:55,524 WARN L169 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 735 DAG size of output: 3 [2018-07-23 15:32:56,208 WARN L169 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 410 DAG size of output: 3 [2018-07-23 15:32:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:32:56,214 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:32:56,214 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:32:56,215 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:32:56,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:32:56,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:32:56,216 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-07-23 15:32:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:32:56,228 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 15:32:56,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 15:32:56,229 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-07-23 15:32:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:32:56,229 INFO L225 Difference]: With dead ends: 17 [2018-07-23 15:32:56,229 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 15:32:56,230 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:32:56,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 15:32:56,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-23 15:32:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 15:32:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 15:32:56,233 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-23 15:32:56,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:32:56,234 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 15:32:56,234 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:32:56,234 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 15:32:56,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 15:32:56,235 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:32:56,235 INFO L353 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-23 15:32:56,235 INFO L414 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:32:56,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1440171816, now seen corresponding path program 11 times [2018-07-23 15:32:56,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:32:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:32:59,146 WARN L169 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 521 DAG size of output: 3 [2018-07-23 15:33:42,129 WARN L169 SmtUtils]: Spent 40.00 s on a formula simplification. DAG size of input: 1164 DAG size of output: 3 [2018-07-23 15:34:00,141 WARN L169 SmtUtils]: Spent 16.78 s on a formula simplification. DAG size of input: 1347 DAG size of output: 3 [2018-07-23 15:34:18,525 WARN L169 SmtUtils]: Spent 16.38 s on a formula simplification. DAG size of input: 1481 DAG size of output: 3 [2018-07-23 15:34:31,772 WARN L169 SmtUtils]: Spent 12.21 s on a formula simplification. DAG size of input: 1507 DAG size of output: 3 [2018-07-23 15:34:34,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:34:41,524 WARN L169 SmtUtils]: Spent 8.79 s on a formula simplification. DAG size of input: 1666 DAG size of output: 3 [2018-07-23 15:34:42,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 15:34:48,033 WARN L169 SmtUtils]: Spent 5.85 s on a formula simplification. DAG size of input: 1235 DAG size of output: 3 [2018-07-23 15:34:50,968 WARN L169 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 796 DAG size of output: 3 [2018-07-23 15:34:50,973 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:50,973 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:50,973 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:34:50,974 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:34:50,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:34:50,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:34:50,975 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-07-23 15:34:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:50,984 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-23 15:34:50,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 15:34:50,985 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-07-23 15:34:50,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:50,985 INFO L225 Difference]: With dead ends: 18 [2018-07-23 15:34:50,985 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 15:34:50,986 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 107.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:34:50,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 15:34:50,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-23 15:34:50,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-23 15:34:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-23 15:34:50,989 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-23 15:34:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:50,989 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-23 15:34:50,989 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:34:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-23 15:34:50,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:34:50,990 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:50,990 INFO L353 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-07-23 15:34:50,990 INFO L414 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:34:50,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1695645664, now seen corresponding path program 12 times [2018-07-23 15:34:50,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:58,998 WARN L169 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 1029 DAG size of output: 3 [2018-07-23 15:35:06,776 WARN L169 SmtUtils]: Spent 7.25 s on a formula simplification. DAG size of input: 1032 DAG size of output: 3 [2018-07-23 15:35:14,948 WARN L169 SmtUtils]: Spent 7.58 s on a formula simplification. DAG size of input: 1033 DAG size of output: 3 Received shutdown request... [2018-07-23 15:36:55,916 WARN L177 SmtUtils]: Removed 2 from assertion stack [2018-07-23 15:36:55,917 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-23 15:36:55,921 WARN L202 ceAbstractionStarter]: Timeout [2018-07-23 15:36:55,921 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 03:36:55 BoogieIcfgContainer [2018-07-23 15:36:55,922 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 15:36:55,923 INFO L168 Benchmark]: Toolchain (without parser) took 269229.48 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -349.2 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-07-23 15:36:55,924 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 15:36:55,925 INFO L168 Benchmark]: Boogie Preprocessor took 54.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 15:36:55,925 INFO L168 Benchmark]: RCFGBuilder took 211.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 15:36:55,926 INFO L168 Benchmark]: TraceAbstraction took 268959.69 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -359.7 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-07-23 15:36:55,930 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 211.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 268959.69 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -359.7 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 16 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 2316. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 268.8s OverallTime, 13 OverallIterations, 12 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 38 SDtfs, 2 SDslu, 60 SDs, 0 SdLazy, 150 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 133.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=12, 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, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 143.0s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 2274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 1 PerfectInterpolantSequences, 0/286 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg-sophisticated.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_15-36-55-948.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg-sophisticated.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_15-36-55-948.csv Completed graceful shutdown