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/20181010-MemSafetyPathprograms/960521-1_1_false-valid-free.i_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 20:44:21,298 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 20:44:21,300 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 20:44:21,314 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 20:44:21,314 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 20:44:21,315 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 20:44:21,316 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 20:44:21,318 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 20:44:21,320 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 20:44:21,321 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 20:44:21,322 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 20:44:21,322 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 20:44:21,324 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 20:44:21,325 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 20:44:21,326 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 20:44:21,327 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 20:44:21,328 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 20:44:21,330 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 20:44:21,332 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 20:44:21,334 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 20:44:21,335 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 20:44:21,337 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 20:44:21,339 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 20:44:21,340 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 20:44:21,340 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 20:44:21,341 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 20:44:21,342 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 20:44:21,343 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 20:44:21,344 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 20:44:21,345 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 20:44:21,346 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 20:44:21,346 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 20:44:21,347 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 20:44:21,347 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 20:44:21,348 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 20:44:21,349 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 20:44:21,349 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-12 20:44:21,368 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 20:44:21,368 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 20:44:21,370 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 20:44:21,370 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 20:44:21,371 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 20:44:21,371 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 20:44:21,372 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 20:44:21,372 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 20:44:21,372 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 20:44:21,372 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 20:44:21,373 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 20:44:21,373 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 20:44:21,373 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 20:44:21,375 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 20:44:21,375 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 20:44:21,446 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 20:44:21,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 20:44:21,470 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 20:44:21,472 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 20:44:21,473 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 20:44:21,474 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/960521-1_1_false-valid-free.i_11.bpl [2018-10-12 20:44:21,474 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/960521-1_1_false-valid-free.i_11.bpl' [2018-10-12 20:44:21,558 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 20:44:21,560 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-12 20:44:21,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 20:44:21,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 20:44:21,561 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 20:44:21,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:21" (1/1) ... [2018-10-12 20:44:21,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:21" (1/1) ... [2018-10-12 20:44:21,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:21" (1/1) ... [2018-10-12 20:44:21,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:21" (1/1) ... [2018-10-12 20:44:21,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:21" (1/1) ... [2018-10-12 20:44:21,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:21" (1/1) ... [2018-10-12 20:44:21,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:21" (1/1) ... [2018-10-12 20:44:21,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 20:44:21,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 20:44:21,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 20:44:21,638 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 20:44:21,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:21" (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-12 20:44:21,717 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 20:44:21,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 20:44:21,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 20:44:22,268 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 20:44:22,269 INFO L202 PluginConnector]: Adding new model 960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:44:22 BoogieIcfgContainer [2018-10-12 20:44:22,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 20:44:22,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 20:44:22,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 20:44:22,274 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 20:44:22,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:21" (1/2) ... [2018-10-12 20:44:22,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77058aa9 and model type 960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:44:22, skipping insertion in model container [2018-10-12 20:44:22,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:44:22" (2/2) ... [2018-10-12 20:44:22,278 INFO L112 eAbstractionObserver]: Analyzing ICFG 960521-1_1_false-valid-free.i_11.bpl [2018-10-12 20:44:22,288 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 20:44:22,297 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 20:44:22,316 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 20:44:22,346 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 20:44:22,347 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 20:44:22,347 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 20:44:22,347 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 20:44:22,347 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 20:44:22,348 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 20:44:22,348 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 20:44:22,348 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 20:44:22,348 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 20:44:22,368 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-10-12 20:44:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-12 20:44:22,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:22,379 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] [2018-10-12 20:44:22,381 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:22,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:22,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1460050407, now seen corresponding path program 1 times [2018-10-12 20:44:22,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:23,495 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-12 20:44:23,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 20:44:23,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-12 20:44:23,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-12 20:44:23,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-12 20:44:23,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-10-12 20:44:23,525 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 14 states. [2018-10-12 20:44:23,974 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-12 20:44:25,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:25,405 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2018-10-12 20:44:25,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-12 20:44:25,407 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2018-10-12 20:44:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:25,421 INFO L225 Difference]: With dead ends: 133 [2018-10-12 20:44:25,422 INFO L226 Difference]: Without dead ends: 133 [2018-10-12 20:44:25,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=213, Invalid=599, Unknown=0, NotChecked=0, Total=812 [2018-10-12 20:44:25,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-12 20:44:25,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2018-10-12 20:44:25,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-12 20:44:25,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-10-12 20:44:25,476 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 54 [2018-10-12 20:44:25,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:25,477 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-10-12 20:44:25,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-12 20:44:25,477 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-10-12 20:44:25,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-12 20:44:25,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:25,481 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-12 20:44:25,481 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:25,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:25,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1706373082, now seen corresponding path program 1 times [2018-10-12 20:44:25,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:25,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-12 20:44:25,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 20:44:25,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-12 20:44:25,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-12 20:44:25,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-12 20:44:25,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-10-12 20:44:25,981 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 14 states. [2018-10-12 20:44:27,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:27,029 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-10-12 20:44:27,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-12 20:44:27,029 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2018-10-12 20:44:27,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:27,033 INFO L225 Difference]: With dead ends: 121 [2018-10-12 20:44:27,034 INFO L226 Difference]: Without dead ends: 121 [2018-10-12 20:44:27,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2018-10-12 20:44:27,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-12 20:44:27,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 71. [2018-10-12 20:44:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-12 20:44:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-10-12 20:44:27,043 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 60 [2018-10-12 20:44:27,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:27,044 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-10-12 20:44:27,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-12 20:44:27,044 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-10-12 20:44:27,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-12 20:44:27,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:27,046 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-12 20:44:27,047 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:27,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:27,047 INFO L82 PathProgramCache]: Analyzing trace with hash 630589741, now seen corresponding path program 1 times [2018-10-12 20:44:27,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:27,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:27,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:27,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-12 20:44:27,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-12 20:44:27,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-12 20:44:27,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-12 20:44:27,169 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 6 states. [2018-10-12 20:44:27,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:27,294 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2018-10-12 20:44:27,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-12 20:44:27,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-10-12 20:44:27,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:27,297 INFO L225 Difference]: With dead ends: 126 [2018-10-12 20:44:27,298 INFO L226 Difference]: Without dead ends: 76 [2018-10-12 20:44:27,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-10-12 20:44:27,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-12 20:44:27,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2018-10-12 20:44:27,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-12 20:44:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-10-12 20:44:27,305 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 66 [2018-10-12 20:44:27,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:27,305 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-10-12 20:44:27,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-12 20:44:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-10-12 20:44:27,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-12 20:44:27,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:27,307 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-12 20:44:27,308 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:27,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:27,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1215056544, now seen corresponding path program 1 times [2018-10-12 20:44:27,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:27,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:27,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-12 20:44:27,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-12 20:44:27,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-12 20:44:27,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-10-12 20:44:27,748 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 19 states. [2018-10-12 20:44:29,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:29,352 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2018-10-12 20:44:29,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-12 20:44:29,353 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2018-10-12 20:44:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:29,354 INFO L225 Difference]: With dead ends: 98 [2018-10-12 20:44:29,354 INFO L226 Difference]: Without dead ends: 98 [2018-10-12 20:44:29,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=425, Invalid=1381, Unknown=0, NotChecked=0, Total=1806 [2018-10-12 20:44:29,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-12 20:44:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2018-10-12 20:44:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-12 20:44:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-10-12 20:44:29,363 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 72 [2018-10-12 20:44:29,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:29,363 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-10-12 20:44:29,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-12 20:44:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-10-12 20:44:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-12 20:44:29,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:29,365 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-10-12 20:44:29,366 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:29,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:29,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1734120346, now seen corresponding path program 2 times [2018-10-12 20:44:29,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:29,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:29,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 20:44:29,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 20:44:29,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 20:44:29,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-12 20:44:29,522 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 10 states. [2018-10-12 20:44:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:30,207 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2018-10-12 20:44:30,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-12 20:44:30,207 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2018-10-12 20:44:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:30,208 INFO L225 Difference]: With dead ends: 156 [2018-10-12 20:44:30,208 INFO L226 Difference]: Without dead ends: 94 [2018-10-12 20:44:30,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-10-12 20:44:30,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-12 20:44:30,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-10-12 20:44:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-12 20:44:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-10-12 20:44:30,217 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 84 [2018-10-12 20:44:30,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:30,218 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-10-12 20:44:30,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 20:44:30,218 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-10-12 20:44:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-12 20:44:30,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:30,219 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-10-12 20:44:30,220 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:30,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:30,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1739237607, now seen corresponding path program 3 times [2018-10-12 20:44:30,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:30,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:30,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-12 20:44:30,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-12 20:44:30,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-12 20:44:30,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2018-10-12 20:44:30,765 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 24 states. [2018-10-12 20:44:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:32,932 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2018-10-12 20:44:32,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-12 20:44:32,932 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2018-10-12 20:44:32,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:32,933 INFO L225 Difference]: With dead ends: 116 [2018-10-12 20:44:32,933 INFO L226 Difference]: Without dead ends: 116 [2018-10-12 20:44:32,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=561, Invalid=2195, Unknown=0, NotChecked=0, Total=2756 [2018-10-12 20:44:32,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-12 20:44:32,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2018-10-12 20:44:32,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-12 20:44:32,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-10-12 20:44:32,942 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 90 [2018-10-12 20:44:32,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:32,942 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-10-12 20:44:32,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-12 20:44:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-10-12 20:44:32,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-12 20:44:32,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:32,944 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-12 20:44:32,945 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:32,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:32,945 INFO L82 PathProgramCache]: Analyzing trace with hash 860392287, now seen corresponding path program 4 times [2018-10-12 20:44:32,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:33,134 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:33,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:33,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-12 20:44:33,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-12 20:44:33,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-12 20:44:33,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-10-12 20:44:33,136 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 14 states. [2018-10-12 20:44:33,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:33,565 INFO L93 Difference]: Finished difference Result 186 states and 187 transitions. [2018-10-12 20:44:33,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-12 20:44:33,566 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 102 [2018-10-12 20:44:33,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:33,567 INFO L225 Difference]: With dead ends: 186 [2018-10-12 20:44:33,567 INFO L226 Difference]: Without dead ends: 112 [2018-10-12 20:44:33,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2018-10-12 20:44:33,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-12 20:44:33,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-10-12 20:44:33,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-12 20:44:33,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-10-12 20:44:33,574 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 102 [2018-10-12 20:44:33,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:33,574 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-10-12 20:44:33,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-12 20:44:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-10-12 20:44:33,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-12 20:44:33,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:33,576 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2018-10-12 20:44:33,577 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:33,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:33,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1808380078, now seen corresponding path program 5 times [2018-10-12 20:44:33,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 24 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:34,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:34,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-12 20:44:34,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-12 20:44:34,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-12 20:44:34,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2018-10-12 20:44:34,221 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 28 states. [2018-10-12 20:44:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:36,729 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2018-10-12 20:44:36,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-12 20:44:36,730 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 108 [2018-10-12 20:44:36,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:36,731 INFO L225 Difference]: With dead ends: 134 [2018-10-12 20:44:36,731 INFO L226 Difference]: Without dead ends: 134 [2018-10-12 20:44:36,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=706, Invalid=3076, Unknown=0, NotChecked=0, Total=3782 [2018-10-12 20:44:36,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-12 20:44:36,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2018-10-12 20:44:36,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-12 20:44:36,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-10-12 20:44:36,737 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 108 [2018-10-12 20:44:36,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:36,738 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-10-12 20:44:36,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-12 20:44:36,738 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-10-12 20:44:36,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-12 20:44:36,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:36,740 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-10-12 20:44:36,740 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:36,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:36,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1755444760, now seen corresponding path program 6 times [2018-10-12 20:44:36,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 58 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:37,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:37,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-12 20:44:37,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-12 20:44:37,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-12 20:44:37,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-10-12 20:44:37,065 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 18 states. [2018-10-12 20:44:37,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:37,524 INFO L93 Difference]: Finished difference Result 216 states and 217 transitions. [2018-10-12 20:44:37,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-12 20:44:37,524 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 120 [2018-10-12 20:44:37,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:37,525 INFO L225 Difference]: With dead ends: 216 [2018-10-12 20:44:37,525 INFO L226 Difference]: Without dead ends: 130 [2018-10-12 20:44:37,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2018-10-12 20:44:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-12 20:44:37,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2018-10-12 20:44:37,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-12 20:44:37,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-10-12 20:44:37,531 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 120 [2018-10-12 20:44:37,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:37,531 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-10-12 20:44:37,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-12 20:44:37,531 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-10-12 20:44:37,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-12 20:44:37,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:37,533 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2018-10-12 20:44:37,533 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:37,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:37,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1233109835, now seen corresponding path program 7 times [2018-10-12 20:44:37,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 44 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:39,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:39,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-12 20:44:39,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-12 20:44:39,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-12 20:44:39,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2018-10-12 20:44:39,216 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 32 states. [2018-10-12 20:44:40,599 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-10-12 20:44:42,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:42,338 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2018-10-12 20:44:42,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-12 20:44:42,339 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 126 [2018-10-12 20:44:42,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:42,340 INFO L225 Difference]: With dead ends: 152 [2018-10-12 20:44:42,341 INFO L226 Difference]: Without dead ends: 152 [2018-10-12 20:44:42,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=867, Invalid=4103, Unknown=0, NotChecked=0, Total=4970 [2018-10-12 20:44:42,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-12 20:44:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 139. [2018-10-12 20:44:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-12 20:44:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-10-12 20:44:42,346 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 126 [2018-10-12 20:44:42,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:42,346 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-10-12 20:44:42,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-12 20:44:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-10-12 20:44:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-12 20:44:42,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:42,348 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-10-12 20:44:42,349 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:42,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:42,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1372077201, now seen corresponding path program 8 times [2018-10-12 20:44:42,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:42,801 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 100 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:42,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:42,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-12 20:44:42,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-12 20:44:42,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-12 20:44:42,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-10-12 20:44:42,803 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 22 states. [2018-10-12 20:44:43,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:43,404 INFO L93 Difference]: Finished difference Result 246 states and 247 transitions. [2018-10-12 20:44:43,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-12 20:44:43,405 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 138 [2018-10-12 20:44:43,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:43,406 INFO L225 Difference]: With dead ends: 246 [2018-10-12 20:44:43,406 INFO L226 Difference]: Without dead ends: 148 [2018-10-12 20:44:43,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=334, Invalid=1646, Unknown=0, NotChecked=0, Total=1980 [2018-10-12 20:44:43,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-12 20:44:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2018-10-12 20:44:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-12 20:44:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-10-12 20:44:43,411 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 138 [2018-10-12 20:44:43,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:43,412 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-10-12 20:44:43,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-12 20:44:43,412 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-10-12 20:44:43,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-12 20:44:43,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:43,414 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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] [2018-10-12 20:44:43,414 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:43,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:43,414 INFO L82 PathProgramCache]: Analyzing trace with hash -23182588, now seen corresponding path program 9 times [2018-10-12 20:44:43,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:44,167 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 70 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:44,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:44,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-12 20:44:44,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-12 20:44:44,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-12 20:44:44,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1147, Unknown=0, NotChecked=0, Total=1260 [2018-10-12 20:44:44,169 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 36 states. [2018-10-12 20:44:46,998 WARN L178 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-10-12 20:44:47,547 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-10-12 20:44:49,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:49,432 INFO L93 Difference]: Finished difference Result 170 states and 171 transitions. [2018-10-12 20:44:49,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-12 20:44:49,432 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 144 [2018-10-12 20:44:49,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:49,434 INFO L225 Difference]: With dead ends: 170 [2018-10-12 20:44:49,434 INFO L226 Difference]: Without dead ends: 170 [2018-10-12 20:44:49,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1044, Invalid=5276, Unknown=0, NotChecked=0, Total=6320 [2018-10-12 20:44:49,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-12 20:44:49,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2018-10-12 20:44:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-12 20:44:49,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-10-12 20:44:49,441 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 144 [2018-10-12 20:44:49,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:49,441 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-10-12 20:44:49,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-12 20:44:49,441 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-10-12 20:44:49,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-12 20:44:49,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:49,443 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-10-12 20:44:49,443 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:49,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:49,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1496322358, now seen corresponding path program 10 times [2018-10-12 20:44:49,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:49,814 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 154 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:49,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:49,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-12 20:44:49,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-12 20:44:49,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-12 20:44:49,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2018-10-12 20:44:49,816 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 26 states. [2018-10-12 20:44:50,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:50,926 INFO L93 Difference]: Finished difference Result 276 states and 277 transitions. [2018-10-12 20:44:50,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-12 20:44:50,927 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 156 [2018-10-12 20:44:50,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:50,930 INFO L225 Difference]: With dead ends: 276 [2018-10-12 20:44:50,930 INFO L226 Difference]: Without dead ends: 166 [2018-10-12 20:44:50,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=471, Invalid=2391, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 20:44:50,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-12 20:44:50,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2018-10-12 20:44:50,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-12 20:44:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-10-12 20:44:50,935 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 156 [2018-10-12 20:44:50,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:50,936 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-10-12 20:44:50,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-12 20:44:50,936 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-10-12 20:44:50,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-12 20:44:50,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:50,937 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:44:50,938 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:50,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:50,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1811570301, now seen corresponding path program 11 times [2018-10-12 20:44:50,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 102 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:51,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:51,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-12 20:44:51,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-12 20:44:51,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-12 20:44:51,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1556, Unknown=0, NotChecked=0, Total=1722 [2018-10-12 20:44:51,959 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 42 states. [2018-10-12 20:44:54,295 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-10-12 20:44:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:57,203 INFO L93 Difference]: Finished difference Result 188 states and 189 transitions. [2018-10-12 20:44:57,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-12 20:44:57,204 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 162 [2018-10-12 20:44:57,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:57,206 INFO L225 Difference]: With dead ends: 188 [2018-10-12 20:44:57,206 INFO L226 Difference]: Without dead ends: 188 [2018-10-12 20:44:57,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2068 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1686, Invalid=7244, Unknown=0, NotChecked=0, Total=8930 [2018-10-12 20:44:57,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-12 20:44:57,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2018-10-12 20:44:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-12 20:44:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-10-12 20:44:57,214 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 162 [2018-10-12 20:44:57,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:57,215 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-10-12 20:44:57,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-12 20:44:57,215 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-10-12 20:44:57,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-12 20:44:57,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:57,216 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:44:57,216 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:57,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:57,217 INFO L82 PathProgramCache]: Analyzing trace with hash 2009701571, now seen corresponding path program 12 times [2018-10-12 20:44:57,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:57,796 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 220 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:57,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:57,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-12 20:44:57,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-12 20:44:57,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-12 20:44:57,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2018-10-12 20:44:57,798 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 30 states. [2018-10-12 20:44:58,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:58,703 INFO L93 Difference]: Finished difference Result 306 states and 307 transitions. [2018-10-12 20:44:58,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-12 20:44:58,703 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 174 [2018-10-12 20:44:58,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:58,705 INFO L225 Difference]: With dead ends: 306 [2018-10-12 20:44:58,705 INFO L226 Difference]: Without dead ends: 184 [2018-10-12 20:44:58,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=632, Invalid=3274, Unknown=0, NotChecked=0, Total=3906 [2018-10-12 20:44:58,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-12 20:44:58,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-10-12 20:44:58,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-12 20:44:58,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-10-12 20:44:58,711 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 174 [2018-10-12 20:44:58,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:58,711 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-10-12 20:44:58,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-12 20:44:58,711 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-10-12 20:44:58,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-12 20:44:58,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:58,712 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:44:58,712 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:58,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:58,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1258773066, now seen corresponding path program 13 times [2018-10-12 20:44:58,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 140 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:00,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:00,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-12 20:45:00,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-12 20:45:00,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-12 20:45:00,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1883, Unknown=0, NotChecked=0, Total=2070 [2018-10-12 20:45:00,116 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 46 states. [2018-10-12 20:45:01,947 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2018-10-12 20:45:02,135 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2018-10-12 20:45:05,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:05,464 INFO L93 Difference]: Finished difference Result 206 states and 207 transitions. [2018-10-12 20:45:05,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-12 20:45:05,465 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 180 [2018-10-12 20:45:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:05,466 INFO L225 Difference]: With dead ends: 206 [2018-10-12 20:45:05,467 INFO L226 Difference]: Without dead ends: 206 [2018-10-12 20:45:05,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2473 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1880, Invalid=8626, Unknown=0, NotChecked=0, Total=10506 [2018-10-12 20:45:05,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-12 20:45:05,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 193. [2018-10-12 20:45:05,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-12 20:45:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-10-12 20:45:05,474 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 180 [2018-10-12 20:45:05,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:05,474 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-10-12 20:45:05,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-12 20:45:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-10-12 20:45:05,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-12 20:45:05,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:05,476 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:45:05,476 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:05,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:05,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1514023300, now seen corresponding path program 14 times [2018-10-12 20:45:05,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 298 proven. 218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:06,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:06,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-12 20:45:06,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-12 20:45:06,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-12 20:45:06,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2018-10-12 20:45:06,252 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 34 states. [2018-10-12 20:45:07,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:07,481 INFO L93 Difference]: Finished difference Result 336 states and 337 transitions. [2018-10-12 20:45:07,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-12 20:45:07,482 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 192 [2018-10-12 20:45:07,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:07,484 INFO L225 Difference]: With dead ends: 336 [2018-10-12 20:45:07,484 INFO L226 Difference]: Without dead ends: 202 [2018-10-12 20:45:07,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=817, Invalid=4295, Unknown=0, NotChecked=0, Total=5112 [2018-10-12 20:45:07,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-12 20:45:07,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2018-10-12 20:45:07,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-12 20:45:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-10-12 20:45:07,490 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 192 [2018-10-12 20:45:07,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:07,490 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-10-12 20:45:07,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-12 20:45:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-10-12 20:45:07,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-12 20:45:07,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:07,491 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:45:07,492 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:07,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:07,492 INFO L82 PathProgramCache]: Analyzing trace with hash 553232559, now seen corresponding path program 15 times [2018-10-12 20:45:07,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 184 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:08,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:08,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-12 20:45:08,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-12 20:45:08,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-12 20:45:08,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=2212, Unknown=0, NotChecked=0, Total=2450 [2018-10-12 20:45:08,613 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 50 states. [2018-10-12 20:45:11,453 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-10-12 20:45:11,884 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-10-12 20:45:12,462 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-10-12 20:45:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:14,937 INFO L93 Difference]: Finished difference Result 224 states and 225 transitions. [2018-10-12 20:45:14,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-12 20:45:14,940 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 198 [2018-10-12 20:45:14,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:14,942 INFO L225 Difference]: With dead ends: 224 [2018-10-12 20:45:14,942 INFO L226 Difference]: Without dead ends: 224 [2018-10-12 20:45:14,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3183 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2435, Invalid=10675, Unknown=0, NotChecked=0, Total=13110 [2018-10-12 20:45:14,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-12 20:45:14,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 211. [2018-10-12 20:45:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-12 20:45:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-10-12 20:45:14,947 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 198 [2018-10-12 20:45:14,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:14,948 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-10-12 20:45:14,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-12 20:45:14,948 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-10-12 20:45:14,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-12 20:45:14,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:14,950 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:45:14,950 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:14,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:14,950 INFO L82 PathProgramCache]: Analyzing trace with hash 465644533, now seen corresponding path program 16 times [2018-10-12 20:45:14,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 388 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:15,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:15,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-12 20:45:15,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-12 20:45:15,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-12 20:45:15,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1203, Unknown=0, NotChecked=0, Total=1406 [2018-10-12 20:45:15,586 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 38 states. [2018-10-12 20:45:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:17,382 INFO L93 Difference]: Finished difference Result 366 states and 367 transitions. [2018-10-12 20:45:17,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-12 20:45:17,382 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 210 [2018-10-12 20:45:17,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:17,383 INFO L225 Difference]: With dead ends: 366 [2018-10-12 20:45:17,383 INFO L226 Difference]: Without dead ends: 220 [2018-10-12 20:45:17,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1026, Invalid=5454, Unknown=0, NotChecked=0, Total=6480 [2018-10-12 20:45:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-12 20:45:17,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2018-10-12 20:45:17,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-12 20:45:17,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-10-12 20:45:17,389 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 210 [2018-10-12 20:45:17,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:17,389 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-10-12 20:45:17,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-12 20:45:17,389 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-10-12 20:45:17,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-12 20:45:17,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:17,391 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:45:17,391 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:17,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:17,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1806043288, now seen corresponding path program 17 times [2018-10-12 20:45:17,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:18,372 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 272 proven. 98 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2018-10-12 20:45:18,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:18,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-12 20:45:18,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-12 20:45:18,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-12 20:45:18,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-10-12 20:45:18,373 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 24 states. [2018-10-12 20:45:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:21,145 INFO L93 Difference]: Finished difference Result 215 states and 216 transitions. [2018-10-12 20:45:21,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-12 20:45:21,146 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 216 [2018-10-12 20:45:21,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:21,147 INFO L225 Difference]: With dead ends: 215 [2018-10-12 20:45:21,147 INFO L226 Difference]: Without dead ends: 0 [2018-10-12 20:45:21,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=849, Invalid=2457, Unknown=0, NotChecked=0, Total=3306 [2018-10-12 20:45:21,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-12 20:45:21,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-12 20:45:21,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-12 20:45:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-12 20:45:21,149 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 216 [2018-10-12 20:45:21,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:21,150 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-12 20:45:21,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-12 20:45:21,150 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-12 20:45:21,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-12 20:45:21,156 INFO L202 PluginConnector]: Adding new model 960521-1_1_false-valid-free.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 08:45:21 BoogieIcfgContainer [2018-10-12 20:45:21,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-12 20:45:21,157 INFO L168 Benchmark]: Toolchain (without parser) took 59598.48 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 503.8 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -88.2 MB). Peak memory consumption was 415.6 MB. Max. memory is 7.1 GB. [2018-10-12 20:45:21,159 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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-12 20:45:21,159 INFO L168 Benchmark]: Boogie Preprocessor took 76.10 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-12 20:45:21,160 INFO L168 Benchmark]: RCFGBuilder took 631.74 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-12 20:45:21,160 INFO L168 Benchmark]: TraceAbstraction took 58885.74 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 503.8 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -119.9 MB). Peak memory consumption was 383.9 MB. Max. memory is 7.1 GB. [2018-10-12 20:45:21,164 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 76.10 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 631.74 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 58885.74 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 503.8 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -119.9 MB). Peak memory consumption was 383.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 134]: 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, 68 locations, 1 error locations. SAFE Result, 58.8s OverallTime, 20 OverallIterations, 10 TraceHistogramMax, 44.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1410 SDtfs, 12261 SDslu, 16485 SDs, 0 SdLazy, 13076 SolverSat, 1411 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1162 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17768 ImplicationChecksByTransitivity, 40.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=19, 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, 20 MinimizatonAttempts, 204 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 2652 NumberOfCodeBlocks, 2652 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2632 ConstructedInterpolants, 0 QuantifiedInterpolants, 2781235 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 2451/4718 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/960521-1_1_false-valid-free.i_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-12_20-45-21-175.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-12_20-45-21-175.csv Received shutdown request...