java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-56c9370 [2018-07-23 15:19:18,935 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 15:19:18,940 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 15:19:18,959 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 15:19:18,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 15:19:18,960 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 15:19:18,961 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 15:19:18,963 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 15:19:18,965 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 15:19:18,966 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 15:19:18,967 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 15:19:18,967 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 15:19:18,968 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 15:19:18,969 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 15:19:18,970 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 15:19:18,971 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 15:19:18,972 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 15:19:18,973 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 15:19:18,976 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 15:19:18,977 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 15:19:18,978 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 15:19:18,980 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 15:19:18,982 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 15:19:18,983 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 15:19:18,983 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 15:19:18,986 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 15:19:18,989 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 15:19:18,990 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 15:19:18,991 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 15:19:18,992 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 15:19:18,993 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 15:19:18,993 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 15:19:18,994 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 15:19:18,994 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 15:19:18,995 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 15:19:18,996 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 15:19:18,996 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 15:19:19,009 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 15:19:19,010 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 15:19:19,013 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 15:19:19,013 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 15:19:19,014 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 15:19:19,014 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 15:19:19,014 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 15:19:19,014 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 15:19:19,064 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 15:19:19,082 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 15:19:19,089 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 15:19:19,091 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 15:19:19,092 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 15:19:19,093 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-07-23 15:19:19,094 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl' [2018-07-23 15:19:19,146 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 15:19:19,147 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 15:19:19,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 15:19:19,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 15:19:19,148 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 15:19:19,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:19:19" (1/1) ... [2018-07-23 15:19:19,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:19:19" (1/1) ... [2018-07-23 15:19:19,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:19:19" (1/1) ... [2018-07-23 15:19:19,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:19:19" (1/1) ... [2018-07-23 15:19:19,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:19:19" (1/1) ... [2018-07-23 15:19:19,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:19:19" (1/1) ... [2018-07-23 15:19:19,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:19:19" (1/1) ... [2018-07-23 15:19:19,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 15:19:19,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 15:19:19,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 15:19:19,197 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 15:19:19,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:19:19" (1/1) ... [2018-07-23 15:19:19,286 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-07-23 15:19:19,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 15:19:19,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 15:19:19,453 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 15:19:19,454 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:19:19 BoogieIcfgContainer [2018-07-23 15:19:19,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 15:19:19,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 15:19:19,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 15:19:19,458 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 15:19:19,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:19:19" (1/2) ... [2018-07-23 15:19:19,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8e9fe4 and model type gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 03:19:19, skipping insertion in model container [2018-07-23 15:19:19,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:19:19" (2/2) ... [2018-07-23 15:19:19,463 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-07-23 15:19:19,479 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 15:19:19,488 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 15:19:19,542 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 15:19:19,543 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 15:19:19,544 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 15:19:19,544 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 15:19:19,544 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 15:19:19,544 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 15:19:19,545 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 15:19:19,545 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 15:19:19,545 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 15:19:19,562 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-07-23 15:19:19,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-23 15:19:19,575 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:19,577 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-23 15:19:19,578 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:19,584 INFO L82 PathProgramCache]: Analyzing trace with hash 30023, now seen corresponding path program 1 times [2018-07-23 15:19:19,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:19,655 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-23 15:19:19,658 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:19:19,658 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 15:19:19,662 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:19:19,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:19:19,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:19:19,680 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-07-23 15:19:19,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:19,705 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2018-07-23 15:19:19,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:19:19,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-23 15:19:19,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:19,717 INFO L225 Difference]: With dead ends: 8 [2018-07-23 15:19:19,718 INFO L226 Difference]: Without dead ends: 5 [2018-07-23 15:19:19,721 INFO L573 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-23 15:19:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-23 15:19:19,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-23 15:19:19,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-23 15:19:19,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-23 15:19:19,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-23 15:19:19,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:19,759 INFO L471 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-23 15:19:19,759 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:19:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-23 15:19:19,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 15:19:19,760 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:19,760 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 15:19:19,760 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:19,761 INFO L82 PathProgramCache]: Analyzing trace with hash 942973, now seen corresponding path program 1 times [2018-07-23 15:19:19,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:19,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:19,782 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:19,782 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 15:19:19,784 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:19:19,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:19:19,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:19:19,785 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-07-23 15:19:19,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:19,802 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-23 15:19:19,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 15:19:19,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-23 15:19:19,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:19,803 INFO L225 Difference]: With dead ends: 8 [2018-07-23 15:19:19,803 INFO L226 Difference]: Without dead ends: 6 [2018-07-23 15:19:19,804 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:19:19,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-23 15:19:19,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-23 15:19:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-23 15:19:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-23 15:19:19,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-23 15:19:19,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:19,807 INFO L471 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-23 15:19:19,808 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:19:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-23 15:19:19,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-23 15:19:19,808 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:19,809 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-23 15:19:19,809 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:19,809 INFO L82 PathProgramCache]: Analyzing trace with hash 29244423, now seen corresponding path program 2 times [2018-07-23 15:19:19,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:19,854 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:19,857 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 15:19:19,858 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 15:19:19,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 15:19:19,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:19:19,859 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-07-23 15:19:19,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:19,876 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-23 15:19:19,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 15:19:19,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-23 15:19:19,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:19,877 INFO L225 Difference]: With dead ends: 9 [2018-07-23 15:19:19,877 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 15:19:19,878 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:19:19,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 15:19:19,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-23 15:19:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 15:19:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 15:19:19,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-23 15:19:19,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:19,881 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 15:19:19,882 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 15:19:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 15:19:19,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 15:19:19,882 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:19,882 INFO L353 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-23 15:19:19,883 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:19,883 INFO L82 PathProgramCache]: Analyzing trace with hash 906589373, now seen corresponding path program 3 times [2018-07-23 15:19:19,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:19,925 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-23 15:19:19,925 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:19,925 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 15:19:19,926 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 15:19:19,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 15:19:19,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:19:19,931 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-23 15:19:19,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:19,948 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-23 15:19:19,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 15:19:19,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 15:19:19,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:19,949 INFO L225 Difference]: With dead ends: 10 [2018-07-23 15:19:19,949 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 15:19:19,950 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:19:19,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 15:19:19,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-23 15:19:19,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-23 15:19:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-23 15:19:19,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-23 15:19:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:19,953 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-23 15:19:19,953 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 15:19:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-23 15:19:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 15:19:19,954 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:19,954 INFO L353 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-23 15:19:19,955 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:19,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1960488249, now seen corresponding path program 4 times [2018-07-23 15:19:19,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:20,000 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:20,001 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:19:20,001 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:19:20,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:19:20,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:19:20,002 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-23 15:19:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:20,038 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-23 15:19:20,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 15:19:20,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-23 15:19:20,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:20,039 INFO L225 Difference]: With dead ends: 11 [2018-07-23 15:19:20,039 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 15:19:20,040 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:19:20,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 15:19:20,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-23 15:19:20,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 15:19:20,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 15:19:20,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-23 15:19:20,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:20,044 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 15:19:20,044 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:19:20,044 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 15:19:20,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:19:20,045 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:20,045 INFO L353 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-23 15:19:20,045 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:20,046 INFO L82 PathProgramCache]: Analyzing trace with hash -645581315, now seen corresponding path program 5 times [2018-07-23 15:19:20,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:20,133 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:20,133 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:20,134 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:19:20,134 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:19:20,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:19:20,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:19:20,135 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-07-23 15:19:20,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:20,153 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 15:19:20,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 15:19:20,153 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 15:19:20,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:20,154 INFO L225 Difference]: With dead ends: 12 [2018-07-23 15:19:20,154 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 15:19:20,155 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:19:20,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 15:19:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-23 15:19:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-23 15:19:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-23 15:19:20,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-23 15:19:20,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:20,160 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-23 15:19:20,160 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:19:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-23 15:19:20,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 15:19:20,161 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:20,161 INFO L353 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-23 15:19:20,161 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:20,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1461827975, now seen corresponding path program 6 times [2018-07-23 15:19:20,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:20,238 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:20,238 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:20,238 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:19:20,239 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:19:20,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:19:20,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:19:20,240 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-07-23 15:19:20,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:20,256 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 15:19:20,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 15:19:20,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-23 15:19:20,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:20,257 INFO L225 Difference]: With dead ends: 13 [2018-07-23 15:19:20,257 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 15:19:20,258 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:19:20,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 15:19:20,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 15:19:20,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 15:19:20,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 15:19:20,266 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-23 15:19:20,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:20,267 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 15:19:20,267 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:19:20,267 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 15:19:20,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:19:20,270 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:20,271 INFO L353 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-23 15:19:20,271 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:20,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1927960771, now seen corresponding path program 7 times [2018-07-23 15:19:20,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:20,375 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:20,376 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:19:20,376 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:19:20,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:19:20,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:19:20,381 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-07-23 15:19:20,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:20,422 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-23 15:19:20,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:19:20,424 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-07-23 15:19:20,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:20,425 INFO L225 Difference]: With dead ends: 14 [2018-07-23 15:19:20,425 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 15:19:20,426 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:19:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 15:19:20,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-23 15:19:20,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-23 15:19:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-23 15:19:20,433 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-23 15:19:20,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:20,433 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-23 15:19:20,434 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:19:20,434 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-23 15:19:20,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 15:19:20,434 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:20,435 INFO L353 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-23 15:19:20,435 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:20,435 INFO L82 PathProgramCache]: Analyzing trace with hash 362770503, now seen corresponding path program 8 times [2018-07-23 15:19:20,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:20,506 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:20,506 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:20,506 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:19:20,507 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:19:20,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:19:20,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:19:20,508 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-07-23 15:19:20,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:20,541 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 15:19:20,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 15:19:20,541 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-07-23 15:19:20,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:20,542 INFO L225 Difference]: With dead ends: 15 [2018-07-23 15:19:20,542 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 15:19:20,543 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:19:20,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 15:19:20,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 15:19:20,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 15:19:20,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 15:19:20,548 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-23 15:19:20,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:20,548 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 15:19:20,548 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:19:20,548 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 15:19:20,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 15:19:20,549 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:20,549 INFO L353 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-23 15:19:20,549 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:20,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1639004035, now seen corresponding path program 9 times [2018-07-23 15:19:20,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:20,617 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:20,618 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:19:20,618 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:19:20,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:19:20,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:19:20,619 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-07-23 15:19:20,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:20,645 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-23 15:19:20,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:19:20,646 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-07-23 15:19:20,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:20,650 INFO L225 Difference]: With dead ends: 16 [2018-07-23 15:19:20,650 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 15:19:20,651 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:19:20,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 15:19:20,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-23 15:19:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-23 15:19:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-23 15:19:20,661 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-23 15:19:20,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:20,664 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-23 15:19:20,664 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:19:20,664 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-23 15:19:20,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:19:20,665 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:20,665 INFO L353 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-23 15:19:20,665 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:20,666 INFO L82 PathProgramCache]: Analyzing trace with hash 730494727, now seen corresponding path program 10 times [2018-07-23 15:19:20,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:20,777 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:20,777 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:19:20,777 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:19:20,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:19:20,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:19:20,780 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-07-23 15:19:20,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:20,806 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 15:19:20,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 15:19:20,807 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-07-23 15:19:20,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:20,809 INFO L225 Difference]: With dead ends: 17 [2018-07-23 15:19:20,809 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 15:19:20,810 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:19:20,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 15:19:20,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-23 15:19:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 15:19:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 15:19:20,818 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-23 15:19:20,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:20,818 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 15:19:20,818 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:19:20,819 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 15:19:20,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 15:19:20,819 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:20,820 INFO L353 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-23 15:19:20,820 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:20,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1170512317, now seen corresponding path program 11 times [2018-07-23 15:19:20,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:20,911 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:20,912 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:20,912 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:19:20,912 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:19:20,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:19:20,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:19:20,914 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-07-23 15:19:20,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:20,939 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-23 15:19:20,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 15:19:20,939 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-07-23 15:19:20,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:20,940 INFO L225 Difference]: With dead ends: 18 [2018-07-23 15:19:20,943 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 15:19:20,944 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:19:20,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 15:19:20,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-23 15:19:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-23 15:19:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-23 15:19:20,952 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-23 15:19:20,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:20,952 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-23 15:19:20,952 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:19:20,953 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-23 15:19:20,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:19:20,954 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:20,954 INFO L353 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-07-23 15:19:20,954 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:20,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1926155719, now seen corresponding path program 12 times [2018-07-23 15:19:20,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:21,038 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:21,039 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:21,039 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 15:19:21,039 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 15:19:21,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 15:19:21,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:19:21,041 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-07-23 15:19:21,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:21,054 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-23 15:19:21,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 15:19:21,054 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-07-23 15:19:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:21,055 INFO L225 Difference]: With dead ends: 19 [2018-07-23 15:19:21,056 INFO L226 Difference]: Without dead ends: 17 [2018-07-23 15:19:21,056 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:19:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-23 15:19:21,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-23 15:19:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 15:19:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-23 15:19:21,062 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-07-23 15:19:21,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:21,063 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-23 15:19:21,063 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 15:19:21,063 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-23 15:19:21,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 15:19:21,064 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:21,064 INFO L353 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-07-23 15:19:21,065 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:21,065 INFO L82 PathProgramCache]: Analyzing trace with hash -418702595, now seen corresponding path program 13 times [2018-07-23 15:19:21,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:21,161 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:21,161 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 15:19:21,162 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 15:19:21,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 15:19:21,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:19:21,163 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-07-23 15:19:21,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:21,179 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-23 15:19:21,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 15:19:21,180 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-07-23 15:19:21,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:21,180 INFO L225 Difference]: With dead ends: 20 [2018-07-23 15:19:21,181 INFO L226 Difference]: Without dead ends: 18 [2018-07-23 15:19:21,181 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:19:21,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-23 15:19:21,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-23 15:19:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-23 15:19:21,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-23 15:19:21,185 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-07-23 15:19:21,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:21,186 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-23 15:19:21,186 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 15:19:21,186 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-23 15:19:21,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 15:19:21,187 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:21,187 INFO L353 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-07-23 15:19:21,188 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:21,188 INFO L82 PathProgramCache]: Analyzing trace with hash -94866297, now seen corresponding path program 14 times [2018-07-23 15:19:21,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:21,260 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:21,260 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 15:19:21,261 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 15:19:21,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 15:19:21,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:19:21,262 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-07-23 15:19:21,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:21,276 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-23 15:19:21,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 15:19:21,277 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-07-23 15:19:21,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:21,278 INFO L225 Difference]: With dead ends: 21 [2018-07-23 15:19:21,278 INFO L226 Difference]: Without dead ends: 19 [2018-07-23 15:19:21,278 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:19:21,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-23 15:19:21,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-23 15:19:21,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 15:19:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-23 15:19:21,283 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-07-23 15:19:21,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:21,283 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-23 15:19:21,283 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 15:19:21,283 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-23 15:19:21,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:19:21,284 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:21,284 INFO L353 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-07-23 15:19:21,284 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:21,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1354124349, now seen corresponding path program 15 times [2018-07-23 15:19:21,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:21,353 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:21,354 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 15:19:21,354 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 15:19:21,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 15:19:21,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:19:21,355 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-07-23 15:19:21,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:21,371 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-23 15:19:21,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 15:19:21,372 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-07-23 15:19:21,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:21,373 INFO L225 Difference]: With dead ends: 22 [2018-07-23 15:19:21,373 INFO L226 Difference]: Without dead ends: 20 [2018-07-23 15:19:21,373 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:19:21,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-23 15:19:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-23 15:19:21,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-23 15:19:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-23 15:19:21,377 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-07-23 15:19:21,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:21,378 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-23 15:19:21,378 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 15:19:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-23 15:19:21,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 15:19:21,379 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:21,379 INFO L353 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-07-23 15:19:21,379 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:21,380 INFO L82 PathProgramCache]: Analyzing trace with hash -971805881, now seen corresponding path program 16 times [2018-07-23 15:19:21,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:21,472 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:21,473 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:21,473 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-23 15:19:21,475 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-23 15:19:21,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-23 15:19:21,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:19:21,476 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-07-23 15:19:21,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:21,491 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-23 15:19:21,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 15:19:21,491 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-07-23 15:19:21,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:21,492 INFO L225 Difference]: With dead ends: 23 [2018-07-23 15:19:21,493 INFO L226 Difference]: Without dead ends: 21 [2018-07-23 15:19:21,494 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:19:21,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-23 15:19:21,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-23 15:19:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-23 15:19:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-23 15:19:21,498 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-07-23 15:19:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:21,500 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-23 15:19:21,500 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-23 15:19:21,500 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-23 15:19:21,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:19:21,501 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:21,501 INFO L353 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-07-23 15:19:21,502 INFO L414 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:21,502 INFO L82 PathProgramCache]: Analyzing trace with hash -61198979, now seen corresponding path program 17 times [2018-07-23 15:19:21,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:21,594 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:21,595 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:21,595 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-23 15:19:21,595 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 15:19:21,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 15:19:21,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-23 15:19:21,597 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-07-23 15:19:21,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:21,613 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-23 15:19:21,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 15:19:21,614 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-07-23 15:19:21,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:21,615 INFO L225 Difference]: With dead ends: 24 [2018-07-23 15:19:21,615 INFO L226 Difference]: Without dead ends: 22 [2018-07-23 15:19:21,616 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-23 15:19:21,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-23 15:19:21,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-23 15:19:21,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-23 15:19:21,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-23 15:19:21,619 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-07-23 15:19:21,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:21,620 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-23 15:19:21,620 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 15:19:21,620 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-23 15:19:21,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 15:19:21,621 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:21,621 INFO L353 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-07-23 15:19:21,621 INFO L414 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:21,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1897156089, now seen corresponding path program 18 times [2018-07-23 15:19:21,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:21,724 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:21,724 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-23 15:19:21,724 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 15:19:21,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 15:19:21,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:19:21,727 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-07-23 15:19:21,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:21,742 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-23 15:19:21,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 15:19:21,743 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-07-23 15:19:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:21,743 INFO L225 Difference]: With dead ends: 25 [2018-07-23 15:19:21,744 INFO L226 Difference]: Without dead ends: 23 [2018-07-23 15:19:21,744 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:19:21,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-23 15:19:21,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-23 15:19:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-23 15:19:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-23 15:19:21,754 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-07-23 15:19:21,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:21,755 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-23 15:19:21,755 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 15:19:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-23 15:19:21,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 15:19:21,756 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:21,758 INFO L353 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-07-23 15:19:21,758 INFO L414 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:21,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1317715645, now seen corresponding path program 19 times [2018-07-23 15:19:21,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:21,855 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:21,855 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:21,855 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-23 15:19:21,856 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-23 15:19:21,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-23 15:19:21,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-23 15:19:21,857 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-07-23 15:19:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:21,878 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-23 15:19:21,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 15:19:21,878 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-07-23 15:19:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:21,879 INFO L225 Difference]: With dead ends: 26 [2018-07-23 15:19:21,879 INFO L226 Difference]: Without dead ends: 24 [2018-07-23 15:19:21,880 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-23 15:19:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-23 15:19:21,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-23 15:19:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-23 15:19:21,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-23 15:19:21,887 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-07-23 15:19:21,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:21,888 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-23 15:19:21,888 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-23 15:19:21,888 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-23 15:19:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 15:19:21,889 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:21,889 INFO L353 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-07-23 15:19:21,889 INFO L414 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:21,891 INFO L82 PathProgramCache]: Analyzing trace with hash -2100475705, now seen corresponding path program 20 times [2018-07-23 15:19:21,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:21,999 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-23 15:19:22,000 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:22,000 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-23 15:19:22,001 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 15:19:22,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 15:19:22,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-23 15:19:22,003 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-07-23 15:19:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:22,026 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-23 15:19:22,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 15:19:22,026 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-07-23 15:19:22,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:22,027 INFO L225 Difference]: With dead ends: 27 [2018-07-23 15:19:22,027 INFO L226 Difference]: Without dead ends: 25 [2018-07-23 15:19:22,028 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-23 15:19:22,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-23 15:19:22,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-23 15:19:22,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 15:19:22,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-23 15:19:22,033 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-07-23 15:19:22,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:22,034 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-23 15:19:22,034 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 15:19:22,034 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-23 15:19:22,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 15:19:22,035 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:22,035 INFO L353 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-07-23 15:19:22,035 INFO L414 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:22,035 INFO L82 PathProgramCache]: Analyzing trace with hash -690225155, now seen corresponding path program 21 times [2018-07-23 15:19:22,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:22,136 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:22,136 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-23 15:19:22,137 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 15:19:22,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 15:19:22,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-23 15:19:22,138 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-07-23 15:19:22,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:22,156 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-23 15:19:22,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 15:19:22,157 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-07-23 15:19:22,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:22,158 INFO L225 Difference]: With dead ends: 28 [2018-07-23 15:19:22,158 INFO L226 Difference]: Without dead ends: 26 [2018-07-23 15:19:22,159 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-23 15:19:22,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-23 15:19:22,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-23 15:19:22,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-23 15:19:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-23 15:19:22,162 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-07-23 15:19:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:22,163 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-23 15:19:22,163 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 15:19:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-23 15:19:22,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 15:19:22,164 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:22,164 INFO L353 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-07-23 15:19:22,164 INFO L414 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:22,165 INFO L82 PathProgramCache]: Analyzing trace with hash 77868935, now seen corresponding path program 22 times [2018-07-23 15:19:22,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:22,303 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:22,303 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-23 15:19:22,303 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 15:19:22,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 15:19:22,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-23 15:19:22,304 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-07-23 15:19:22,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:22,329 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-23 15:19:22,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 15:19:22,330 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-07-23 15:19:22,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:22,331 INFO L225 Difference]: With dead ends: 29 [2018-07-23 15:19:22,331 INFO L226 Difference]: Without dead ends: 27 [2018-07-23 15:19:22,331 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-23 15:19:22,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-23 15:19:22,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-23 15:19:22,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-23 15:19:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-23 15:19:22,338 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-07-23 15:19:22,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:22,338 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-23 15:19:22,338 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 15:19:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-23 15:19:22,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 15:19:22,339 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:22,339 INFO L353 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-07-23 15:19:22,340 INFO L414 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:22,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1881018051, now seen corresponding path program 23 times [2018-07-23 15:19:22,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:22,477 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:22,478 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:22,478 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-23 15:19:22,478 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 15:19:22,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 15:19:22,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:19:22,483 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-07-23 15:19:22,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:22,507 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-23 15:19:22,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 15:19:22,508 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-07-23 15:19:22,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:22,508 INFO L225 Difference]: With dead ends: 30 [2018-07-23 15:19:22,508 INFO L226 Difference]: Without dead ends: 28 [2018-07-23 15:19:22,509 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:19:22,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-23 15:19:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-23 15:19:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-23 15:19:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-23 15:19:22,517 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-07-23 15:19:22,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:22,518 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-23 15:19:22,518 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 15:19:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-23 15:19:22,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-23 15:19:22,519 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:22,519 INFO L353 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-07-23 15:19:22,519 INFO L414 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:22,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1817994823, now seen corresponding path program 24 times [2018-07-23 15:19:22,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:22,654 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:22,654 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-23 15:19:22,654 INFO L450 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-23 15:19:22,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-23 15:19:22,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:19:22,656 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-07-23 15:19:22,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:22,673 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-23 15:19:22,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 15:19:22,673 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-07-23 15:19:22,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:22,674 INFO L225 Difference]: With dead ends: 31 [2018-07-23 15:19:22,674 INFO L226 Difference]: Without dead ends: 29 [2018-07-23 15:19:22,675 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:19:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-23 15:19:22,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-23 15:19:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-23 15:19:22,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-23 15:19:22,681 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-07-23 15:19:22,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:22,681 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-23 15:19:22,682 INFO L472 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-23 15:19:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-23 15:19:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 15:19:22,683 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:22,683 INFO L353 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-07-23 15:19:22,683 INFO L414 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:22,686 INFO L82 PathProgramCache]: Analyzing trace with hash 523276925, now seen corresponding path program 25 times [2018-07-23 15:19:22,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:22,817 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:22,817 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-23 15:19:22,817 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 15:19:22,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 15:19:22,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:19:22,819 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-07-23 15:19:22,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:22,841 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-23 15:19:22,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 15:19:22,843 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-07-23 15:19:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:22,844 INFO L225 Difference]: With dead ends: 32 [2018-07-23 15:19:22,844 INFO L226 Difference]: Without dead ends: 30 [2018-07-23 15:19:22,845 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:19:22,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-23 15:19:22,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-23 15:19:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-23 15:19:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-23 15:19:22,850 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-07-23 15:19:22,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:22,850 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-23 15:19:22,850 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 15:19:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-23 15:19:22,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 15:19:22,851 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:22,853 INFO L353 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-07-23 15:19:22,853 INFO L414 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:22,854 INFO L82 PathProgramCache]: Analyzing trace with hash -958272249, now seen corresponding path program 26 times [2018-07-23 15:19:22,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:23,001 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:23,002 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:23,002 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-23 15:19:23,003 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-23 15:19:23,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-23 15:19:23,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-23 15:19:23,005 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-07-23 15:19:23,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:23,033 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-23 15:19:23,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 15:19:23,034 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-07-23 15:19:23,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:23,034 INFO L225 Difference]: With dead ends: 33 [2018-07-23 15:19:23,034 INFO L226 Difference]: Without dead ends: 31 [2018-07-23 15:19:23,036 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-23 15:19:23,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-23 15:19:23,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-23 15:19:23,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-23 15:19:23,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-23 15:19:23,040 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-07-23 15:19:23,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:23,041 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-23 15:19:23,041 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-23 15:19:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-23 15:19:23,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-23 15:19:23,042 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:23,043 INFO L353 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-07-23 15:19:23,043 INFO L414 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:23,043 INFO L82 PathProgramCache]: Analyzing trace with hash 358343613, now seen corresponding path program 27 times [2018-07-23 15:19:23,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:23,184 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:23,184 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-23 15:19:23,184 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 15:19:23,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 15:19:23,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-23 15:19:23,186 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-07-23 15:19:23,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:23,213 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-23 15:19:23,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 15:19:23,213 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-07-23 15:19:23,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:23,214 INFO L225 Difference]: With dead ends: 34 [2018-07-23 15:19:23,214 INFO L226 Difference]: Without dead ends: 32 [2018-07-23 15:19:23,215 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-23 15:19:23,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-23 15:19:23,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-23 15:19:23,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-23 15:19:23,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-23 15:19:23,227 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-07-23 15:19:23,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:23,227 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-23 15:19:23,227 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 15:19:23,227 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-23 15:19:23,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-23 15:19:23,228 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:23,228 INFO L353 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-07-23 15:19:23,228 INFO L414 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:23,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1776237625, now seen corresponding path program 28 times [2018-07-23 15:19:23,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:23,386 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:23,386 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-23 15:19:23,387 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 15:19:23,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 15:19:23,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-23 15:19:23,388 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-07-23 15:19:23,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:23,409 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-23 15:19:23,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 15:19:23,409 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-07-23 15:19:23,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:23,410 INFO L225 Difference]: With dead ends: 35 [2018-07-23 15:19:23,410 INFO L226 Difference]: Without dead ends: 33 [2018-07-23 15:19:23,411 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-23 15:19:23,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-23 15:19:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-23 15:19:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-23 15:19:23,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-23 15:19:23,422 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-07-23 15:19:23,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:23,422 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-23 15:19:23,422 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 15:19:23,422 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-23 15:19:23,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-23 15:19:23,423 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:23,423 INFO L353 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-07-23 15:19:23,423 INFO L414 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:23,424 INFO L82 PathProgramCache]: Analyzing trace with hash 771220733, now seen corresponding path program 29 times [2018-07-23 15:19:23,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:23,643 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:23,643 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-23 15:19:23,644 INFO L450 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-23 15:19:23,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-23 15:19:23,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-23 15:19:23,645 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-07-23 15:19:23,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:23,666 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-23 15:19:23,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-23 15:19:23,668 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-07-23 15:19:23,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:23,668 INFO L225 Difference]: With dead ends: 36 [2018-07-23 15:19:23,668 INFO L226 Difference]: Without dead ends: 34 [2018-07-23 15:19:23,669 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-23 15:19:23,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-23 15:19:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-23 15:19:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-23 15:19:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-23 15:19:23,675 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-07-23 15:19:23,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:23,675 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-23 15:19:23,675 INFO L472 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-23 15:19:23,676 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-23 15:19:23,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-23 15:19:23,676 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:23,676 INFO L353 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-07-23 15:19:23,676 INFO L414 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:23,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1861948793, now seen corresponding path program 30 times [2018-07-23 15:19:23,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:23,824 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:23,825 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:23,825 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-23 15:19:23,825 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 15:19:23,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 15:19:23,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 15:19:23,827 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-07-23 15:19:23,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:23,843 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-23 15:19:23,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 15:19:23,843 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-07-23 15:19:23,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:23,843 INFO L225 Difference]: With dead ends: 37 [2018-07-23 15:19:23,844 INFO L226 Difference]: Without dead ends: 35 [2018-07-23 15:19:23,845 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 15:19:23,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-23 15:19:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-23 15:19:23,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-23 15:19:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-23 15:19:23,848 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-07-23 15:19:23,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:23,848 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-23 15:19:23,848 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 15:19:23,848 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-23 15:19:23,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-23 15:19:23,849 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:23,849 INFO L353 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-07-23 15:19:23,849 INFO L414 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:23,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1885825475, now seen corresponding path program 31 times [2018-07-23 15:19:23,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:24,011 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:24,011 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-23 15:19:24,011 INFO L450 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-23 15:19:24,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-23 15:19:24,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 15:19:24,013 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-07-23 15:19:24,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:24,028 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-23 15:19:24,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 15:19:24,029 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-07-23 15:19:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:24,029 INFO L225 Difference]: With dead ends: 38 [2018-07-23 15:19:24,029 INFO L226 Difference]: Without dead ends: 36 [2018-07-23 15:19:24,030 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 15:19:24,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-23 15:19:24,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-23 15:19:24,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-23 15:19:24,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-23 15:19:24,037 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-07-23 15:19:24,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:24,041 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-23 15:19:24,041 INFO L472 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-23 15:19:24,042 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-23 15:19:24,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-23 15:19:24,042 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:24,042 INFO L353 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-07-23 15:19:24,044 INFO L414 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:24,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1668964679, now seen corresponding path program 32 times [2018-07-23 15:19:24,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:24,201 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:24,201 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:24,203 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-23 15:19:24,203 INFO L450 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-23 15:19:24,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-23 15:19:24,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 15:19:24,206 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-07-23 15:19:24,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:24,228 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-23 15:19:24,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 15:19:24,229 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-07-23 15:19:24,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:24,229 INFO L225 Difference]: With dead ends: 39 [2018-07-23 15:19:24,229 INFO L226 Difference]: Without dead ends: 37 [2018-07-23 15:19:24,231 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 15:19:24,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-23 15:19:24,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-23 15:19:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-23 15:19:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-23 15:19:24,235 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-07-23 15:19:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:24,235 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-23 15:19:24,235 INFO L472 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-23 15:19:24,236 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-23 15:19:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 15:19:24,236 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:24,236 INFO L353 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-07-23 15:19:24,236 INFO L414 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:24,236 INFO L82 PathProgramCache]: Analyzing trace with hash 198309757, now seen corresponding path program 33 times [2018-07-23 15:19:24,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:24,397 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:24,397 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:24,398 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-23 15:19:24,398 INFO L450 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-23 15:19:24,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-23 15:19:24,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 15:19:24,399 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-07-23 15:19:24,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:24,423 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-23 15:19:24,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 15:19:24,423 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-07-23 15:19:24,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:24,424 INFO L225 Difference]: With dead ends: 40 [2018-07-23 15:19:24,424 INFO L226 Difference]: Without dead ends: 38 [2018-07-23 15:19:24,425 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 15:19:24,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-23 15:19:24,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-23 15:19:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-23 15:19:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-23 15:19:24,429 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-07-23 15:19:24,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:24,429 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-23 15:19:24,429 INFO L472 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-23 15:19:24,429 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-23 15:19:24,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-23 15:19:24,430 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:24,430 INFO L353 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-07-23 15:19:24,430 INFO L414 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:24,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1852647431, now seen corresponding path program 34 times [2018-07-23 15:19:24,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:24,613 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:24,613 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:24,613 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-23 15:19:24,614 INFO L450 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-23 15:19:24,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-23 15:19:24,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 15:19:24,615 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-07-23 15:19:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:24,638 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-23 15:19:24,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-23 15:19:24,638 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-07-23 15:19:24,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:24,639 INFO L225 Difference]: With dead ends: 41 [2018-07-23 15:19:24,639 INFO L226 Difference]: Without dead ends: 39 [2018-07-23 15:19:24,640 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 15:19:24,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-23 15:19:24,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-23 15:19:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-23 15:19:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-23 15:19:24,649 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-07-23 15:19:24,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:24,650 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-23 15:19:24,650 INFO L472 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-23 15:19:24,650 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-23 15:19:24,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-23 15:19:24,650 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:24,651 INFO L353 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-07-23 15:19:24,651 INFO L414 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:24,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1597507773, now seen corresponding path program 35 times [2018-07-23 15:19:24,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:24,844 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:24,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-23 15:19:24,845 INFO L450 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-23 15:19:24,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-23 15:19:24,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 15:19:24,846 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-07-23 15:19:24,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:24,868 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-23 15:19:24,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 15:19:24,868 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-07-23 15:19:24,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:24,869 INFO L225 Difference]: With dead ends: 42 [2018-07-23 15:19:24,869 INFO L226 Difference]: Without dead ends: 40 [2018-07-23 15:19:24,870 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 15:19:24,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-23 15:19:24,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-23 15:19:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-23 15:19:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-23 15:19:24,876 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-07-23 15:19:24,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:24,876 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-23 15:19:24,876 INFO L472 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-23 15:19:24,876 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-23 15:19:24,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-23 15:19:24,877 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:24,877 INFO L353 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-07-23 15:19:24,877 INFO L414 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:24,879 INFO L82 PathProgramCache]: Analyzing trace with hash -2016854329, now seen corresponding path program 36 times [2018-07-23 15:19:24,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:25,059 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:25,059 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-23 15:19:25,059 INFO L450 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-23 15:19:25,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-23 15:19:25,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 15:19:25,061 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-07-23 15:19:25,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:25,080 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-23 15:19:25,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 15:19:25,080 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-07-23 15:19:25,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:25,081 INFO L225 Difference]: With dead ends: 43 [2018-07-23 15:19:25,081 INFO L226 Difference]: Without dead ends: 41 [2018-07-23 15:19:25,082 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 15:19:25,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-23 15:19:25,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-23 15:19:25,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-23 15:19:25,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-23 15:19:25,085 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-07-23 15:19:25,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:25,085 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-23 15:19:25,085 INFO L472 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-23 15:19:25,085 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-23 15:19:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 15:19:25,086 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:25,086 INFO L353 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-07-23 15:19:25,086 INFO L414 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:25,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1902037501, now seen corresponding path program 37 times [2018-07-23 15:19:25,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:25,273 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:25,273 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-23 15:19:25,274 INFO L450 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-23 15:19:25,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-23 15:19:25,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 15:19:25,276 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-07-23 15:19:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:25,297 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-23 15:19:25,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 15:19:25,297 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-07-23 15:19:25,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:25,298 INFO L225 Difference]: With dead ends: 44 [2018-07-23 15:19:25,298 INFO L226 Difference]: Without dead ends: 42 [2018-07-23 15:19:25,299 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 15:19:25,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-23 15:19:25,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-23 15:19:25,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-23 15:19:25,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-23 15:19:25,302 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-07-23 15:19:25,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:25,302 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-23 15:19:25,302 INFO L472 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-23 15:19:25,302 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-23 15:19:25,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-23 15:19:25,303 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:25,303 INFO L353 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-07-23 15:19:25,303 INFO L414 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:25,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1166367353, now seen corresponding path program 38 times [2018-07-23 15:19:25,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:25,494 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:25,494 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:25,494 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-23 15:19:25,494 INFO L450 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-23 15:19:25,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-23 15:19:25,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 15:19:25,496 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-07-23 15:19:25,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:25,521 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-23 15:19:25,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-23 15:19:25,521 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-07-23 15:19:25,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:25,522 INFO L225 Difference]: With dead ends: 45 [2018-07-23 15:19:25,522 INFO L226 Difference]: Without dead ends: 43 [2018-07-23 15:19:25,523 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 15:19:25,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-23 15:19:25,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-23 15:19:25,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-23 15:19:25,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-23 15:19:25,526 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-07-23 15:19:25,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:25,526 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-23 15:19:25,526 INFO L472 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-23 15:19:25,526 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-23 15:19:25,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 15:19:25,526 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:25,527 INFO L353 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-07-23 15:19:25,527 INFO L414 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:25,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1797637315, now seen corresponding path program 39 times [2018-07-23 15:19:25,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:25,719 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:25,719 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-23 15:19:25,719 INFO L450 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-23 15:19:25,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-23 15:19:25,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 15:19:25,721 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-07-23 15:19:25,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:25,741 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-23 15:19:25,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-23 15:19:25,741 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-07-23 15:19:25,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:25,742 INFO L225 Difference]: With dead ends: 46 [2018-07-23 15:19:25,742 INFO L226 Difference]: Without dead ends: 44 [2018-07-23 15:19:25,743 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 15:19:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-23 15:19:25,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-23 15:19:25,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-23 15:19:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-23 15:19:25,746 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-07-23 15:19:25,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:25,746 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-23 15:19:25,746 INFO L472 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-23 15:19:25,746 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-23 15:19:25,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-23 15:19:25,747 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:25,747 INFO L353 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-07-23 15:19:25,747 INFO L414 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:25,748 INFO L82 PathProgramCache]: Analyzing trace with hash 107830343, now seen corresponding path program 40 times [2018-07-23 15:19:25,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:25,966 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:25,966 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-23 15:19:25,966 INFO L450 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-23 15:19:25,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-23 15:19:25,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 15:19:25,968 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-07-23 15:19:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:25,999 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-23 15:19:25,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 15:19:25,999 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-07-23 15:19:25,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:26,000 INFO L225 Difference]: With dead ends: 47 [2018-07-23 15:19:26,000 INFO L226 Difference]: Without dead ends: 45 [2018-07-23 15:19:26,001 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 15:19:26,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-23 15:19:26,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-23 15:19:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-23 15:19:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-23 15:19:26,004 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-07-23 15:19:26,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:26,005 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-23 15:19:26,005 INFO L472 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-23 15:19:26,005 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-23 15:19:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 15:19:26,005 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:26,006 INFO L353 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-07-23 15:19:26,006 INFO L414 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:26,006 INFO L82 PathProgramCache]: Analyzing trace with hash -952214403, now seen corresponding path program 41 times [2018-07-23 15:19:26,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:26,262 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:26,262 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-23 15:19:26,263 INFO L450 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-23 15:19:26,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-23 15:19:26,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 15:19:26,265 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-07-23 15:19:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:26,289 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-23 15:19:26,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-23 15:19:26,289 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-07-23 15:19:26,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:26,290 INFO L225 Difference]: With dead ends: 48 [2018-07-23 15:19:26,290 INFO L226 Difference]: Without dead ends: 46 [2018-07-23 15:19:26,292 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 15:19:26,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-23 15:19:26,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-23 15:19:26,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-23 15:19:26,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-23 15:19:26,295 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-07-23 15:19:26,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:26,295 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-23 15:19:26,295 INFO L472 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-23 15:19:26,295 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-23 15:19:26,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-23 15:19:26,296 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:26,296 INFO L353 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-07-23 15:19:26,296 INFO L414 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:26,297 INFO L82 PathProgramCache]: Analyzing trace with hash 546136839, now seen corresponding path program 42 times [2018-07-23 15:19:26,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:26,583 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:26,584 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:26,584 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-23 15:19:26,584 INFO L450 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-23 15:19:26,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-23 15:19:26,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 15:19:26,586 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-07-23 15:19:26,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:26,615 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-23 15:19:26,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 15:19:26,615 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-07-23 15:19:26,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:26,616 INFO L225 Difference]: With dead ends: 49 [2018-07-23 15:19:26,616 INFO L226 Difference]: Without dead ends: 47 [2018-07-23 15:19:26,617 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 15:19:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-23 15:19:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-23 15:19:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-23 15:19:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-23 15:19:26,620 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-07-23 15:19:26,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:26,621 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-23 15:19:26,621 INFO L472 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-23 15:19:26,621 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-23 15:19:26,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-23 15:19:26,621 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:26,622 INFO L353 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-07-23 15:19:26,622 INFO L414 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:26,622 INFO L82 PathProgramCache]: Analyzing trace with hash -249614915, now seen corresponding path program 43 times [2018-07-23 15:19:26,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:26,838 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:26,838 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:26,839 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-23 15:19:26,839 INFO L450 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-23 15:19:26,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-23 15:19:26,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 15:19:26,841 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-07-23 15:19:26,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:26,869 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-23 15:19:26,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 15:19:26,869 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-07-23 15:19:26,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:26,870 INFO L225 Difference]: With dead ends: 50 [2018-07-23 15:19:26,870 INFO L226 Difference]: Without dead ends: 48 [2018-07-23 15:19:26,872 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 15:19:26,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-23 15:19:26,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-23 15:19:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-23 15:19:26,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-23 15:19:26,874 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-07-23 15:19:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:26,875 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-23 15:19:26,875 INFO L472 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-23 15:19:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-23 15:19:26,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-23 15:19:26,875 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:26,876 INFO L353 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-07-23 15:19:26,876 INFO L414 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:26,876 INFO L82 PathProgramCache]: Analyzing trace with hash 851884487, now seen corresponding path program 44 times [2018-07-23 15:19:26,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:27,090 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:27,090 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-23 15:19:27,090 INFO L450 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-23 15:19:27,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-23 15:19:27,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 15:19:27,092 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-07-23 15:19:27,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:27,116 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-23 15:19:27,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-23 15:19:27,116 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-07-23 15:19:27,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:27,117 INFO L225 Difference]: With dead ends: 51 [2018-07-23 15:19:27,117 INFO L226 Difference]: Without dead ends: 49 [2018-07-23 15:19:27,118 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 15:19:27,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-23 15:19:27,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-23 15:19:27,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-23 15:19:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-23 15:19:27,120 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-07-23 15:19:27,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:27,121 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-23 15:19:27,121 INFO L472 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-23 15:19:27,121 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-23 15:19:27,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 15:19:27,121 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:27,121 INFO L353 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-07-23 15:19:27,122 INFO L414 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:27,122 INFO L82 PathProgramCache]: Analyzing trace with hash 638627581, now seen corresponding path program 45 times [2018-07-23 15:19:27,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:27,359 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:27,359 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-23 15:19:27,359 INFO L450 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-23 15:19:27,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-23 15:19:27,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 15:19:27,361 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-07-23 15:19:27,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:27,385 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-07-23 15:19:27,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-23 15:19:27,385 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-07-23 15:19:27,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:27,386 INFO L225 Difference]: With dead ends: 52 [2018-07-23 15:19:27,386 INFO L226 Difference]: Without dead ends: 50 [2018-07-23 15:19:27,387 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 15:19:27,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-23 15:19:27,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-23 15:19:27,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-23 15:19:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-23 15:19:27,389 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-07-23 15:19:27,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:27,390 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-23 15:19:27,390 INFO L472 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-23 15:19:27,390 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-23 15:19:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-23 15:19:27,390 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:27,391 INFO L353 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-07-23 15:19:27,391 INFO L414 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:27,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1677369209, now seen corresponding path program 46 times [2018-07-23 15:19:27,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:27,650 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:27,650 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-23 15:19:27,650 INFO L450 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-23 15:19:27,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-23 15:19:27,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 15:19:27,652 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-07-23 15:19:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:27,678 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-23 15:19:27,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-23 15:19:27,678 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-07-23 15:19:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:27,679 INFO L225 Difference]: With dead ends: 53 [2018-07-23 15:19:27,679 INFO L226 Difference]: Without dead ends: 51 [2018-07-23 15:19:27,680 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 15:19:27,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-23 15:19:27,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-23 15:19:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-23 15:19:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-23 15:19:27,683 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-07-23 15:19:27,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:27,684 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-23 15:19:27,684 INFO L472 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-23 15:19:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-23 15:19:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-23 15:19:27,684 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:27,685 INFO L353 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-07-23 15:19:27,685 INFO L414 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:27,685 INFO L82 PathProgramCache]: Analyzing trace with hash -458825667, now seen corresponding path program 47 times [2018-07-23 15:19:27,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:27,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:27,951 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:27,951 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-23 15:19:27,951 INFO L450 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-23 15:19:27,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-23 15:19:27,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 15:19:27,953 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-07-23 15:19:27,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:27,979 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-23 15:19:27,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-23 15:19:27,980 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-07-23 15:19:27,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:27,980 INFO L225 Difference]: With dead ends: 54 [2018-07-23 15:19:27,980 INFO L226 Difference]: Without dead ends: 52 [2018-07-23 15:19:27,981 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 15:19:27,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-23 15:19:27,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-07-23 15:19:27,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-23 15:19:27,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-07-23 15:19:27,986 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-07-23 15:19:27,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:27,986 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-07-23 15:19:27,986 INFO L472 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-23 15:19:27,986 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-07-23 15:19:27,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-23 15:19:27,987 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:27,987 INFO L353 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-07-23 15:19:27,987 INFO L414 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:27,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1338681529, now seen corresponding path program 48 times [2018-07-23 15:19:27,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:28,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:28,256 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:28,256 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-23 15:19:28,256 INFO L450 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-23 15:19:28,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-23 15:19:28,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 15:19:28,258 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-07-23 15:19:28,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:28,289 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-23 15:19:28,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-23 15:19:28,289 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-07-23 15:19:28,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:28,290 INFO L225 Difference]: With dead ends: 55 [2018-07-23 15:19:28,290 INFO L226 Difference]: Without dead ends: 53 [2018-07-23 15:19:28,291 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 15:19:28,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-23 15:19:28,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-23 15:19:28,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-23 15:19:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-23 15:19:28,294 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-07-23 15:19:28,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:28,294 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-23 15:19:28,294 INFO L472 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-23 15:19:28,294 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-23 15:19:28,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-23 15:19:28,295 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:28,295 INFO L353 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-07-23 15:19:28,295 INFO L414 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:28,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1450557821, now seen corresponding path program 49 times [2018-07-23 15:19:28,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:28,586 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:28,586 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-23 15:19:28,586 INFO L450 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-23 15:19:28,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-23 15:19:28,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 15:19:28,588 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-07-23 15:19:28,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:28,618 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-07-23 15:19:28,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-23 15:19:28,619 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-07-23 15:19:28,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:28,619 INFO L225 Difference]: With dead ends: 56 [2018-07-23 15:19:28,619 INFO L226 Difference]: Without dead ends: 54 [2018-07-23 15:19:28,620 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 15:19:28,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-23 15:19:28,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-07-23 15:19:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-23 15:19:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-07-23 15:19:28,623 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-07-23 15:19:28,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:28,623 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-07-23 15:19:28,623 INFO L472 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-23 15:19:28,623 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-07-23 15:19:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-23 15:19:28,624 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:28,624 INFO L353 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-07-23 15:19:28,624 INFO L414 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:28,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2017631751, now seen corresponding path program 50 times [2018-07-23 15:19:28,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:28,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:28,931 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:28,931 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-23 15:19:28,931 INFO L450 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-23 15:19:28,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-23 15:19:28,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 15:19:28,933 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-07-23 15:19:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:28,975 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-23 15:19:28,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-23 15:19:28,976 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-07-23 15:19:28,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:28,976 INFO L225 Difference]: With dead ends: 57 [2018-07-23 15:19:28,976 INFO L226 Difference]: Without dead ends: 55 [2018-07-23 15:19:28,978 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 15:19:28,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-23 15:19:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-23 15:19:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-23 15:19:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-23 15:19:28,981 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-07-23 15:19:28,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:28,981 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-23 15:19:28,981 INFO L472 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-23 15:19:28,982 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-23 15:19:28,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-23 15:19:28,982 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:28,982 INFO L353 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-07-23 15:19:28,983 INFO L414 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:28,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1877912899, now seen corresponding path program 51 times [2018-07-23 15:19:28,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:29,375 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:29,375 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-23 15:19:29,375 INFO L450 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-23 15:19:29,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-23 15:19:29,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 15:19:29,377 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-07-23 15:19:29,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:29,409 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-07-23 15:19:29,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 15:19:29,410 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-07-23 15:19:29,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:29,411 INFO L225 Difference]: With dead ends: 58 [2018-07-23 15:19:29,411 INFO L226 Difference]: Without dead ends: 56 [2018-07-23 15:19:29,412 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 15:19:29,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-23 15:19:29,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-23 15:19:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-23 15:19:29,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-23 15:19:29,415 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-07-23 15:19:29,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:29,416 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-23 15:19:29,416 INFO L472 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-23 15:19:29,416 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-23 15:19:29,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-23 15:19:29,417 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:29,417 INFO L353 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-07-23 15:19:29,417 INFO L414 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:29,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1914254535, now seen corresponding path program 52 times [2018-07-23 15:19:29,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:29,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:29,977 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:29,977 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-23 15:19:29,977 INFO L450 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-23 15:19:29,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-23 15:19:29,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2760, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 15:19:29,979 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-07-23 15:19:30,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:30,524 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-23 15:19:30,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-23 15:19:30,524 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-07-23 15:19:30,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:30,525 INFO L225 Difference]: With dead ends: 59 [2018-07-23 15:19:30,525 INFO L226 Difference]: Without dead ends: 57 [2018-07-23 15:19:30,526 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=2760, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 15:19:30,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-23 15:19:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-23 15:19:30,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-23 15:19:30,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-23 15:19:30,534 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-07-23 15:19:30,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:30,536 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-23 15:19:30,536 INFO L472 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-23 15:19:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-23 15:19:30,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-23 15:19:30,536 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:30,536 INFO L353 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-07-23 15:19:30,537 INFO L414 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:30,537 INFO L82 PathProgramCache]: Analyzing trace with hash -787639299, now seen corresponding path program 53 times [2018-07-23 15:19:30,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:30,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:30,962 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:30,962 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-23 15:19:30,963 INFO L450 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-23 15:19:30,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-23 15:19:30,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2866, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 15:19:30,964 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-07-23 15:19:31,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:31,469 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-23 15:19:31,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-23 15:19:31,469 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-07-23 15:19:31,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:31,470 INFO L225 Difference]: With dead ends: 60 [2018-07-23 15:19:31,470 INFO L226 Difference]: Without dead ends: 58 [2018-07-23 15:19:31,471 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=2866, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 15:19:31,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-23 15:19:31,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-07-23 15:19:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-23 15:19:31,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-07-23 15:19:31,477 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-07-23 15:19:31,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:31,477 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-07-23 15:19:31,477 INFO L472 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-23 15:19:31,478 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-07-23 15:19:31,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-23 15:19:31,478 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:31,478 INFO L353 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-07-23 15:19:31,478 INFO L414 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:31,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1352997767, now seen corresponding path program 54 times [2018-07-23 15:19:31,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:31,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:31,944 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:31,944 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-23 15:19:31,944 INFO L450 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-23 15:19:31,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-23 15:19:31,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2974, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 15:19:31,946 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-07-23 15:19:32,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:32,469 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-23 15:19:32,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-23 15:19:32,469 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-07-23 15:19:32,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:32,470 INFO L225 Difference]: With dead ends: 61 [2018-07-23 15:19:32,470 INFO L226 Difference]: Without dead ends: 59 [2018-07-23 15:19:32,471 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=2974, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 15:19:32,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-23 15:19:32,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-23 15:19:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-23 15:19:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-23 15:19:32,477 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-07-23 15:19:32,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:32,477 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-23 15:19:32,477 INFO L472 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-23 15:19:32,477 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-23 15:19:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-23 15:19:32,478 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:32,478 INFO L353 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-07-23 15:19:32,478 INFO L414 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:32,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1006729923, now seen corresponding path program 55 times [2018-07-23 15:19:32,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:32,925 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:32,925 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-23 15:19:32,925 INFO L450 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-23 15:19:32,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-23 15:19:32,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3084, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 15:19:32,927 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-07-23 15:19:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:33,432 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-07-23 15:19:33,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-23 15:19:33,432 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-07-23 15:19:33,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:33,433 INFO L225 Difference]: With dead ends: 62 [2018-07-23 15:19:33,433 INFO L226 Difference]: Without dead ends: 60 [2018-07-23 15:19:33,434 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=3084, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 15:19:33,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-23 15:19:33,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-23 15:19:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-23 15:19:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-23 15:19:33,440 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-07-23 15:19:33,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:33,440 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-23 15:19:33,440 INFO L472 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-23 15:19:33,440 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-23 15:19:33,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-23 15:19:33,441 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:33,441 INFO L353 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-07-23 15:19:33,441 INFO L414 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:33,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1143844281, now seen corresponding path program 56 times [2018-07-23 15:19:33,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:33,973 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:33,974 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-23 15:19:33,974 INFO L450 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-23 15:19:33,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-23 15:19:33,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=3196, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 15:19:33,975 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-07-23 15:19:34,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:34,442 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-23 15:19:34,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-23 15:19:34,443 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-07-23 15:19:34,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:34,443 INFO L225 Difference]: With dead ends: 63 [2018-07-23 15:19:34,443 INFO L226 Difference]: Without dead ends: 61 [2018-07-23 15:19:34,445 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=3196, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 15:19:34,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-23 15:19:34,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-23 15:19:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-23 15:19:34,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-23 15:19:34,450 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-07-23 15:19:34,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:34,451 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-23 15:19:34,451 INFO L472 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-23 15:19:34,451 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-23 15:19:34,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-23 15:19:34,451 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:34,451 INFO L353 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-07-23 15:19:34,452 INFO L414 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:34,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1099422083, now seen corresponding path program 57 times [2018-07-23 15:19:34,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:34,855 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:34,855 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-23 15:19:34,855 INFO L450 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-23 15:19:34,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-23 15:19:34,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3310, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 15:19:34,857 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-07-23 15:19:35,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:35,304 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-07-23 15:19:35,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-23 15:19:35,304 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-07-23 15:19:35,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:35,305 INFO L225 Difference]: With dead ends: 64 [2018-07-23 15:19:35,305 INFO L226 Difference]: Without dead ends: 62 [2018-07-23 15:19:35,306 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=3310, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 15:19:35,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-23 15:19:35,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-23 15:19:35,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-23 15:19:35,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-23 15:19:35,311 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-07-23 15:19:35,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:35,311 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-23 15:19:35,311 INFO L472 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-23 15:19:35,312 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-23 15:19:35,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-23 15:19:35,312 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:35,312 INFO L353 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-07-23 15:19:35,312 INFO L414 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:35,313 INFO L82 PathProgramCache]: Analyzing trace with hash 277666055, now seen corresponding path program 58 times [2018-07-23 15:19:35,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:35,689 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:35,689 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-23 15:19:35,689 INFO L450 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-23 15:19:35,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-23 15:19:35,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3426, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 15:19:35,691 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-07-23 15:19:36,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:36,160 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-23 15:19:36,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-23 15:19:36,160 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-07-23 15:19:36,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:36,161 INFO L225 Difference]: With dead ends: 65 [2018-07-23 15:19:36,161 INFO L226 Difference]: Without dead ends: 63 [2018-07-23 15:19:36,162 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=3426, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 15:19:36,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-23 15:19:36,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-23 15:19:36,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-23 15:19:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-23 15:19:36,168 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-07-23 15:19:36,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:36,168 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-23 15:19:36,168 INFO L472 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-23 15:19:36,168 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-23 15:19:36,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-23 15:19:36,169 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:36,169 INFO L353 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-07-23 15:19:36,169 INFO L414 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:36,169 INFO L82 PathProgramCache]: Analyzing trace with hash 17725373, now seen corresponding path program 59 times [2018-07-23 15:19:36,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:36,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:36,573 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:36,573 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-23 15:19:36,574 INFO L450 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-23 15:19:36,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-23 15:19:36,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=3544, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 15:19:36,576 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-07-23 15:19:37,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:37,040 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-23 15:19:37,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-23 15:19:37,040 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-07-23 15:19:37,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:37,041 INFO L225 Difference]: With dead ends: 66 [2018-07-23 15:19:37,041 INFO L226 Difference]: Without dead ends: 64 [2018-07-23 15:19:37,043 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=238, Invalid=3544, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 15:19:37,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-23 15:19:37,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-07-23 15:19:37,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-23 15:19:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-07-23 15:19:37,048 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-07-23 15:19:37,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:37,048 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-07-23 15:19:37,049 INFO L472 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-23 15:19:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-07-23 15:19:37,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-23 15:19:37,049 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:37,049 INFO L353 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-07-23 15:19:37,050 INFO L414 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:37,050 INFO L82 PathProgramCache]: Analyzing trace with hash 549498823, now seen corresponding path program 60 times [2018-07-23 15:19:37,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:37,437 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:37,437 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-23 15:19:37,438 INFO L450 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-23 15:19:37,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-23 15:19:37,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=3664, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 15:19:37,439 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-07-23 15:19:37,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:37,891 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-23 15:19:37,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-23 15:19:37,891 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-07-23 15:19:37,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:37,892 INFO L225 Difference]: With dead ends: 67 [2018-07-23 15:19:37,892 INFO L226 Difference]: Without dead ends: 65 [2018-07-23 15:19:37,893 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=3664, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 15:19:37,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-23 15:19:37,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-23 15:19:37,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 15:19:37,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-23 15:19:37,898 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-07-23 15:19:37,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:37,899 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-23 15:19:37,899 INFO L472 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-23 15:19:37,899 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-23 15:19:37,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-23 15:19:37,900 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:37,900 INFO L353 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-07-23 15:19:37,900 INFO L414 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:37,900 INFO L82 PathProgramCache]: Analyzing trace with hash -145393411, now seen corresponding path program 61 times [2018-07-23 15:19:37,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:38,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:38,480 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:38,480 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-23 15:19:38,480 INFO L450 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-23 15:19:38,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-23 15:19:38,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3786, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 15:19:38,482 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-07-23 15:19:38,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:38,942 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-07-23 15:19:38,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-23 15:19:38,943 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-07-23 15:19:38,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:38,943 INFO L225 Difference]: With dead ends: 68 [2018-07-23 15:19:38,944 INFO L226 Difference]: Without dead ends: 66 [2018-07-23 15:19:38,944 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=3786, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 15:19:38,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-23 15:19:38,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-07-23 15:19:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-23 15:19:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-23 15:19:38,950 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-07-23 15:19:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:38,951 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-23 15:19:38,951 INFO L472 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-23 15:19:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-23 15:19:38,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-23 15:19:38,952 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:38,952 INFO L353 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-07-23 15:19:38,952 INFO L414 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:38,952 INFO L82 PathProgramCache]: Analyzing trace with hash -212216185, now seen corresponding path program 62 times [2018-07-23 15:19:38,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:39,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:39,357 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:39,358 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-23 15:19:39,358 INFO L450 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-23 15:19:39,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-23 15:19:39,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=3910, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 15:19:39,362 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-07-23 15:19:39,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:39,850 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-23 15:19:39,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-23 15:19:39,851 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-07-23 15:19:39,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:39,851 INFO L225 Difference]: With dead ends: 69 [2018-07-23 15:19:39,851 INFO L226 Difference]: Without dead ends: 67 [2018-07-23 15:19:39,852 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=250, Invalid=3910, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 15:19:39,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-23 15:19:39,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-23 15:19:39,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-23 15:19:39,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-23 15:19:39,858 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-07-23 15:19:39,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:39,858 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-23 15:19:39,858 INFO L472 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-23 15:19:39,858 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-23 15:19:39,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-23 15:19:39,863 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:39,864 INFO L353 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-07-23 15:19:39,864 INFO L414 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:39,864 INFO L82 PathProgramCache]: Analyzing trace with hash 2011245117, now seen corresponding path program 63 times [2018-07-23 15:19:39,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:40,342 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:40,343 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-23 15:19:40,343 INFO L450 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-23 15:19:40,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-23 15:19:40,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=4036, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 15:19:40,345 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-07-23 15:19:40,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:40,934 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-23 15:19:40,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-23 15:19:40,934 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-07-23 15:19:40,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:40,935 INFO L225 Difference]: With dead ends: 70 [2018-07-23 15:19:40,935 INFO L226 Difference]: Without dead ends: 68 [2018-07-23 15:19:40,936 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=4036, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 15:19:40,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-23 15:19:40,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-23 15:19:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-23 15:19:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-23 15:19:40,945 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-07-23 15:19:40,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:40,946 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-23 15:19:40,946 INFO L472 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-23 15:19:40,946 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-23 15:19:40,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-23 15:19:40,947 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:40,947 INFO L353 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-07-23 15:19:40,948 INFO L414 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:40,948 INFO L82 PathProgramCache]: Analyzing trace with hash -2075898553, now seen corresponding path program 64 times [2018-07-23 15:19:40,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:41,400 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:41,400 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-23 15:19:41,400 INFO L450 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-23 15:19:41,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-23 15:19:41,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=4164, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 15:19:41,402 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-07-23 15:19:41,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:41,898 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-23 15:19:41,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-23 15:19:41,898 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-07-23 15:19:41,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:41,899 INFO L225 Difference]: With dead ends: 71 [2018-07-23 15:19:41,899 INFO L226 Difference]: Without dead ends: 69 [2018-07-23 15:19:41,900 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=258, Invalid=4164, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 15:19:41,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-23 15:19:41,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-23 15:19:41,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-23 15:19:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-23 15:19:41,905 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-07-23 15:19:41,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:41,906 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-23 15:19:41,906 INFO L472 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-23 15:19:41,906 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-23 15:19:41,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-23 15:19:41,907 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:41,907 INFO L353 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-07-23 15:19:41,907 INFO L414 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:41,907 INFO L82 PathProgramCache]: Analyzing trace with hash 71666557, now seen corresponding path program 65 times [2018-07-23 15:19:41,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:42,317 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:42,317 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-23 15:19:42,317 INFO L450 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-23 15:19:42,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-23 15:19:42,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=4294, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 15:19:42,319 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-07-23 15:19:42,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:42,800 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-23 15:19:42,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-23 15:19:42,800 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-07-23 15:19:42,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:42,801 INFO L225 Difference]: With dead ends: 72 [2018-07-23 15:19:42,801 INFO L226 Difference]: Without dead ends: 70 [2018-07-23 15:19:42,802 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=262, Invalid=4294, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 15:19:42,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-23 15:19:42,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-23 15:19:42,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-23 15:19:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-07-23 15:19:42,807 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-07-23 15:19:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:42,807 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-07-23 15:19:42,807 INFO L472 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-23 15:19:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-07-23 15:19:42,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-23 15:19:42,808 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:42,808 INFO L353 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-07-23 15:19:42,808 INFO L414 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:42,809 INFO L82 PathProgramCache]: Analyzing trace with hash -2073291769, now seen corresponding path program 66 times [2018-07-23 15:19:42,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:43,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:43,298 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:43,298 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-23 15:19:43,299 INFO L450 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-23 15:19:43,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-23 15:19:43,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=4426, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 15:19:43,301 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-07-23 15:19:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:43,828 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-23 15:19:43,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-23 15:19:43,829 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-07-23 15:19:43,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:43,829 INFO L225 Difference]: With dead ends: 73 [2018-07-23 15:19:43,829 INFO L226 Difference]: Without dead ends: 71 [2018-07-23 15:19:43,830 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=266, Invalid=4426, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 15:19:43,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-23 15:19:43,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-23 15:19:43,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-23 15:19:43,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-23 15:19:43,836 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-07-23 15:19:43,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:43,836 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-23 15:19:43,836 INFO L472 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-23 15:19:43,837 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-23 15:19:43,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-23 15:19:43,837 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:43,837 INFO L353 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-07-23 15:19:43,838 INFO L414 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:43,838 INFO L82 PathProgramCache]: Analyzing trace with hash 152476861, now seen corresponding path program 67 times [2018-07-23 15:19:43,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:44,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:44,266 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:44,266 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-23 15:19:44,266 INFO L450 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-23 15:19:44,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-23 15:19:44,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=4560, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 15:19:44,268 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-07-23 15:19:44,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:44,784 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-07-23 15:19:44,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-23 15:19:44,785 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-07-23 15:19:44,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:44,785 INFO L225 Difference]: With dead ends: 74 [2018-07-23 15:19:44,786 INFO L226 Difference]: Without dead ends: 72 [2018-07-23 15:19:44,786 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=270, Invalid=4560, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 15:19:44,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-23 15:19:44,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-23 15:19:44,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-23 15:19:44,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-23 15:19:44,792 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-07-23 15:19:44,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:44,792 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-23 15:19:44,792 INFO L472 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-23 15:19:44,792 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-23 15:19:44,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-23 15:19:44,793 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:44,793 INFO L353 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-07-23 15:19:44,793 INFO L414 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:44,794 INFO L82 PathProgramCache]: Analyzing trace with hash 431827655, now seen corresponding path program 68 times [2018-07-23 15:19:44,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:45,225 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:45,225 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-23 15:19:45,226 INFO L450 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-23 15:19:45,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-23 15:19:45,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=4696, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 15:19:45,227 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-07-23 15:19:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:45,682 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-23 15:19:45,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-23 15:19:45,682 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-07-23 15:19:45,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:45,683 INFO L225 Difference]: With dead ends: 75 [2018-07-23 15:19:45,683 INFO L226 Difference]: Without dead ends: 73 [2018-07-23 15:19:45,684 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=274, Invalid=4696, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 15:19:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-23 15:19:45,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-23 15:19:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-23 15:19:45,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-23 15:19:45,689 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-07-23 15:19:45,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:45,689 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-23 15:19:45,689 INFO L472 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-23 15:19:45,689 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-23 15:19:45,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-23 15:19:45,690 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:45,690 INFO L353 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-07-23 15:19:45,690 INFO L414 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:45,691 INFO L82 PathProgramCache]: Analyzing trace with hash 501767677, now seen corresponding path program 69 times [2018-07-23 15:19:45,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:46,129 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:46,129 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-23 15:19:46,129 INFO L450 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-23 15:19:46,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-23 15:19:46,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=4834, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 15:19:46,130 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-07-23 15:19:46,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:46,624 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-07-23 15:19:46,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-23 15:19:46,625 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-07-23 15:19:46,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:46,626 INFO L225 Difference]: With dead ends: 76 [2018-07-23 15:19:46,626 INFO L226 Difference]: Without dead ends: 74 [2018-07-23 15:19:46,627 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=278, Invalid=4834, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 15:19:46,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-23 15:19:46,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-23 15:19:46,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-23 15:19:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-23 15:19:46,632 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-07-23 15:19:46,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:46,633 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-23 15:19:46,633 INFO L472 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-23 15:19:46,633 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-23 15:19:46,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-23 15:19:46,634 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:46,634 INFO L353 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-07-23 15:19:46,634 INFO L414 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:46,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1625058937, now seen corresponding path program 70 times [2018-07-23 15:19:46,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:47,065 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:47,065 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-23 15:19:47,065 INFO L450 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-23 15:19:47,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-23 15:19:47,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=4974, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 15:19:47,067 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-07-23 15:19:47,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:47,515 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-23 15:19:47,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-23 15:19:47,515 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-07-23 15:19:47,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:47,516 INFO L225 Difference]: With dead ends: 77 [2018-07-23 15:19:47,516 INFO L226 Difference]: Without dead ends: 75 [2018-07-23 15:19:47,518 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=282, Invalid=4974, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 15:19:47,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-23 15:19:47,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-23 15:19:47,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-23 15:19:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-23 15:19:47,524 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-07-23 15:19:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:47,525 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-23 15:19:47,525 INFO L472 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-23 15:19:47,525 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-23 15:19:47,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-23 15:19:47,526 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:47,526 INFO L353 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-07-23 15:19:47,526 INFO L414 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:47,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1162792765, now seen corresponding path program 71 times [2018-07-23 15:19:47,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:48,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:48,015 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:48,015 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-23 15:19:48,015 INFO L450 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-23 15:19:48,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-23 15:19:48,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=5116, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 15:19:48,017 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-07-23 15:19:48,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:48,375 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-23 15:19:48,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-23 15:19:48,376 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-07-23 15:19:48,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:48,376 INFO L225 Difference]: With dead ends: 78 [2018-07-23 15:19:48,376 INFO L226 Difference]: Without dead ends: 76 [2018-07-23 15:19:48,377 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=286, Invalid=5116, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 15:19:48,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-23 15:19:48,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-23 15:19:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-23 15:19:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-23 15:19:48,383 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-07-23 15:19:48,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:48,383 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-23 15:19:48,383 INFO L472 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-23 15:19:48,383 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-23 15:19:48,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-23 15:19:48,384 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:48,384 INFO L353 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-07-23 15:19:48,384 INFO L414 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:48,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1686849607, now seen corresponding path program 72 times [2018-07-23 15:19:48,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:48,754 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:48,754 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-23 15:19:48,754 INFO L450 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-23 15:19:48,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-23 15:19:48,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=5260, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 15:19:48,755 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-07-23 15:19:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:49,127 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-23 15:19:49,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-23 15:19:49,127 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-07-23 15:19:49,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:49,128 INFO L225 Difference]: With dead ends: 79 [2018-07-23 15:19:49,128 INFO L226 Difference]: Without dead ends: 77 [2018-07-23 15:19:49,129 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=290, Invalid=5260, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 15:19:49,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-23 15:19:49,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-23 15:19:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-23 15:19:49,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-23 15:19:49,134 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-07-23 15:19:49,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:49,134 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-23 15:19:49,134 INFO L472 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-23 15:19:49,134 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-23 15:19:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-23 15:19:49,135 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:49,135 INFO L353 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-07-23 15:19:49,135 INFO L414 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:49,135 INFO L82 PathProgramCache]: Analyzing trace with hash 752742525, now seen corresponding path program 73 times [2018-07-23 15:19:49,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:49,503 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:49,503 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-23 15:19:49,503 INFO L450 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-23 15:19:49,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-23 15:19:49,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=5406, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 15:19:49,504 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-07-23 15:19:49,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:49,880 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-23 15:19:49,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-23 15:19:49,880 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-07-23 15:19:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:49,881 INFO L225 Difference]: With dead ends: 80 [2018-07-23 15:19:49,881 INFO L226 Difference]: Without dead ends: 78 [2018-07-23 15:19:49,881 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=294, Invalid=5406, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 15:19:49,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-23 15:19:49,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-23 15:19:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-23 15:19:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-07-23 15:19:49,886 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-07-23 15:19:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:49,886 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-07-23 15:19:49,887 INFO L472 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-23 15:19:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-07-23 15:19:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-23 15:19:49,887 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:49,888 INFO L353 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-07-23 15:19:49,888 INFO L414 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:49,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1860194055, now seen corresponding path program 74 times [2018-07-23 15:19:49,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:50,340 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:50,340 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-23 15:19:50,340 INFO L450 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-23 15:19:50,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-23 15:19:50,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=5554, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 15:19:50,341 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-07-23 15:19:50,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:50,738 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-23 15:19:50,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-23 15:19:50,738 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-07-23 15:19:50,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:50,739 INFO L225 Difference]: With dead ends: 81 [2018-07-23 15:19:50,739 INFO L226 Difference]: Without dead ends: 79 [2018-07-23 15:19:50,739 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=298, Invalid=5554, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 15:19:50,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-23 15:19:50,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-23 15:19:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-23 15:19:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-23 15:19:50,745 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-07-23 15:19:50,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:50,745 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-23 15:19:50,745 INFO L472 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-23 15:19:50,745 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-23 15:19:50,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-23 15:19:50,746 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:50,746 INFO L353 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-07-23 15:19:50,746 INFO L414 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:50,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1831453117, now seen corresponding path program 75 times [2018-07-23 15:19:50,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:51,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:51,253 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:51,253 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-23 15:19:51,254 INFO L450 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-23 15:19:51,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-23 15:19:51,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=5704, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 15:19:51,255 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-07-23 15:19:51,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:51,744 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-07-23 15:19:51,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-23 15:19:51,744 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-07-23 15:19:51,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:51,745 INFO L225 Difference]: With dead ends: 82 [2018-07-23 15:19:51,745 INFO L226 Difference]: Without dead ends: 80 [2018-07-23 15:19:51,746 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=5704, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 15:19:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-23 15:19:51,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-23 15:19:51,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-23 15:19:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-23 15:19:51,752 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-07-23 15:19:51,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:51,752 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-23 15:19:51,752 INFO L472 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-23 15:19:51,752 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-23 15:19:51,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-23 15:19:51,753 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:51,753 INFO L353 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-07-23 15:19:51,753 INFO L414 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:51,753 INFO L82 PathProgramCache]: Analyzing trace with hash 940484039, now seen corresponding path program 76 times [2018-07-23 15:19:51,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:52,245 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:52,245 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-23 15:19:52,245 INFO L450 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-23 15:19:52,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-23 15:19:52,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=5856, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 15:19:52,246 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-07-23 15:19:52,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:52,671 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-23 15:19:52,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-23 15:19:52,671 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-07-23 15:19:52,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:52,672 INFO L225 Difference]: With dead ends: 83 [2018-07-23 15:19:52,672 INFO L226 Difference]: Without dead ends: 81 [2018-07-23 15:19:52,673 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=306, Invalid=5856, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 15:19:52,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-23 15:19:52,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-23 15:19:52,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-23 15:19:52,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-23 15:19:52,679 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-07-23 15:19:52,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:52,684 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-23 15:19:52,684 INFO L472 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-23 15:19:52,684 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-23 15:19:52,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-23 15:19:52,684 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:52,685 INFO L353 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-07-23 15:19:52,685 INFO L414 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:52,685 INFO L82 PathProgramCache]: Analyzing trace with hash -909753603, now seen corresponding path program 77 times [2018-07-23 15:19:52,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:53,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:53,160 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:53,160 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-23 15:19:53,161 INFO L450 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-23 15:19:53,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-23 15:19:53,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=6010, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 15:19:53,162 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-07-23 15:19:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:53,703 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-23 15:19:53,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-23 15:19:53,703 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-07-23 15:19:53,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:53,704 INFO L225 Difference]: With dead ends: 84 [2018-07-23 15:19:53,704 INFO L226 Difference]: Without dead ends: 82 [2018-07-23 15:19:53,705 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=310, Invalid=6010, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 15:19:53,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-23 15:19:53,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-07-23 15:19:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-23 15:19:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-07-23 15:19:53,710 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-07-23 15:19:53,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:53,711 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-07-23 15:19:53,711 INFO L472 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-23 15:19:53,711 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-07-23 15:19:53,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-23 15:19:53,711 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:53,712 INFO L353 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-07-23 15:19:53,712 INFO L414 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:53,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1862421639, now seen corresponding path program 78 times [2018-07-23 15:19:53,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:54,407 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:54,407 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-23 15:19:54,408 INFO L450 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-23 15:19:54,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-23 15:19:54,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=6166, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 15:19:54,409 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-07-23 15:19:54,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:54,960 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-23 15:19:54,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-23 15:19:54,960 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-07-23 15:19:54,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:54,961 INFO L225 Difference]: With dead ends: 85 [2018-07-23 15:19:54,961 INFO L226 Difference]: Without dead ends: 83 [2018-07-23 15:19:54,962 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=314, Invalid=6166, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 15:19:54,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-23 15:19:54,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-23 15:19:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-23 15:19:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-23 15:19:54,967 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-07-23 15:19:54,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:54,967 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-23 15:19:54,968 INFO L472 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-23 15:19:54,968 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-23 15:19:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-23 15:19:54,968 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:54,968 INFO L353 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-07-23 15:19:54,968 INFO L414 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:54,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1900508221, now seen corresponding path program 79 times [2018-07-23 15:19:54,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:55,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:55,406 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:55,406 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-23 15:19:55,407 INFO L450 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-23 15:19:55,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-23 15:19:55,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=6324, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 15:19:55,408 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-07-23 15:19:55,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:55,843 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-07-23 15:19:55,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-23 15:19:55,844 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-07-23 15:19:55,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:55,844 INFO L225 Difference]: With dead ends: 86 [2018-07-23 15:19:55,844 INFO L226 Difference]: Without dead ends: 84 [2018-07-23 15:19:55,845 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=6324, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 15:19:55,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-23 15:19:55,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-07-23 15:19:55,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-23 15:19:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-07-23 15:19:55,849 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-07-23 15:19:55,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:55,850 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-07-23 15:19:55,850 INFO L472 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-23 15:19:55,850 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-07-23 15:19:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-23 15:19:55,850 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:55,850 INFO L353 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-07-23 15:19:55,850 INFO L414 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:55,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1213775033, now seen corresponding path program 80 times [2018-07-23 15:19:55,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:56,328 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:56,328 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-23 15:19:56,328 INFO L450 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-23 15:19:56,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-23 15:19:56,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=6484, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 15:19:56,329 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-07-23 15:19:56,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:56,762 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-23 15:19:56,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-23 15:19:56,762 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-07-23 15:19:56,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:56,763 INFO L225 Difference]: With dead ends: 87 [2018-07-23 15:19:56,763 INFO L226 Difference]: Without dead ends: 85 [2018-07-23 15:19:56,763 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=322, Invalid=6484, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 15:19:56,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-23 15:19:56,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-23 15:19:56,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-23 15:19:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-23 15:19:56,769 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-07-23 15:19:56,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:56,769 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-23 15:19:56,769 INFO L472 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-23 15:19:56,769 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-23 15:19:56,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-23 15:19:56,770 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:56,770 INFO L353 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-07-23 15:19:56,770 INFO L414 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:56,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1027691901, now seen corresponding path program 81 times [2018-07-23 15:19:56,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:57,156 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:57,156 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-23 15:19:57,156 INFO L450 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-23 15:19:57,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-23 15:19:57,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=6646, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 15:19:57,157 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-07-23 15:19:57,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:57,623 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-07-23 15:19:57,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-23 15:19:57,624 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-07-23 15:19:57,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:57,624 INFO L225 Difference]: With dead ends: 88 [2018-07-23 15:19:57,624 INFO L226 Difference]: Without dead ends: 86 [2018-07-23 15:19:57,625 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=326, Invalid=6646, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 15:19:57,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-23 15:19:57,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-23 15:19:57,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-23 15:19:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-23 15:19:57,629 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-07-23 15:19:57,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:57,630 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-23 15:19:57,630 INFO L472 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-23 15:19:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-23 15:19:57,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-23 15:19:57,630 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:57,630 INFO L353 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-07-23 15:19:57,630 INFO L414 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:57,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1793690119, now seen corresponding path program 82 times [2018-07-23 15:19:57,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:58,113 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:58,113 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-23 15:19:58,113 INFO L450 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-23 15:19:58,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-23 15:19:58,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=6810, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 15:19:58,114 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-07-23 15:19:58,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:58,572 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-23 15:19:58,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-23 15:19:58,573 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-07-23 15:19:58,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:58,573 INFO L225 Difference]: With dead ends: 89 [2018-07-23 15:19:58,573 INFO L226 Difference]: Without dead ends: 87 [2018-07-23 15:19:58,574 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=330, Invalid=6810, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 15:19:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-23 15:19:58,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-23 15:19:58,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-23 15:19:58,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-23 15:19:58,578 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-07-23 15:19:58,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:58,578 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-23 15:19:58,578 INFO L472 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-23 15:19:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-23 15:19:58,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-23 15:19:58,579 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:58,579 INFO L353 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-07-23 15:19:58,579 INFO L414 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:58,579 INFO L82 PathProgramCache]: Analyzing trace with hash -230168899, now seen corresponding path program 83 times [2018-07-23 15:19:58,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:58,945 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:58,945 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-23 15:19:58,946 INFO L450 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-23 15:19:58,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-23 15:19:58,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=6976, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 15:19:58,947 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-07-23 15:19:59,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:59,449 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-23 15:19:59,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-23 15:19:59,449 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-07-23 15:19:59,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:59,450 INFO L225 Difference]: With dead ends: 90 [2018-07-23 15:19:59,450 INFO L226 Difference]: Without dead ends: 88 [2018-07-23 15:19:59,450 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=334, Invalid=6976, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 15:19:59,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-23 15:19:59,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-07-23 15:19:59,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-23 15:19:59,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-07-23 15:19:59,454 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-07-23 15:19:59,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:59,454 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-07-23 15:19:59,454 INFO L472 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-23 15:19:59,454 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-07-23 15:19:59,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-23 15:19:59,455 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:59,455 INFO L353 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-07-23 15:19:59,455 INFO L414 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:59,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1454710983, now seen corresponding path program 84 times [2018-07-23 15:19:59,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:59,853 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:59,853 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-23 15:19:59,853 INFO L450 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-23 15:19:59,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-23 15:19:59,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=7144, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 15:19:59,854 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-07-23 15:20:00,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:00,461 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-23 15:20:00,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-23 15:20:00,461 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-07-23 15:20:00,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:00,462 INFO L225 Difference]: With dead ends: 91 [2018-07-23 15:20:00,462 INFO L226 Difference]: Without dead ends: 89 [2018-07-23 15:20:00,462 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=338, Invalid=7144, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 15:20:00,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-23 15:20:00,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-23 15:20:00,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-23 15:20:00,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-23 15:20:00,467 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-07-23 15:20:00,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:00,468 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-23 15:20:00,468 INFO L472 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-23 15:20:00,468 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-23 15:20:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-23 15:20:00,468 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:00,468 INFO L353 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-07-23 15:20:00,469 INFO L414 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:00,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2146379773, now seen corresponding path program 85 times [2018-07-23 15:20:00,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:00,914 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:00,914 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-23 15:20:00,914 INFO L450 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-23 15:20:00,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-23 15:20:00,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=7314, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 15:20:00,915 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-07-23 15:20:01,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:01,427 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-07-23 15:20:01,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-23 15:20:01,428 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-07-23 15:20:01,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:01,429 INFO L225 Difference]: With dead ends: 92 [2018-07-23 15:20:01,429 INFO L226 Difference]: Without dead ends: 90 [2018-07-23 15:20:01,429 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=342, Invalid=7314, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 15:20:01,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-23 15:20:01,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-07-23 15:20:01,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-23 15:20:01,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-07-23 15:20:01,435 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-07-23 15:20:01,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:01,435 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-07-23 15:20:01,435 INFO L472 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-23 15:20:01,435 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-07-23 15:20:01,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-23 15:20:01,436 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:01,436 INFO L353 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-07-23 15:20:01,436 INFO L414 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:01,436 INFO L82 PathProgramCache]: Analyzing trace with hash 2113275783, now seen corresponding path program 86 times [2018-07-23 15:20:01,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:01,831 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:01,831 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-23 15:20:01,832 INFO L450 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-23 15:20:01,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-23 15:20:01,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=7486, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 15:20:01,833 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-07-23 15:20:02,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:02,342 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-23 15:20:02,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-23 15:20:02,342 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-07-23 15:20:02,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:02,343 INFO L225 Difference]: With dead ends: 93 [2018-07-23 15:20:02,343 INFO L226 Difference]: Without dead ends: 91 [2018-07-23 15:20:02,344 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=346, Invalid=7486, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 15:20:02,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-23 15:20:02,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-23 15:20:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-23 15:20:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-23 15:20:02,349 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-07-23 15:20:02,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:02,350 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-23 15:20:02,350 INFO L472 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-23 15:20:02,350 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-23 15:20:02,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-23 15:20:02,351 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:02,351 INFO L353 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-07-23 15:20:02,351 INFO L414 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:02,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1087052093, now seen corresponding path program 87 times [2018-07-23 15:20:02,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:02,798 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:02,798 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-23 15:20:02,798 INFO L450 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-23 15:20:02,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-23 15:20:02,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=7660, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 15:20:02,799 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-07-23 15:20:03,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:03,312 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-07-23 15:20:03,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-23 15:20:03,312 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-07-23 15:20:03,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:03,313 INFO L225 Difference]: With dead ends: 94 [2018-07-23 15:20:03,314 INFO L226 Difference]: Without dead ends: 92 [2018-07-23 15:20:03,314 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=350, Invalid=7660, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 15:20:03,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-23 15:20:03,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-23 15:20:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-23 15:20:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-07-23 15:20:03,324 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-07-23 15:20:03,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:03,324 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-07-23 15:20:03,324 INFO L472 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-23 15:20:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-07-23 15:20:03,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-23 15:20:03,328 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:03,328 INFO L353 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-07-23 15:20:03,328 INFO L414 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:03,328 INFO L82 PathProgramCache]: Analyzing trace with hash -661111225, now seen corresponding path program 88 times [2018-07-23 15:20:03,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:03,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:03,793 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:03,793 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-23 15:20:03,794 INFO L450 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-23 15:20:03,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-23 15:20:03,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=7836, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 15:20:03,795 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-07-23 15:20:04,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:04,322 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-23 15:20:04,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-23 15:20:04,322 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-07-23 15:20:04,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:04,323 INFO L225 Difference]: With dead ends: 95 [2018-07-23 15:20:04,324 INFO L226 Difference]: Without dead ends: 93 [2018-07-23 15:20:04,325 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=354, Invalid=7836, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 15:20:04,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-23 15:20:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-23 15:20:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-23 15:20:04,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-23 15:20:04,330 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-07-23 15:20:04,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:04,331 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-23 15:20:04,331 INFO L472 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-23 15:20:04,331 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-23 15:20:04,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-23 15:20:04,332 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:04,332 INFO L353 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-07-23 15:20:04,332 INFO L414 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:04,332 INFO L82 PathProgramCache]: Analyzing trace with hash 980400765, now seen corresponding path program 89 times [2018-07-23 15:20:04,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:04,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:04,804 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:04,804 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-23 15:20:04,805 INFO L450 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-23 15:20:04,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-23 15:20:04,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=8014, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 15:20:04,806 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-07-23 15:20:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:05,293 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-07-23 15:20:05,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-23 15:20:05,293 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-07-23 15:20:05,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:05,293 INFO L225 Difference]: With dead ends: 96 [2018-07-23 15:20:05,294 INFO L226 Difference]: Without dead ends: 94 [2018-07-23 15:20:05,294 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=358, Invalid=8014, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 15:20:05,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-23 15:20:05,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-23 15:20:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-23 15:20:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-07-23 15:20:05,299 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-07-23 15:20:05,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:05,300 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-07-23 15:20:05,300 INFO L472 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-23 15:20:05,300 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-07-23 15:20:05,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-23 15:20:05,300 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:05,301 INFO L353 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-07-23 15:20:05,301 INFO L414 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:05,301 INFO L82 PathProgramCache]: Analyzing trace with hash 327664903, now seen corresponding path program 90 times [2018-07-23 15:20:05,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:05,716 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:05,716 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-23 15:20:05,716 INFO L450 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-23 15:20:05,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-23 15:20:05,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=8194, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 15:20:05,717 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-07-23 15:20:06,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:06,287 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-23 15:20:06,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-23 15:20:06,287 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-07-23 15:20:06,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:06,288 INFO L225 Difference]: With dead ends: 97 [2018-07-23 15:20:06,288 INFO L226 Difference]: Without dead ends: 95 [2018-07-23 15:20:06,289 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=362, Invalid=8194, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 15:20:06,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-23 15:20:06,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-23 15:20:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-23 15:20:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-23 15:20:06,295 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-07-23 15:20:06,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:06,295 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-23 15:20:06,295 INFO L472 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-23 15:20:06,295 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-23 15:20:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-23 15:20:06,296 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:06,296 INFO L353 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-07-23 15:20:06,296 INFO L414 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:06,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1567689661, now seen corresponding path program 91 times [2018-07-23 15:20:06,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:06,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:06,831 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:06,831 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-23 15:20:06,831 INFO L450 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-23 15:20:06,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-23 15:20:06,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=8376, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 15:20:06,832 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-07-23 15:20:07,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:07,360 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-07-23 15:20:07,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-23 15:20:07,360 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-07-23 15:20:07,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:07,361 INFO L225 Difference]: With dead ends: 98 [2018-07-23 15:20:07,361 INFO L226 Difference]: Without dead ends: 96 [2018-07-23 15:20:07,362 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=366, Invalid=8376, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 15:20:07,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-23 15:20:07,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-23 15:20:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-23 15:20:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-07-23 15:20:07,365 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-07-23 15:20:07,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:07,366 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-07-23 15:20:07,366 INFO L472 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-23 15:20:07,366 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-07-23 15:20:07,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-23 15:20:07,366 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:07,366 INFO L353 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-07-23 15:20:07,367 INFO L414 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:07,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1353751495, now seen corresponding path program 92 times [2018-07-23 15:20:07,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:07,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:07,785 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:07,785 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-23 15:20:07,786 INFO L450 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-23 15:20:07,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-23 15:20:07,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=8560, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 15:20:07,786 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-07-23 15:20:08,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:08,335 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-23 15:20:08,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-23 15:20:08,335 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-07-23 15:20:08,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:08,336 INFO L225 Difference]: With dead ends: 99 [2018-07-23 15:20:08,336 INFO L226 Difference]: Without dead ends: 97 [2018-07-23 15:20:08,336 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=370, Invalid=8560, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 15:20:08,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-23 15:20:08,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-23 15:20:08,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-23 15:20:08,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-23 15:20:08,340 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-07-23 15:20:08,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:08,340 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-23 15:20:08,340 INFO L472 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-23 15:20:08,340 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-23 15:20:08,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-23 15:20:08,340 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:08,341 INFO L353 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-07-23 15:20:08,341 INFO L414 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:08,341 INFO L82 PathProgramCache]: Analyzing trace with hash -983364355, now seen corresponding path program 93 times [2018-07-23 15:20:08,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:08,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:08,769 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:08,769 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-23 15:20:08,770 INFO L450 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-23 15:20:08,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-23 15:20:08,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=8746, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 15:20:08,771 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-07-23 15:20:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:09,333 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-07-23 15:20:09,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-23 15:20:09,334 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-07-23 15:20:09,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:09,334 INFO L225 Difference]: With dead ends: 100 [2018-07-23 15:20:09,334 INFO L226 Difference]: Without dead ends: 98 [2018-07-23 15:20:09,335 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=374, Invalid=8746, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 15:20:09,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-23 15:20:09,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-07-23 15:20:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-23 15:20:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-07-23 15:20:09,339 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-07-23 15:20:09,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:09,339 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-07-23 15:20:09,339 INFO L472 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-23 15:20:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-07-23 15:20:09,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-07-23 15:20:09,339 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:09,339 INFO L353 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-07-23 15:20:09,339 INFO L414 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:09,340 INFO L82 PathProgramCache]: Analyzing trace with hash -419511673, now seen corresponding path program 94 times [2018-07-23 15:20:09,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:09,846 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:09,846 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-23 15:20:09,846 INFO L450 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-23 15:20:09,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-23 15:20:09,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=8934, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 15:20:09,847 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-07-23 15:20:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:10,430 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-23 15:20:10,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-23 15:20:10,430 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-07-23 15:20:10,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:10,431 INFO L225 Difference]: With dead ends: 101 [2018-07-23 15:20:10,431 INFO L226 Difference]: Without dead ends: 99 [2018-07-23 15:20:10,431 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=8934, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 15:20:10,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-23 15:20:10,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-23 15:20:10,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-23 15:20:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-23 15:20:10,435 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-07-23 15:20:10,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:10,436 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-23 15:20:10,436 INFO L472 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-23 15:20:10,436 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-23 15:20:10,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-23 15:20:10,436 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:10,436 INFO L353 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-07-23 15:20:10,436 INFO L414 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:10,437 INFO L82 PathProgramCache]: Analyzing trace with hash -119947715, now seen corresponding path program 95 times [2018-07-23 15:20:10,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:10,899 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:10,900 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-23 15:20:10,900 INFO L450 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-23 15:20:10,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-23 15:20:10,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=9124, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 15:20:10,901 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-07-23 15:20:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:11,529 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-07-23 15:20:11,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-23 15:20:11,529 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-07-23 15:20:11,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:11,530 INFO L225 Difference]: With dead ends: 102 [2018-07-23 15:20:11,530 INFO L226 Difference]: Without dead ends: 100 [2018-07-23 15:20:11,531 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=382, Invalid=9124, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 15:20:11,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-23 15:20:11,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-07-23 15:20:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-23 15:20:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-07-23 15:20:11,535 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-07-23 15:20:11,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:11,535 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-07-23 15:20:11,535 INFO L472 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-23 15:20:11,536 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-07-23 15:20:11,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-07-23 15:20:11,536 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:11,536 INFO L353 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-07-23 15:20:11,536 INFO L414 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:11,537 INFO L82 PathProgramCache]: Analyzing trace with hash 576600391, now seen corresponding path program 96 times [2018-07-23 15:20:11,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:12,020 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:12,020 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-23 15:20:12,021 INFO L450 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-23 15:20:12,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-23 15:20:12,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=9316, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 15:20:12,021 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-07-23 15:20:12,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:12,635 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-23 15:20:12,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-23 15:20:12,635 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-07-23 15:20:12,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:12,636 INFO L225 Difference]: With dead ends: 103 [2018-07-23 15:20:12,636 INFO L226 Difference]: Without dead ends: 101 [2018-07-23 15:20:12,637 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=386, Invalid=9316, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 15:20:12,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-23 15:20:12,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-23 15:20:12,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-23 15:20:12,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-23 15:20:12,641 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-07-23 15:20:12,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:12,641 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-23 15:20:12,641 INFO L472 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-23 15:20:12,641 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-23 15:20:12,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-23 15:20:12,642 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:12,642 INFO L353 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-07-23 15:20:12,642 INFO L414 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:12,642 INFO L82 PathProgramCache]: Analyzing trace with hash 694755197, now seen corresponding path program 97 times [2018-07-23 15:20:12,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:13,235 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:13,235 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-23 15:20:13,235 INFO L450 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-23 15:20:13,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-23 15:20:13,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=9510, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 15:20:13,236 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-07-23 15:20:13,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:13,797 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-07-23 15:20:13,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-23 15:20:13,798 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-07-23 15:20:13,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:13,798 INFO L225 Difference]: With dead ends: 104 [2018-07-23 15:20:13,798 INFO L226 Difference]: Without dead ends: 102 [2018-07-23 15:20:13,799 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=390, Invalid=9510, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 15:20:13,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-23 15:20:13,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-07-23 15:20:13,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-23 15:20:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-07-23 15:20:13,804 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-07-23 15:20:13,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:13,805 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-07-23 15:20:13,805 INFO L472 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-23 15:20:13,805 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-07-23 15:20:13,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-07-23 15:20:13,806 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:13,806 INFO L353 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-07-23 15:20:13,806 INFO L414 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:13,806 INFO L82 PathProgramCache]: Analyzing trace with hash 62586887, now seen corresponding path program 98 times [2018-07-23 15:20:13,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:14,275 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:14,275 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-23 15:20:14,276 INFO L450 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-23 15:20:14,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-23 15:20:14,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=9706, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 15:20:14,277 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-07-23 15:20:14,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:14,881 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-23 15:20:14,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-23 15:20:14,881 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-07-23 15:20:14,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:14,882 INFO L225 Difference]: With dead ends: 105 [2018-07-23 15:20:14,882 INFO L226 Difference]: Without dead ends: 103 [2018-07-23 15:20:14,883 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=394, Invalid=9706, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 15:20:14,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-23 15:20:14,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-23 15:20:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-23 15:20:14,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-23 15:20:14,888 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-07-23 15:20:14,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:14,888 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-23 15:20:14,888 INFO L472 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-23 15:20:14,888 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-23 15:20:14,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-23 15:20:14,888 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:14,888 INFO L353 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-07-23 15:20:14,888 INFO L414 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:14,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1940205757, now seen corresponding path program 99 times [2018-07-23 15:20:14,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:15,412 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:15,412 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-23 15:20:15,413 INFO L450 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-23 15:20:15,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-23 15:20:15,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=9904, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 15:20:15,413 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-07-23 15:20:16,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:16,068 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-07-23 15:20:16,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-23 15:20:16,069 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-07-23 15:20:16,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:16,069 INFO L225 Difference]: With dead ends: 106 [2018-07-23 15:20:16,069 INFO L226 Difference]: Without dead ends: 104 [2018-07-23 15:20:16,070 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=398, Invalid=9904, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 15:20:16,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-23 15:20:16,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-23 15:20:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-23 15:20:16,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-07-23 15:20:16,074 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-07-23 15:20:16,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:16,074 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-07-23 15:20:16,074 INFO L472 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-23 15:20:16,074 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-07-23 15:20:16,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-23 15:20:16,075 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:16,075 INFO L353 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-07-23 15:20:16,075 INFO L414 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:16,075 INFO L82 PathProgramCache]: Analyzing trace with hash 16848583, now seen corresponding path program 100 times [2018-07-23 15:20:16,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:17,584 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:17,584 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-23 15:20:17,584 INFO L450 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-23 15:20:17,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-23 15:20:17,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 15:20:17,585 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-07-23 15:20:18,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:18,818 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-23 15:20:18,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-23 15:20:18,818 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-07-23 15:20:18,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:18,819 INFO L225 Difference]: With dead ends: 107 [2018-07-23 15:20:18,819 INFO L226 Difference]: Without dead ends: 105 [2018-07-23 15:20:18,820 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 15:20:18,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-23 15:20:18,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-23 15:20:18,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-23 15:20:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-23 15:20:18,827 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-07-23 15:20:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:18,828 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-23 15:20:18,828 INFO L472 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-23 15:20:18,828 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-23 15:20:18,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-23 15:20:18,829 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:18,829 INFO L353 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-07-23 15:20:18,829 INFO L414 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:18,829 INFO L82 PathProgramCache]: Analyzing trace with hash 522318333, now seen corresponding path program 101 times [2018-07-23 15:20:18,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 1376 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:19,534 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:19,534 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-23 15:20:19,534 INFO L450 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-23 15:20:19,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-23 15:20:19,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1478, Invalid=9028, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 15:20:19,536 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 103 states. [2018-07-23 15:20:20,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:20,104 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-23 15:20:20,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-23 15:20:20,104 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 104 [2018-07-23 15:20:20,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:20,105 INFO L225 Difference]: With dead ends: 105 [2018-07-23 15:20:20,105 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 15:20:20,106 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1478, Invalid=9028, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 15:20:20,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 15:20:20,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 15:20:20,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 15:20:20,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 15:20:20,108 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2018-07-23 15:20:20,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:20,108 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 15:20:20,108 INFO L472 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-23 15:20:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 15:20:20,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 15:20:20,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 15:20:20,275 WARN L169 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 508 [2018-07-23 15:20:20,840 WARN L169 SmtUtils]: Spent 559.00 ms on a formula simplification that was a NOOP. DAG size: 508 [2018-07-23 15:20:20,847 INFO L417 ceAbstractionStarter]: At program point L30(lines 30 42) the Hoare annotation is: false [2018-07-23 15:20:20,863 INFO L417 ceAbstractionStarter]: At program point L41(lines 15 41) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~y~4 50)) (.cse1 (<= 50 ULTIMATE.start_main_~y~4))) (or (and (<= 48 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 48) .cse1) (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= 99 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 99)) (and (<= 44 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 44) .cse1) (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)) (and (<= ULTIMATE.start_main_~y~4 65) (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4) .cse1) (and .cse0 (<= ULTIMATE.start_main_~x~4 8) .cse1 (<= 8 ULTIMATE.start_main_~x~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 37) .cse1 (<= 37 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63)) (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 30) .cse0 (<= 30 ULTIMATE.start_main_~x~4) .cse1) (and (<= 36 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 36) .cse1) (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 40) .cse0 (<= 40 ULTIMATE.start_main_~x~4) .cse1) (and .cse0 (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4) .cse0 .cse1) (and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= 90 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 90)) (and .cse0 (<= ULTIMATE.start_main_~x~4 28) .cse1 (<= 28 ULTIMATE.start_main_~x~4)) (and (<= 3 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 3) .cse1) (and .cse0 (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4) .cse1) (and .cse0 (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14) .cse1) (and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18) .cse0 .cse1) (and .cse0 (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9) .cse1) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= 78 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 78)) (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96) (<= 96 ULTIMATE.start_main_~x~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4) .cse1) (and (<= 29 ULTIMATE.start_main_~x~4) .cse0 .cse1 (<= ULTIMATE.start_main_~x~4 29)) (and (<= ULTIMATE.start_main_~x~4 50) .cse0 (<= 50 ULTIMATE.start_main_~x~4) .cse1) (and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 25) .cse1 (<= 25 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76) (<= 76 ULTIMATE.start_main_~x~4)) (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91) (<= 91 ULTIMATE.start_main_~x~4)) (and (<= 12 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 12) .cse1) (and (<= 20 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 20) .cse1) (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 71 ULTIMATE.start_main_~y~4) (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71)) (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (and (<= ULTIMATE.start_main_~x~4 32) .cse0 (<= 32 ULTIMATE.start_main_~x~4) .cse1) (and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67)) (and (<= 38 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 38) .cse1) (and .cse0 (<= ULTIMATE.start_main_~x~4 26) .cse1 (<= 26 ULTIMATE.start_main_~x~4)) (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)) (and (<= 34 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 34) .cse1) (and .cse0 (<= 15 ULTIMATE.start_main_~x~4) .cse1 (<= ULTIMATE.start_main_~x~4 15)) (and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4) (<= 81 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~y~4 60) (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4)) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= 86 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 86)) (and (<= ULTIMATE.start_main_~x~4 21) .cse0 (<= 21 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 5) .cse0 .cse1 (<= 5 ULTIMATE.start_main_~x~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 17) .cse1 (<= 17 ULTIMATE.start_main_~x~4)) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54) (<= 54 ULTIMATE.start_main_~x~4)) (and .cse0 (<= 2 ULTIMATE.start_main_~x~4) .cse1 (<= ULTIMATE.start_main_~x~4 2)) (and (<= 74 ULTIMATE.start_main_~y~4) (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (and (<= ULTIMATE.start_main_~x~4 98) (<= 98 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4) .cse0 .cse1) (and .cse0 (<= ULTIMATE.start_main_~x~4 1) .cse1 (<= 1 ULTIMATE.start_main_~x~4)) (and (<= 83 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83)) (and (<= 95 ULTIMATE.start_main_~x~4) (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (and (<= ULTIMATE.start_main_~x~4 16) .cse0 (<= 16 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 31) .cse0 .cse1 (<= 31 ULTIMATE.start_main_~x~4)) (and .cse0 (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19) .cse1) (and .cse0 .cse1 (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= 92 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 92)) (and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4) (<= 94 ULTIMATE.start_main_~x~4)) (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88)) (and (<= ULTIMATE.start_main_~x~4 7) .cse0 (<= 7 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= 73 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 73)) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52)) (and (<= ULTIMATE.start_main_~y~4 100) (< 99 ULTIMATE.start_main_~y~4) (<= 100 ULTIMATE.start_main_~x~4)) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 70)) (and .cse0 (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 33) .cse0 (<= 33 ULTIMATE.start_main_~x~4) .cse1) (and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61)) (and (<= 6 ULTIMATE.start_main_~x~4) .cse0 .cse1 (<= ULTIMATE.start_main_~x~4 6)) (and (<= ULTIMATE.start_main_~x~4 10) .cse0 .cse1 (<= 10 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~y~4) (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66)) (and (<= ULTIMATE.start_main_~x~4 46) .cse0 (<= 46 ULTIMATE.start_main_~x~4) .cse1) (and .cse0 .cse1 (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~x~4) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79)) (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4) (<= 84 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4) (<= 89 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~x~4) (<= 75 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~y~4 69) (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4)) (and (<= 47 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 47) .cse1) (and (<= 97 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64)) (and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51)) (and .cse0 (<= ULTIMATE.start_main_~x~4 4) .cse1 (<= 4 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4) .cse0 .cse1) (and .cse0 (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49) .cse1))) [2018-07-23 15:20:20,864 INFO L421 ceAbstractionStarter]: For program point L22(lines 22 37) no Hoare annotation was computed. [2018-07-23 15:20:20,864 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 43) the Hoare annotation is: false [2018-07-23 15:20:20,864 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 44) the Hoare annotation is: true [2018-07-23 15:20:20,864 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 44) no Hoare annotation was computed. [2018-07-23 15:20:20,865 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 1 44) the Hoare annotation is: false [2018-07-23 15:20:20,901 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 03:20:20 BoogieIcfgContainer [2018-07-23 15:20:20,901 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 15:20:20,902 INFO L168 Benchmark]: Toolchain (without parser) took 61755.95 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -2.4 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-07-23 15:20:20,903 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 15:20:20,904 INFO L168 Benchmark]: Boogie Preprocessor took 48.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 15:20:20,904 INFO L168 Benchmark]: RCFGBuilder took 256.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 15:20:20,905 INFO L168 Benchmark]: TraceAbstraction took 61446.37 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -13.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-07-23 15:20:20,907 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 256.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 61446.37 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -13.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((48 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 48) && 50 <= main_~y~4) || (((99 <= main_~y~4 && main_~y~4 <= 99) && 99 <= main_~x~4) && main_~x~4 <= 99)) || (((44 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 44) && 50 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && 55 <= main_~x~4) && main_~x~4 <= 55)) || (((main_~y~4 <= 65 && 65 <= main_~x~4) && main_~x~4 <= 65) && 65 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 35) && 35 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 8) && 50 <= main_~y~4) && 8 <= main_~x~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 37) && 50 <= main_~y~4) && 37 <= main_~x~4)) || (((63 <= main_~x~4 && 63 <= main_~y~4) && main_~y~4 <= 63) && main_~x~4 <= 63)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (((main_~x~4 <= 30 && main_~y~4 <= 50) && 30 <= main_~x~4) && 50 <= main_~y~4)) || (((36 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 36) && 50 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (((main_~x~4 <= 40 && main_~y~4 <= 50) && 40 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 43) && 43 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 41 && 41 <= main_~x~4) && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((53 <= main_~x~4 && main_~x~4 <= 53) && main_~y~4 <= 53) && 53 <= main_~y~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && 90 <= main_~x~4) && main_~y~4 <= 90)) || (((main_~y~4 <= 50 && main_~x~4 <= 28) && 50 <= main_~y~4) && 28 <= main_~x~4)) || (((3 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 3) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 24) && 24 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && 14 <= main_~x~4) && main_~x~4 <= 14) && 50 <= main_~y~4)) || (((18 <= main_~x~4 && main_~x~4 <= 18) && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && 9 <= main_~x~4) && main_~x~4 <= 9) && 50 <= main_~y~4)) || (((main_~x~4 <= 78 && 78 <= main_~y~4) && 78 <= main_~x~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 0) && 0 <= main_~x~4) && 50 <= main_~y~4)) || (((29 <= main_~x~4 && main_~y~4 <= 50) && 50 <= main_~y~4) && main_~x~4 <= 29)) || (((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~x~4) && 50 <= main_~y~4)) || (((58 <= main_~x~4 && main_~y~4 <= 58) && main_~x~4 <= 58) && 58 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 25) && 50 <= main_~y~4) && 25 <= main_~x~4)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((12 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 12) && 50 <= main_~y~4)) || (((20 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 20) && 50 <= main_~y~4)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (((71 <= main_~y~4 && 71 <= main_~x~4) && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 82 && 82 <= main_~x~4) && 82 <= main_~y~4) && main_~y~4 <= 82)) || (((main_~x~4 <= 32 && main_~y~4 <= 50) && 32 <= main_~x~4) && 50 <= main_~y~4)) || (((72 <= main_~x~4 && main_~x~4 <= 72) && 72 <= main_~y~4) && main_~y~4 <= 72)) || (((67 <= main_~x~4 && main_~y~4 <= 67) && 67 <= main_~y~4) && main_~x~4 <= 67)) || (((38 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 38) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 26) && 50 <= main_~y~4) && 26 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && 57 <= main_~x~4) && main_~x~4 <= 57)) || (((34 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 34) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && 15 <= main_~x~4) && 50 <= main_~y~4) && main_~x~4 <= 15)) || (((main_~x~4 <= 68 && 68 <= main_~x~4) && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~x~4) && 81 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 27) && 27 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~y~4 <= 60 && 60 <= main_~x~4) && main_~x~4 <= 60) && 60 <= main_~y~4)) || (((86 <= main_~y~4 && main_~y~4 <= 86) && 86 <= main_~x~4) && main_~x~4 <= 86)) || (((main_~x~4 <= 21 && main_~y~4 <= 50) && 21 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 5 && main_~y~4 <= 50) && 50 <= main_~y~4) && 5 <= main_~x~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 17) && 50 <= main_~y~4) && 17 <= main_~x~4)) || (((54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54) && 54 <= main_~x~4)) || (((main_~y~4 <= 50 && 2 <= main_~x~4) && 50 <= main_~y~4) && main_~x~4 <= 2)) || (((74 <= main_~y~4 && 74 <= main_~x~4) && main_~x~4 <= 74) && main_~y~4 <= 74)) || (((main_~x~4 <= 98 && 98 <= main_~x~4) && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 13) && 13 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 11 && 11 <= main_~x~4) && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 1) && 50 <= main_~y~4) && 1 <= main_~x~4)) || (((83 <= main_~x~4 && main_~y~4 <= 83) && 83 <= main_~y~4) && main_~x~4 <= 83)) || (((95 <= main_~x~4 && 95 <= main_~y~4) && main_~y~4 <= 95) && main_~x~4 <= 95)) || (((main_~x~4 <= 16 && main_~y~4 <= 50) && 16 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 31 && main_~y~4 <= 50) && 50 <= main_~y~4) && 31 <= main_~x~4)) || (((main_~y~4 <= 50 && 19 <= main_~x~4) && main_~x~4 <= 19) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && 50 <= main_~y~4) && main_~x~4 <= 22) && 22 <= main_~x~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && 92 <= main_~x~4) && main_~y~4 <= 92)) || (((56 <= main_~x~4 && main_~y~4 <= 56) && main_~x~4 <= 56) && 56 <= main_~y~4)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && 85 <= main_~x~4) && main_~x~4 <= 85)) || (((main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4) && 94 <= main_~x~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && 88 <= main_~x~4) && main_~x~4 <= 88)) || (((main_~x~4 <= 7 && main_~y~4 <= 50) && 7 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && 73 <= main_~x~4) && main_~y~4 <= 73)) || (((main_~x~4 <= 52 && 52 <= main_~x~4) && 52 <= main_~y~4) && main_~y~4 <= 52)) || ((main_~y~4 <= 100 && 99 < main_~y~4) && 100 <= main_~x~4)) || (((70 <= main_~y~4 && main_~x~4 <= 70) && 70 <= main_~x~4) && main_~y~4 <= 70)) || (((main_~y~4 <= 50 && main_~x~4 <= 42) && 42 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 33 && main_~y~4 <= 50) && 33 <= main_~x~4) && 50 <= main_~y~4)) || (((61 <= main_~x~4 && main_~x~4 <= 61) && 61 <= main_~y~4) && main_~y~4 <= 61)) || (((6 <= main_~x~4 && main_~y~4 <= 50) && 50 <= main_~y~4) && main_~x~4 <= 6)) || (((main_~x~4 <= 10 && main_~y~4 <= 50) && 50 <= main_~y~4) && 10 <= main_~x~4)) || (((66 <= main_~y~4 && 66 <= main_~x~4) && main_~y~4 <= 66) && main_~x~4 <= 66)) || (((main_~x~4 <= 46 && main_~y~4 <= 50) && 46 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && 50 <= main_~y~4) && 45 <= main_~x~4) && main_~x~4 <= 45)) || (((main_~y~4 <= 79 && 79 <= main_~x~4) && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~x~4) && 89 <= main_~y~4)) || (((main_~x~4 <= 77 && 77 <= main_~x~4) && main_~y~4 <= 77) && 77 <= main_~y~4)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~x~4) && 75 <= main_~y~4)) || (((main_~y~4 <= 69 && 69 <= main_~x~4) && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((47 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 47) && 50 <= main_~y~4)) || (((97 <= main_~x~4 && main_~y~4 <= 97) && main_~x~4 <= 97) && 97 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 39) && 39 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 64 && 64 <= main_~x~4) && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((51 <= main_~x~4 && main_~y~4 <= 51) && 51 <= main_~y~4) && main_~x~4 <= 51)) || (((main_~y~4 <= 50 && main_~x~4 <= 4) && 50 <= main_~y~4) && 4 <= main_~x~4)) || (((main_~x~4 <= 23 && 23 <= main_~x~4) && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && 49 <= main_~x~4) && main_~x~4 <= 49) && 50 <= main_~y~4) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 61.3s OverallTime, 102 OverallIterations, 101 TraceHistogramMax, 27.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 304 SDtfs, 0 SDslu, 3924 SDs, 0 SdLazy, 300152 SolverSat, 3649 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5354 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=101, 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.5s AutomataMinimizationTime, 102 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 106 NumberOfFragments, 1315 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 29.7s InterpolantComputationTime, 5457 NumberOfCodeBlocks, 5457 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 5355 ConstructedInterpolants, 0 QuantifiedInterpolants, 2350889 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 102 InterpolantComputations, 1 PerfectInterpolantSequences, 1376/176851 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_15-20-20-918.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_15-20-20-918.csv Received shutdown request...