java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:05:42,347 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:05:42,349 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:05:42,360 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:05:42,360 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:05:42,361 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:05:42,362 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:05:42,364 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:05:42,366 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:05:42,366 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:05:42,367 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:05:42,368 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:05:42,369 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:05:42,370 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:05:42,371 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:05:42,372 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:05:42,372 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:05:42,374 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:05:42,376 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:05:42,378 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:05:42,379 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:05:42,381 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:05:42,383 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:05:42,384 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:05:42,384 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:05:42,385 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:05:42,386 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:05:42,387 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:05:42,388 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:05:42,389 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:05:42,389 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:05:42,390 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:05:42,390 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:05:42,390 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:05:42,392 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:05:42,392 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:05:42,393 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 15:05:42,402 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:05:42,402 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:05:42,403 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:05:42,404 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:05:42,404 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:05:42,404 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:05:42,405 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:05:42,405 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:05:42,406 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:05:42,406 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:05:42,406 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:05:42,406 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:05:42,407 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:05:42,408 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:05:42,408 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:05:42,450 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:05:42,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:05:42,471 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:05:42,472 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:05:42,473 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:05:42,474 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl [2018-10-15 15:05:42,474 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl' [2018-10-15 15:05:42,574 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:05:42,575 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 15:05:42,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:05:42,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:05:42,576 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:05:42,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:05:42" (1/1) ... [2018-10-15 15:05:42,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:05:42" (1/1) ... [2018-10-15 15:05:42,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:05:42" (1/1) ... [2018-10-15 15:05:42,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:05:42" (1/1) ... [2018-10-15 15:05:42,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:05:42" (1/1) ... [2018-10-15 15:05:42,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:05:42" (1/1) ... [2018-10-15 15:05:42,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:05:42" (1/1) ... [2018-10-15 15:05:42,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:05:42,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:05:42,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:05:42,628 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:05:42,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:05:42" (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 [2018-10-15 15:05:42,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:05:42,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:05:43,513 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:05:43,514 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:05:43 BoogieIcfgContainer [2018-10-15 15:05:43,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:05:43,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:05:43,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:05:43,520 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:05:43,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:05:42" (1/2) ... [2018-10-15 15:05:43,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2379726b and model type eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:05:43, skipping insertion in model container [2018-10-15 15:05:43,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:05:43" (2/2) ... [2018-10-15 15:05:43,524 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01.i_6.bpl [2018-10-15 15:05:43,534 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:05:43,544 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:05:43,563 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:05:43,593 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:05:43,594 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:05:43,594 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:05:43,595 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:05:43,595 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:05:43,595 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:05:43,595 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:05:43,595 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:05:43,595 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:05:43,621 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states. [2018-10-15 15:05:43,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-15 15:05:43,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:43,636 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:43,637 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:43,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:43,644 INFO L82 PathProgramCache]: Analyzing trace with hash 39908676, now seen corresponding path program 1 times [2018-10-15 15:05:43,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:05:44,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:05:44,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-15 15:05:44,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:05:44,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:05:44,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:05:44,141 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 4 states. [2018-10-15 15:05:44,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:44,497 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2018-10-15 15:05:44,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:05:44,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-10-15 15:05:44,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:44,514 INFO L225 Difference]: With dead ends: 142 [2018-10-15 15:05:44,514 INFO L226 Difference]: Without dead ends: 142 [2018-10-15 15:05:44,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10-15 15:05:44,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-15 15:05:44,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 118. [2018-10-15 15:05:44,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-15 15:05:44,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2018-10-15 15:05:44,572 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 89 [2018-10-15 15:05:44,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:44,574 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2018-10-15 15:05:44,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:05:44,574 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2018-10-15 15:05:44,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-15 15:05:44,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:44,581 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:44,582 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:44,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:44,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1642252399, now seen corresponding path program 1 times [2018-10-15 15:05:44,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-15 15:05:44,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:44,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 15:05:44,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 15:05:44,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 15:05:44,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:05:44,833 INFO L87 Difference]: Start difference. First operand 118 states and 121 transitions. Second operand 6 states. [2018-10-15 15:05:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:45,184 INFO L93 Difference]: Finished difference Result 149 states and 154 transitions. [2018-10-15 15:05:45,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 15:05:45,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-10-15 15:05:45,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:45,190 INFO L225 Difference]: With dead ends: 149 [2018-10-15 15:05:45,190 INFO L226 Difference]: Without dead ends: 149 [2018-10-15 15:05:45,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:05:45,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-15 15:05:45,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 125. [2018-10-15 15:05:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-15 15:05:45,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2018-10-15 15:05:45,204 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 104 [2018-10-15 15:05:45,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:45,205 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2018-10-15 15:05:45,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 15:05:45,205 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2018-10-15 15:05:45,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-15 15:05:45,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:45,208 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:45,208 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:45,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:45,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1757244945, now seen corresponding path program 2 times [2018-10-15 15:05:45,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:45,391 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-15 15:05:45,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:45,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 15:05:45,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 15:05:45,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 15:05:45,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:05:45,393 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand 6 states. [2018-10-15 15:05:45,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:45,971 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2018-10-15 15:05:45,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 15:05:45,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2018-10-15 15:05:45,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:45,975 INFO L225 Difference]: With dead ends: 160 [2018-10-15 15:05:45,975 INFO L226 Difference]: Without dead ends: 160 [2018-10-15 15:05:45,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:05:45,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-15 15:05:45,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2018-10-15 15:05:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 15:05:45,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2018-10-15 15:05:45,986 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 111 [2018-10-15 15:05:45,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:45,986 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2018-10-15 15:05:45,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 15:05:45,987 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-10-15 15:05:45,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-15 15:05:45,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:45,989 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:45,990 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:45,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:45,990 INFO L82 PathProgramCache]: Analyzing trace with hash -58026082, now seen corresponding path program 3 times [2018-10-15 15:05:45,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:46,326 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-15 15:05:46,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:46,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 15:05:46,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:05:46,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:05:46,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:05:46,328 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand 8 states. [2018-10-15 15:05:46,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:46,938 INFO L93 Difference]: Finished difference Result 175 states and 182 transitions. [2018-10-15 15:05:46,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 15:05:46,938 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 119 [2018-10-15 15:05:46,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:46,942 INFO L225 Difference]: With dead ends: 175 [2018-10-15 15:05:46,942 INFO L226 Difference]: Without dead ends: 175 [2018-10-15 15:05:46,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:05:46,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-15 15:05:46,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 155. [2018-10-15 15:05:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-15 15:05:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 160 transitions. [2018-10-15 15:05:46,955 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 160 transitions. Word has length 119 [2018-10-15 15:05:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:46,956 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 160 transitions. [2018-10-15 15:05:46,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:05:46,956 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 160 transitions. [2018-10-15 15:05:46,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 15:05:46,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:46,959 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:46,959 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:46,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:46,960 INFO L82 PathProgramCache]: Analyzing trace with hash 315614251, now seen corresponding path program 4 times [2018-10-15 15:05:46,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-15 15:05:47,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:47,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:05:47,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:05:47,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:05:47,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:05:47,406 INFO L87 Difference]: Start difference. First operand 155 states and 160 transitions. Second operand 10 states. [2018-10-15 15:05:47,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:47,918 INFO L93 Difference]: Finished difference Result 190 states and 198 transitions. [2018-10-15 15:05:47,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 15:05:47,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2018-10-15 15:05:47,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:47,921 INFO L225 Difference]: With dead ends: 190 [2018-10-15 15:05:47,921 INFO L226 Difference]: Without dead ends: 190 [2018-10-15 15:05:47,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:05:47,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-15 15:05:47,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 170. [2018-10-15 15:05:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-15 15:05:47,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 176 transitions. [2018-10-15 15:05:47,932 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 176 transitions. Word has length 127 [2018-10-15 15:05:47,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:47,932 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 176 transitions. [2018-10-15 15:05:47,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:05:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 176 transitions. [2018-10-15 15:05:47,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-15 15:05:47,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:47,935 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:47,936 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:47,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:47,936 INFO L82 PathProgramCache]: Analyzing trace with hash 247092152, now seen corresponding path program 5 times [2018-10-15 15:05:47,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-15 15:05:48,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:48,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 15:05:48,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 15:05:48,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 15:05:48,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:05:48,210 INFO L87 Difference]: Start difference. First operand 170 states and 176 transitions. Second operand 12 states. [2018-10-15 15:05:48,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:48,675 INFO L93 Difference]: Finished difference Result 193 states and 201 transitions. [2018-10-15 15:05:48,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 15:05:48,676 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 135 [2018-10-15 15:05:48,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:48,678 INFO L225 Difference]: With dead ends: 193 [2018-10-15 15:05:48,679 INFO L226 Difference]: Without dead ends: 193 [2018-10-15 15:05:48,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2018-10-15 15:05:48,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-15 15:05:48,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2018-10-15 15:05:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-15 15:05:48,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 192 transitions. [2018-10-15 15:05:48,689 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 192 transitions. Word has length 135 [2018-10-15 15:05:48,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:48,690 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 192 transitions. [2018-10-15 15:05:48,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 15:05:48,690 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 192 transitions. [2018-10-15 15:05:48,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-15 15:05:48,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:48,693 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:48,693 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:48,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:48,694 INFO L82 PathProgramCache]: Analyzing trace with hash -696850875, now seen corresponding path program 6 times [2018-10-15 15:05:48,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:49,436 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-15 15:05:49,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:49,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 15:05:49,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:05:49,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:05:49,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:05:49,438 INFO L87 Difference]: Start difference. First operand 185 states and 192 transitions. Second operand 8 states. [2018-10-15 15:05:49,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:49,851 INFO L93 Difference]: Finished difference Result 204 states and 212 transitions. [2018-10-15 15:05:49,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 15:05:49,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 143 [2018-10-15 15:05:49,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:49,854 INFO L225 Difference]: With dead ends: 204 [2018-10-15 15:05:49,854 INFO L226 Difference]: Without dead ends: 204 [2018-10-15 15:05:49,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:05:49,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-15 15:05:49,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2018-10-15 15:05:49,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-15 15:05:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 199 transitions. [2018-10-15 15:05:49,863 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 199 transitions. Word has length 143 [2018-10-15 15:05:49,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:49,863 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 199 transitions. [2018-10-15 15:05:49,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:05:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 199 transitions. [2018-10-15 15:05:49,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-15 15:05:49,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:49,866 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:49,866 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:49,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:49,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1685123485, now seen corresponding path program 7 times [2018-10-15 15:05:49,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:50,032 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-15 15:05:50,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:05:50,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-15 15:05:50,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:05:50,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:05:50,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:05:50,033 INFO L87 Difference]: Start difference. First operand 192 states and 199 transitions. Second operand 4 states. [2018-10-15 15:05:50,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:50,091 INFO L93 Difference]: Finished difference Result 232 states and 239 transitions. [2018-10-15 15:05:50,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:05:50,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-10-15 15:05:50,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:50,094 INFO L225 Difference]: With dead ends: 232 [2018-10-15 15:05:50,094 INFO L226 Difference]: Without dead ends: 232 [2018-10-15 15:05:50,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10-15 15:05:50,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-15 15:05:50,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 202. [2018-10-15 15:05:50,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-15 15:05:50,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 209 transitions. [2018-10-15 15:05:50,100 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 209 transitions. Word has length 150 [2018-10-15 15:05:50,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:50,100 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 209 transitions. [2018-10-15 15:05:50,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:05:50,101 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 209 transitions. [2018-10-15 15:05:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-15 15:05:50,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:50,103 INFO L375 BasicCegarLoop]: trace histogram [10, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:50,103 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:50,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:50,104 INFO L82 PathProgramCache]: Analyzing trace with hash -681526670, now seen corresponding path program 1 times [2018-10-15 15:05:50,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:50,606 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 74 proven. 2 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-10-15 15:05:50,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:50,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 15:05:50,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 15:05:50,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 15:05:50,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:05:50,609 INFO L87 Difference]: Start difference. First operand 202 states and 209 transitions. Second operand 6 states. [2018-10-15 15:05:50,961 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-15 15:05:51,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:51,347 INFO L93 Difference]: Finished difference Result 277 states and 284 transitions. [2018-10-15 15:05:51,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 15:05:51,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2018-10-15 15:05:51,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:51,349 INFO L225 Difference]: With dead ends: 277 [2018-10-15 15:05:51,349 INFO L226 Difference]: Without dead ends: 277 [2018-10-15 15:05:51,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:05:51,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-15 15:05:51,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 247. [2018-10-15 15:05:51,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-15 15:05:51,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 254 transitions. [2018-10-15 15:05:51,355 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 254 transitions. Word has length 195 [2018-10-15 15:05:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:51,356 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 254 transitions. [2018-10-15 15:05:51,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 15:05:51,356 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 254 transitions. [2018-10-15 15:05:51,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-15 15:05:51,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:51,359 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:51,360 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:51,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:51,360 INFO L82 PathProgramCache]: Analyzing trace with hash 604334787, now seen corresponding path program 2 times [2018-10-15 15:05:51,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 198 proven. 13 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2018-10-15 15:05:51,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:51,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 15:05:51,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:05:51,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:05:51,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:05:51,551 INFO L87 Difference]: Start difference. First operand 247 states and 254 transitions. Second operand 8 states. [2018-10-15 15:05:51,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:51,713 INFO L93 Difference]: Finished difference Result 322 states and 329 transitions. [2018-10-15 15:05:51,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 15:05:51,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 240 [2018-10-15 15:05:51,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:51,715 INFO L225 Difference]: With dead ends: 322 [2018-10-15 15:05:51,715 INFO L226 Difference]: Without dead ends: 322 [2018-10-15 15:05:51,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:05:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-10-15 15:05:51,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 292. [2018-10-15 15:05:51,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-10-15 15:05:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 299 transitions. [2018-10-15 15:05:51,722 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 299 transitions. Word has length 240 [2018-10-15 15:05:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:51,722 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 299 transitions. [2018-10-15 15:05:51,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:05:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 299 transitions. [2018-10-15 15:05:51,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-15 15:05:51,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:51,724 INFO L375 BasicCegarLoop]: trace histogram [20, 15, 15, 15, 15, 15, 15, 15, 15, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:51,724 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:51,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:51,725 INFO L82 PathProgramCache]: Analyzing trace with hash -701215982, now seen corresponding path program 3 times [2018-10-15 15:05:51,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1212 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1212 trivial. 0 not checked. [2018-10-15 15:05:51,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:05:51,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-15 15:05:51,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:05:51,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:05:51,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:05:51,955 INFO L87 Difference]: Start difference. First operand 292 states and 299 transitions. Second operand 4 states. [2018-10-15 15:05:52,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:52,125 INFO L93 Difference]: Finished difference Result 299 states and 306 transitions. [2018-10-15 15:05:52,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:05:52,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 285 [2018-10-15 15:05:52,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:52,131 INFO L225 Difference]: With dead ends: 299 [2018-10-15 15:05:52,131 INFO L226 Difference]: Without dead ends: 299 [2018-10-15 15:05:52,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:05:52,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-15 15:05:52,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 294. [2018-10-15 15:05:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-15 15:05:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 301 transitions. [2018-10-15 15:05:52,137 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 301 transitions. Word has length 285 [2018-10-15 15:05:52,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:52,137 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 301 transitions. [2018-10-15 15:05:52,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:05:52,137 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 301 transitions. [2018-10-15 15:05:52,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-10-15 15:05:52,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:52,139 INFO L375 BasicCegarLoop]: trace histogram [20, 15, 15, 15, 15, 15, 15, 15, 15, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:52,140 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:52,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:52,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1974616521, now seen corresponding path program 1 times [2018-10-15 15:05:52,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:52,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1212 trivial. 0 not checked. [2018-10-15 15:05:52,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:52,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 15:05:52,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 15:05:52,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 15:05:52,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:05:52,480 INFO L87 Difference]: Start difference. First operand 294 states and 301 transitions. Second operand 6 states. [2018-10-15 15:05:52,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:52,731 INFO L93 Difference]: Finished difference Result 307 states and 314 transitions. [2018-10-15 15:05:52,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 15:05:52,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 293 [2018-10-15 15:05:52,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:52,734 INFO L225 Difference]: With dead ends: 307 [2018-10-15 15:05:52,735 INFO L226 Difference]: Without dead ends: 307 [2018-10-15 15:05:52,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:05:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-15 15:05:52,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 302. [2018-10-15 15:05:52,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-15 15:05:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 309 transitions. [2018-10-15 15:05:52,742 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 309 transitions. Word has length 293 [2018-10-15 15:05:52,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:52,742 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 309 transitions. [2018-10-15 15:05:52,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 15:05:52,743 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 309 transitions. [2018-10-15 15:05:52,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-15 15:05:52,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:52,745 INFO L375 BasicCegarLoop]: trace histogram [20, 15, 15, 15, 15, 15, 15, 15, 15, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:52,745 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:52,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:52,746 INFO L82 PathProgramCache]: Analyzing trace with hash 130388352, now seen corresponding path program 2 times [2018-10-15 15:05:52,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:53,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1224 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1212 trivial. 0 not checked. [2018-10-15 15:05:53,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:53,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 15:05:53,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:05:53,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:05:53,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:05:53,368 INFO L87 Difference]: Start difference. First operand 302 states and 309 transitions. Second operand 8 states. [2018-10-15 15:05:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:53,580 INFO L93 Difference]: Finished difference Result 315 states and 322 transitions. [2018-10-15 15:05:53,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 15:05:53,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 301 [2018-10-15 15:05:53,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:53,584 INFO L225 Difference]: With dead ends: 315 [2018-10-15 15:05:53,584 INFO L226 Difference]: Without dead ends: 315 [2018-10-15 15:05:53,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:05:53,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-15 15:05:53,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 310. [2018-10-15 15:05:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-15 15:05:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 317 transitions. [2018-10-15 15:05:53,591 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 317 transitions. Word has length 301 [2018-10-15 15:05:53,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:53,592 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 317 transitions. [2018-10-15 15:05:53,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:05:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 317 transitions. [2018-10-15 15:05:53,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-15 15:05:53,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:53,594 INFO L375 BasicCegarLoop]: trace histogram [20, 15, 15, 15, 15, 15, 15, 15, 15, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:53,594 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:53,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:53,595 INFO L82 PathProgramCache]: Analyzing trace with hash -234538441, now seen corresponding path program 3 times [2018-10-15 15:05:53,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:53,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2018-10-15 15:05:53,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:53,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:05:53,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:05:53,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:05:53,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:05:53,936 INFO L87 Difference]: Start difference. First operand 310 states and 317 transitions. Second operand 10 states. [2018-10-15 15:05:54,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:54,410 INFO L93 Difference]: Finished difference Result 321 states and 328 transitions. [2018-10-15 15:05:54,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 15:05:54,410 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 309 [2018-10-15 15:05:54,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:54,412 INFO L225 Difference]: With dead ends: 321 [2018-10-15 15:05:54,413 INFO L226 Difference]: Without dead ends: 321 [2018-10-15 15:05:54,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:05:54,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-10-15 15:05:54,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 317. [2018-10-15 15:05:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-15 15:05:54,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 324 transitions. [2018-10-15 15:05:54,419 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 324 transitions. Word has length 309 [2018-10-15 15:05:54,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:54,420 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 324 transitions. [2018-10-15 15:05:54,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:05:54,420 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 324 transitions. [2018-10-15 15:05:54,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-15 15:05:54,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:54,422 INFO L375 BasicCegarLoop]: trace histogram [20, 15, 15, 15, 15, 15, 15, 15, 15, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:54,422 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:54,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:54,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1767605291, now seen corresponding path program 4 times [2018-10-15 15:05:54,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2018-10-15 15:05:55,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:55,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 15:05:55,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 15:05:55,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 15:05:55,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:05:55,074 INFO L87 Difference]: Start difference. First operand 317 states and 324 transitions. Second operand 12 states. [2018-10-15 15:05:55,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:55,478 INFO L93 Difference]: Finished difference Result 324 states and 331 transitions. [2018-10-15 15:05:55,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 15:05:55,479 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 316 [2018-10-15 15:05:55,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:55,481 INFO L225 Difference]: With dead ends: 324 [2018-10-15 15:05:55,481 INFO L226 Difference]: Without dead ends: 324 [2018-10-15 15:05:55,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2018-10-15 15:05:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-15 15:05:55,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2018-10-15 15:05:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-10-15 15:05:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 331 transitions. [2018-10-15 15:05:55,487 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 331 transitions. Word has length 316 [2018-10-15 15:05:55,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:55,488 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 331 transitions. [2018-10-15 15:05:55,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 15:05:55,488 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 331 transitions. [2018-10-15 15:05:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-10-15 15:05:55,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:55,490 INFO L375 BasicCegarLoop]: trace histogram [20, 15, 15, 15, 15, 15, 15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:55,490 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:55,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:55,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1702638473, now seen corresponding path program 5 times [2018-10-15 15:05:55,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 496 proven. 240 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2018-10-15 15:05:56,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:56,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:05:56,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:05:56,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:05:56,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:05:56,022 INFO L87 Difference]: Start difference. First operand 324 states and 331 transitions. Second operand 10 states. [2018-10-15 15:05:56,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:56,341 INFO L93 Difference]: Finished difference Result 399 states and 406 transitions. [2018-10-15 15:05:56,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 15:05:56,342 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 323 [2018-10-15 15:05:56,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:56,345 INFO L225 Difference]: With dead ends: 399 [2018-10-15 15:05:56,345 INFO L226 Difference]: Without dead ends: 399 [2018-10-15 15:05:56,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:05:56,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-15 15:05:56,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 369. [2018-10-15 15:05:56,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-10-15 15:05:56,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 376 transitions. [2018-10-15 15:05:56,351 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 376 transitions. Word has length 323 [2018-10-15 15:05:56,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:56,352 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 376 transitions. [2018-10-15 15:05:56,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:05:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 376 transitions. [2018-10-15 15:05:56,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-10-15 15:05:56,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:56,354 INFO L375 BasicCegarLoop]: trace histogram [25, 20, 20, 20, 20, 20, 20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:56,355 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:56,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:56,355 INFO L82 PathProgramCache]: Analyzing trace with hash -914624248, now seen corresponding path program 6 times [2018-10-15 15:05:56,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2110 backedges. 788 proven. 446 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2018-10-15 15:05:57,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:57,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 15:05:57,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 15:05:57,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 15:05:57,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:05:57,207 INFO L87 Difference]: Start difference. First operand 369 states and 376 transitions. Second operand 12 states. [2018-10-15 15:05:57,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:57,589 INFO L93 Difference]: Finished difference Result 444 states and 451 transitions. [2018-10-15 15:05:57,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 15:05:57,590 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 368 [2018-10-15 15:05:57,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:57,592 INFO L225 Difference]: With dead ends: 444 [2018-10-15 15:05:57,592 INFO L226 Difference]: Without dead ends: 444 [2018-10-15 15:05:57,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2018-10-15 15:05:57,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-10-15 15:05:57,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 414. [2018-10-15 15:05:57,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-10-15 15:05:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 421 transitions. [2018-10-15 15:05:57,599 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 421 transitions. Word has length 368 [2018-10-15 15:05:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:57,600 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 421 transitions. [2018-10-15 15:05:57,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 15:05:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 421 transitions. [2018-10-15 15:05:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-10-15 15:05:57,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:57,602 INFO L375 BasicCegarLoop]: trace histogram [30, 25, 25, 25, 25, 25, 25, 25, 25, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:57,603 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:57,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:57,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1206166807, now seen corresponding path program 7 times [2018-10-15 15:05:57,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:58,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3150 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2018-10-15 15:05:58,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:58,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:05:58,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:05:58,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:05:58,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:05:58,820 INFO L87 Difference]: Start difference. First operand 414 states and 421 transitions. Second operand 10 states. [2018-10-15 15:06:00,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:00,908 INFO L93 Difference]: Finished difference Result 427 states and 434 transitions. [2018-10-15 15:06:00,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 15:06:00,908 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 413 [2018-10-15 15:06:00,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:00,912 INFO L225 Difference]: With dead ends: 427 [2018-10-15 15:06:00,912 INFO L226 Difference]: Without dead ends: 427 [2018-10-15 15:06:00,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:06:00,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-10-15 15:06:00,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 422. [2018-10-15 15:06:00,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-10-15 15:06:00,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 429 transitions. [2018-10-15 15:06:00,919 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 429 transitions. Word has length 413 [2018-10-15 15:06:00,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:00,920 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 429 transitions. [2018-10-15 15:06:00,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:06:00,920 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 429 transitions. [2018-10-15 15:06:00,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2018-10-15 15:06:00,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:00,923 INFO L375 BasicCegarLoop]: trace histogram [30, 25, 25, 25, 25, 25, 25, 25, 25, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:00,923 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:00,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:00,924 INFO L82 PathProgramCache]: Analyzing trace with hash 733923022, now seen corresponding path program 8 times [2018-10-15 15:06:00,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:01,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3176 backedges. 190 proven. 920 refuted. 0 times theorem prover too weak. 2066 trivial. 0 not checked. [2018-10-15 15:06:01,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:01,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 15:06:01,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 15:06:01,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 15:06:01,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:06:01,687 INFO L87 Difference]: Start difference. First operand 422 states and 429 transitions. Second operand 14 states. [2018-10-15 15:06:02,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:02,303 INFO L93 Difference]: Finished difference Result 497 states and 504 transitions. [2018-10-15 15:06:02,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 15:06:02,304 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 421 [2018-10-15 15:06:02,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:02,308 INFO L225 Difference]: With dead ends: 497 [2018-10-15 15:06:02,308 INFO L226 Difference]: Without dead ends: 497 [2018-10-15 15:06:02,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=271, Invalid=541, Unknown=0, NotChecked=0, Total=812 [2018-10-15 15:06:02,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-10-15 15:06:02,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 467. [2018-10-15 15:06:02,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-10-15 15:06:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 474 transitions. [2018-10-15 15:06:02,315 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 474 transitions. Word has length 421 [2018-10-15 15:06:02,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:02,316 INFO L481 AbstractCegarLoop]: Abstraction has 467 states and 474 transitions. [2018-10-15 15:06:02,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 15:06:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 474 transitions. [2018-10-15 15:06:02,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-10-15 15:06:02,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:02,319 INFO L375 BasicCegarLoop]: trace histogram [35, 30, 30, 30, 30, 30, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:02,319 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:02,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:02,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1789447711, now seen corresponding path program 9 times [2018-10-15 15:06:02,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4441 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 4385 trivial. 0 not checked. [2018-10-15 15:06:03,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:03,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 15:06:03,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 15:06:03,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 15:06:03,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:06:03,165 INFO L87 Difference]: Start difference. First operand 467 states and 474 transitions. Second operand 12 states. [2018-10-15 15:06:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:03,497 INFO L93 Difference]: Finished difference Result 480 states and 487 transitions. [2018-10-15 15:06:03,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 15:06:03,500 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 466 [2018-10-15 15:06:03,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:03,503 INFO L225 Difference]: With dead ends: 480 [2018-10-15 15:06:03,503 INFO L226 Difference]: Without dead ends: 480 [2018-10-15 15:06:03,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2018-10-15 15:06:03,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-10-15 15:06:03,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 475. [2018-10-15 15:06:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-10-15 15:06:03,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 482 transitions. [2018-10-15 15:06:03,510 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 482 transitions. Word has length 466 [2018-10-15 15:06:03,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:03,510 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 482 transitions. [2018-10-15 15:06:03,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 15:06:03,510 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 482 transitions. [2018-10-15 15:06:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-10-15 15:06:03,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:03,513 INFO L375 BasicCegarLoop]: trace histogram [35, 30, 30, 30, 30, 30, 30, 30, 30, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:03,514 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:03,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:03,514 INFO L82 PathProgramCache]: Analyzing trace with hash -496146474, now seen corresponding path program 10 times [2018-10-15 15:06:03,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4475 backedges. 1588 proven. 1047 refuted. 0 times theorem prover too weak. 1840 trivial. 0 not checked. [2018-10-15 15:06:04,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:04,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 15:06:04,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 15:06:04,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 15:06:04,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-10-15 15:06:04,305 INFO L87 Difference]: Start difference. First operand 475 states and 482 transitions. Second operand 16 states. [2018-10-15 15:06:04,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:04,723 INFO L93 Difference]: Finished difference Result 550 states and 557 transitions. [2018-10-15 15:06:04,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 15:06:04,725 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 474 [2018-10-15 15:06:04,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:04,727 INFO L225 Difference]: With dead ends: 550 [2018-10-15 15:06:04,727 INFO L226 Difference]: Without dead ends: 550 [2018-10-15 15:06:04,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=366, Invalid=756, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 15:06:04,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-10-15 15:06:04,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 520. [2018-10-15 15:06:04,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-15 15:06:04,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 527 transitions. [2018-10-15 15:06:04,734 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 527 transitions. Word has length 474 [2018-10-15 15:06:04,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:04,734 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 527 transitions. [2018-10-15 15:06:04,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 15:06:04,735 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 527 transitions. [2018-10-15 15:06:04,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-10-15 15:06:04,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:04,738 INFO L375 BasicCegarLoop]: trace histogram [40, 35, 35, 35, 35, 35, 35, 35, 35, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:04,738 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:04,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:04,739 INFO L82 PathProgramCache]: Analyzing trace with hash -205368795, now seen corresponding path program 11 times [2018-10-15 15:06:04,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:05,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 5875 trivial. 0 not checked. [2018-10-15 15:06:05,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:05,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 15:06:05,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 15:06:05,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 15:06:05,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:06:05,209 INFO L87 Difference]: Start difference. First operand 520 states and 527 transitions. Second operand 14 states. [2018-10-15 15:06:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:05,735 INFO L93 Difference]: Finished difference Result 533 states and 540 transitions. [2018-10-15 15:06:05,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 15:06:05,738 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 519 [2018-10-15 15:06:05,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:05,742 INFO L225 Difference]: With dead ends: 533 [2018-10-15 15:06:05,742 INFO L226 Difference]: Without dead ends: 533 [2018-10-15 15:06:05,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=271, Invalid=541, Unknown=0, NotChecked=0, Total=812 [2018-10-15 15:06:05,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-10-15 15:06:05,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 528. [2018-10-15 15:06:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-10-15 15:06:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 535 transitions. [2018-10-15 15:06:05,749 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 535 transitions. Word has length 519 [2018-10-15 15:06:05,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:05,750 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 535 transitions. [2018-10-15 15:06:05,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 15:06:05,750 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 535 transitions. [2018-10-15 15:06:05,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-10-15 15:06:05,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:05,754 INFO L375 BasicCegarLoop]: trace histogram [40, 35, 35, 35, 35, 35, 35, 35, 35, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:05,754 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:05,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:05,754 INFO L82 PathProgramCache]: Analyzing trace with hash 90015196, now seen corresponding path program 12 times [2018-10-15 15:06:05,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:06,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6007 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5993 trivial. 0 not checked. [2018-10-15 15:06:06,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:06:06,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-15 15:06:06,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:06:06,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:06:06,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:06:06,347 INFO L87 Difference]: Start difference. First operand 528 states and 535 transitions. Second operand 4 states. [2018-10-15 15:06:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:06,355 INFO L93 Difference]: Finished difference Result 75 states and 74 transitions. [2018-10-15 15:06:06,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:06:06,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 527 [2018-10-15 15:06:06,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:06,356 INFO L225 Difference]: With dead ends: 75 [2018-10-15 15:06:06,356 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 15:06:06,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:06:06,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 15:06:06,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 15:06:06,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 15:06:06,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 15:06:06,357 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 527 [2018-10-15 15:06:06,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:06,357 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 15:06:06,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:06:06,357 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 15:06:06,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 15:06:06,361 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:06:06 BoogieIcfgContainer [2018-10-15 15:06:06,361 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:06:06,362 INFO L168 Benchmark]: Toolchain (without parser) took 23787.96 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 406.8 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -333.3 MB). Peak memory consumption was 73.5 MB. Max. memory is 7.1 GB. [2018-10-15 15:06:06,363 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:06:06,364 INFO L168 Benchmark]: Boogie Preprocessor took 51.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:06:06,364 INFO L168 Benchmark]: RCFGBuilder took 887.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-15 15:06:06,365 INFO L168 Benchmark]: TraceAbstraction took 22845.54 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 406.8 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -365.0 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. [2018-10-15 15:06:06,369 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 887.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22845.54 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 406.8 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -365.0 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 116 locations, 1 error locations. SAFE Result, 22.7s OverallTime, 23 OverallIterations, 40 TraceHistogramMax, 10.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2327 SDtfs, 2235 SDslu, 11071 SDs, 0 SdLazy, 2484 SolverSat, 183 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 373 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1258 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=528occurred in iteration=22, 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.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 372 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 6428 NumberOfCodeBlocks, 6428 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 6405 ConstructedInterpolants, 0 QuantifiedInterpolants, 6028971 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 4 PerfectInterpolantSequences, 34973/38021 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/eureka_01.i_6.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-15_15-06-06-379.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/eureka_01.i_6.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-06-06-379.csv Received shutdown request...