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 -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:26:34,228 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:26:34,230 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:26:34,242 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:26:34,242 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:26:34,243 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:26:34,246 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:26:34,248 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:26:34,250 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:26:34,250 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:26:34,251 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:26:34,252 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:26:34,253 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:26:34,253 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:26:34,255 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:26:34,255 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:26:34,256 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:26:34,258 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:26:34,260 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:26:34,262 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:26:34,263 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:26:34,264 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:26:34,266 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:26:34,267 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:26:34,267 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:26:34,268 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:26:34,269 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:26:34,270 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:26:34,271 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:26:34,272 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:26:34,272 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:26:34,273 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:26:34,273 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:26:34,273 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:26:34,274 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:26:34,275 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:26:34,275 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:26:34,283 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:26:34,284 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:26:34,285 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:26:34,285 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:26:34,285 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:26:34,286 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:26:34,286 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:26:34,286 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:26:34,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:26:34,347 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:26:34,351 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:26:34,353 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:26:34,354 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:26:34,354 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl [2018-09-26 08:26:34,355 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl' [2018-09-26 08:26:34,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:26:34,405 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:26:34,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:26:34,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:26:34,406 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:26:34,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:34" (1/1) ... [2018-09-26 08:26:34,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:34" (1/1) ... [2018-09-26 08:26:34,448 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:26:34,448 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:26:34,448 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:26:34,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:26:34,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:26:34,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:26:34,452 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:26:34,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:34" (1/1) ... [2018-09-26 08:26:34,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:34" (1/1) ... [2018-09-26 08:26:34,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:34" (1/1) ... [2018-09-26 08:26:34,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:34" (1/1) ... [2018-09-26 08:26:34,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:34" (1/1) ... [2018-09-26 08:26:34,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:34" (1/1) ... [2018-09-26 08:26:34,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:34" (1/1) ... [2018-09-26 08:26:34,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:26:34,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:26:34,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:26:34,473 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:26:34,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:34" (1/1) ... [2018-09-26 08:26:34,557 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-26 08:26:34,557 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-26 08:26:34,558 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-26 08:26:34,702 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:26:34,703 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:26:34 BoogieIcfgContainer [2018-09-26 08:26:34,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:26:34,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:26:34,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:26:34,708 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:26:34,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:26:34" (1/2) ... [2018-09-26 08:26:34,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@246794e0 and model type GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:26:34, skipping insertion in model container [2018-09-26 08:26:34,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:26:34" (2/2) ... [2018-09-26 08:26:34,713 INFO L112 eAbstractionObserver]: Analyzing ICFG GeometricalCake.bpl [2018-09-26 08:26:34,724 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:26:34,732 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:26:34,789 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:26:34,790 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:26:34,790 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:26:34,790 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:26:34,791 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:26:34,791 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:26:34,791 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:26:34,792 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:26:34,793 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:26:34,809 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2018-09-26 08:26:34,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-09-26 08:26:34,820 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:34,821 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-09-26 08:26:34,822 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:34,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:34,832 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-09-26 08:26:34,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:34,907 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:26:34,908 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-26 08:26:34,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:26:34,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:26:34,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:26:34,932 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2018-09-26 08:26:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:34,963 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-09-26 08:26:34,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:26:34,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-09-26 08:26:34,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:34,976 INFO L225 Difference]: With dead ends: 7 [2018-09-26 08:26:34,977 INFO L226 Difference]: Without dead ends: 4 [2018-09-26 08:26:34,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:26:35,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-09-26 08:26:35,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-09-26 08:26:35,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-09-26 08:26:35,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-09-26 08:26:35,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-09-26 08:26:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:35,022 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-09-26 08:26:35,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:26:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-09-26 08:26:35,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 08:26:35,024 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:35,024 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 08:26:35,024 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:35,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:35,025 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-09-26 08:26:35,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:35,051 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:35,051 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2018-09-26 08:26:35,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:26:35,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:26:35,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:26:35,054 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-09-26 08:26:35,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:35,084 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-09-26 08:26:35,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:26:35,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-09-26 08:26:35,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:35,085 INFO L225 Difference]: With dead ends: 6 [2018-09-26 08:26:35,085 INFO L226 Difference]: Without dead ends: 5 [2018-09-26 08:26:35,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:26:35,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-26 08:26:35,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-26 08:26:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-26 08:26:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-26 08:26:35,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-26 08:26:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:35,090 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-26 08:26:35,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:26:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-26 08:26:35,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:26:35,091 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:35,092 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-09-26 08:26:35,092 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:35,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:35,092 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-09-26 08:26:35,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:35,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:35,152 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:35,153 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:26:35,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:26:35,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:26:35,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:26:35,156 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-09-26 08:26:35,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:35,251 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-09-26 08:26:35,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:26:35,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-26 08:26:35,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:35,252 INFO L225 Difference]: With dead ends: 7 [2018-09-26 08:26:35,252 INFO L226 Difference]: Without dead ends: 6 [2018-09-26 08:26:35,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:26:35,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-26 08:26:35,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-26 08:26:35,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 08:26:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-26 08:26:35,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-26 08:26:35,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:35,258 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-26 08:26:35,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:26:35,258 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-26 08:26:35,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:26:35,259 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:35,260 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-09-26 08:26:35,260 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:35,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:35,261 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-09-26 08:26:35,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:35,324 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:35,324 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:26:35,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:26:35,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:26:35,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:26:35,326 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-09-26 08:26:35,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:35,469 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-26 08:26:35,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:26:35,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-26 08:26:35,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:35,471 INFO L225 Difference]: With dead ends: 8 [2018-09-26 08:26:35,471 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:26:35,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:26:35,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:26:35,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:26:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:26:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:26:35,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-26 08:26:35,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:35,481 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:26:35,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:26:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:26:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:26:35,485 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:35,485 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-09-26 08:26:35,486 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:35,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:35,486 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-09-26 08:26:35,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:35,563 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:35,563 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:35,563 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:26:35,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:26:35,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:26:35,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:26:35,565 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-09-26 08:26:35,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:35,702 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:26:35,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:26:35,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:26:35,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:35,703 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:26:35,704 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:26:35,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:26:35,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:26:35,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:26:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:26:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 08:26:35,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-26 08:26:35,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:35,724 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 08:26:35,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:26:35,724 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 08:26:35,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:26:35,725 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:35,725 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-09-26 08:26:35,725 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:35,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:35,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-09-26 08:26:35,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:35,783 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:35,783 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:35,783 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:26:35,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:26:35,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:26:35,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:26:35,785 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-09-26 08:26:35,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:35,876 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-26 08:26:35,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:26:35,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:26:35,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:35,877 INFO L225 Difference]: With dead ends: 10 [2018-09-26 08:26:35,877 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:26:35,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:26:35,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:26:35,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:26:35,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:26:35,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:26:35,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-26 08:26:35,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:35,884 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:26:35,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:26:35,884 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:26:35,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:26:35,885 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:35,885 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-09-26 08:26:35,885 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:35,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:35,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-09-26 08:26:35,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:35,962 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:35,962 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:35,963 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:26:35,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:26:35,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:26:35,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:26:35,967 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-09-26 08:26:36,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:36,119 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:26:36,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:26:36,119 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-09-26 08:26:36,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:36,120 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:26:36,120 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:26:36,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:26:36,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:26:36,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-26 08:26:36,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:26:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-26 08:26:36,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-09-26 08:26:36,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:36,133 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-26 08:26:36,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:26:36,133 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-26 08:26:36,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:26:36,134 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:36,135 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-09-26 08:26:36,135 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:36,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:36,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-09-26 08:26:36,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:36,200 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:36,201 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:36,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:26:36,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:26:36,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:26:36,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:26:36,203 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-09-26 08:26:36,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:36,398 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-26 08:26:36,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:26:36,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-09-26 08:26:36,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:36,399 INFO L225 Difference]: With dead ends: 12 [2018-09-26 08:26:36,399 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:26:36,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:26:36,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:26:36,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:26:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:26:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:26:36,409 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-09-26 08:26:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:36,410 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:26:36,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:26:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:26:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:26:36,411 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:36,411 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-09-26 08:26:36,414 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:36,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:36,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-09-26 08:26:36,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:36,484 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:36,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:26:36,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:26:36,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:26:36,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:26:36,486 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-09-26 08:26:36,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:36,713 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:26:36,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:26:36,713 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-09-26 08:26:36,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:36,714 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:26:36,714 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:26:36,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:26:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:26:36,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 08:26:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:26:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-26 08:26:36,726 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-26 08:26:36,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:36,726 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-26 08:26:36,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:26:36,726 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-26 08:26:36,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:26:36,727 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:36,727 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-09-26 08:26:36,732 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:36,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:36,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-09-26 08:26:36,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:36,827 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:36,827 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:26:36,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:26:36,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:26:36,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:26:36,828 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-09-26 08:26:37,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:37,148 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 08:26:37,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:26:37,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-09-26 08:26:37,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:37,150 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:26:37,150 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:26:37,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:26:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:26:37,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:26:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:26:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:26:37,158 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-09-26 08:26:37,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:37,160 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:26:37,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:26:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:26:37,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:26:37,161 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:37,161 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-09-26 08:26:37,161 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:37,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:37,162 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-09-26 08:26:37,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:37,261 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:37,262 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:37,262 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:26:37,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:26:37,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:26:37,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:26:37,265 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-09-26 08:26:37,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:37,609 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:26:37,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:26:37,610 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-09-26 08:26:37,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:37,611 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:26:37,611 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:26:37,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:26:37,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:26:37,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 08:26:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:26:37,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-26 08:26:37,622 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-09-26 08:26:37,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:37,622 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-26 08:26:37,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:26:37,623 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-26 08:26:37,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:26:37,623 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:37,625 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-09-26 08:26:37,625 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:37,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:37,625 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-09-26 08:26:37,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:37,735 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:37,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:26:37,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:26:37,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:26:37,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:26:37,736 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-09-26 08:26:38,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:38,150 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-26 08:26:38,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:26:38,150 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-26 08:26:38,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:38,151 INFO L225 Difference]: With dead ends: 16 [2018-09-26 08:26:38,151 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:26:38,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:26:38,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:26:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:26:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:26:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:26:38,160 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-09-26 08:26:38,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:38,162 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:26:38,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:26:38,162 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:26:38,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:26:38,163 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:38,163 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-09-26 08:26:38,164 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:38,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:38,164 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-09-26 08:26:38,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:38,308 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:38,308 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:26:38,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:26:38,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:26:38,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:26:38,310 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-09-26 08:26:38,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:38,793 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:26:38,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:26:38,794 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-09-26 08:26:38,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:38,794 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:26:38,795 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:26:38,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:26:38,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:26:38,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:26:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:26:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-26 08:26:38,809 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-09-26 08:26:38,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:38,810 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-26 08:26:38,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:26:38,810 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-26 08:26:38,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:26:38,811 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:38,811 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-09-26 08:26:38,812 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:38,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:38,812 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-09-26 08:26:38,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:38,996 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:38,996 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:26:38,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:26:38,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:26:38,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:26:38,998 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-09-26 08:26:39,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:39,567 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-26 08:26:39,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:26:39,567 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-09-26 08:26:39,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:39,568 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:26:39,568 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:26:39,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=575, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:26:39,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:26:39,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:26:39,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:26:39,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:26:39,577 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-09-26 08:26:39,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:39,577 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:26:39,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:26:39,578 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:26:39,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:26:39,578 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:39,579 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-09-26 08:26:39,579 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:39,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:39,579 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-09-26 08:26:39,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:39,742 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:39,743 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:26:39,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:26:39,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:26:39,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:26:39,745 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-09-26 08:26:40,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:40,473 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 08:26:40,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:26:40,474 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-26 08:26:40,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:40,475 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:26:40,475 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 08:26:40,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=269, Invalid=661, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:26:40,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 08:26:40,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-26 08:26:40,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 08:26:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-26 08:26:40,485 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-09-26 08:26:40,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:40,485 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-26 08:26:40,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:26:40,487 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-26 08:26:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:26:40,488 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:40,488 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-09-26 08:26:40,488 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:40,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:40,489 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-09-26 08:26:40,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:40,666 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:40,669 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:26:40,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:26:40,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:26:40,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:26:40,671 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-09-26 08:26:41,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:41,528 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-26 08:26:41,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:26:41,528 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-09-26 08:26:41,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:41,529 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:26:41,529 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:26:41,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=303, Invalid=753, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:26:41,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:26:41,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:26:41,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:26:41,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-26 08:26:41,538 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-09-26 08:26:41,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:41,538 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-26 08:26:41,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:26:41,538 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-26 08:26:41,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:26:41,539 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:41,539 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-09-26 08:26:41,539 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:41,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:41,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-09-26 08:26:41,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:41,749 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:41,749 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:41,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:26:41,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:26:41,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:26:41,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:26:41,752 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-09-26 08:26:42,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:42,937 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-26 08:26:42,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:26:42,937 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-09-26 08:26:42,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:42,937 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:26:42,938 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:26:42,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=339, Invalid=851, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:26:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:26:42,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 08:26:42,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:26:42,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-26 08:26:42,952 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-09-26 08:26:42,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:42,952 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-26 08:26:42,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:26:42,960 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-26 08:26:42,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:26:42,963 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:42,963 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-09-26 08:26:42,963 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:42,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:42,964 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-09-26 08:26:42,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:43,183 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:43,183 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:43,183 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:26:43,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:26:43,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:26:43,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:26:43,187 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-09-26 08:26:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:44,448 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-26 08:26:44,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:26:44,448 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-09-26 08:26:44,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:44,449 INFO L225 Difference]: With dead ends: 22 [2018-09-26 08:26:44,449 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:26:44,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=377, Invalid=955, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:26:44,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:26:44,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:26:44,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:26:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 08:26:44,469 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-09-26 08:26:44,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:44,469 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 08:26:44,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:26:44,469 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 08:26:44,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:26:44,470 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:44,470 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-09-26 08:26:44,470 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:44,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:44,471 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-09-26 08:26:44,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:44,747 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:44,747 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:44,747 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:26:44,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:26:44,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:26:44,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:26:44,750 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-09-26 08:26:46,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:46,430 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 08:26:46,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:26:46,430 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-09-26 08:26:46,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:46,431 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:26:46,431 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 08:26:46,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=417, Invalid=1065, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:26:46,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 08:26:46,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-26 08:26:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:26:46,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-26 08:26:46,445 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-09-26 08:26:46,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:46,445 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-26 08:26:46,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:26:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-26 08:26:46,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:26:46,451 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:46,451 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-09-26 08:26:46,451 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:46,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:46,452 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-09-26 08:26:46,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:46,751 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:46,751 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:46,751 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:26:46,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:26:46,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:26:46,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:26:46,753 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-09-26 08:26:48,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:48,509 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-26 08:26:48,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:26:48,509 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-09-26 08:26:48,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:48,510 INFO L225 Difference]: With dead ends: 24 [2018-09-26 08:26:48,510 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:26:48,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=459, Invalid=1181, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:26:48,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:26:48,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:26:48,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:26:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:26:48,519 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-09-26 08:26:48,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:48,519 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:26:48,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:26:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:26:48,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:26:48,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:48,520 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-09-26 08:26:48,521 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:48,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:48,521 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-09-26 08:26:48,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:48,757 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:48,757 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:48,757 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:26:48,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:26:48,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:26:48,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:26:48,758 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-09-26 08:26:50,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:50,276 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-26 08:26:50,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:26:50,277 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-09-26 08:26:50,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:50,277 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:26:50,278 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 08:26:50,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=503, Invalid=1303, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:26:50,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 08:26:50,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-26 08:26:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 08:26:50,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-26 08:26:50,289 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-09-26 08:26:50,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:50,289 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-26 08:26:50,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:26:50,290 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-26 08:26:50,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:26:50,290 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:50,291 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-09-26 08:26:50,291 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:50,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:50,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-09-26 08:26:50,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:50,619 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:50,619 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:26:50,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:26:50,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:26:50,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:26:50,620 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-09-26 08:26:52,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:52,360 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-26 08:26:52,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:26:52,360 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-09-26 08:26:52,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:52,361 INFO L225 Difference]: With dead ends: 26 [2018-09-26 08:26:52,361 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:26:52,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=549, Invalid=1431, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:26:52,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:26:52,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:26:52,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:26:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 08:26:52,372 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-09-26 08:26:52,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:52,372 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 08:26:52,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:26:52,372 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 08:26:52,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:26:52,373 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:52,373 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-09-26 08:26:52,373 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:52,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:52,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-09-26 08:26:52,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:52,697 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:52,697 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:26:52,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:26:52,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:26:52,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:26:52,698 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-09-26 08:26:54,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:54,934 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 08:26:54,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:26:54,935 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-09-26 08:26:54,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:54,935 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:26:54,935 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 08:26:54,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=597, Invalid=1565, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:26:54,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 08:26:54,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-26 08:26:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 08:26:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-26 08:26:54,944 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-09-26 08:26:54,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:54,944 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-26 08:26:54,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:26:54,944 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-26 08:26:54,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:26:54,944 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:54,944 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-09-26 08:26:54,945 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:54,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:54,945 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-09-26 08:26:54,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:55,263 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:55,263 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:26:55,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:26:55,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:26:55,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:26:55,265 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-09-26 08:26:57,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:57,551 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-26 08:26:57,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:26:57,552 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-09-26 08:26:57,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:57,552 INFO L225 Difference]: With dead ends: 28 [2018-09-26 08:26:57,552 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:26:57,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=647, Invalid=1705, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:26:57,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:26:57,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:26:57,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:26:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 08:26:57,562 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-09-26 08:26:57,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:57,562 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 08:26:57,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:26:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 08:26:57,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:26:57,563 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:57,563 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-09-26 08:26:57,563 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:57,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:57,563 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-09-26 08:26:57,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:57,918 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:57,918 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:26:57,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:26:57,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:26:57,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:26:57,919 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-09-26 08:27:00,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:00,672 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-26 08:27:00,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:27:00,672 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-09-26 08:27:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:00,673 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:27:00,673 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 08:27:00,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=699, Invalid=1851, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:27:00,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 08:27:00,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-09-26 08:27:00,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-26 08:27:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-09-26 08:27:00,683 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-09-26 08:27:00,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:00,684 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-09-26 08:27:00,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:27:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-09-26 08:27:00,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 08:27:00,685 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:00,685 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-09-26 08:27:00,685 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:00,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:00,685 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-09-26 08:27:00,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:01,037 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:01,037 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:27:01,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:27:01,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:27:01,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:27:01,038 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-09-26 08:27:04,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:04,094 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-26 08:27:04,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:27:04,094 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-09-26 08:27:04,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:04,095 INFO L225 Difference]: With dead ends: 30 [2018-09-26 08:27:04,095 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:27:04,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=753, Invalid=2003, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:27:04,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:27:04,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:27:04,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:27:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:27:04,105 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-09-26 08:27:04,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:04,105 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:27:04,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:27:04,106 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:27:04,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:27:04,106 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:04,106 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-09-26 08:27:04,107 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:04,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:04,107 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-09-26 08:27:04,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:04,487 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:04,487 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:27:04,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:27:04,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:27:04,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:27:04,488 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-09-26 08:27:08,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:08,467 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 08:27:08,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:27:08,467 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-09-26 08:27:08,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:08,467 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:27:08,468 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 08:27:08,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=809, Invalid=2161, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:27:08,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 08:27:08,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-26 08:27:08,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 08:27:08,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-26 08:27:08,478 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-09-26 08:27:08,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:08,479 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-26 08:27:08,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:27:08,479 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-26 08:27:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:27:08,479 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:08,479 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-09-26 08:27:08,480 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:08,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:08,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-09-26 08:27:08,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:09,009 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:09,010 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:27:09,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:27:09,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:27:09,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:27:09,011 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-09-26 08:27:09,130 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-09-26 08:27:13,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:13,423 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-26 08:27:13,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:27:13,423 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-09-26 08:27:13,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:13,424 INFO L225 Difference]: With dead ends: 32 [2018-09-26 08:27:13,424 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:27:13,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=867, Invalid=2325, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:27:13,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:27:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:27:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:27:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 08:27:13,437 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-09-26 08:27:13,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:13,437 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 08:27:13,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:27:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 08:27:13,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:27:13,438 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:13,438 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-09-26 08:27:13,438 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:13,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:13,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-09-26 08:27:13,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:13,918 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:13,919 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:13,919 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:27:13,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:27:13,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:27:13,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:27:13,920 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-09-26 08:27:19,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:19,149 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-26 08:27:19,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:27:19,150 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-09-26 08:27:19,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:19,150 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:27:19,150 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 08:27:19,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=927, Invalid=2495, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:27:19,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 08:27:19,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-26 08:27:19,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 08:27:19,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-26 08:27:19,163 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-09-26 08:27:19,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:19,164 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-26 08:27:19,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:27:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-26 08:27:19,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 08:27:19,164 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:19,164 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-09-26 08:27:19,165 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:19,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:19,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-09-26 08:27:19,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:19,705 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:19,705 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:19,706 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:27:19,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:27:19,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:27:19,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:27:19,707 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-09-26 08:27:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:25,118 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-26 08:27:25,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:27:25,119 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-09-26 08:27:25,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:25,119 INFO L225 Difference]: With dead ends: 34 [2018-09-26 08:27:25,119 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:27:25,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=989, Invalid=2671, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:27:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:27:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:27:25,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:27:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 08:27:25,132 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-09-26 08:27:25,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:25,132 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 08:27:25,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:27:25,132 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 08:27:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:27:25,133 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:25,133 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-09-26 08:27:25,133 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:25,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:25,134 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-09-26 08:27:25,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:25,710 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:25,711 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:25,711 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:27:25,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:27:25,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:27:25,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:27:25,712 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-09-26 08:27:25,862 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-09-26 08:27:26,383 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-09-26 08:27:26,878 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 12 [2018-09-26 08:27:32,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:32,717 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 08:27:32,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:27:32,718 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-09-26 08:27:32,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:32,718 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:27:32,718 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 08:27:32,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1053, Invalid=2853, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:27:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 08:27:32,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-26 08:27:32,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 08:27:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-09-26 08:27:32,730 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-09-26 08:27:32,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:32,731 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-09-26 08:27:32,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:27:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-09-26 08:27:32,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 08:27:32,731 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:32,731 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-09-26 08:27:32,732 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:32,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:32,732 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-09-26 08:27:32,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:33,386 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:33,386 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:33,387 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:27:33,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:27:33,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:27:33,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:27:33,388 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-09-26 08:27:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:41,915 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-26 08:27:41,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:27:41,915 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-09-26 08:27:41,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:41,916 INFO L225 Difference]: With dead ends: 36 [2018-09-26 08:27:41,916 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:27:41,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=1119, Invalid=3041, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:27:41,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:27:41,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:27:41,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:27:41,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:27:41,926 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-09-26 08:27:41,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:41,926 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:27:41,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:27:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:27:41,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:27:41,927 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:41,927 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-09-26 08:27:41,927 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:41,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:41,927 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-09-26 08:27:41,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:42,645 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:42,645 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:42,645 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:27:42,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:27:42,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:27:42,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:27:42,647 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-09-26 08:27:42,782 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 12 [2018-09-26 08:27:43,124 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-09-26 08:27:43,347 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 12 [2018-09-26 08:27:43,593 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 12 [2018-09-26 08:27:44,435 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 12 [2018-09-26 08:27:44,798 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 12 [2018-09-26 08:27:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:51,410 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-26 08:27:51,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:27:51,410 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-09-26 08:27:51,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:51,411 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:27:51,411 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:27:51,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1187, Invalid=3235, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:27:51,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:27:51,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-26 08:27:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 08:27:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-26 08:27:51,424 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-09-26 08:27:51,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:51,425 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-26 08:27:51,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:27:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-26 08:27:51,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 08:27:51,425 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:51,425 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-09-26 08:27:51,426 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:51,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:51,426 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-09-26 08:27:51,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:52,208 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:52,208 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:27:52,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:27:52,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:27:52,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:27:52,209 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-09-26 08:27:52,347 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 12 [2018-09-26 08:27:52,701 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 12 [2018-09-26 08:27:52,920 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-09-26 08:27:53,171 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 12 [2018-09-26 08:28:01,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:01,783 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-26 08:28:01,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:28:01,783 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-09-26 08:28:01,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:01,783 INFO L225 Difference]: With dead ends: 38 [2018-09-26 08:28:01,784 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:28:01,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1257, Invalid=3435, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:28:01,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:28:01,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:28:01,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:28:01,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 08:28:01,797 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-09-26 08:28:01,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:01,797 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 08:28:01,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:28:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 08:28:01,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:28:01,798 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:01,798 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-09-26 08:28:01,798 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:01,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:01,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-09-26 08:28:01,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:02,668 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:02,668 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:02,669 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:28:02,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:28:02,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:28:02,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:28:02,670 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-09-26 08:28:02,847 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 12 [2018-09-26 08:28:03,050 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 12 [2018-09-26 08:28:03,310 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 12 [2018-09-26 08:28:03,570 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 12 [2018-09-26 08:28:03,854 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-09-26 08:28:04,571 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 12 [2018-09-26 08:28:04,971 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-09-26 08:28:05,403 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 12 [2018-09-26 08:28:05,853 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 12 [2018-09-26 08:28:06,327 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 12 [2018-09-26 08:28:07,268 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 12 [2018-09-26 08:28:14,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:14,922 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 08:28:14,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:28:14,922 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-09-26 08:28:14,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:14,922 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:28:14,922 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 08:28:14,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=1329, Invalid=3641, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:28:14,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 08:28:14,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-26 08:28:14,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:28:14,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-26 08:28:14,932 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-09-26 08:28:14,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:14,933 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-26 08:28:14,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:28:14,933 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-26 08:28:14,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 08:28:14,933 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:14,933 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-09-26 08:28:14,933 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:14,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:14,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-09-26 08:28:14,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:15,885 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:15,885 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:15,886 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:28:15,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:28:15,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:28:15,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:28:15,886 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-09-26 08:28:16,072 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 12 [2018-09-26 08:28:16,245 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 12 [2018-09-26 08:28:16,504 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 12 [2018-09-26 08:28:16,790 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 12 [2018-09-26 08:28:17,079 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 12 [2018-09-26 08:28:17,500 WARN L178 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-09-26 08:28:17,953 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 12 [2018-09-26 08:28:18,387 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 12 [2018-09-26 08:28:18,825 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-09-26 08:28:19,287 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 12 [2018-09-26 08:28:28,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:28,171 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-26 08:28:28,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:28:28,172 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-09-26 08:28:28,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:28,172 INFO L225 Difference]: With dead ends: 40 [2018-09-26 08:28:28,172 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:28:28,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=1403, Invalid=3853, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:28:28,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:28:28,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:28:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:28:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-26 08:28:28,182 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-09-26 08:28:28,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:28,182 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-26 08:28:28,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:28:28,182 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-26 08:28:28,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:28:28,182 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:28,183 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-09-26 08:28:28,183 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:28,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:28,183 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-09-26 08:28:28,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:29,218 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:29,218 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:29,218 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:28:29,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:28:29,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:28:29,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:28:29,219 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-09-26 08:28:29,412 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 12 [2018-09-26 08:28:29,619 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 12 [2018-09-26 08:28:29,877 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 12 [2018-09-26 08:28:30,127 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 12 [2018-09-26 08:28:30,492 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 12 [2018-09-26 08:28:30,863 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 12 [2018-09-26 08:28:31,300 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-09-26 08:28:31,723 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 12 [2018-09-26 08:28:32,163 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 12 [2018-09-26 08:28:32,653 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-09-26 08:28:33,104 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 12 [2018-09-26 08:28:33,585 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 12 [2018-09-26 08:28:42,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:42,758 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-26 08:28:42,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:28:42,758 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-09-26 08:28:42,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:42,758 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:28:42,759 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:28:42,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=1479, Invalid=4071, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:28:42,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:28:42,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-26 08:28:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 08:28:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-09-26 08:28:42,768 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-09-26 08:28:42,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:42,768 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-09-26 08:28:42,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:28:42,768 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-09-26 08:28:42,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 08:28:42,769 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:42,769 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-09-26 08:28:42,769 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:42,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:42,770 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-09-26 08:28:42,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:43,937 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:43,937 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:43,937 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:28:43,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:28:43,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:28:43,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:28:43,938 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-09-26 08:28:44,119 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 12 [2018-09-26 08:28:44,379 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 12 [2018-09-26 08:28:44,701 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 12 [2018-09-26 08:28:45,047 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 12 [2018-09-26 08:28:45,379 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 12 [2018-09-26 08:28:45,745 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 12 [2018-09-26 08:28:46,126 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 12 [2018-09-26 08:28:46,554 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-09-26 08:28:47,011 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 12 [2018-09-26 08:28:47,482 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 12 [2018-09-26 08:28:47,991 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-09-26 08:28:49,570 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 12 [2018-09-26 08:28:59,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:59,089 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-26 08:28:59,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:28:59,089 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-09-26 08:28:59,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:59,090 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:28:59,090 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:28:59,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=1557, Invalid=4295, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:28:59,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:28:59,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:28:59,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:28:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:28:59,099 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-09-26 08:28:59,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:59,100 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:28:59,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:28:59,100 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:28:59,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:28:59,100 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:59,100 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-09-26 08:28:59,100 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:59,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:59,100 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-09-26 08:28:59,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:00,380 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:00,380 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:29:00,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:29:00,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:29:00,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:29:00,381 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-09-26 08:29:00,671 WARN L178 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 12 [2018-09-26 08:29:00,974 WARN L178 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 12 [2018-09-26 08:29:01,335 WARN L178 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 12 [2018-09-26 08:29:01,757 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 12 [2018-09-26 08:29:02,215 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 12 [2018-09-26 08:29:02,713 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 12 [2018-09-26 08:29:03,217 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 12 [2018-09-26 08:29:03,817 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 12 [2018-09-26 08:29:04,426 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-09-26 08:29:05,033 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 12 [2018-09-26 08:29:05,723 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 12 [2018-09-26 08:29:06,467 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-09-26 08:29:07,185 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 12 [2018-09-26 08:29:07,884 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 12 [2018-09-26 08:29:08,596 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 12 [2018-09-26 08:29:09,200 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 12 [2018-09-26 08:29:09,815 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 12 [2018-09-26 08:29:10,475 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 12 [2018-09-26 08:29:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:19,093 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-26 08:29:19,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:29:19,093 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-09-26 08:29:19,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:19,094 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:29:19,094 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 08:29:19,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=1637, Invalid=4525, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:29:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 08:29:19,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-09-26 08:29:19,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-26 08:29:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-26 08:29:19,109 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-09-26 08:29:19,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:19,109 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-26 08:29:19,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:29:19,110 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-26 08:29:19,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 08:29:19,110 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:19,110 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-09-26 08:29:19,110 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:19,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:19,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-09-26 08:29:19,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:20,458 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:20,459 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:20,459 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:29:20,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:29:20,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:29:20,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:29:20,459 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-09-26 08:29:20,676 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 12 [2018-09-26 08:29:21,011 WARN L178 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 12 [2018-09-26 08:29:21,350 WARN L178 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 12 [2018-09-26 08:29:21,712 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 12 [2018-09-26 08:29:22,095 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 12 [2018-09-26 08:29:22,545 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 12 [2018-09-26 08:29:22,999 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 12 [2018-09-26 08:29:23,484 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 12 [2018-09-26 08:29:23,967 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 12 [2018-09-26 08:29:24,468 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-09-26 08:29:25,102 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 12 [2018-09-26 08:29:25,845 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 12 [2018-09-26 08:29:26,622 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-09-26 08:29:27,379 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 12 [2018-09-26 08:29:28,101 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 12 [2018-09-26 08:29:28,983 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 12 [2018-09-26 08:29:29,821 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 12 [2018-09-26 08:29:30,629 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 12 [2018-09-26 08:29:31,438 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 12 [2018-09-26 08:29:32,205 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 12 [2018-09-26 08:29:41,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:41,200 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-26 08:29:41,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:29:41,200 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-09-26 08:29:41,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:41,200 INFO L225 Difference]: With dead ends: 44 [2018-09-26 08:29:41,200 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:29:41,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=1719, Invalid=4761, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:29:41,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:29:41,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:29:41,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:29:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-26 08:29:41,216 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-09-26 08:29:41,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:41,216 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-26 08:29:41,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:29:41,217 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-26 08:29:41,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:29:41,217 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:41,217 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-09-26 08:29:41,217 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:41,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:41,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-09-26 08:29:41,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:42,690 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:42,691 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:42,691 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:29:42,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:29:42,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:29:42,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:29:42,692 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-09-26 08:29:42,954 WARN L178 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 12 [2018-09-26 08:29:43,218 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 12 [2018-09-26 08:29:43,532 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 12 [2018-09-26 08:29:43,888 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 12 [2018-09-26 08:29:44,305 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 12 [2018-09-26 08:29:44,713 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 12 [2018-09-26 08:29:45,345 WARN L178 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 12 [2018-09-26 08:29:45,995 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 12 [2018-09-26 08:29:46,657 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 12 [2018-09-26 08:29:47,323 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 12 [2018-09-26 08:29:47,973 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-09-26 08:29:48,807 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 12 [2018-09-26 08:29:49,650 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 12 [2018-09-26 08:29:50,444 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-09-26 08:29:51,202 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 12 [2018-09-26 08:29:52,784 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 12 [2018-09-26 08:29:54,548 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 12 [2018-09-26 08:29:55,578 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 12 [2018-09-26 08:29:57,621 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 12 [2018-09-26 08:30:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:30:07,060 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 08:30:07,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:30:07,060 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-09-26 08:30:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:30:07,061 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:30:07,061 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 08:30:07,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=1803, Invalid=5003, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:30:07,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 08:30:07,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-09-26 08:30:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 08:30:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-26 08:30:07,072 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-09-26 08:30:07,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:30:07,072 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-26 08:30:07,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:30:07,072 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-26 08:30:07,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 08:30:07,072 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:30:07,072 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-09-26 08:30:07,073 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:30:07,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:30:07,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-09-26 08:30:07,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:30:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:30:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:30:08,663 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:30:08,663 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:30:08,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:30:08,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:30:08,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:30:08,664 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-09-26 08:30:08,931 WARN L178 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 12 [2018-09-26 08:30:09,200 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 12 [2018-09-26 08:30:09,539 WARN L178 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 12 [2018-09-26 08:30:09,903 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 12 [2018-09-26 08:30:10,484 WARN L178 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 12 [2018-09-26 08:30:11,102 WARN L178 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 12 [2018-09-26 08:30:11,782 WARN L178 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 12 [2018-09-26 08:30:12,468 WARN L178 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 12 [2018-09-26 08:30:13,277 WARN L178 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 12 [2018-09-26 08:30:14,066 WARN L178 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 12 [2018-09-26 08:30:14,882 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 12 [2018-09-26 08:30:15,687 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-09-26 08:30:16,531 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 12 [2018-09-26 08:30:17,483 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 12 [2018-09-26 08:30:18,479 WARN L178 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-09-26 08:30:19,441 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 12 [2018-09-26 08:30:20,343 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 12 [2018-09-26 08:30:22,215 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 12 [2018-09-26 08:30:23,171 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 12 [2018-09-26 08:30:24,056 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 12 [2018-09-26 08:30:35,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:30:35,024 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-26 08:30:35,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:30:35,024 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-09-26 08:30:35,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:30:35,024 INFO L225 Difference]: With dead ends: 46 [2018-09-26 08:30:35,024 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:30:35,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=1889, Invalid=5251, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:30:35,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:30:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:30:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:30:35,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 08:30:35,037 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-09-26 08:30:35,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:30:35,037 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 08:30:35,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:30:35,037 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 08:30:35,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:30:35,037 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:30:35,037 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-09-26 08:30:35,037 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:30:35,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:30:35,038 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-09-26 08:30:35,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:30:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:30:36,764 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:30:36,764 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:30:36,764 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:30:36,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:30:36,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:30:36,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:30:36,765 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-09-26 08:30:37,098 WARN L178 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 12 [2018-09-26 08:30:37,510 WARN L178 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 12 [2018-09-26 08:30:37,863 WARN L178 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 12 [2018-09-26 08:30:38,248 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 12 [2018-09-26 08:30:38,690 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 12 [2018-09-26 08:30:39,139 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 12 [2018-09-26 08:30:39,743 WARN L178 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 12 [2018-09-26 08:30:40,464 WARN L178 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 12 [2018-09-26 08:30:41,251 WARN L178 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 12 [2018-09-26 08:30:42,004 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 12 [2018-09-26 08:30:42,753 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 12 [2018-09-26 08:30:43,536 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 12 [2018-09-26 08:30:44,270 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-09-26 08:30:45,204 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 12 [2018-09-26 08:30:46,113 WARN L178 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 12 [2018-09-26 08:30:46,971 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-09-26 08:30:47,776 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 12 [2018-09-26 08:30:48,589 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 12 [2018-09-26 08:31:02,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:31:02,422 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 08:31:02,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:31:02,422 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-09-26 08:31:02,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:31:02,422 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:31:02,422 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 08:31:02,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=1977, Invalid=5505, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:31:02,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 08:31:02,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-26 08:31:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 08:31:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-26 08:31:02,436 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-09-26 08:31:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:31:02,436 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-26 08:31:02,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:31:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-26 08:31:02,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 08:31:02,437 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:31:02,437 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-09-26 08:31:02,437 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:31:02,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:31:02,437 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-09-26 08:31:02,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:31:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:31:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:31:04,324 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:31:04,324 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:31:04,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:31:04,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:31:04,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:31:04,325 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-09-26 08:31:04,657 WARN L178 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 12 [2018-09-26 08:31:05,035 WARN L178 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 12 [2018-09-26 08:31:05,492 WARN L178 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 12 [2018-09-26 08:31:06,086 WARN L178 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 12 [2018-09-26 08:31:06,728 WARN L178 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 12 [2018-09-26 08:31:07,430 WARN L178 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 12 [2018-09-26 08:31:08,104 WARN L178 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 12 [2018-09-26 08:31:08,802 WARN L178 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 12 [2018-09-26 08:31:09,628 WARN L178 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 12 Received shutdown request... [2018-09-26 08:31:09,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:31:09,804 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:31:09,807 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:31:09,808 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:31:09 BoogieIcfgContainer [2018-09-26 08:31:09,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:31:09,809 INFO L168 Benchmark]: Toolchain (without parser) took 275406.36 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -143.1 MB). Free memory was 1.5 GB in the beginning and 941.5 MB in the end (delta: 540.5 MB). Peak memory consumption was 397.3 MB. Max. memory is 7.1 GB. [2018-09-26 08:31:09,809 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:31:09,810 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.64 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-09-26 08:31:09,810 INFO L168 Benchmark]: Boogie Preprocessor took 20.42 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-09-26 08:31:09,810 INFO L168 Benchmark]: RCFGBuilder took 231.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:31:09,811 INFO L168 Benchmark]: TraceAbstraction took 275102.85 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -143.1 MB). Free memory was 1.5 GB in the beginning and 941.5 MB in the end (delta: 529.9 MB). Peak memory consumption was 386.8 MB. Max. memory is 7.1 GB. [2018-09-26 08:31:09,813 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.64 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 20.42 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 231.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 275102.85 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -143.1 MB). Free memory was 1.5 GB in the beginning and 941.5 MB in the end (delta: 529.9 MB). Peak memory consumption was 386.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 21). Cancelled while BasicCegarLoop was constructing difference of abstraction (46states) and FLOYD_HOARE automaton (currently 11 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 275.0s OverallTime, 44 OverallIterations, 43 TraceHistogramMax, 251.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 87 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 1947 SolverSat, 945 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1903 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1902 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12380 ImplicationChecksByTransitivity, 266.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=43, 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.4s AutomataMinimizationTime, 43 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 21.2s InterpolantComputationTime, 1034 NumberOfCodeBlocks, 1034 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 990 ConstructedInterpolants, 0 QuantifiedInterpolants, 258390 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 1 PerfectInterpolantSequences, 0/14190 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GeometricalCake.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-31-09-824.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GeometricalCake.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-31-09-824.csv Completed graceful shutdown