java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/toy/SAS09doubleLoop-incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:39:57,365 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:39:57,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:39:57,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:39:57,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:39:57,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:39:57,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:39:57,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:39:57,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:39:57,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:39:57,394 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:39:57,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:39:57,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:39:57,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:39:57,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:39:57,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:39:57,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:39:57,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:39:57,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:39:57,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:39:57,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:39:57,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:39:57,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:39:57,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:39:57,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:39:57,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:39:57,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:39:57,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:39:57,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:39:57,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:39:57,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:39:57,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:39:57,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:39:57,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:39:57,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:39:57,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:39:57,428 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:39:57,428 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:39:57,428 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:39:57,429 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:39:57,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:39:57,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:39:57,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:39:57,471 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:39:57,473 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:39:57,473 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:39:57,474 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/SAS09doubleLoop-incorrect.bpl [2019-08-05 10:39:57,474 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/SAS09doubleLoop-incorrect.bpl' [2019-08-05 10:39:57,501 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:39:57,502 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:39:57,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:39:57,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:39:57,504 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:39:57,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "SAS09doubleLoop-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:57" (1/1) ... [2019-08-05 10:39:57,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "SAS09doubleLoop-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:57" (1/1) ... [2019-08-05 10:39:57,535 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:39:57,535 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:39:57,535 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:39:57,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:39:57,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:39:57,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:39:57,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:39:57,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "SAS09doubleLoop-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:57" (1/1) ... [2019-08-05 10:39:57,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "SAS09doubleLoop-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:57" (1/1) ... [2019-08-05 10:39:57,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "SAS09doubleLoop-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:57" (1/1) ... [2019-08-05 10:39:57,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "SAS09doubleLoop-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:57" (1/1) ... [2019-08-05 10:39:57,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "SAS09doubleLoop-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:57" (1/1) ... [2019-08-05 10:39:57,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "SAS09doubleLoop-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:57" (1/1) ... [2019-08-05 10:39:57,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "SAS09doubleLoop-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:57" (1/1) ... [2019-08-05 10:39:57,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:39:57,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:39:57,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:39:57,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:39:57,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "SAS09doubleLoop-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:39:57,630 INFO L124 BoogieDeclarations]: Specification and implementation of procedure SAS09paper given in one single declaration [2019-08-05 10:39:57,630 INFO L130 BoogieDeclarations]: Found specification of procedure SAS09paper [2019-08-05 10:39:57,630 INFO L138 BoogieDeclarations]: Found implementation of procedure SAS09paper [2019-08-05 10:39:57,936 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:39:57,937 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-08-05 10:39:57,938 INFO L202 PluginConnector]: Adding new model SAS09doubleLoop-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:39:57 BoogieIcfgContainer [2019-08-05 10:39:57,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:39:57,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:39:57,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:39:57,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:39:57,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SAS09doubleLoop-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:57" (1/2) ... [2019-08-05 10:39:57,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ffd2d71 and model type SAS09doubleLoop-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:39:57, skipping insertion in model container [2019-08-05 10:39:57,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SAS09doubleLoop-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:39:57" (2/2) ... [2019-08-05 10:39:57,948 INFO L109 eAbstractionObserver]: Analyzing ICFG SAS09doubleLoop-incorrect.bpl [2019-08-05 10:39:57,958 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:39:57,966 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-08-05 10:39:57,981 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-08-05 10:39:58,005 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:39:58,006 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:39:58,006 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:39:58,006 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:39:58,007 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:39:58,007 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:39:58,007 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:39:58,007 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:39:58,007 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:39:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-08-05 10:39:58,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:39:58,029 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:58,030 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:39:58,033 INFO L418 AbstractCegarLoop]: === Iteration 1 === [SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr3ASSERT_VIOLATIONASSERT, SAS09paperErr1ASSERT_VIOLATIONASSERT, SAS09paperErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:58,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:58,039 INFO L82 PathProgramCache]: Analyzing trace with hash 29892, now seen corresponding path program 1 times [2019-08-05 10:39:58,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:58,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:39:58,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:58,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:39:58,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:39:58,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:39:58,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:39:58,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:39:58,182 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2019-08-05 10:39:58,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:58,246 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-05 10:39:58,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:39:58,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:39:58,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:58,263 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:39:58,263 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:39:58,266 INFO L628 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 [2019-08-05 10:39:58,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:39:58,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:39:58,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:39:58,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 10:39:58,322 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 3 [2019-08-05 10:39:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:58,322 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 10:39:58,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:39:58,323 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 10:39:58,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:39:58,323 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:58,323 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:39:58,324 INFO L418 AbstractCegarLoop]: === Iteration 2 === [SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr3ASSERT_VIOLATIONASSERT, SAS09paperErr1ASSERT_VIOLATIONASSERT, SAS09paperErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:58,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:58,325 INFO L82 PathProgramCache]: Analyzing trace with hash 926693, now seen corresponding path program 1 times [2019-08-05 10:39:58,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:58,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:39:58,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:58,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:39:58,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:39:58,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:39:58,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:39:58,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:39:58,379 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 3 states. [2019-08-05 10:39:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:58,406 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2019-08-05 10:39:58,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:39:58,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 10:39:58,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:58,408 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:39:58,408 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:39:58,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:39:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:39:58,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:39:58,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:39:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 10:39:58,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2019-08-05 10:39:58,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:58,412 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 10:39:58,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:39:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 10:39:58,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:39:58,413 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:58,414 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:39:58,414 INFO L418 AbstractCegarLoop]: === Iteration 3 === [SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr3ASSERT_VIOLATIONASSERT, SAS09paperErr1ASSERT_VIOLATIONASSERT, SAS09paperErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:58,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:58,415 INFO L82 PathProgramCache]: Analyzing trace with hash 926853, now seen corresponding path program 1 times [2019-08-05 10:39:58,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:58,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:39:58,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:58,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:39:58,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:39:58,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:39:58,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:39:58,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:39:58,476 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2019-08-05 10:39:58,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:58,515 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 10:39:58,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:39:58,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 10:39:58,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:58,516 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:39:58,516 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:39:58,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:39:58,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:39:58,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 10:39:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:39:58,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 10:39:58,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-08-05 10:39:58,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:58,520 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 10:39:58,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:39:58,521 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 10:39:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:39:58,525 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:58,525 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:39:58,525 INFO L418 AbstractCegarLoop]: === Iteration 4 === [SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr3ASSERT_VIOLATIONASSERT, SAS09paperErr1ASSERT_VIOLATIONASSERT, SAS09paperErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:58,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:58,526 INFO L82 PathProgramCache]: Analyzing trace with hash 890553383, now seen corresponding path program 1 times [2019-08-05 10:39:58,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:58,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:39:58,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:58,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:58,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:58,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:39:58,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:39:58,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:39:58,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:39:58,609 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-08-05 10:39:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:58,637 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 10:39:58,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:39:58,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 10:39:58,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:58,640 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:39:58,640 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:39:58,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:39:58,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:39:58,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 10:39:58,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:39:58,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 10:39:58,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-05 10:39:58,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:58,644 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 10:39:58,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:39:58,644 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 10:39:58,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:39:58,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:58,645 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-05 10:39:58,646 INFO L418 AbstractCegarLoop]: === Iteration 5 === [SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr3ASSERT_VIOLATIONASSERT, SAS09paperErr1ASSERT_VIOLATIONASSERT, SAS09paperErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:58,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:58,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1123156809, now seen corresponding path program 2 times [2019-08-05 10:39:58,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:58,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:39:58,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:58,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:58,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:58,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:39:58,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:39:58,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:39:58,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:39:58,723 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-08-05 10:39:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:58,765 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 10:39:58,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:39:58,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 10:39:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:58,766 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:39:58,767 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:39:58,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:39:58,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:39:58,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 10:39:58,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:39:58,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 10:39:58,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-08-05 10:39:58,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:58,770 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 10:39:58,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:39:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 10:39:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:39:58,771 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:58,771 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-08-05 10:39:58,772 INFO L418 AbstractCegarLoop]: === Iteration 6 === [SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr3ASSERT_VIOLATIONASSERT, SAS09paperErr1ASSERT_VIOLATIONASSERT, SAS09paperErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:58,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:58,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1316749803, now seen corresponding path program 3 times [2019-08-05 10:39:58,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:58,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:39:58,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:58,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:58,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:58,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:39:58,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:39:58,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:39:58,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:39:58,861 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-08-05 10:39:58,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:58,919 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-05 10:39:58,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:39:58,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 10:39:58,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:58,920 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:39:58,920 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:39:58,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:39:58,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:39:58,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 10:39:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:39:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 10:39:58,924 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-08-05 10:39:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:58,924 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 10:39:58,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:39:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 10:39:58,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:39:58,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:58,925 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-08-05 10:39:58,925 INFO L418 AbstractCegarLoop]: === Iteration 7 === [SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr3ASSERT_VIOLATIONASSERT, SAS09paperErr1ASSERT_VIOLATIONASSERT, SAS09paperErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:58,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:58,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1618943987, now seen corresponding path program 4 times [2019-08-05 10:39:58,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:58,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:39:58,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:59,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:59,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:39:59,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:39:59,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:39:59,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:39:59,167 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-08-05 10:39:59,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:59,195 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-08-05 10:39:59,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:39:59,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-05 10:39:59,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:59,196 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:39:59,196 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:39:59,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:39:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:39:59,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-08-05 10:39:59,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:39:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 10:39:59,199 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-08-05 10:39:59,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:59,200 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 10:39:59,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:39:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 10:39:59,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:39:59,200 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:59,201 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-08-05 10:39:59,201 INFO L418 AbstractCegarLoop]: === Iteration 8 === [SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr3ASSERT_VIOLATIONASSERT, SAS09paperErr1ASSERT_VIOLATIONASSERT, SAS09paperErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:59,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:59,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1027162705, now seen corresponding path program 5 times [2019-08-05 10:39:59,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:39:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:39:59,234 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:39:59,252 INFO L202 PluginConnector]: Adding new model SAS09doubleLoop-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:39:59 BoogieIcfgContainer [2019-08-05 10:39:59,252 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:39:59,255 INFO L168 Benchmark]: Toolchain (without parser) took 1751.60 ms. Allocated memory was 141.6 MB in the beginning and 176.2 MB in the end (delta: 34.6 MB). Free memory was 108.8 MB in the beginning and 127.7 MB in the end (delta: -18.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:59,256 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.6 MB. Free memory was 110.0 MB in the beginning and 109.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:39:59,257 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.51 ms. Allocated memory is still 141.6 MB. Free memory was 108.8 MB in the beginning and 106.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:59,258 INFO L168 Benchmark]: Boogie Preprocessor took 20.19 ms. Allocated memory is still 141.6 MB. Free memory was 106.9 MB in the beginning and 105.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:59,259 INFO L168 Benchmark]: RCFGBuilder took 379.44 ms. Allocated memory is still 141.6 MB. Free memory was 105.8 MB in the beginning and 96.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:59,260 INFO L168 Benchmark]: TraceAbstraction took 1310.28 ms. Allocated memory was 141.6 MB in the beginning and 176.2 MB in the end (delta: 34.6 MB). Free memory was 96.0 MB in the beginning and 127.7 MB in the end (delta: -31.7 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:59,264 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.6 MB. Free memory was 110.0 MB in the beginning and 109.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.51 ms. Allocated memory is still 141.6 MB. Free memory was 108.8 MB in the beginning and 106.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.19 ms. Allocated memory is still 141.6 MB. Free memory was 106.9 MB in the beginning and 105.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 379.44 ms. Allocated memory is still 141.6 MB. Free memory was 105.8 MB in the beginning and 96.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1310.28 ms. Allocated memory was 141.6 MB in the beginning and 176.2 MB in the end (delta: 34.6 MB). Free memory was 96.0 MB in the beginning and 127.7 MB in the end (delta: -31.7 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 26]: assertion can be violated assertion can be violated We found a FailurePath: [L13] x := 0; [L14] y := 0; VAL [x=0, y=0] [L21] assert x != -1; VAL [x=0, y=0] [L22] assert y != -1; [L23] y := y + 1; VAL [x=0, y=1] [L21] assert x != -1; VAL [x=0, y=1] [L22] assert y != -1; [L23] y := y + 1; VAL [x=0, y=2] [L21] assert x != -1; VAL [x=0, y=2] [L22] assert y != -1; [L23] y := y + 1; VAL [x=0, y=3] [L21] assert x != -1; VAL [x=0, y=3] [L22] assert y != -1; [L23] y := y + 1; VAL [x=0, y=4] [L21] assert x != -1; VAL [x=0, y=4] [L22] assert y != -1; [L23] y := y + 1; VAL [x=0, y=5] [L25] assert x != -1; VAL [x=0, y=5] [L26] assert y != 5; VAL [x=0, y=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 4 error locations. UNSAFE Result, 1.2s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 41 SDtfs, 39 SDslu, 28 SDs, 0 SdLazy, 33 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=7, 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, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 40 ConstructedInterpolants, 0 QuantifiedInterpolants, 894 SizeOfPredicates, 0 NumberOfNonLiveVariables, 109 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 0/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...