java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/diamond1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:45:03,713 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:45:03,716 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:45:03,736 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:45:03,736 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:45:03,740 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:45:03,742 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:45:03,745 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:45:03,747 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:45:03,751 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:45:03,754 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:45:03,754 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:45:03,755 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:45:03,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:45:03,759 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:45:03,760 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:45:03,761 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:45:03,770 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:45:03,776 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:45:03,781 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:45:03,782 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:45:03,785 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:45:03,791 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:45:03,791 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:45:03,791 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:45:03,793 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:45:03,795 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:45:03,798 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:45:03,799 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:45:03,800 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:45:03,801 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:45:03,805 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:45:03,805 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:45:03,805 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:45:03,808 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:45:03,809 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:45:03,809 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:45:03,834 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:45:03,835 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:45:03,837 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:45:03,837 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:45:03,838 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:45:03,838 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:45:03,838 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:45:03,838 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:45:03,906 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:45:03,924 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:45:03,932 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:45:03,934 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:45:03,935 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:45:03,936 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/diamond1.i_3.bpl [2018-07-25 08:45:03,936 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/diamond1.i_3.bpl' [2018-07-25 08:45:04,013 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:45:04,015 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:45:04,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:45:04,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:45:04,016 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:45:04,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:04" (1/1) ... [2018-07-25 08:45:04,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:04" (1/1) ... [2018-07-25 08:45:04,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:45:04,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:45:04,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:45:04,060 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:45:04,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:04" (1/1) ... [2018-07-25 08:45:04,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:04" (1/1) ... [2018-07-25 08:45:04,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:04" (1/1) ... [2018-07-25 08:45:04,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:04" (1/1) ... [2018-07-25 08:45:04,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:04" (1/1) ... [2018-07-25 08:45:04,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:04" (1/1) ... [2018-07-25 08:45:04,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:04" (1/1) ... [2018-07-25 08:45:04,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:45:04,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:45:04,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:45:04,082 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:45:04,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:04" (1/1) ... [2018-07-25 08:45:04,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 08:45:04,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 08:45:04,338 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 08:45:04,339 INFO L202 PluginConnector]: Adding new model diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:45:04 BoogieIcfgContainer [2018-07-25 08:45:04,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:45:04,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:45:04,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:45:04,344 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:45:04,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:04" (1/2) ... [2018-07-25 08:45:04,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d52eec and model type diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:45:04, skipping insertion in model container [2018-07-25 08:45:04,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:45:04" (2/2) ... [2018-07-25 08:45:04,349 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond1.i_3.bpl [2018-07-25 08:45:04,359 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:45:04,368 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 08:45:04,422 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:45:04,423 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:45:04,423 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:45:04,424 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:45:04,424 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:45:04,424 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:45:04,424 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:45:04,424 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:45:04,425 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:45:04,442 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-25 08:45:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 08:45:04,451 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:04,452 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 08:45:04,453 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:04,459 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-07-25 08:45:04,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:04,559 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:45:04,559 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:45:04,565 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:45:04,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:45:04,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:45:04,580 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-25 08:45:04,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:04,626 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-07-25 08:45:04,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:45:04,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-25 08:45:04,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:04,643 INFO L225 Difference]: With dead ends: 10 [2018-07-25 08:45:04,643 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 08:45:04,653 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:45:04,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 08:45:04,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 08:45:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 08:45:04,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 08:45:04,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-25 08:45:04,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:04,689 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 08:45:04,690 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:45:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 08:45:04,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:45:04,690 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:04,691 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-25 08:45:04,691 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:04,691 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-07-25 08:45:04,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:04,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:04,758 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:04,758 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 08:45:04,764 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:45:04,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:45:04,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:45:04,765 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-07-25 08:45:04,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:04,833 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 08:45:04,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:45:04,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-25 08:45:04,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:04,835 INFO L225 Difference]: With dead ends: 11 [2018-07-25 08:45:04,835 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 08:45:04,837 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:45:04,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 08:45:04,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 08:45:04,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 08:45:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 08:45:04,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-25 08:45:04,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:04,842 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 08:45:04,842 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:45:04,842 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 08:45:04,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:45:04,843 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:04,843 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-25 08:45:04,843 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:04,844 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-07-25 08:45:04,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:04,927 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:04,927 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:45:04,930 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:45:04,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:45:04,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:45:04,931 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-07-25 08:45:05,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:05,005 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 08:45:05,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:45:05,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-25 08:45:05,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:05,010 INFO L225 Difference]: With dead ends: 13 [2018-07-25 08:45:05,010 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 08:45:05,011 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:45:05,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 08:45:05,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 08:45:05,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 08:45:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 08:45:05,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-25 08:45:05,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:05,019 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 08:45:05,019 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:45:05,020 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 08:45:05,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:45:05,020 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:05,020 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-25 08:45:05,021 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:05,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-07-25 08:45:05,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:05,122 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:05,122 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:45:05,123 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:45:05,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:45:05,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:45:05,127 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-07-25 08:45:05,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:05,196 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 08:45:05,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:45:05,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-07-25 08:45:05,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:05,198 INFO L225 Difference]: With dead ends: 15 [2018-07-25 08:45:05,199 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 08:45:05,200 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:45:05,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 08:45:05,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 08:45:05,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 08:45:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 08:45:05,211 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-25 08:45:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:05,212 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 08:45:05,212 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:45:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 08:45:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:45:05,213 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:05,214 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-25 08:45:05,214 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:05,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-07-25 08:45:05,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:05,317 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:05,317 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:05,318 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:45:05,318 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:45:05,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:45:05,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:45:05,320 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-07-25 08:45:05,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:05,391 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 08:45:05,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 08:45:05,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-25 08:45:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:05,397 INFO L225 Difference]: With dead ends: 17 [2018-07-25 08:45:05,397 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 08:45:05,398 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:45:05,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 08:45:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 08:45:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 08:45:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 08:45:05,406 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-25 08:45:05,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:05,407 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 08:45:05,407 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:45:05,407 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 08:45:05,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:45:05,408 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:05,408 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-25 08:45:05,409 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:05,409 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-07-25 08:45:05,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:05,503 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:05,504 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:45:05,504 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:45:05,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:45:05,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:45:05,505 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-07-25 08:45:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:05,581 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 08:45:05,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 08:45:05,585 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-25 08:45:05,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:05,586 INFO L225 Difference]: With dead ends: 19 [2018-07-25 08:45:05,586 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 08:45:05,587 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:45:05,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 08:45:05,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 08:45:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 08:45:05,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 08:45:05,601 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-07-25 08:45:05,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:05,603 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 08:45:05,603 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:45:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 08:45:05,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:45:05,604 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:05,604 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-07-25 08:45:05,605 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:05,605 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-07-25 08:45:05,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:05,715 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:05,715 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:45:05,716 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:45:05,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:45:05,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:45:05,717 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-07-25 08:45:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:05,823 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 08:45:05,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:45:05,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 08:45:05,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:05,828 INFO L225 Difference]: With dead ends: 21 [2018-07-25 08:45:05,829 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 08:45:05,829 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:45:05,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 08:45:05,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 08:45:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 08:45:05,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 08:45:05,841 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-07-25 08:45:05,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:05,843 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 08:45:05,843 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:45:05,844 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 08:45:05,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:45:05,845 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:05,845 INFO L354 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-25 08:45:05,845 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:05,846 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-07-25 08:45:05,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:05,940 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:05,942 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:45:05,942 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:45:05,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:45:05,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:45:05,945 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-07-25 08:45:06,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:06,064 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 08:45:06,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:45:06,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 08:45:06,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:06,068 INFO L225 Difference]: With dead ends: 23 [2018-07-25 08:45:06,068 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 08:45:06,069 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:45:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 08:45:06,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 08:45:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 08:45:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 08:45:06,078 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-07-25 08:45:06,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:06,079 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 08:45:06,079 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:45:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 08:45:06,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:45:06,082 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:06,082 INFO L354 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-07-25 08:45:06,082 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:06,083 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-07-25 08:45:06,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:06,164 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:06,165 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:06,165 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:45:06,166 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:45:06,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:45:06,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:45:06,167 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-07-25 08:45:06,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:06,272 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 08:45:06,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:45:06,274 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:45:06,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:06,275 INFO L225 Difference]: With dead ends: 25 [2018-07-25 08:45:06,275 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 08:45:06,277 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:45:06,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 08:45:06,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 08:45:06,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 08:45:06,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 08:45:06,288 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-07-25 08:45:06,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:06,288 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 08:45:06,288 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:45:06,289 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 08:45:06,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:45:06,290 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:06,291 INFO L354 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-07-25 08:45:06,291 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:06,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-07-25 08:45:06,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:06,389 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:06,390 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:45:06,390 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:45:06,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:45:06,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:45:06,391 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-07-25 08:45:06,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:06,493 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 08:45:06,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:45:06,494 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-07-25 08:45:06,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:06,494 INFO L225 Difference]: With dead ends: 27 [2018-07-25 08:45:06,495 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 08:45:06,495 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:45:06,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 08:45:06,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 08:45:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 08:45:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 08:45:06,500 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-07-25 08:45:06,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:06,501 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 08:45:06,501 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:45:06,501 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 08:45:06,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 08:45:06,502 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:06,502 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-07-25 08:45:06,503 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:06,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-07-25 08:45:06,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:06,576 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:06,577 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:06,577 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:45:06,577 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:45:06,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:45:06,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:45:06,578 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-07-25 08:45:06,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:06,686 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 08:45:06,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:45:06,686 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-07-25 08:45:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:06,687 INFO L225 Difference]: With dead ends: 29 [2018-07-25 08:45:06,687 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 08:45:06,688 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:45:06,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 08:45:06,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 08:45:06,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 08:45:06,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 08:45:06,701 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-07-25 08:45:06,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:06,703 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 08:45:06,703 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:45:06,703 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 08:45:06,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 08:45:06,704 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:06,704 INFO L354 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-07-25 08:45:06,705 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:06,705 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-07-25 08:45:06,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:06,791 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:06,792 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:06,792 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:45:06,793 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:45:06,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:45:06,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:45:06,794 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-07-25 08:45:06,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:06,908 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 08:45:06,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:45:06,911 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-07-25 08:45:06,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:06,912 INFO L225 Difference]: With dead ends: 31 [2018-07-25 08:45:06,912 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 08:45:06,913 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:45:06,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 08:45:06,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 08:45:06,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 08:45:06,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 08:45:06,921 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-07-25 08:45:06,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:06,922 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 08:45:06,922 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:45:06,922 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 08:45:06,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 08:45:06,924 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:06,924 INFO L354 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-07-25 08:45:06,925 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:06,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-07-25 08:45:06,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:07,026 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:07,027 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:07,027 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:45:07,027 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:45:07,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:45:07,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:45:07,029 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-07-25 08:45:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:07,154 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 08:45:07,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:45:07,155 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-07-25 08:45:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:07,159 INFO L225 Difference]: With dead ends: 33 [2018-07-25 08:45:07,159 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 08:45:07,160 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:45:07,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 08:45:07,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 08:45:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 08:45:07,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 08:45:07,172 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-07-25 08:45:07,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:07,173 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 08:45:07,173 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:45:07,173 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 08:45:07,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 08:45:07,174 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:07,174 INFO L354 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-07-25 08:45:07,177 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:07,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-07-25 08:45:07,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:07,276 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:07,277 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:07,277 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:45:07,278 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:45:07,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:45:07,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:45:07,283 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-07-25 08:45:07,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:07,430 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 08:45:07,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 08:45:07,430 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-07-25 08:45:07,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:07,434 INFO L225 Difference]: With dead ends: 35 [2018-07-25 08:45:07,434 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 08:45:07,435 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:45:07,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 08:45:07,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 08:45:07,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 08:45:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 08:45:07,447 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-07-25 08:45:07,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:07,448 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 08:45:07,448 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:45:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 08:45:07,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 08:45:07,449 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:07,449 INFO L354 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-07-25 08:45:07,450 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:07,450 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-07-25 08:45:07,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:07,584 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:07,585 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:07,585 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 08:45:07,586 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 08:45:07,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 08:45:07,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:45:07,587 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-07-25 08:45:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:07,756 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 08:45:07,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:45:07,757 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-07-25 08:45:07,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:07,758 INFO L225 Difference]: With dead ends: 37 [2018-07-25 08:45:07,758 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 08:45:07,759 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:45:07,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 08:45:07,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 08:45:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 08:45:07,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 08:45:07,769 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-07-25 08:45:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:07,769 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 08:45:07,769 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 08:45:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 08:45:07,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 08:45:07,770 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:07,771 INFO L354 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-07-25 08:45:07,771 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:07,771 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-07-25 08:45:07,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:07,922 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:07,923 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:07,923 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 08:45:07,924 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 08:45:07,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 08:45:07,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:45:07,928 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-07-25 08:45:08,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:08,088 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 08:45:08,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:45:08,089 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-07-25 08:45:08,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:08,090 INFO L225 Difference]: With dead ends: 39 [2018-07-25 08:45:08,090 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 08:45:08,091 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:45:08,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 08:45:08,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 08:45:08,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 08:45:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 08:45:08,097 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-07-25 08:45:08,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:08,097 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 08:45:08,097 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 08:45:08,098 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 08:45:08,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 08:45:08,098 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:08,099 INFO L354 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-07-25 08:45:08,099 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:08,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-07-25 08:45:08,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:08,226 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:08,227 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:08,227 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 08:45:08,228 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 08:45:08,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 08:45:08,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:45:08,229 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2018-07-25 08:45:08,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:08,450 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 08:45:08,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:45:08,451 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-07-25 08:45:08,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:08,452 INFO L225 Difference]: With dead ends: 41 [2018-07-25 08:45:08,453 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 08:45:08,454 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:45:08,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 08:45:08,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 08:45:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 08:45:08,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 08:45:08,467 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-07-25 08:45:08,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:08,468 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 08:45:08,468 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 08:45:08,468 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 08:45:08,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 08:45:08,469 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:08,469 INFO L354 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-07-25 08:45:08,471 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:08,471 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2018-07-25 08:45:08,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:08,598 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:08,598 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:08,598 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 08:45:08,599 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 08:45:08,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 08:45:08,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:45:08,600 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2018-07-25 08:45:08,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:08,828 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 08:45:08,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 08:45:08,828 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-07-25 08:45:08,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:08,829 INFO L225 Difference]: With dead ends: 43 [2018-07-25 08:45:08,829 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 08:45:08,830 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:45:08,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 08:45:08,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 08:45:08,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 08:45:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 08:45:08,835 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-07-25 08:45:08,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:08,836 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 08:45:08,836 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 08:45:08,836 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 08:45:08,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 08:45:08,837 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:08,837 INFO L354 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-07-25 08:45:08,837 INFO L415 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:08,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2018-07-25 08:45:08,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:08,970 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:08,970 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:08,971 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 08:45:08,971 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 08:45:08,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 08:45:08,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:45:08,972 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-07-25 08:45:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:09,166 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 08:45:09,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:45:09,167 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-07-25 08:45:09,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:09,167 INFO L225 Difference]: With dead ends: 45 [2018-07-25 08:45:09,168 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 08:45:09,168 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:45:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 08:45:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 08:45:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 08:45:09,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 08:45:09,176 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-07-25 08:45:09,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:09,177 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 08:45:09,177 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 08:45:09,177 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 08:45:09,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 08:45:09,178 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:09,178 INFO L354 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-07-25 08:45:09,180 INFO L415 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:09,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2018-07-25 08:45:09,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:09,329 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:09,329 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:09,329 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 08:45:09,330 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 08:45:09,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 08:45:09,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:45:09,331 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-07-25 08:45:09,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:09,536 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 08:45:09,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:45:09,537 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-07-25 08:45:09,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:09,537 INFO L225 Difference]: With dead ends: 47 [2018-07-25 08:45:09,537 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 08:45:09,538 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:45:09,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 08:45:09,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 08:45:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 08:45:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 08:45:09,552 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-07-25 08:45:09,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:09,553 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 08:45:09,553 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 08:45:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 08:45:09,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 08:45:09,555 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:09,556 INFO L354 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-07-25 08:45:09,556 INFO L415 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:09,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2018-07-25 08:45:09,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:09,723 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:09,723 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 08:45:09,723 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 08:45:09,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 08:45:09,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:45:09,724 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2018-07-25 08:45:09,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:09,972 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 08:45:09,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:45:09,972 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-07-25 08:45:09,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:09,973 INFO L225 Difference]: With dead ends: 49 [2018-07-25 08:45:09,973 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 08:45:09,974 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:45:09,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 08:45:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 08:45:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 08:45:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 08:45:09,983 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-07-25 08:45:09,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:09,983 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 08:45:09,983 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 08:45:09,984 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 08:45:09,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 08:45:09,984 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:09,984 INFO L354 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-07-25 08:45:09,985 INFO L415 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:09,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2018-07-25 08:45:09,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:10,160 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:10,161 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:10,161 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 08:45:10,161 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 08:45:10,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 08:45:10,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:45:10,163 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2018-07-25 08:45:10,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:10,411 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 08:45:10,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:45:10,411 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-07-25 08:45:10,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:10,412 INFO L225 Difference]: With dead ends: 51 [2018-07-25 08:45:10,412 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 08:45:10,415 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:45:10,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 08:45:10,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 08:45:10,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 08:45:10,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 08:45:10,423 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-07-25 08:45:10,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:10,424 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 08:45:10,424 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 08:45:10,424 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 08:45:10,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 08:45:10,424 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:10,425 INFO L354 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-07-25 08:45:10,425 INFO L415 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:10,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2018-07-25 08:45:10,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:10,591 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:10,591 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 08:45:10,592 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 08:45:10,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 08:45:10,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:45:10,593 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2018-07-25 08:45:10,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:10,846 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 08:45:10,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 08:45:10,847 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-07-25 08:45:10,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:10,847 INFO L225 Difference]: With dead ends: 53 [2018-07-25 08:45:10,847 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 08:45:10,848 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:45:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 08:45:10,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 08:45:10,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 08:45:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 08:45:10,858 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-07-25 08:45:10,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:10,858 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 08:45:10,858 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 08:45:10,858 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 08:45:10,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 08:45:10,859 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:10,859 INFO L354 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-07-25 08:45:10,859 INFO L415 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:10,859 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2018-07-25 08:45:10,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:11,021 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:11,021 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 08:45:11,022 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 08:45:11,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 08:45:11,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:45:11,023 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2018-07-25 08:45:11,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:11,279 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 08:45:11,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 08:45:11,280 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-07-25 08:45:11,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:11,281 INFO L225 Difference]: With dead ends: 55 [2018-07-25 08:45:11,281 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 08:45:11,282 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:45:11,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 08:45:11,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 08:45:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 08:45:11,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 08:45:11,290 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-07-25 08:45:11,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:11,291 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 08:45:11,291 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 08:45:11,291 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 08:45:11,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 08:45:11,292 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:11,292 INFO L354 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-07-25 08:45:11,292 INFO L415 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:11,293 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2018-07-25 08:45:11,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:11,489 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:11,489 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 08:45:11,489 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 08:45:11,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 08:45:11,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:45:11,490 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2018-07-25 08:45:11,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:11,821 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 08:45:11,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:45:11,822 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-07-25 08:45:11,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:11,823 INFO L225 Difference]: With dead ends: 57 [2018-07-25 08:45:11,823 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 08:45:11,824 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:45:11,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 08:45:11,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 08:45:11,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 08:45:11,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 08:45:11,830 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-07-25 08:45:11,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:11,831 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 08:45:11,831 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 08:45:11,831 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 08:45:11,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 08:45:11,832 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:11,832 INFO L354 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-07-25 08:45:11,832 INFO L415 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:11,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2018-07-25 08:45:11,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:12,034 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:12,035 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:12,035 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 08:45:12,035 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 08:45:12,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 08:45:12,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:45:12,037 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2018-07-25 08:45:12,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:12,342 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 08:45:12,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 08:45:12,342 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-07-25 08:45:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:12,343 INFO L225 Difference]: With dead ends: 59 [2018-07-25 08:45:12,343 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 08:45:12,344 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:45:12,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 08:45:12,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 08:45:12,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 08:45:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 08:45:12,355 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-07-25 08:45:12,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:12,355 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 08:45:12,355 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 08:45:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 08:45:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 08:45:12,356 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:12,356 INFO L354 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-07-25 08:45:12,356 INFO L415 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:12,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2018-07-25 08:45:12,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:12,590 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:12,590 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 08:45:12,591 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 08:45:12,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 08:45:12,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:45:12,592 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2018-07-25 08:45:12,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:12,917 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 08:45:12,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:45:12,918 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-07-25 08:45:12,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:12,920 INFO L225 Difference]: With dead ends: 61 [2018-07-25 08:45:12,920 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 08:45:12,921 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:45:12,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 08:45:12,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 08:45:12,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 08:45:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 08:45:12,928 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-07-25 08:45:12,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:12,928 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 08:45:12,929 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 08:45:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 08:45:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 08:45:12,929 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:12,932 INFO L354 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-07-25 08:45:12,932 INFO L415 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:12,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2018-07-25 08:45:12,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:13,166 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:13,166 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 08:45:13,166 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 08:45:13,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 08:45:13,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:45:13,167 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2018-07-25 08:45:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:13,511 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 08:45:13,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 08:45:13,511 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-07-25 08:45:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:13,512 INFO L225 Difference]: With dead ends: 63 [2018-07-25 08:45:13,512 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 08:45:13,513 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:45:13,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 08:45:13,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 08:45:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 08:45:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 08:45:13,519 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-07-25 08:45:13,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:13,519 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 08:45:13,519 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 08:45:13,519 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 08:45:13,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 08:45:13,520 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:13,520 INFO L354 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-07-25 08:45:13,520 INFO L415 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:13,521 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2018-07-25 08:45:13,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:13,745 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:13,745 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:13,746 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 08:45:13,746 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 08:45:13,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 08:45:13,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:45:13,747 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2018-07-25 08:45:14,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:14,104 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 08:45:14,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 08:45:14,104 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-07-25 08:45:14,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:14,105 INFO L225 Difference]: With dead ends: 65 [2018-07-25 08:45:14,105 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 08:45:14,106 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:45:14,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 08:45:14,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 08:45:14,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 08:45:14,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 08:45:14,111 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-07-25 08:45:14,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:14,111 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 08:45:14,111 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 08:45:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 08:45:14,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 08:45:14,112 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:14,112 INFO L354 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-07-25 08:45:14,112 INFO L415 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:14,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2018-07-25 08:45:14,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:14,324 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:14,325 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:14,325 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 08:45:14,325 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 08:45:14,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 08:45:14,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:45:14,327 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 32 states. [2018-07-25 08:45:14,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:14,706 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 08:45:14,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 08:45:14,706 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-07-25 08:45:14,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:14,707 INFO L225 Difference]: With dead ends: 67 [2018-07-25 08:45:14,707 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 08:45:14,708 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:45:14,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 08:45:14,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 08:45:14,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 08:45:14,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 08:45:14,716 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-07-25 08:45:14,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:14,716 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 08:45:14,716 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 08:45:14,716 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 08:45:14,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 08:45:14,717 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:14,717 INFO L354 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-07-25 08:45:14,717 INFO L415 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:14,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2018-07-25 08:45:14,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:14,963 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:14,963 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 08:45:14,964 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 08:45:14,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 08:45:14,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:45:14,965 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2018-07-25 08:45:15,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:15,358 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 08:45:15,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 08:45:15,358 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-07-25 08:45:15,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:15,359 INFO L225 Difference]: With dead ends: 69 [2018-07-25 08:45:15,359 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 08:45:15,360 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:45:15,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 08:45:15,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 08:45:15,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 08:45:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 08:45:15,366 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-07-25 08:45:15,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:15,366 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 08:45:15,366 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 08:45:15,366 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 08:45:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 08:45:15,367 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:15,367 INFO L354 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-07-25 08:45:15,367 INFO L415 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:15,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2018-07-25 08:45:15,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:15,578 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:15,578 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 08:45:15,578 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 08:45:15,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 08:45:15,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:45:15,580 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 34 states. [2018-07-25 08:45:15,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:15,957 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 08:45:15,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 08:45:15,958 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-07-25 08:45:15,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:15,958 INFO L225 Difference]: With dead ends: 71 [2018-07-25 08:45:15,958 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 08:45:15,959 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:45:15,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 08:45:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 08:45:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 08:45:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 08:45:15,966 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-07-25 08:45:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:15,966 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 08:45:15,966 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 08:45:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 08:45:15,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 08:45:15,967 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:15,967 INFO L354 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-07-25 08:45:15,968 INFO L415 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:15,968 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2018-07-25 08:45:15,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:16,198 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:16,198 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 08:45:16,199 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 08:45:16,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 08:45:16,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:45:16,203 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 35 states. [2018-07-25 08:45:16,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:16,605 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 08:45:16,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 08:45:16,605 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-07-25 08:45:16,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:16,606 INFO L225 Difference]: With dead ends: 73 [2018-07-25 08:45:16,606 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 08:45:16,607 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:45:16,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 08:45:16,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 08:45:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 08:45:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 08:45:16,613 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-07-25 08:45:16,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:16,613 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 08:45:16,613 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 08:45:16,613 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 08:45:16,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 08:45:16,614 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:16,614 INFO L354 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-07-25 08:45:16,614 INFO L415 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:16,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2018-07-25 08:45:16,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:16,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:16,836 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:16,837 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 08:45:16,837 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 08:45:16,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 08:45:16,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:45:16,838 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 36 states. [2018-07-25 08:45:17,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:17,248 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 08:45:17,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 08:45:17,249 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-07-25 08:45:17,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:17,249 INFO L225 Difference]: With dead ends: 75 [2018-07-25 08:45:17,249 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 08:45:17,250 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:45:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 08:45:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 08:45:17,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 08:45:17,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 08:45:17,256 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-07-25 08:45:17,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:17,257 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 08:45:17,257 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 08:45:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 08:45:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 08:45:17,258 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:17,258 INFO L354 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-07-25 08:45:17,258 INFO L415 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:17,258 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2018-07-25 08:45:17,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:17,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:17,517 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:17,517 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 08:45:17,518 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 08:45:17,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 08:45:17,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:45:17,519 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 37 states. [2018-07-25 08:45:17,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:17,960 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 08:45:17,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 08:45:17,961 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-07-25 08:45:17,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:17,962 INFO L225 Difference]: With dead ends: 77 [2018-07-25 08:45:17,962 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 08:45:17,963 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:45:17,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 08:45:17,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 08:45:17,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 08:45:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 08:45:17,971 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-07-25 08:45:17,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:17,971 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 08:45:17,971 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 08:45:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 08:45:17,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 08:45:17,972 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:17,973 INFO L354 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-07-25 08:45:17,973 INFO L415 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:17,973 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2018-07-25 08:45:17,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:18,257 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:18,257 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 08:45:18,257 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 08:45:18,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 08:45:18,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:45:18,259 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 38 states. [2018-07-25 08:45:18,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:18,731 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 08:45:18,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 08:45:18,732 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-07-25 08:45:18,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:18,733 INFO L225 Difference]: With dead ends: 79 [2018-07-25 08:45:18,733 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 08:45:18,734 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:45:18,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 08:45:18,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 08:45:18,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 08:45:18,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 08:45:18,740 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-07-25 08:45:18,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:18,740 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 08:45:18,741 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 08:45:18,741 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 08:45:18,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 08:45:18,741 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:18,742 INFO L354 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-07-25 08:45:18,742 INFO L415 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:18,742 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2018-07-25 08:45:18,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:18,966 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:18,966 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 08:45:18,966 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 08:45:18,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 08:45:18,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:45:18,968 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 39 states. [2018-07-25 08:45:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:19,408 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 08:45:19,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 08:45:19,408 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-07-25 08:45:19,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:19,409 INFO L225 Difference]: With dead ends: 81 [2018-07-25 08:45:19,409 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 08:45:19,410 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:45:19,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 08:45:19,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 08:45:19,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 08:45:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 08:45:19,416 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-07-25 08:45:19,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:19,416 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 08:45:19,417 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 08:45:19,417 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 08:45:19,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 08:45:19,421 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:19,421 INFO L354 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-07-25 08:45:19,421 INFO L415 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:19,422 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2018-07-25 08:45:19,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:19,658 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:19,658 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 08:45:19,659 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 08:45:19,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 08:45:19,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:45:19,660 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 40 states. [2018-07-25 08:45:20,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:20,111 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 08:45:20,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 08:45:20,111 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-07-25 08:45:20,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:20,112 INFO L225 Difference]: With dead ends: 83 [2018-07-25 08:45:20,112 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 08:45:20,113 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:45:20,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 08:45:20,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 08:45:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 08:45:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 08:45:20,120 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-07-25 08:45:20,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:20,120 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 08:45:20,120 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 08:45:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 08:45:20,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 08:45:20,121 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:20,121 INFO L354 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-07-25 08:45:20,122 INFO L415 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:20,122 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2018-07-25 08:45:20,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:20,372 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:20,372 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 08:45:20,373 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 08:45:20,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 08:45:20,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:45:20,374 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 41 states. [2018-07-25 08:45:20,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:20,854 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 08:45:20,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 08:45:20,854 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-07-25 08:45:20,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:20,855 INFO L225 Difference]: With dead ends: 85 [2018-07-25 08:45:20,855 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 08:45:20,856 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:45:20,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 08:45:20,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 08:45:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 08:45:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 08:45:20,864 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-07-25 08:45:20,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:20,864 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 08:45:20,864 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 08:45:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 08:45:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 08:45:20,865 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:20,865 INFO L354 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-07-25 08:45:20,865 INFO L415 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:20,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2018-07-25 08:45:20,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:21,116 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:21,116 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 08:45:21,116 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 08:45:21,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 08:45:21,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 08:45:21,118 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 42 states. [2018-07-25 08:45:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:21,621 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 08:45:21,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 08:45:21,622 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-07-25 08:45:21,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:21,622 INFO L225 Difference]: With dead ends: 87 [2018-07-25 08:45:21,623 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 08:45:21,624 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 08:45:21,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 08:45:21,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 08:45:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 08:45:21,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 08:45:21,630 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-07-25 08:45:21,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:21,630 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 08:45:21,630 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 08:45:21,630 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 08:45:21,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 08:45:21,631 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:21,631 INFO L354 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-07-25 08:45:21,632 INFO L415 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:21,632 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2018-07-25 08:45:21,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:21,889 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:21,889 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 08:45:21,890 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 08:45:21,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 08:45:21,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:45:21,891 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 43 states. [2018-07-25 08:45:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:22,379 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 08:45:22,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 08:45:22,380 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-07-25 08:45:22,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:22,381 INFO L225 Difference]: With dead ends: 89 [2018-07-25 08:45:22,381 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 08:45:22,382 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:45:22,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 08:45:22,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 08:45:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 08:45:22,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 08:45:22,388 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-07-25 08:45:22,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:22,389 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 08:45:22,389 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 08:45:22,389 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 08:45:22,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 08:45:22,390 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:22,390 INFO L354 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-07-25 08:45:22,390 INFO L415 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:22,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2018-07-25 08:45:22,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:22,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:22,624 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:22,624 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 08:45:22,625 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 08:45:22,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 08:45:22,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:45:22,626 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 44 states. [2018-07-25 08:45:23,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:23,114 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 08:45:23,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 08:45:23,114 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-07-25 08:45:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:23,115 INFO L225 Difference]: With dead ends: 91 [2018-07-25 08:45:23,115 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 08:45:23,117 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:45:23,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 08:45:23,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 08:45:23,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 08:45:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 08:45:23,124 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-07-25 08:45:23,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:23,124 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 08:45:23,124 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 08:45:23,124 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 08:45:23,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 08:45:23,125 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:23,125 INFO L354 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-07-25 08:45:23,125 INFO L415 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:23,126 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2018-07-25 08:45:23,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:23,376 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:23,376 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 08:45:23,376 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 08:45:23,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 08:45:23,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:45:23,378 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 45 states. [2018-07-25 08:45:23,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:23,867 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 08:45:23,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 08:45:23,868 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-07-25 08:45:23,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:23,869 INFO L225 Difference]: With dead ends: 93 [2018-07-25 08:45:23,869 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 08:45:23,870 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:45:23,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 08:45:23,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 08:45:23,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 08:45:23,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 08:45:23,879 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-07-25 08:45:23,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:23,880 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 08:45:23,880 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 08:45:23,880 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 08:45:23,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 08:45:23,881 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:23,881 INFO L354 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-07-25 08:45:23,881 INFO L415 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:23,882 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2018-07-25 08:45:23,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:24,183 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:24,184 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 08:45:24,184 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 08:45:24,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 08:45:24,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:45:24,186 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 46 states. [2018-07-25 08:45:24,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:24,743 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 08:45:24,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 08:45:24,743 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-07-25 08:45:24,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:24,744 INFO L225 Difference]: With dead ends: 95 [2018-07-25 08:45:24,744 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 08:45:24,745 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:45:24,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 08:45:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 08:45:24,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 08:45:24,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 08:45:24,752 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-07-25 08:45:24,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:24,752 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 08:45:24,752 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 08:45:24,752 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 08:45:24,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 08:45:24,753 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:24,753 INFO L354 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-07-25 08:45:24,754 INFO L415 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:24,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2018-07-25 08:45:24,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:25,010 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:25,011 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 08:45:25,011 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 08:45:25,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 08:45:25,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:45:25,012 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 47 states. [2018-07-25 08:45:25,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:25,536 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 08:45:25,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 08:45:25,536 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-07-25 08:45:25,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:25,538 INFO L225 Difference]: With dead ends: 97 [2018-07-25 08:45:25,538 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 08:45:25,539 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:45:25,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 08:45:25,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 08:45:25,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 08:45:25,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 08:45:25,548 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-07-25 08:45:25,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:25,548 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 08:45:25,548 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 08:45:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 08:45:25,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 08:45:25,549 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:25,549 INFO L354 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-07-25 08:45:25,550 INFO L415 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:25,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2018-07-25 08:45:25,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:25,804 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:25,804 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 08:45:25,804 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 08:45:25,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 08:45:25,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 08:45:25,805 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 48 states. [2018-07-25 08:45:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:26,338 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 08:45:26,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 08:45:26,338 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-07-25 08:45:26,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:26,339 INFO L225 Difference]: With dead ends: 99 [2018-07-25 08:45:26,339 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 08:45:26,340 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 08:45:26,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 08:45:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 08:45:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 08:45:26,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 08:45:26,346 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-07-25 08:45:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:26,347 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 08:45:26,347 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 08:45:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 08:45:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 08:45:26,348 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:26,348 INFO L354 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-07-25 08:45:26,348 INFO L415 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:26,348 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2018-07-25 08:45:26,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:26,595 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:26,595 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 08:45:26,596 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 08:45:26,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 08:45:26,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:45:26,597 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 49 states. [2018-07-25 08:45:27,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:27,148 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-25 08:45:27,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 08:45:27,149 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-07-25 08:45:27,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:27,149 INFO L225 Difference]: With dead ends: 101 [2018-07-25 08:45:27,150 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 08:45:27,150 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:45:27,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 08:45:27,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 08:45:27,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 08:45:27,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-25 08:45:27,157 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-07-25 08:45:27,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:27,157 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-25 08:45:27,157 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 08:45:27,157 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-25 08:45:27,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 08:45:27,158 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:27,158 INFO L354 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-07-25 08:45:27,158 INFO L415 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:27,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2018-07-25 08:45:27,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:27,403 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:27,403 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 08:45:27,404 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 08:45:27,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 08:45:27,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 08:45:27,405 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 50 states. [2018-07-25 08:45:27,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:27,921 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-25 08:45:27,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 08:45:27,921 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-07-25 08:45:27,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:27,922 INFO L225 Difference]: With dead ends: 103 [2018-07-25 08:45:27,922 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 08:45:27,923 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 08:45:27,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 08:45:27,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 08:45:27,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 08:45:27,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 08:45:27,930 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-07-25 08:45:27,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:27,930 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 08:45:27,930 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 08:45:27,930 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 08:45:27,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 08:45:27,931 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:27,931 INFO L354 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-07-25 08:45:27,932 INFO L415 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:27,932 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2018-07-25 08:45:27,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:28,180 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:28,181 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 08:45:28,181 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 08:45:28,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 08:45:28,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:45:28,182 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 51 states. [2018-07-25 08:45:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:28,784 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 08:45:28,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 08:45:28,784 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-07-25 08:45:28,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:28,785 INFO L225 Difference]: With dead ends: 105 [2018-07-25 08:45:28,786 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 08:45:28,787 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:45:28,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 08:45:28,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 08:45:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 08:45:28,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-25 08:45:28,794 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-07-25 08:45:28,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:28,794 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-25 08:45:28,794 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 08:45:28,794 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-25 08:45:28,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 08:45:28,795 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:28,795 INFO L354 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-07-25 08:45:28,796 INFO L415 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:28,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2018-07-25 08:45:28,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:29,081 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:29,081 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 08:45:29,081 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 08:45:29,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 08:45:29,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 08:45:29,083 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 52 states. [2018-07-25 08:45:29,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:29,699 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-25 08:45:29,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 08:45:29,699 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-07-25 08:45:29,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:29,700 INFO L225 Difference]: With dead ends: 107 [2018-07-25 08:45:29,700 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 08:45:29,701 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 08:45:29,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 08:45:29,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 08:45:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 08:45:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-25 08:45:29,709 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-07-25 08:45:29,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:29,709 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-25 08:45:29,709 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 08:45:29,710 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-25 08:45:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 08:45:29,710 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:29,711 INFO L354 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-07-25 08:45:29,711 INFO L415 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:29,711 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2018-07-25 08:45:29,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:30,098 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:30,099 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 08:45:30,099 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 08:45:30,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 08:45:30,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:45:30,100 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 53 states. [2018-07-25 08:45:30,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:30,752 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-25 08:45:30,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 08:45:30,752 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-07-25 08:45:30,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:30,753 INFO L225 Difference]: With dead ends: 109 [2018-07-25 08:45:30,753 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 08:45:30,754 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:45:30,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 08:45:30,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 08:45:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 08:45:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-25 08:45:30,761 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-07-25 08:45:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:30,762 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-25 08:45:30,764 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 08:45:30,764 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-25 08:45:30,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 08:45:30,765 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:30,766 INFO L354 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-07-25 08:45:30,766 INFO L415 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:30,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2018-07-25 08:45:30,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:31,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:31,037 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:31,037 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 08:45:31,037 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 08:45:31,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 08:45:31,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 08:45:31,038 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 54 states. [2018-07-25 08:45:31,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:31,689 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-25 08:45:31,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 08:45:31,690 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-07-25 08:45:31,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:31,691 INFO L225 Difference]: With dead ends: 111 [2018-07-25 08:45:31,691 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 08:45:31,692 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 08:45:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 08:45:31,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 08:45:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 08:45:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-25 08:45:31,699 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-07-25 08:45:31,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:31,699 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-25 08:45:31,700 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 08:45:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-25 08:45:31,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 08:45:31,701 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:31,701 INFO L354 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-07-25 08:45:31,701 INFO L415 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:31,701 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2018-07-25 08:45:31,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:31,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:31,997 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:31,997 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 08:45:31,998 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 08:45:31,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 08:45:31,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:45:31,999 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 55 states. [2018-07-25 08:45:32,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:32,573 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-25 08:45:32,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 08:45:32,574 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-07-25 08:45:32,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:32,575 INFO L225 Difference]: With dead ends: 113 [2018-07-25 08:45:32,575 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 08:45:32,575 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:45:32,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 08:45:32,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 08:45:32,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 08:45:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 08:45:32,583 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-07-25 08:45:32,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:32,583 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 08:45:32,583 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 08:45:32,584 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 08:45:32,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 08:45:32,585 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:32,585 INFO L354 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-07-25 08:45:32,585 INFO L415 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:32,585 INFO L82 PathProgramCache]: Analyzing trace with hash 194724425, now seen corresponding path program 53 times [2018-07-25 08:45:32,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:32,873 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:32,873 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 08:45:32,874 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 08:45:32,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 08:45:32,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 08:45:32,875 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 56 states. [2018-07-25 08:45:33,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:33,439 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 08:45:33,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 08:45:33,440 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-07-25 08:45:33,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:33,440 INFO L225 Difference]: With dead ends: 115 [2018-07-25 08:45:33,441 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 08:45:33,441 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 08:45:33,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 08:45:33,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 08:45:33,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 08:45:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-25 08:45:33,449 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-07-25 08:45:33,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:33,449 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-25 08:45:33,449 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 08:45:33,449 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-25 08:45:33,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 08:45:33,450 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:33,450 INFO L354 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-07-25 08:45:33,450 INFO L415 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:33,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1848336509, now seen corresponding path program 54 times [2018-07-25 08:45:33,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:33,764 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:33,765 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 08:45:33,765 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 08:45:33,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 08:45:33,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:45:33,766 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 57 states. [2018-07-25 08:45:34,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:34,497 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-25 08:45:34,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 08:45:34,498 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-07-25 08:45:34,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:34,499 INFO L225 Difference]: With dead ends: 117 [2018-07-25 08:45:34,499 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 08:45:34,500 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:45:34,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 08:45:34,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 08:45:34,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 08:45:34,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-25 08:45:34,507 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-07-25 08:45:34,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:34,507 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-25 08:45:34,507 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 08:45:34,507 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-25 08:45:34,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 08:45:34,508 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:34,508 INFO L354 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-07-25 08:45:34,509 INFO L415 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:34,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1865127485, now seen corresponding path program 55 times [2018-07-25 08:45:34,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:34,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:34,843 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:34,844 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 08:45:34,844 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 08:45:34,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 08:45:34,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 08:45:34,848 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 58 states. [2018-07-25 08:45:35,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:35,457 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-25 08:45:35,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 08:45:35,457 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-07-25 08:45:35,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:35,459 INFO L225 Difference]: With dead ends: 119 [2018-07-25 08:45:35,459 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 08:45:35,460 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 08:45:35,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 08:45:35,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 08:45:35,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 08:45:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-25 08:45:35,467 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-07-25 08:45:35,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:35,467 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-25 08:45:35,467 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 08:45:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-25 08:45:35,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 08:45:35,468 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:35,468 INFO L354 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-07-25 08:45:35,469 INFO L415 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:35,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1386202743, now seen corresponding path program 56 times [2018-07-25 08:45:35,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:35,799 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:35,799 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 08:45:35,799 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 08:45:35,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 08:45:35,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:45:35,800 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 59 states. [2018-07-25 08:45:36,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:36,460 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-25 08:45:36,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 08:45:36,460 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-07-25 08:45:36,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:36,461 INFO L225 Difference]: With dead ends: 121 [2018-07-25 08:45:36,461 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 08:45:36,462 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:45:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 08:45:36,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 08:45:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 08:45:36,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-25 08:45:36,469 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-07-25 08:45:36,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:36,469 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-25 08:45:36,469 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 08:45:36,469 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-25 08:45:36,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 08:45:36,470 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:36,470 INFO L354 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-07-25 08:45:36,470 INFO L415 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:36,471 INFO L82 PathProgramCache]: Analyzing trace with hash 701026353, now seen corresponding path program 57 times [2018-07-25 08:45:36,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:36,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:36,775 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:36,775 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 08:45:36,776 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 08:45:36,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 08:45:36,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 08:45:36,777 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 60 states. [2018-07-25 08:45:37,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:37,306 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-25 08:45:37,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 08:45:37,306 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-07-25 08:45:37,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:37,307 INFO L225 Difference]: With dead ends: 123 [2018-07-25 08:45:37,307 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 08:45:37,308 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 08:45:37,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 08:45:37,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 08:45:37,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 08:45:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 08:45:37,315 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-07-25 08:45:37,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:37,315 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 08:45:37,315 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 08:45:37,315 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 08:45:37,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 08:45:37,316 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:37,316 INFO L354 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-07-25 08:45:37,316 INFO L415 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:37,317 INFO L82 PathProgramCache]: Analyzing trace with hash -623488149, now seen corresponding path program 58 times [2018-07-25 08:45:37,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:37,655 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:37,656 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 08:45:37,656 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 08:45:37,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 08:45:37,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:45:37,657 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 61 states. [2018-07-25 08:45:38,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:38,222 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 08:45:38,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 08:45:38,222 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-07-25 08:45:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:38,223 INFO L225 Difference]: With dead ends: 125 [2018-07-25 08:45:38,223 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 08:45:38,224 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:45:38,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 08:45:38,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 08:45:38,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 08:45:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-25 08:45:38,231 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-07-25 08:45:38,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:38,232 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-25 08:45:38,232 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 08:45:38,232 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-25 08:45:38,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 08:45:38,233 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:38,233 INFO L354 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-07-25 08:45:38,233 INFO L415 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:38,233 INFO L82 PathProgramCache]: Analyzing trace with hash 2123362341, now seen corresponding path program 59 times [2018-07-25 08:45:38,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:38,575 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:38,575 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 08:45:38,576 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 08:45:38,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 08:45:38,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 08:45:38,576 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 62 states. [2018-07-25 08:45:39,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:39,144 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-25 08:45:39,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 08:45:39,145 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-07-25 08:45:39,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:39,146 INFO L225 Difference]: With dead ends: 127 [2018-07-25 08:45:39,146 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 08:45:39,146 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 08:45:39,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 08:45:39,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 08:45:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 08:45:39,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-25 08:45:39,152 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-07-25 08:45:39,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:39,152 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-25 08:45:39,152 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 08:45:39,152 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-25 08:45:39,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 08:45:39,153 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:39,153 INFO L354 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-07-25 08:45:39,154 INFO L415 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:39,154 INFO L82 PathProgramCache]: Analyzing trace with hash 441796191, now seen corresponding path program 60 times [2018-07-25 08:45:39,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:39,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:39,531 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:39,531 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 08:45:39,531 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 08:45:39,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 08:45:39,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:45:39,532 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 63 states. [2018-07-25 08:45:40,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:40,431 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-25 08:45:40,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 08:45:40,431 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-07-25 08:45:40,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:40,432 INFO L225 Difference]: With dead ends: 129 [2018-07-25 08:45:40,432 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 08:45:40,433 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:45:40,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 08:45:40,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 08:45:40,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 08:45:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-25 08:45:40,442 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-07-25 08:45:40,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:40,443 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-25 08:45:40,443 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 08:45:40,443 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-25 08:45:40,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 08:45:40,444 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:40,444 INFO L354 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-07-25 08:45:40,444 INFO L415 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:40,449 INFO L82 PathProgramCache]: Analyzing trace with hash -635570663, now seen corresponding path program 61 times [2018-07-25 08:45:40,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:40,844 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:40,844 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 08:45:40,845 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 08:45:40,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 08:45:40,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 08:45:40,846 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 64 states. [2018-07-25 08:45:41,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:41,722 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-25 08:45:41,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 08:45:41,723 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-07-25 08:45:41,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:41,724 INFO L225 Difference]: With dead ends: 131 [2018-07-25 08:45:41,724 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 08:45:41,725 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 08:45:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 08:45:41,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 08:45:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 08:45:41,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-25 08:45:41,732 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-07-25 08:45:41,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:41,733 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-25 08:45:41,733 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 08:45:41,733 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-25 08:45:41,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 08:45:41,734 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:41,734 INFO L354 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-07-25 08:45:41,734 INFO L415 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:41,735 INFO L82 PathProgramCache]: Analyzing trace with hash -897999021, now seen corresponding path program 62 times [2018-07-25 08:45:41,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:42,148 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:42,148 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 08:45:42,148 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 08:45:42,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 08:45:42,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 08:45:42,149 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 65 states. [2018-07-25 08:45:42,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:42,787 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-25 08:45:42,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 08:45:42,787 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-07-25 08:45:42,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:42,788 INFO L225 Difference]: With dead ends: 133 [2018-07-25 08:45:42,788 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 08:45:42,789 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 08:45:42,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 08:45:42,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 08:45:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 08:45:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 08:45:42,797 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-07-25 08:45:42,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:42,798 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 08:45:42,798 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 08:45:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 08:45:42,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 08:45:42,799 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:42,799 INFO L354 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-07-25 08:45:42,799 INFO L415 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:42,799 INFO L82 PathProgramCache]: Analyzing trace with hash 311419405, now seen corresponding path program 63 times [2018-07-25 08:45:42,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:43,104 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:43,104 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 08:45:43,104 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 08:45:43,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 08:45:43,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 08:45:43,105 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 66 states. [2018-07-25 08:45:43,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:43,765 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 08:45:43,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 08:45:43,765 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-07-25 08:45:43,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:43,766 INFO L225 Difference]: With dead ends: 135 [2018-07-25 08:45:43,766 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 08:45:43,767 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 08:45:43,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 08:45:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 08:45:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 08:45:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-25 08:45:43,775 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-07-25 08:45:43,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:43,775 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-25 08:45:43,775 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 08:45:43,776 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-25 08:45:43,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 08:45:43,776 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:43,777 INFO L354 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-07-25 08:45:43,777 INFO L415 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:43,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1373610425, now seen corresponding path program 64 times [2018-07-25 08:45:43,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:44,145 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:44,145 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 08:45:44,145 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 08:45:44,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 08:45:44,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 08:45:44,146 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 67 states. [2018-07-25 08:45:44,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:44,821 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-25 08:45:44,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 08:45:44,821 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-07-25 08:45:44,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:44,822 INFO L225 Difference]: With dead ends: 137 [2018-07-25 08:45:44,822 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 08:45:44,822 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 08:45:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 08:45:44,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 08:45:44,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 08:45:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-25 08:45:44,830 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-07-25 08:45:44,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:44,830 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-25 08:45:44,830 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 08:45:44,831 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-25 08:45:44,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 08:45:44,831 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:44,831 INFO L354 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-07-25 08:45:44,831 INFO L415 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:44,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1484606463, now seen corresponding path program 65 times [2018-07-25 08:45:44,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:45,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:45,132 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:45,132 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 08:45:45,132 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 08:45:45,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 08:45:45,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 08:45:45,133 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 68 states. [2018-07-25 08:45:45,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:45,810 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-25 08:45:45,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 08:45:45,811 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-07-25 08:45:45,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:45,812 INFO L225 Difference]: With dead ends: 139 [2018-07-25 08:45:45,812 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 08:45:45,812 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 08:45:45,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 08:45:45,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 08:45:45,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 08:45:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-25 08:45:45,820 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-07-25 08:45:45,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:45,821 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-25 08:45:45,821 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 08:45:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-25 08:45:45,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 08:45:45,822 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:45,822 INFO L354 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-07-25 08:45:45,822 INFO L415 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:45,822 INFO L82 PathProgramCache]: Analyzing trace with hash -777616581, now seen corresponding path program 66 times [2018-07-25 08:45:45,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:46,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:46,166 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:46,166 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 08:45:46,166 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 08:45:46,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 08:45:46,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 08:45:46,167 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 69 states. [2018-07-25 08:45:46,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:46,897 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-25 08:45:46,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 08:45:46,897 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-07-25 08:45:46,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:46,898 INFO L225 Difference]: With dead ends: 141 [2018-07-25 08:45:46,899 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 08:45:46,899 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 08:45:46,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 08:45:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 08:45:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 08:45:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-25 08:45:46,906 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-07-25 08:45:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:46,907 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-25 08:45:46,907 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 08:45:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-25 08:45:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 08:45:46,908 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:46,908 INFO L354 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-07-25 08:45:46,908 INFO L415 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:46,908 INFO L82 PathProgramCache]: Analyzing trace with hash 34827253, now seen corresponding path program 67 times [2018-07-25 08:45:46,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:47,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:47,315 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:47,316 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 08:45:47,316 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 08:45:47,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 08:45:47,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 08:45:47,317 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 70 states. [2018-07-25 08:45:48,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:48,087 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-25 08:45:48,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 08:45:48,087 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-07-25 08:45:48,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:48,088 INFO L225 Difference]: With dead ends: 143 [2018-07-25 08:45:48,088 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 08:45:48,088 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 08:45:48,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 08:45:48,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 08:45:48,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 08:45:48,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 08:45:48,095 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-07-25 08:45:48,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:48,095 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 08:45:48,095 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 08:45:48,095 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 08:45:48,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 08:45:48,096 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:48,096 INFO L354 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-07-25 08:45:48,096 INFO L415 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:48,097 INFO L82 PathProgramCache]: Analyzing trace with hash -890696145, now seen corresponding path program 68 times [2018-07-25 08:45:48,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:48,503 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:48,503 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 08:45:48,503 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 08:45:48,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 08:45:48,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 08:45:48,504 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 71 states. [2018-07-25 08:45:49,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:49,260 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 08:45:49,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 08:45:49,260 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-07-25 08:45:49,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:49,261 INFO L225 Difference]: With dead ends: 145 [2018-07-25 08:45:49,261 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 08:45:49,262 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 08:45:49,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 08:45:49,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 08:45:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 08:45:49,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-25 08:45:49,269 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-07-25 08:45:49,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:49,269 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-25 08:45:49,269 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 08:45:49,269 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-25 08:45:49,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 08:45:49,270 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:49,270 INFO L354 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-07-25 08:45:49,270 INFO L415 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:49,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1260451351, now seen corresponding path program 69 times [2018-07-25 08:45:49,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:49,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:49,605 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:49,605 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 08:45:49,605 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 08:45:49,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 08:45:49,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 08:45:49,606 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 72 states. [2018-07-25 08:45:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:50,377 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-25 08:45:50,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 08:45:50,377 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-07-25 08:45:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:50,378 INFO L225 Difference]: With dead ends: 147 [2018-07-25 08:45:50,378 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 08:45:50,379 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 08:45:50,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 08:45:50,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 08:45:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 08:45:50,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-25 08:45:50,386 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-07-25 08:45:50,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:50,387 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-25 08:45:50,387 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 08:45:50,387 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-25 08:45:50,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 08:45:50,387 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:50,387 INFO L354 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-07-25 08:45:50,388 INFO L415 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:50,388 INFO L82 PathProgramCache]: Analyzing trace with hash -112918749, now seen corresponding path program 70 times [2018-07-25 08:45:50,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:50,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:50,731 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:50,732 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 08:45:50,732 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 08:45:50,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 08:45:50,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 08:45:50,733 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 73 states. [2018-07-25 08:45:51,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:51,511 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-25 08:45:51,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 08:45:51,512 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-07-25 08:45:51,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:51,512 INFO L225 Difference]: With dead ends: 149 [2018-07-25 08:45:51,513 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 08:45:51,514 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 08:45:51,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 08:45:51,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 08:45:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 08:45:51,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-25 08:45:51,522 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-07-25 08:45:51,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:51,522 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-25 08:45:51,522 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 08:45:51,522 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-25 08:45:51,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 08:45:51,523 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:51,523 INFO L354 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-07-25 08:45:51,524 INFO L415 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:51,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1140683299, now seen corresponding path program 71 times [2018-07-25 08:45:51,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:51,931 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:51,931 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:51,931 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 08:45:51,931 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 08:45:51,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 08:45:51,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 08:45:51,932 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 74 states. [2018-07-25 08:45:52,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:52,760 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-25 08:45:52,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 08:45:52,760 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-07-25 08:45:52,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:52,761 INFO L225 Difference]: With dead ends: 151 [2018-07-25 08:45:52,761 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 08:45:52,762 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 08:45:52,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 08:45:52,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 08:45:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 08:45:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-25 08:45:52,768 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-07-25 08:45:52,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:52,768 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-25 08:45:52,769 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 08:45:52,769 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-25 08:45:52,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 08:45:52,769 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:52,770 INFO L354 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-07-25 08:45:52,770 INFO L415 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:52,770 INFO L82 PathProgramCache]: Analyzing trace with hash -979937769, now seen corresponding path program 72 times [2018-07-25 08:45:52,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:53,257 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:53,257 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 08:45:53,257 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 08:45:53,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 08:45:53,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:45:53,258 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 75 states. [2018-07-25 08:45:54,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:54,060 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-25 08:45:54,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 08:45:54,060 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-07-25 08:45:54,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:54,061 INFO L225 Difference]: With dead ends: 153 [2018-07-25 08:45:54,062 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 08:45:54,062 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:45:54,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 08:45:54,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 08:45:54,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 08:45:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 08:45:54,070 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-07-25 08:45:54,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:54,071 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 08:45:54,071 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 08:45:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 08:45:54,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 08:45:54,072 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:54,072 INFO L354 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-07-25 08:45:54,072 INFO L415 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:54,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1122306095, now seen corresponding path program 73 times [2018-07-25 08:45:54,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:54,533 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:54,533 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 08:45:54,534 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 08:45:54,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 08:45:54,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 08:45:54,535 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 76 states. [2018-07-25 08:45:55,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:55,398 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-25 08:45:55,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 08:45:55,398 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-07-25 08:45:55,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:55,399 INFO L225 Difference]: With dead ends: 155 [2018-07-25 08:45:55,399 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 08:45:55,400 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 08:45:55,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 08:45:55,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 08:45:55,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 08:45:55,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-25 08:45:55,408 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-07-25 08:45:55,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:55,409 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-25 08:45:55,409 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 08:45:55,409 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-25 08:45:55,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 08:45:55,410 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:55,410 INFO L354 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-07-25 08:45:55,410 INFO L415 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:55,410 INFO L82 PathProgramCache]: Analyzing trace with hash -499313909, now seen corresponding path program 74 times [2018-07-25 08:45:55,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:55,843 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:55,844 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:55,844 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 08:45:55,844 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 08:45:55,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 08:45:55,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:45:55,845 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 77 states. [2018-07-25 08:45:56,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:56,673 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-25 08:45:56,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 08:45:56,673 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-07-25 08:45:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:56,674 INFO L225 Difference]: With dead ends: 157 [2018-07-25 08:45:56,674 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 08:45:56,675 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:45:56,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 08:45:56,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 08:45:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 08:45:56,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-25 08:45:56,683 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-07-25 08:45:56,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:56,683 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-25 08:45:56,683 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 08:45:56,683 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-25 08:45:56,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 08:45:56,684 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:56,684 INFO L354 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-07-25 08:45:56,685 INFO L415 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:56,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1195722693, now seen corresponding path program 75 times [2018-07-25 08:45:56,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:57,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:57,065 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:57,065 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 08:45:57,065 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 08:45:57,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 08:45:57,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 08:45:57,066 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 78 states. [2018-07-25 08:45:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:57,942 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-25 08:45:57,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 08:45:57,942 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-07-25 08:45:57,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:57,943 INFO L225 Difference]: With dead ends: 159 [2018-07-25 08:45:57,944 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 08:45:57,944 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 08:45:57,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 08:45:57,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-25 08:45:57,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-25 08:45:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-25 08:45:57,953 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-07-25 08:45:57,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:57,953 INFO L472 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-25 08:45:57,953 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 08:45:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-25 08:45:57,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-25 08:45:57,954 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:57,954 INFO L354 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-07-25 08:45:57,955 INFO L415 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:57,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1961675265, now seen corresponding path program 76 times [2018-07-25 08:45:57,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:58,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:58,381 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:58,381 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 08:45:58,381 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 08:45:58,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 08:45:58,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 08:45:58,382 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 79 states. [2018-07-25 08:45:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:59,350 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-25 08:45:59,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 08:45:59,350 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-07-25 08:45:59,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:59,351 INFO L225 Difference]: With dead ends: 161 [2018-07-25 08:45:59,351 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 08:45:59,352 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 08:45:59,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 08:45:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-25 08:45:59,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-25 08:45:59,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-25 08:45:59,359 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-07-25 08:45:59,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:59,360 INFO L472 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-25 08:45:59,360 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 08:45:59,360 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-25 08:45:59,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-25 08:45:59,361 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:59,361 INFO L354 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-07-25 08:45:59,361 INFO L415 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:59,362 INFO L82 PathProgramCache]: Analyzing trace with hash 320765369, now seen corresponding path program 77 times [2018-07-25 08:45:59,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:59,794 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:59,794 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 08:45:59,794 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 08:45:59,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 08:45:59,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 08:45:59,795 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 80 states. [2018-07-25 08:46:00,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:00,719 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-25 08:46:00,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 08:46:00,720 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-07-25 08:46:00,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:00,721 INFO L225 Difference]: With dead ends: 163 [2018-07-25 08:46:00,721 INFO L226 Difference]: Without dead ends: 161 [2018-07-25 08:46:00,721 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 08:46:00,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-25 08:46:00,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-25 08:46:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-25 08:46:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-25 08:46:00,727 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-07-25 08:46:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:00,728 INFO L472 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-25 08:46:00,728 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 08:46:00,728 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-25 08:46:00,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-25 08:46:00,728 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:00,728 INFO L354 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-07-25 08:46:00,729 INFO L415 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:00,729 INFO L82 PathProgramCache]: Analyzing trace with hash -982073613, now seen corresponding path program 78 times [2018-07-25 08:46:00,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:01,134 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:01,134 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 08:46:01,134 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 08:46:01,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 08:46:01,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:46:01,135 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 81 states. [2018-07-25 08:46:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:02,283 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-25 08:46:02,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 08:46:02,284 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-07-25 08:46:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:02,285 INFO L225 Difference]: With dead ends: 165 [2018-07-25 08:46:02,285 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 08:46:02,286 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:46:02,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 08:46:02,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-25 08:46:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 08:46:02,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-25 08:46:02,294 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-07-25 08:46:02,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:02,294 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-25 08:46:02,294 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 08:46:02,294 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-25 08:46:02,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-25 08:46:02,295 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:02,295 INFO L354 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-07-25 08:46:02,295 INFO L415 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:02,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1120115117, now seen corresponding path program 79 times [2018-07-25 08:46:02,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:02,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:02,712 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:02,712 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 08:46:02,713 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 08:46:02,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 08:46:02,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 08:46:02,714 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 82 states. [2018-07-25 08:46:03,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:03,684 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-25 08:46:03,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 08:46:03,684 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-07-25 08:46:03,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:03,685 INFO L225 Difference]: With dead ends: 167 [2018-07-25 08:46:03,685 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 08:46:03,686 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 08:46:03,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 08:46:03,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-25 08:46:03,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-25 08:46:03,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-25 08:46:03,694 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-07-25 08:46:03,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:03,694 INFO L472 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-25 08:46:03,694 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 08:46:03,694 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-25 08:46:03,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-25 08:46:03,695 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:03,695 INFO L354 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-07-25 08:46:03,696 INFO L415 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:03,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1606111769, now seen corresponding path program 80 times [2018-07-25 08:46:03,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:04,118 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:04,118 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 08:46:04,119 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 08:46:04,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 08:46:04,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 08:46:04,120 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 83 states. [2018-07-25 08:46:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:05,122 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-25 08:46:05,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 08:46:05,122 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-07-25 08:46:05,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:05,123 INFO L225 Difference]: With dead ends: 169 [2018-07-25 08:46:05,123 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 08:46:05,124 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 08:46:05,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 08:46:05,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-25 08:46:05,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 08:46:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-25 08:46:05,132 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-07-25 08:46:05,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:05,133 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-25 08:46:05,133 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 08:46:05,133 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-25 08:46:05,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-25 08:46:05,134 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:05,134 INFO L354 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-07-25 08:46:05,134 INFO L415 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:05,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1580098655, now seen corresponding path program 81 times [2018-07-25 08:46:05,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:05,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:05,624 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:05,624 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 08:46:05,624 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 08:46:05,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 08:46:05,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 08:46:05,625 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 84 states. [2018-07-25 08:46:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:06,637 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-25 08:46:06,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 08:46:06,637 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-07-25 08:46:06,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:06,638 INFO L225 Difference]: With dead ends: 171 [2018-07-25 08:46:06,638 INFO L226 Difference]: Without dead ends: 169 [2018-07-25 08:46:06,639 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 08:46:06,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-25 08:46:06,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-25 08:46:06,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-25 08:46:06,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-25 08:46:06,647 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-07-25 08:46:06,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:06,647 INFO L472 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-25 08:46:06,647 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 08:46:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-25 08:46:06,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-25 08:46:06,648 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:06,648 INFO L354 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-07-25 08:46:06,649 INFO L415 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:06,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1943667419, now seen corresponding path program 82 times [2018-07-25 08:46:06,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:07,084 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:07,084 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 08:46:07,084 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 08:46:07,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 08:46:07,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 08:46:07,085 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 85 states. [2018-07-25 08:46:08,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:08,141 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-25 08:46:08,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 08:46:08,142 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-07-25 08:46:08,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:08,143 INFO L225 Difference]: With dead ends: 173 [2018-07-25 08:46:08,143 INFO L226 Difference]: Without dead ends: 171 [2018-07-25 08:46:08,144 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 08:46:08,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-25 08:46:08,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-25 08:46:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 08:46:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-25 08:46:08,153 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-07-25 08:46:08,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:08,154 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-25 08:46:08,154 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 08:46:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-25 08:46:08,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-25 08:46:08,155 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:08,155 INFO L354 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-07-25 08:46:08,155 INFO L415 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:08,156 INFO L82 PathProgramCache]: Analyzing trace with hash -446332011, now seen corresponding path program 83 times [2018-07-25 08:46:08,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:08,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:08,833 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:08,833 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 08:46:08,834 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 08:46:08,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 08:46:08,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 08:46:08,834 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 86 states. [2018-07-25 08:46:09,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:09,904 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-25 08:46:09,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 08:46:09,904 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-07-25 08:46:09,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:09,906 INFO L225 Difference]: With dead ends: 175 [2018-07-25 08:46:09,906 INFO L226 Difference]: Without dead ends: 173 [2018-07-25 08:46:09,906 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 08:46:09,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-25 08:46:09,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-25 08:46:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 08:46:09,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-25 08:46:09,914 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-07-25 08:46:09,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:09,915 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-25 08:46:09,915 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 08:46:09,915 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-25 08:46:09,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-25 08:46:09,916 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:09,916 INFO L354 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-07-25 08:46:09,916 INFO L415 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:09,916 INFO L82 PathProgramCache]: Analyzing trace with hash 571719119, now seen corresponding path program 84 times [2018-07-25 08:46:09,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:10,380 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:10,380 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 08:46:10,381 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 08:46:10,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 08:46:10,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 08:46:10,382 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 87 states. [2018-07-25 08:46:11,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:11,459 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-25 08:46:11,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 08:46:11,459 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-07-25 08:46:11,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:11,460 INFO L225 Difference]: With dead ends: 177 [2018-07-25 08:46:11,461 INFO L226 Difference]: Without dead ends: 175 [2018-07-25 08:46:11,461 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 08:46:11,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-25 08:46:11,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-25 08:46:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-25 08:46:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-25 08:46:11,470 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-07-25 08:46:11,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:11,470 INFO L472 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-25 08:46:11,470 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 08:46:11,471 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-25 08:46:11,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-25 08:46:11,471 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:11,472 INFO L354 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-07-25 08:46:11,472 INFO L415 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:11,472 INFO L82 PathProgramCache]: Analyzing trace with hash -333688439, now seen corresponding path program 85 times [2018-07-25 08:46:11,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:12,001 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:12,001 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:12,001 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 08:46:12,002 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 08:46:12,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 08:46:12,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 08:46:12,003 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 88 states. [2018-07-25 08:46:13,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:13,168 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-25 08:46:13,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 08:46:13,168 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-07-25 08:46:13,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:13,169 INFO L225 Difference]: With dead ends: 179 [2018-07-25 08:46:13,169 INFO L226 Difference]: Without dead ends: 177 [2018-07-25 08:46:13,170 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 08:46:13,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-25 08:46:13,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-25 08:46:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-25 08:46:13,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-25 08:46:13,175 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-07-25 08:46:13,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:13,176 INFO L472 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-25 08:46:13,176 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 08:46:13,176 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-25 08:46:13,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-25 08:46:13,177 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:13,177 INFO L354 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-07-25 08:46:13,177 INFO L415 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:13,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1448009411, now seen corresponding path program 86 times [2018-07-25 08:46:13,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:13,666 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:13,666 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:13,667 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 08:46:13,667 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 08:46:13,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 08:46:13,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 08:46:13,668 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 89 states. [2018-07-25 08:46:14,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:14,834 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-25 08:46:14,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 08:46:14,834 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-07-25 08:46:14,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:14,835 INFO L225 Difference]: With dead ends: 181 [2018-07-25 08:46:14,835 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 08:46:14,836 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 08:46:14,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 08:46:14,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-25 08:46:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-25 08:46:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-25 08:46:14,843 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-07-25 08:46:14,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:14,843 INFO L472 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-25 08:46:14,843 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 08:46:14,843 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-25 08:46:14,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-25 08:46:14,844 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:14,844 INFO L354 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-07-25 08:46:14,845 INFO L415 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:14,845 INFO L82 PathProgramCache]: Analyzing trace with hash -32307843, now seen corresponding path program 87 times [2018-07-25 08:46:14,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:15,345 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:15,345 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 08:46:15,345 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 08:46:15,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 08:46:15,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 08:46:15,346 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 90 states. [2018-07-25 08:46:16,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:16,539 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-25 08:46:16,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 08:46:16,540 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-07-25 08:46:16,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:16,541 INFO L225 Difference]: With dead ends: 183 [2018-07-25 08:46:16,541 INFO L226 Difference]: Without dead ends: 181 [2018-07-25 08:46:16,541 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 08:46:16,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-25 08:46:16,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-25 08:46:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-25 08:46:16,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-25 08:46:16,546 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-07-25 08:46:16,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:16,547 INFO L472 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-25 08:46:16,547 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 08:46:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-25 08:46:16,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-25 08:46:16,548 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:16,548 INFO L354 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-07-25 08:46:16,548 INFO L415 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:16,548 INFO L82 PathProgramCache]: Analyzing trace with hash -983013961, now seen corresponding path program 88 times [2018-07-25 08:46:16,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:17,044 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:17,044 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 08:46:17,044 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 08:46:17,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 08:46:17,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 08:46:17,045 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 91 states. [2018-07-25 08:46:18,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:18,256 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-25 08:46:18,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 08:46:18,257 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-07-25 08:46:18,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:18,258 INFO L225 Difference]: With dead ends: 185 [2018-07-25 08:46:18,258 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 08:46:18,259 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 08:46:18,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 08:46:18,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 08:46:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 08:46:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-07-25 08:46:18,266 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-07-25 08:46:18,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:18,267 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-07-25 08:46:18,267 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 08:46:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-07-25 08:46:18,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-25 08:46:18,268 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:18,268 INFO L354 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-07-25 08:46:18,268 INFO L415 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:18,269 INFO L82 PathProgramCache]: Analyzing trace with hash 216440689, now seen corresponding path program 89 times [2018-07-25 08:46:18,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:18,815 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:18,815 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 08:46:18,816 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 08:46:18,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 08:46:18,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 08:46:18,817 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 92 states. [2018-07-25 08:46:20,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:20,130 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-25 08:46:20,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 08:46:20,130 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-07-25 08:46:20,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:20,131 INFO L225 Difference]: With dead ends: 187 [2018-07-25 08:46:20,131 INFO L226 Difference]: Without dead ends: 185 [2018-07-25 08:46:20,131 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 08:46:20,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-25 08:46:20,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-25 08:46:20,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-25 08:46:20,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-25 08:46:20,137 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-07-25 08:46:20,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:20,137 INFO L472 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-25 08:46:20,137 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 08:46:20,137 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-25 08:46:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-25 08:46:20,138 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:20,138 INFO L354 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2018-07-25 08:46:20,138 INFO L415 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:20,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1841124011, now seen corresponding path program 90 times [2018-07-25 08:46:20,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:20,689 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:20,689 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 08:46:20,690 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 08:46:20,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 08:46:20,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 08:46:20,691 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 93 states. [2018-07-25 08:46:21,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:21,946 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-07-25 08:46:21,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 08:46:21,946 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-07-25 08:46:21,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:21,947 INFO L225 Difference]: With dead ends: 189 [2018-07-25 08:46:21,947 INFO L226 Difference]: Without dead ends: 187 [2018-07-25 08:46:21,948 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 08:46:21,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-25 08:46:21,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-25 08:46:21,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-25 08:46:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-07-25 08:46:21,955 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-07-25 08:46:21,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:21,956 INFO L472 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-07-25 08:46:21,956 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 08:46:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-07-25 08:46:21,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-25 08:46:21,957 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:21,957 INFO L354 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2018-07-25 08:46:21,957 INFO L415 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:21,957 INFO L82 PathProgramCache]: Analyzing trace with hash -206299291, now seen corresponding path program 91 times [2018-07-25 08:46:21,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:22,520 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:22,520 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 08:46:22,521 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 08:46:22,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 08:46:22,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 08:46:22,521 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 94 states. [2018-07-25 08:46:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:23,774 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-07-25 08:46:23,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 08:46:23,774 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-07-25 08:46:23,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:23,775 INFO L225 Difference]: With dead ends: 191 [2018-07-25 08:46:23,775 INFO L226 Difference]: Without dead ends: 189 [2018-07-25 08:46:23,775 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 08:46:23,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-25 08:46:23,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-07-25 08:46:23,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-25 08:46:23,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-07-25 08:46:23,783 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-07-25 08:46:23,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:23,783 INFO L472 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-07-25 08:46:23,783 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 08:46:23,783 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-07-25 08:46:23,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-25 08:46:23,784 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:23,784 INFO L354 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1] [2018-07-25 08:46:23,784 INFO L415 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:23,785 INFO L82 PathProgramCache]: Analyzing trace with hash -685070945, now seen corresponding path program 92 times [2018-07-25 08:46:23,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:24,344 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:24,344 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 08:46:24,345 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 08:46:24,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 08:46:24,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 08:46:24,346 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 95 states. [2018-07-25 08:46:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:25,623 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-07-25 08:46:25,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 08:46:25,623 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-07-25 08:46:25,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:25,624 INFO L225 Difference]: With dead ends: 193 [2018-07-25 08:46:25,625 INFO L226 Difference]: Without dead ends: 191 [2018-07-25 08:46:25,625 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 08:46:25,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-25 08:46:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-25 08:46:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-25 08:46:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-07-25 08:46:25,633 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-07-25 08:46:25,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:25,633 INFO L472 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-07-25 08:46:25,633 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 08:46:25,633 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-07-25 08:46:25,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-25 08:46:25,634 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:25,634 INFO L354 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1] [2018-07-25 08:46:25,635 INFO L415 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:25,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1223129767, now seen corresponding path program 93 times [2018-07-25 08:46:25,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:26,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:26,194 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:26,194 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 08:46:26,194 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 08:46:26,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 08:46:26,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 08:46:26,196 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 96 states. [2018-07-25 08:46:27,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:27,544 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-07-25 08:46:27,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 08:46:27,544 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-07-25 08:46:27,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:27,545 INFO L225 Difference]: With dead ends: 195 [2018-07-25 08:46:27,546 INFO L226 Difference]: Without dead ends: 193 [2018-07-25 08:46:27,546 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 08:46:27,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-07-25 08:46:27,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-07-25 08:46:27,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-25 08:46:27,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-07-25 08:46:27,555 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2018-07-25 08:46:27,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:27,555 INFO L472 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-07-25 08:46:27,555 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 08:46:27,555 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-07-25 08:46:27,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-25 08:46:27,556 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:27,557 INFO L354 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1] [2018-07-25 08:46:27,557 INFO L415 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:27,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1393385107, now seen corresponding path program 94 times [2018-07-25 08:46:27,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:28,148 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:28,149 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 08:46:28,149 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 08:46:28,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 08:46:28,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 08:46:28,150 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 97 states. [2018-07-25 08:46:29,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:29,528 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-07-25 08:46:29,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 08:46:29,529 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-07-25 08:46:29,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:29,530 INFO L225 Difference]: With dead ends: 197 [2018-07-25 08:46:29,530 INFO L226 Difference]: Without dead ends: 195 [2018-07-25 08:46:29,531 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 08:46:29,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-25 08:46:29,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-07-25 08:46:29,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-07-25 08:46:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-07-25 08:46:29,539 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2018-07-25 08:46:29,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:29,540 INFO L472 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-07-25 08:46:29,540 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 08:46:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-07-25 08:46:29,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-25 08:46:29,541 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:29,541 INFO L354 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1] [2018-07-25 08:46:29,541 INFO L415 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:29,541 INFO L82 PathProgramCache]: Analyzing trace with hash -986656435, now seen corresponding path program 95 times [2018-07-25 08:46:29,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:30,174 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:30,174 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 08:46:30,174 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 08:46:30,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 08:46:30,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 08:46:30,175 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 98 states. [2018-07-25 08:46:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:31,552 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-07-25 08:46:31,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 08:46:31,552 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-07-25 08:46:31,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:31,553 INFO L225 Difference]: With dead ends: 199 [2018-07-25 08:46:31,553 INFO L226 Difference]: Without dead ends: 197 [2018-07-25 08:46:31,553 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 08:46:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-25 08:46:31,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-07-25 08:46:31,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-25 08:46:31,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-07-25 08:46:31,560 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2018-07-25 08:46:31,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:31,561 INFO L472 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-07-25 08:46:31,561 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 08:46:31,561 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-07-25 08:46:31,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-25 08:46:31,562 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:31,562 INFO L354 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1] [2018-07-25 08:46:31,562 INFO L415 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:31,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1010990471, now seen corresponding path program 96 times [2018-07-25 08:46:31,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:32,157 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:32,157 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 08:46:32,157 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 08:46:32,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 08:46:32,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 08:46:32,158 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 99 states. [2018-07-25 08:46:33,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:33,609 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-07-25 08:46:33,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 08:46:33,609 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-07-25 08:46:33,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:33,610 INFO L225 Difference]: With dead ends: 201 [2018-07-25 08:46:33,610 INFO L226 Difference]: Without dead ends: 199 [2018-07-25 08:46:33,611 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 08:46:33,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-25 08:46:33,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-07-25 08:46:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-07-25 08:46:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-07-25 08:46:33,619 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2018-07-25 08:46:33,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:33,620 INFO L472 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-07-25 08:46:33,620 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 08:46:33,620 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-07-25 08:46:33,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-25 08:46:33,621 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:33,621 INFO L354 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1] [2018-07-25 08:46:33,621 INFO L415 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:33,622 INFO L82 PathProgramCache]: Analyzing trace with hash 899285825, now seen corresponding path program 97 times [2018-07-25 08:46:33,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:34,282 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:34,283 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:34,283 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 08:46:34,283 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 08:46:34,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 08:46:34,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 08:46:34,284 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 100 states. [2018-07-25 08:46:35,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:35,733 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-07-25 08:46:35,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 08:46:35,733 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-07-25 08:46:35,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:35,734 INFO L225 Difference]: With dead ends: 203 [2018-07-25 08:46:35,734 INFO L226 Difference]: Without dead ends: 201 [2018-07-25 08:46:35,735 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 08:46:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-07-25 08:46:35,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-07-25 08:46:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-25 08:46:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-07-25 08:46:35,741 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2018-07-25 08:46:35,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:35,741 INFO L472 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-07-25 08:46:35,741 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 08:46:35,741 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-07-25 08:46:35,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-25 08:46:35,742 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:35,742 INFO L354 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1] [2018-07-25 08:46:35,742 INFO L415 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:35,743 INFO L82 PathProgramCache]: Analyzing trace with hash 925303419, now seen corresponding path program 98 times [2018-07-25 08:46:35,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:36,380 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:36,381 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 08:46:36,381 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 08:46:36,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 08:46:36,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 08:46:36,382 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 101 states. [2018-07-25 08:46:37,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:37,905 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-07-25 08:46:37,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 08:46:37,905 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-07-25 08:46:37,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:37,907 INFO L225 Difference]: With dead ends: 205 [2018-07-25 08:46:37,907 INFO L226 Difference]: Without dead ends: 203 [2018-07-25 08:46:37,907 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 08:46:37,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-25 08:46:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-25 08:46:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 08:46:37,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-07-25 08:46:37,916 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2018-07-25 08:46:37,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:37,916 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-07-25 08:46:37,916 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 08:46:37,916 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-07-25 08:46:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-25 08:46:37,917 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:37,917 INFO L354 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1] [2018-07-25 08:46:37,918 INFO L415 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:37,918 INFO L82 PathProgramCache]: Analyzing trace with hash 158407477, now seen corresponding path program 99 times [2018-07-25 08:46:37,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-25 08:46:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-25 08:46:39,074 INFO L420 BasicCegarLoop]: Counterexample might be feasible [2018-07-25 08:46:39,153 INFO L202 PluginConnector]: Adding new model diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:46:39 BoogieIcfgContainer [2018-07-25 08:46:39,153 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:46:39,154 INFO L168 Benchmark]: Toolchain (without parser) took 95140.43 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -494.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-07-25 08:46:39,158 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:46:39,158 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.46 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-07-25 08:46:39,160 INFO L168 Benchmark]: Boogie Preprocessor took 21.80 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-07-25 08:46:39,161 INFO L168 Benchmark]: RCFGBuilder took 257.56 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-07-25 08:46:39,161 INFO L168 Benchmark]: TraceAbstraction took 94812.64 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -505.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-07-25 08:46:39,168 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.46 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 21.80 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 257.56 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 94812.64 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -505.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 38]: assertion can be violated assertion can be violated We found a FailurePath: [L11] havoc main_#res; [L12] havoc main_#t~nondet0, main_#t~post1, main_~x~5, main_~y~5; [L13] main_~x~5 := 0; [L14] main_~y~5 := main_#t~nondet0; [L15] havoc main_#t~nondet0; VAL [main_~x~5=0] [L18] assume true; VAL [main_~x~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=1, main_~y~5=0] [L18] assume true; VAL [main_~x~5=1, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=2, main_~y~5=0] [L18] assume true; VAL [main_~x~5=2, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=3, main_~y~5=0] [L18] assume true; VAL [main_~x~5=3, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=4, main_~y~5=0] [L18] assume true; VAL [main_~x~5=4, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=5, main_~y~5=0] [L18] assume true; VAL [main_~x~5=5, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=6, main_~y~5=0] [L18] assume true; VAL [main_~x~5=6, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=7, main_~y~5=0] [L18] assume true; VAL [main_~x~5=7, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=8, main_~y~5=0] [L18] assume true; VAL [main_~x~5=8, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=9, main_~y~5=0] [L18] assume true; VAL [main_~x~5=9, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=10, main_~y~5=0] [L18] assume true; VAL [main_~x~5=10, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=11, main_~y~5=0] [L18] assume true; VAL [main_~x~5=11, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=12, main_~y~5=0] [L18] assume true; VAL [main_~x~5=12, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=13, main_~y~5=0] [L18] assume true; VAL [main_~x~5=13, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=14, main_~y~5=0] [L18] assume true; VAL [main_~x~5=14, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=15, main_~y~5=0] [L18] assume true; VAL [main_~x~5=15, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=16, main_~y~5=0] [L18] assume true; VAL [main_~x~5=16, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=17, main_~y~5=0] [L18] assume true; VAL [main_~x~5=17, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=18, main_~y~5=0] [L18] assume true; VAL [main_~x~5=18, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=19, main_~y~5=0] [L18] assume true; VAL [main_~x~5=19, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=20, main_~y~5=0] [L18] assume true; VAL [main_~x~5=20, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=21, main_~y~5=0] [L18] assume true; VAL [main_~x~5=21, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=22, main_~y~5=0] [L18] assume true; VAL [main_~x~5=22, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=23, main_~y~5=0] [L18] assume true; VAL [main_~x~5=23, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=24, main_~y~5=0] [L18] assume true; VAL [main_~x~5=24, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=25, main_~y~5=0] [L18] assume true; VAL [main_~x~5=25, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=26, main_~y~5=0] [L18] assume true; VAL [main_~x~5=26, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=27, main_~y~5=0] [L18] assume true; VAL [main_~x~5=27, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=28, main_~y~5=0] [L18] assume true; VAL [main_~x~5=28, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=29, main_~y~5=0] [L18] assume true; VAL [main_~x~5=29, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=30, main_~y~5=0] [L18] assume true; VAL [main_~x~5=30, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=31, main_~y~5=0] [L18] assume true; VAL [main_~x~5=31, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=32, main_~y~5=0] [L18] assume true; VAL [main_~x~5=32, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=33, main_~y~5=0] [L18] assume true; VAL [main_~x~5=33, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=34, main_~y~5=0] [L18] assume true; VAL [main_~x~5=34, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=35, main_~y~5=0] [L18] assume true; VAL [main_~x~5=35, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=36, main_~y~5=0] [L18] assume true; VAL [main_~x~5=36, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=37, main_~y~5=0] [L18] assume true; VAL [main_~x~5=37, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=38, main_~y~5=0] [L18] assume true; VAL [main_~x~5=38, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=39, main_~y~5=0] [L18] assume true; VAL [main_~x~5=39, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=40, main_~y~5=0] [L18] assume true; VAL [main_~x~5=40, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=41, main_~y~5=0] [L18] assume true; VAL [main_~x~5=41, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=42, main_~y~5=0] [L18] assume true; VAL [main_~x~5=42, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=43, main_~y~5=0] [L18] assume true; VAL [main_~x~5=43, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=44, main_~y~5=0] [L18] assume true; VAL [main_~x~5=44, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=45, main_~y~5=0] [L18] assume true; VAL [main_~x~5=45, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=46, main_~y~5=0] [L18] assume true; VAL [main_~x~5=46, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=47, main_~y~5=0] [L18] assume true; VAL [main_~x~5=47, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=48, main_~y~5=0] [L18] assume true; VAL [main_~x~5=48, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=49, main_~y~5=0] [L18] assume true; VAL [main_~x~5=49, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=50, main_~y~5=0] [L18] assume true; VAL [main_~x~5=50, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=51, main_~y~5=0] [L18] assume true; VAL [main_~x~5=51, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=52, main_~y~5=0] [L18] assume true; VAL [main_~x~5=52, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=53, main_~y~5=0] [L18] assume true; VAL [main_~x~5=53, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=54, main_~y~5=0] [L18] assume true; VAL [main_~x~5=54, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=55, main_~y~5=0] [L18] assume true; VAL [main_~x~5=55, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=56, main_~y~5=0] [L18] assume true; VAL [main_~x~5=56, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=57, main_~y~5=0] [L18] assume true; VAL [main_~x~5=57, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=58, main_~y~5=0] [L18] assume true; VAL [main_~x~5=58, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=59, main_~y~5=0] [L18] assume true; VAL [main_~x~5=59, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=60, main_~y~5=0] [L18] assume true; VAL [main_~x~5=60, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=61, main_~y~5=0] [L18] assume true; VAL [main_~x~5=61, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=62, main_~y~5=0] [L18] assume true; VAL [main_~x~5=62, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=63, main_~y~5=0] [L18] assume true; VAL [main_~x~5=63, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=64, main_~y~5=0] [L18] assume true; VAL [main_~x~5=64, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=65, main_~y~5=0] [L18] assume true; VAL [main_~x~5=65, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=66, main_~y~5=0] [L18] assume true; VAL [main_~x~5=66, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=67, main_~y~5=0] [L18] assume true; VAL [main_~x~5=67, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=68, main_~y~5=0] [L18] assume true; VAL [main_~x~5=68, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=69, main_~y~5=0] [L18] assume true; VAL [main_~x~5=69, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=70, main_~y~5=0] [L18] assume true; VAL [main_~x~5=70, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=71, main_~y~5=0] [L18] assume true; VAL [main_~x~5=71, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=72, main_~y~5=0] [L18] assume true; VAL [main_~x~5=72, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=73, main_~y~5=0] [L18] assume true; VAL [main_~x~5=73, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=74, main_~y~5=0] [L18] assume true; VAL [main_~x~5=74, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=75, main_~y~5=0] [L18] assume true; VAL [main_~x~5=75, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=76, main_~y~5=0] [L18] assume true; VAL [main_~x~5=76, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=77, main_~y~5=0] [L18] assume true; VAL [main_~x~5=77, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=78, main_~y~5=0] [L18] assume true; VAL [main_~x~5=78, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=79, main_~y~5=0] [L18] assume true; VAL [main_~x~5=79, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=80, main_~y~5=0] [L18] assume true; VAL [main_~x~5=80, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=81, main_~y~5=0] [L18] assume true; VAL [main_~x~5=81, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=82, main_~y~5=0] [L18] assume true; VAL [main_~x~5=82, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=83, main_~y~5=0] [L18] assume true; VAL [main_~x~5=83, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=84, main_~y~5=0] [L18] assume true; VAL [main_~x~5=84, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=85, main_~y~5=0] [L18] assume true; VAL [main_~x~5=85, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=86, main_~y~5=0] [L18] assume true; VAL [main_~x~5=86, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=87, main_~y~5=0] [L18] assume true; VAL [main_~x~5=87, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=88, main_~y~5=0] [L18] assume true; VAL [main_~x~5=88, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=89, main_~y~5=0] [L18] assume true; VAL [main_~x~5=89, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=90, main_~y~5=0] [L18] assume true; VAL [main_~x~5=90, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=91, main_~y~5=0] [L18] assume true; VAL [main_~x~5=91, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=92, main_~y~5=0] [L18] assume true; VAL [main_~x~5=92, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=93, main_~y~5=0] [L18] assume true; VAL [main_~x~5=93, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=94, main_~y~5=0] [L18] assume true; VAL [main_~x~5=94, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=95, main_~y~5=0] [L18] assume true; VAL [main_~x~5=95, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=96, main_~y~5=0] [L18] assume true; VAL [main_~x~5=96, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=97, main_~y~5=0] [L18] assume true; VAL [main_~x~5=97, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=98, main_~y~5=0] [L18] assume true; VAL [main_~x~5=98, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=99, main_~y~5=0] [L18] assume true; VAL [main_~x~5=99, main_~y~5=0] [L23] assume !(main_~x~5 % 4294967296 < 99); [L24] __VERIFIER_assert_#in~cond := (if (if main_~x~5 % 4294967296 < 0 && main_~x~5 % 4294967296 % 2 != 0 then main_~x~5 % 4294967296 % 2 - 2 else main_~x~5 % 4294967296 % 2) % 4294967296 == (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 then 1 else 0); [L25] havoc __VERIFIER_assert_~cond; [L26] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L27] assume __VERIFIER_assert_~cond == 0; [L28] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~5=99, main_~y~5=0] [L38] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~5=99, main_~y~5=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. UNSAFE Result, 94.7s OverallTime, 100 OverallIterations, 100 TraceHistogramMax, 61.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5247 SDtfs, 0 SDslu, 328351 SDs, 0 SdLazy, 338250 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5049 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4950 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203occurred in iteration=99, 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.7s AutomataMinimizationTime, 99 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 24.2s InterpolantComputationTime, 10300 NumberOfCodeBlocks, 10300 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 9999 ConstructedInterpolants, 0 QuantifiedInterpolants, 9273099 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 99 InterpolantComputations, 1 PerfectInterpolantSequences, 0/323400 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/diamond1.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-46-39-194.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/diamond1.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-46-39-194.csv Received shutdown request...