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-935f392 [2018-07-23 13:40:52,710 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:40:52,712 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:40:52,725 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:40:52,725 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:40:52,726 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:40:52,728 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:40:52,730 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:40:52,731 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:40:52,732 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:40:52,733 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:40:52,733 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:40:52,734 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:40:52,735 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:40:52,737 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:40:52,737 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:40:52,738 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:40:52,740 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:40:52,743 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:40:52,744 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:40:52,745 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:40:52,747 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:40:52,749 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:40:52,750 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:40:52,750 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:40:52,751 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:40:52,752 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:40:52,753 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:40:52,754 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:40:52,755 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:40:52,755 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:40:52,756 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:40:52,756 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:40:52,756 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:40:52,758 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:40:52,758 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:40:52,759 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 13:40:52,774 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:40:52,775 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:40:52,776 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:40:52,776 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:40:52,777 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:40:52,777 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:40:52,777 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:40:52,777 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:40:52,824 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:40:52,843 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:40:52,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:40:52,850 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:40:52,851 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:40:52,852 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 13:40:52,852 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 13:40:52,915 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:40:52,917 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:40:52,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:40:52,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:40:52,919 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:40:52,947 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 01:40:52" (1/1) ... [2018-07-23 13:40:52,949 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 01:40:52" (1/1) ... [2018-07-23 13:40:52,960 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 01:40:52" (1/1) ... [2018-07-23 13:40:52,961 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 01:40:52" (1/1) ... [2018-07-23 13:40:52,963 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 01:40:52" (1/1) ... [2018-07-23 13:40:52,965 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 01:40:52" (1/1) ... [2018-07-23 13:40:52,966 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 01:40:52" (1/1) ... [2018-07-23 13:40:52,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:40:52,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:40:52,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:40:52,968 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:40:52,970 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 01:40:52" (1/1) ... [2018-07-23 13:40:53,057 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-07-23 13:40:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:40:53,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:40:53,217 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:40:53,218 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 01:40:53 BoogieIcfgContainer [2018-07-23 13:40:53,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:40:53,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:40:53,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:40:53,223 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:40:53,224 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 01:40:52" (1/2) ... [2018-07-23 13:40:53,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744c9cda and model type gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:40:53, skipping insertion in model container [2018-07-23 13:40:53,226 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 01:40:53" (2/2) ... [2018-07-23 13:40:53,228 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-07-23 13:40:53,241 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:40:53,250 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:40:53,304 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:40:53,305 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:40:53,306 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:40:53,306 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:40:53,306 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:40:53,306 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:40:53,307 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:40:53,307 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:40:53,307 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:40:53,326 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-07-23 13:40:53,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-23 13:40:53,338 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:53,339 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-23 13:40:53,341 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:53,348 INFO L82 PathProgramCache]: Analyzing trace with hash 30023, now seen corresponding path program 1 times [2018-07-23 13:40:53,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:53,438 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 13:40:53,441 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:40:53,441 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:40:53,444 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:53,444 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 13:40:53,445 INFO L185 omatonBuilderFactory]: Interpolants [8#true, 9#false, 10#(<= ULTIMATE.start_main_~x~4 0)] [2018-07-23 13:40:53,445 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 13:40:53,447 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:40:53,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:40:53,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:40:53,467 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-07-23 13:40:53,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:53,506 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2018-07-23 13:40:53,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:40:53,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-23 13:40:53,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:53,520 INFO L225 Difference]: With dead ends: 8 [2018-07-23 13:40:53,520 INFO L226 Difference]: Without dead ends: 5 [2018-07-23 13:40:53,524 INFO L575 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 13:40:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-23 13:40:53,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-23 13:40:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-23 13:40:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-23 13:40:53,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-23 13:40:53,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:53,573 INFO L471 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-23 13:40:53,573 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:40:53,574 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-23 13:40:53,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:40:53,578 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:53,579 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:40:53,579 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:53,579 INFO L82 PathProgramCache]: Analyzing trace with hash 942973, now seen corresponding path program 1 times [2018-07-23 13:40:53,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:53,617 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 13:40:53,617 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:53,617 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:40:53,618 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:53,618 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 13:40:53,618 INFO L185 omatonBuilderFactory]: Interpolants [37#true, 38#false, 39#(<= ULTIMATE.start_main_~x~4 0), 40#(<= ULTIMATE.start_main_~x~4 1)] [2018-07-23 13:40:53,618 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 13:40:53,623 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:40:53,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:40:53,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:40:53,624 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-07-23 13:40:53,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:53,659 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-23 13:40:53,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:40:53,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-23 13:40:53,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:53,663 INFO L225 Difference]: With dead ends: 8 [2018-07-23 13:40:53,663 INFO L226 Difference]: Without dead ends: 6 [2018-07-23 13:40:53,664 INFO L575 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 13:40:53,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-23 13:40:53,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-23 13:40:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-23 13:40:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-23 13:40:53,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-23 13:40:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:53,673 INFO L471 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-23 13:40:53,674 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:40:53,674 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-23 13:40:53,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-23 13:40:53,674 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:53,675 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-23 13:40:53,675 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:53,675 INFO L82 PathProgramCache]: Analyzing trace with hash 29244423, now seen corresponding path program 2 times [2018-07-23 13:40:53,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:53,717 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 13:40:53,718 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:53,718 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:40:53,718 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:53,719 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 13:40:53,719 INFO L185 omatonBuilderFactory]: Interpolants [69#true, 70#false, 71#(<= ULTIMATE.start_main_~x~4 0), 72#(<= ULTIMATE.start_main_~x~4 1), 73#(<= ULTIMATE.start_main_~x~4 2)] [2018-07-23 13:40:53,719 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 13:40:53,720 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:40:53,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:40:53,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:40:53,721 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-07-23 13:40:53,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:53,734 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-23 13:40:53,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:40:53,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-23 13:40:53,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:53,736 INFO L225 Difference]: With dead ends: 9 [2018-07-23 13:40:53,736 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 13:40:53,736 INFO L575 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 13:40:53,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 13:40:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-23 13:40:53,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:40:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:40:53,739 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-23 13:40:53,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:53,740 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:40:53,740 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:40:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:40:53,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:40:53,740 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:53,741 INFO L357 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-23 13:40:53,741 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:53,741 INFO L82 PathProgramCache]: Analyzing trace with hash 906589373, now seen corresponding path program 3 times [2018-07-23 13:40:53,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:53,788 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 13:40:53,788 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:53,789 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:40:53,789 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:53,789 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 13:40:53,789 INFO L185 omatonBuilderFactory]: Interpolants [106#true, 107#false, 108#(<= ULTIMATE.start_main_~x~4 0), 109#(<= ULTIMATE.start_main_~x~4 1), 110#(<= ULTIMATE.start_main_~x~4 2), 111#(<= ULTIMATE.start_main_~x~4 3)] [2018-07-23 13:40:53,790 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 13:40:53,790 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:40:53,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:40:53,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:40:53,791 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-23 13:40:53,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:53,807 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-23 13:40:53,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:40:53,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 13:40:53,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:53,811 INFO L225 Difference]: With dead ends: 10 [2018-07-23 13:40:53,811 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:40:53,812 INFO L575 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 13:40:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:40:53,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-23 13:40:53,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-23 13:40:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-23 13:40:53,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-23 13:40:53,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:53,818 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-23 13:40:53,818 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:40:53,818 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-23 13:40:53,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:40:53,819 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:53,819 INFO L357 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-23 13:40:53,820 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:53,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1960488249, now seen corresponding path program 4 times [2018-07-23 13:40:53,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:53,875 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 13:40:53,875 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:53,876 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:40:53,876 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:53,876 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 13:40:53,876 INFO L185 omatonBuilderFactory]: Interpolants [148#true, 149#false, 150#(<= ULTIMATE.start_main_~x~4 0), 151#(<= ULTIMATE.start_main_~x~4 1), 152#(<= ULTIMATE.start_main_~x~4 2), 153#(<= ULTIMATE.start_main_~x~4 3), 154#(<= ULTIMATE.start_main_~x~4 4)] [2018-07-23 13:40:53,877 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 13:40:53,877 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:40:53,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:40:53,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:40:53,878 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-23 13:40:53,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:53,916 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-23 13:40:53,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:40:53,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-23 13:40:53,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:53,921 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:40:53,921 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 13:40:53,922 INFO L575 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 13:40:53,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 13:40:53,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-23 13:40:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:40:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:40:53,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-23 13:40:53,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:53,929 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:40:53,929 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:40:53,929 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:40:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:40:53,930 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:53,930 INFO L357 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-23 13:40:53,930 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:53,930 INFO L82 PathProgramCache]: Analyzing trace with hash -645581315, now seen corresponding path program 5 times [2018-07-23 13:40:53,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:54,034 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 13:40:54,035 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:54,035 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:40:54,035 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:54,036 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 13:40:54,036 INFO L185 omatonBuilderFactory]: Interpolants [195#true, 196#false, 197#(<= ULTIMATE.start_main_~x~4 0), 198#(<= ULTIMATE.start_main_~x~4 1), 199#(<= ULTIMATE.start_main_~x~4 2), 200#(<= ULTIMATE.start_main_~x~4 3), 201#(<= ULTIMATE.start_main_~x~4 4), 202#(<= ULTIMATE.start_main_~x~4 5)] [2018-07-23 13:40:54,036 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 13:40:54,037 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:40:54,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:40:54,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:40:54,038 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-07-23 13:40:54,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:54,053 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 13:40:54,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:40:54,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:40:54,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:54,054 INFO L225 Difference]: With dead ends: 12 [2018-07-23 13:40:54,054 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 13:40:54,055 INFO L575 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 13:40:54,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 13:40:54,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-23 13:40:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-23 13:40:54,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-23 13:40:54,058 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-23 13:40:54,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:54,059 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-23 13:40:54,059 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:40:54,059 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-23 13:40:54,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 13:40:54,060 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:54,060 INFO L357 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-23 13:40:54,060 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:54,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1461827975, now seen corresponding path program 6 times [2018-07-23 13:40:54,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:54,113 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 13:40:54,113 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:54,114 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:40:54,114 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:54,114 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 13:40:54,114 INFO L185 omatonBuilderFactory]: Interpolants [247#true, 248#false, 249#(<= ULTIMATE.start_main_~x~4 0), 250#(<= ULTIMATE.start_main_~x~4 1), 251#(<= ULTIMATE.start_main_~x~4 2), 252#(<= ULTIMATE.start_main_~x~4 3), 253#(<= ULTIMATE.start_main_~x~4 4), 254#(<= ULTIMATE.start_main_~x~4 5), 255#(<= ULTIMATE.start_main_~x~4 6)] [2018-07-23 13:40:54,115 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 13:40:54,115 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:40:54,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:40:54,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:40:54,116 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-07-23 13:40:54,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:54,133 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 13:40:54,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:40:54,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-23 13:40:54,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:54,134 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:40:54,134 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 13:40:54,135 INFO L575 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 13:40:54,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 13:40:54,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 13:40:54,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:40:54,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:40:54,139 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-23 13:40:54,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:54,140 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:40:54,140 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:40:54,140 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:40:54,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:40:54,140 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:54,141 INFO L357 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-23 13:40:54,141 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:54,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1927960771, now seen corresponding path program 7 times [2018-07-23 13:40:54,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:54,198 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 13:40:54,199 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:54,199 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:40:54,199 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:54,200 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 13:40:54,200 INFO L185 omatonBuilderFactory]: Interpolants [304#true, 305#false, 306#(<= ULTIMATE.start_main_~x~4 0), 307#(<= ULTIMATE.start_main_~x~4 1), 308#(<= ULTIMATE.start_main_~x~4 2), 309#(<= ULTIMATE.start_main_~x~4 3), 310#(<= ULTIMATE.start_main_~x~4 4), 311#(<= ULTIMATE.start_main_~x~4 5), 312#(<= ULTIMATE.start_main_~x~4 6), 313#(<= ULTIMATE.start_main_~x~4 7)] [2018-07-23 13:40:54,201 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 13:40:54,201 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:40:54,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:40:54,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:40:54,202 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-07-23 13:40:54,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:54,222 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-23 13:40:54,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:40:54,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-07-23 13:40:54,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:54,226 INFO L225 Difference]: With dead ends: 14 [2018-07-23 13:40:54,227 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 13:40:54,227 INFO L575 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 13:40:54,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 13:40:54,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-23 13:40:54,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-23 13:40:54,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-23 13:40:54,234 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-23 13:40:54,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:54,234 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-23 13:40:54,235 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:40:54,236 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-23 13:40:54,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:40:54,238 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:54,238 INFO L357 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-23 13:40:54,238 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:54,239 INFO L82 PathProgramCache]: Analyzing trace with hash 362770503, now seen corresponding path program 8 times [2018-07-23 13:40:54,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:54,301 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 13:40:54,302 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:54,302 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:40:54,302 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:54,302 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 13:40:54,303 INFO L185 omatonBuilderFactory]: Interpolants [368#(<= ULTIMATE.start_main_~x~4 0), 369#(<= ULTIMATE.start_main_~x~4 1), 370#(<= ULTIMATE.start_main_~x~4 2), 371#(<= ULTIMATE.start_main_~x~4 3), 372#(<= ULTIMATE.start_main_~x~4 4), 373#(<= ULTIMATE.start_main_~x~4 5), 374#(<= ULTIMATE.start_main_~x~4 6), 375#(<= ULTIMATE.start_main_~x~4 7), 376#(<= ULTIMATE.start_main_~x~4 8), 366#true, 367#false] [2018-07-23 13:40:54,303 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 13:40:54,306 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:40:54,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:40:54,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:40:54,307 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-07-23 13:40:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:54,334 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 13:40:54,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:40:54,334 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-07-23 13:40:54,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:54,335 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:40:54,335 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 13:40:54,336 INFO L575 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 13:40:54,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 13:40:54,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 13:40:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 13:40:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 13:40:54,343 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-23 13:40:54,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:54,344 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 13:40:54,344 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:40:54,344 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 13:40:54,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:40:54,345 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:54,346 INFO L357 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-23 13:40:54,346 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:54,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1639004035, now seen corresponding path program 9 times [2018-07-23 13:40:54,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:54,446 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 13:40:54,449 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:54,450 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:40:54,450 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:54,450 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 13:40:54,451 INFO L185 omatonBuilderFactory]: Interpolants [433#true, 434#false, 435#(<= ULTIMATE.start_main_~x~4 0), 436#(<= ULTIMATE.start_main_~x~4 1), 437#(<= ULTIMATE.start_main_~x~4 2), 438#(<= ULTIMATE.start_main_~x~4 3), 439#(<= ULTIMATE.start_main_~x~4 4), 440#(<= ULTIMATE.start_main_~x~4 5), 441#(<= ULTIMATE.start_main_~x~4 6), 442#(<= ULTIMATE.start_main_~x~4 7), 443#(<= ULTIMATE.start_main_~x~4 8), 444#(<= ULTIMATE.start_main_~x~4 9)] [2018-07-23 13:40:54,451 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 13:40:54,451 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:40:54,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:40:54,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:40:54,452 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-07-23 13:40:54,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:54,491 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-23 13:40:54,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:40:54,491 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-07-23 13:40:54,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:54,492 INFO L225 Difference]: With dead ends: 16 [2018-07-23 13:40:54,496 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 13:40:54,497 INFO L575 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 13:40:54,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 13:40:54,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-23 13:40:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-23 13:40:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-23 13:40:54,501 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-23 13:40:54,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:54,508 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-23 13:40:54,508 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:40:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-23 13:40:54,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:40:54,509 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:54,509 INFO L357 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-23 13:40:54,510 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:54,510 INFO L82 PathProgramCache]: Analyzing trace with hash 730494727, now seen corresponding path program 10 times [2018-07-23 13:40:54,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:54,608 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 13:40:54,608 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:54,609 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:40:54,609 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:54,609 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 13:40:54,610 INFO L185 omatonBuilderFactory]: Interpolants [512#(<= ULTIMATE.start_main_~x~4 5), 513#(<= ULTIMATE.start_main_~x~4 6), 514#(<= ULTIMATE.start_main_~x~4 7), 515#(<= ULTIMATE.start_main_~x~4 8), 516#(<= ULTIMATE.start_main_~x~4 9), 517#(<= ULTIMATE.start_main_~x~4 10), 505#true, 506#false, 507#(<= ULTIMATE.start_main_~x~4 0), 508#(<= ULTIMATE.start_main_~x~4 1), 509#(<= ULTIMATE.start_main_~x~4 2), 510#(<= ULTIMATE.start_main_~x~4 3), 511#(<= ULTIMATE.start_main_~x~4 4)] [2018-07-23 13:40:54,610 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 13:40:54,610 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:40:54,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:40:54,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:40:54,611 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-07-23 13:40:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:54,624 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 13:40:54,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:40:54,625 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-07-23 13:40:54,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:54,626 INFO L225 Difference]: With dead ends: 17 [2018-07-23 13:40:54,626 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 13:40:54,626 INFO L575 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 13:40:54,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 13:40:54,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-23 13:40:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:40:54,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 13:40:54,630 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-23 13:40:54,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:54,631 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 13:40:54,631 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:40:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 13:40:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:40:54,632 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:54,632 INFO L357 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-23 13:40:54,634 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:54,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1170512317, now seen corresponding path program 11 times [2018-07-23 13:40:54,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:54,706 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 13:40:54,706 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:54,706 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:40:54,707 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:54,707 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 13:40:54,708 INFO L185 omatonBuilderFactory]: Interpolants [582#true, 583#false, 584#(<= ULTIMATE.start_main_~x~4 0), 585#(<= ULTIMATE.start_main_~x~4 1), 586#(<= ULTIMATE.start_main_~x~4 2), 587#(<= ULTIMATE.start_main_~x~4 3), 588#(<= ULTIMATE.start_main_~x~4 4), 589#(<= ULTIMATE.start_main_~x~4 5), 590#(<= ULTIMATE.start_main_~x~4 6), 591#(<= ULTIMATE.start_main_~x~4 7), 592#(<= ULTIMATE.start_main_~x~4 8), 593#(<= ULTIMATE.start_main_~x~4 9), 594#(<= ULTIMATE.start_main_~x~4 10), 595#(<= ULTIMATE.start_main_~x~4 11)] [2018-07-23 13:40:54,708 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 13:40:54,708 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:40:54,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:40:54,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:40:54,711 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-07-23 13:40:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:54,738 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-23 13:40:54,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:40:54,739 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-07-23 13:40:54,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:54,741 INFO L225 Difference]: With dead ends: 18 [2018-07-23 13:40:54,741 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 13:40:54,742 INFO L575 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 13:40:54,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 13:40:54,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-23 13:40:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-23 13:40:54,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-23 13:40:54,752 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-23 13:40:54,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:54,753 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-23 13:40:54,756 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:40:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-23 13:40:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:40:54,757 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:54,757 INFO L357 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-07-23 13:40:54,757 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:54,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1926155719, now seen corresponding path program 12 times [2018-07-23 13:40:54,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:54,852 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 13:40:54,852 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:54,852 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:40:54,853 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:54,853 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 13:40:54,855 INFO L185 omatonBuilderFactory]: Interpolants [672#(<= ULTIMATE.start_main_~x~4 6), 673#(<= ULTIMATE.start_main_~x~4 7), 674#(<= ULTIMATE.start_main_~x~4 8), 675#(<= ULTIMATE.start_main_~x~4 9), 676#(<= ULTIMATE.start_main_~x~4 10), 677#(<= ULTIMATE.start_main_~x~4 11), 678#(<= ULTIMATE.start_main_~x~4 12), 664#true, 665#false, 666#(<= ULTIMATE.start_main_~x~4 0), 667#(<= ULTIMATE.start_main_~x~4 1), 668#(<= ULTIMATE.start_main_~x~4 2), 669#(<= ULTIMATE.start_main_~x~4 3), 670#(<= ULTIMATE.start_main_~x~4 4), 671#(<= ULTIMATE.start_main_~x~4 5)] [2018-07-23 13:40:54,856 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 13:40:54,856 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:40:54,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:40:54,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:40:54,858 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-07-23 13:40:54,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:54,884 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-23 13:40:54,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:40:54,884 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-07-23 13:40:54,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:54,885 INFO L225 Difference]: With dead ends: 19 [2018-07-23 13:40:54,885 INFO L226 Difference]: Without dead ends: 17 [2018-07-23 13:40:54,886 INFO L575 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 13:40:54,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-23 13:40:54,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-23 13:40:54,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 13:40:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-23 13:40:54,895 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-07-23 13:40:54,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:54,896 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-23 13:40:54,896 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:40:54,896 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-23 13:40:54,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:40:54,897 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:54,897 INFO L357 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-07-23 13:40:54,897 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:54,898 INFO L82 PathProgramCache]: Analyzing trace with hash -418702595, now seen corresponding path program 13 times [2018-07-23 13:40:54,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:54,982 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 13:40:54,983 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:54,983 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:40:54,983 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:54,983 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 13:40:54,984 INFO L185 omatonBuilderFactory]: Interpolants [751#true, 752#false, 753#(<= ULTIMATE.start_main_~x~4 0), 754#(<= ULTIMATE.start_main_~x~4 1), 755#(<= ULTIMATE.start_main_~x~4 2), 756#(<= ULTIMATE.start_main_~x~4 3), 757#(<= ULTIMATE.start_main_~x~4 4), 758#(<= ULTIMATE.start_main_~x~4 5), 759#(<= ULTIMATE.start_main_~x~4 6), 760#(<= ULTIMATE.start_main_~x~4 7), 761#(<= ULTIMATE.start_main_~x~4 8), 762#(<= ULTIMATE.start_main_~x~4 9), 763#(<= ULTIMATE.start_main_~x~4 10), 764#(<= ULTIMATE.start_main_~x~4 11), 765#(<= ULTIMATE.start_main_~x~4 12), 766#(<= ULTIMATE.start_main_~x~4 13)] [2018-07-23 13:40:54,984 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 13:40:54,985 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:40:54,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:40:54,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:40:54,986 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-07-23 13:40:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:55,004 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-23 13:40:55,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:40:55,004 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-07-23 13:40:55,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:55,005 INFO L225 Difference]: With dead ends: 20 [2018-07-23 13:40:55,005 INFO L226 Difference]: Without dead ends: 18 [2018-07-23 13:40:55,006 INFO L575 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 13:40:55,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-23 13:40:55,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-23 13:40:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-23 13:40:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-23 13:40:55,014 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-07-23 13:40:55,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:55,014 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-23 13:40:55,015 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:40:55,015 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-23 13:40:55,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:40:55,015 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:55,016 INFO L357 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-07-23 13:40:55,016 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:55,016 INFO L82 PathProgramCache]: Analyzing trace with hash -94866297, now seen corresponding path program 14 times [2018-07-23 13:40:55,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:55,094 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 13:40:55,095 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:55,095 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 13:40:55,095 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:55,096 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 13:40:55,096 INFO L185 omatonBuilderFactory]: Interpolants [843#true, 844#false, 845#(<= ULTIMATE.start_main_~x~4 0), 846#(<= ULTIMATE.start_main_~x~4 1), 847#(<= ULTIMATE.start_main_~x~4 2), 848#(<= ULTIMATE.start_main_~x~4 3), 849#(<= ULTIMATE.start_main_~x~4 4), 850#(<= ULTIMATE.start_main_~x~4 5), 851#(<= ULTIMATE.start_main_~x~4 6), 852#(<= ULTIMATE.start_main_~x~4 7), 853#(<= ULTIMATE.start_main_~x~4 8), 854#(<= ULTIMATE.start_main_~x~4 9), 855#(<= ULTIMATE.start_main_~x~4 10), 856#(<= ULTIMATE.start_main_~x~4 11), 857#(<= ULTIMATE.start_main_~x~4 12), 858#(<= ULTIMATE.start_main_~x~4 13), 859#(<= ULTIMATE.start_main_~x~4 14)] [2018-07-23 13:40:55,096 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 13:40:55,097 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 13:40:55,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 13:40:55,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:40:55,098 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-07-23 13:40:55,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:55,112 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-23 13:40:55,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:40:55,112 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-07-23 13:40:55,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:55,115 INFO L225 Difference]: With dead ends: 21 [2018-07-23 13:40:55,116 INFO L226 Difference]: Without dead ends: 19 [2018-07-23 13:40:55,121 INFO L575 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 13:40:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-23 13:40:55,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-23 13:40:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 13:40:55,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-23 13:40:55,128 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-07-23 13:40:55,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:55,129 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-23 13:40:55,129 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 13:40:55,129 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-23 13:40:55,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:40:55,130 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:55,130 INFO L357 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-07-23 13:40:55,130 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:55,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1354124349, now seen corresponding path program 15 times [2018-07-23 13:40:55,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:55,210 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 13:40:55,211 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:55,211 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 13:40:55,211 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:55,214 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 13:40:55,214 INFO L185 omatonBuilderFactory]: Interpolants [940#true, 941#false, 942#(<= ULTIMATE.start_main_~x~4 0), 943#(<= ULTIMATE.start_main_~x~4 1), 944#(<= ULTIMATE.start_main_~x~4 2), 945#(<= ULTIMATE.start_main_~x~4 3), 946#(<= ULTIMATE.start_main_~x~4 4), 947#(<= ULTIMATE.start_main_~x~4 5), 948#(<= ULTIMATE.start_main_~x~4 6), 949#(<= ULTIMATE.start_main_~x~4 7), 950#(<= ULTIMATE.start_main_~x~4 8), 951#(<= ULTIMATE.start_main_~x~4 9), 952#(<= ULTIMATE.start_main_~x~4 10), 953#(<= ULTIMATE.start_main_~x~4 11), 954#(<= ULTIMATE.start_main_~x~4 12), 955#(<= ULTIMATE.start_main_~x~4 13), 956#(<= ULTIMATE.start_main_~x~4 14), 957#(<= ULTIMATE.start_main_~x~4 15)] [2018-07-23 13:40:55,215 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 13:40:55,215 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 13:40:55,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 13:40:55,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:40:55,216 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-07-23 13:40:55,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:55,235 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-23 13:40:55,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:40:55,236 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-07-23 13:40:55,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:55,236 INFO L225 Difference]: With dead ends: 22 [2018-07-23 13:40:55,237 INFO L226 Difference]: Without dead ends: 20 [2018-07-23 13:40:55,244 INFO L575 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 13:40:55,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-23 13:40:55,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-23 13:40:55,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-23 13:40:55,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-23 13:40:55,248 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-07-23 13:40:55,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:55,251 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-23 13:40:55,251 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 13:40:55,251 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-23 13:40:55,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:40:55,252 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:55,252 INFO L357 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-07-23 13:40:55,253 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:55,253 INFO L82 PathProgramCache]: Analyzing trace with hash -971805881, now seen corresponding path program 16 times [2018-07-23 13:40:55,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:55,326 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 13:40:55,326 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:55,327 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-23 13:40:55,327 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:55,327 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 13:40:55,328 INFO L185 omatonBuilderFactory]: Interpolants [1056#(<= ULTIMATE.start_main_~x~4 12), 1057#(<= ULTIMATE.start_main_~x~4 13), 1058#(<= ULTIMATE.start_main_~x~4 14), 1059#(<= ULTIMATE.start_main_~x~4 15), 1060#(<= ULTIMATE.start_main_~x~4 16), 1042#true, 1043#false, 1044#(<= ULTIMATE.start_main_~x~4 0), 1045#(<= ULTIMATE.start_main_~x~4 1), 1046#(<= ULTIMATE.start_main_~x~4 2), 1047#(<= ULTIMATE.start_main_~x~4 3), 1048#(<= ULTIMATE.start_main_~x~4 4), 1049#(<= ULTIMATE.start_main_~x~4 5), 1050#(<= ULTIMATE.start_main_~x~4 6), 1051#(<= ULTIMATE.start_main_~x~4 7), 1052#(<= ULTIMATE.start_main_~x~4 8), 1053#(<= ULTIMATE.start_main_~x~4 9), 1054#(<= ULTIMATE.start_main_~x~4 10), 1055#(<= ULTIMATE.start_main_~x~4 11)] [2018-07-23 13:40:55,328 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 13:40:55,328 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-23 13:40:55,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-23 13:40:55,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:40:55,330 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-07-23 13:40:55,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:55,343 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-23 13:40:55,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:40:55,343 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-07-23 13:40:55,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:55,344 INFO L225 Difference]: With dead ends: 23 [2018-07-23 13:40:55,344 INFO L226 Difference]: Without dead ends: 21 [2018-07-23 13:40:55,345 INFO L575 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 13:40:55,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-23 13:40:55,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-23 13:40:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-23 13:40:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-23 13:40:55,349 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-07-23 13:40:55,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:55,349 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-23 13:40:55,349 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-23 13:40:55,349 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-23 13:40:55,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:40:55,350 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:55,350 INFO L357 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-07-23 13:40:55,351 INFO L414 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:55,351 INFO L82 PathProgramCache]: Analyzing trace with hash -61198979, now seen corresponding path program 17 times [2018-07-23 13:40:55,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:55,431 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 13:40:55,431 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:55,431 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-23 13:40:55,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:55,432 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 13:40:55,433 INFO L185 omatonBuilderFactory]: Interpolants [1152#(<= ULTIMATE.start_main_~x~4 1), 1153#(<= ULTIMATE.start_main_~x~4 2), 1154#(<= ULTIMATE.start_main_~x~4 3), 1155#(<= ULTIMATE.start_main_~x~4 4), 1156#(<= ULTIMATE.start_main_~x~4 5), 1157#(<= ULTIMATE.start_main_~x~4 6), 1158#(<= ULTIMATE.start_main_~x~4 7), 1159#(<= ULTIMATE.start_main_~x~4 8), 1160#(<= ULTIMATE.start_main_~x~4 9), 1161#(<= ULTIMATE.start_main_~x~4 10), 1162#(<= ULTIMATE.start_main_~x~4 11), 1163#(<= ULTIMATE.start_main_~x~4 12), 1164#(<= ULTIMATE.start_main_~x~4 13), 1165#(<= ULTIMATE.start_main_~x~4 14), 1166#(<= ULTIMATE.start_main_~x~4 15), 1167#(<= ULTIMATE.start_main_~x~4 16), 1168#(<= ULTIMATE.start_main_~x~4 17), 1149#true, 1150#false, 1151#(<= ULTIMATE.start_main_~x~4 0)] [2018-07-23 13:40:55,434 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 13:40:55,434 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 13:40:55,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 13:40:55,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:40:55,436 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-07-23 13:40:55,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:55,455 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-23 13:40:55,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:40:55,455 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-07-23 13:40:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:55,456 INFO L225 Difference]: With dead ends: 24 [2018-07-23 13:40:55,456 INFO L226 Difference]: Without dead ends: 22 [2018-07-23 13:40:55,458 INFO L575 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 13:40:55,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-23 13:40:55,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-23 13:40:55,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-23 13:40:55,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-23 13:40:55,465 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-07-23 13:40:55,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:55,465 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-23 13:40:55,466 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 13:40:55,466 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-23 13:40:55,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:40:55,471 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:55,471 INFO L357 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-07-23 13:40:55,471 INFO L414 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:55,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1897156089, now seen corresponding path program 18 times [2018-07-23 13:40:55,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:55,566 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 13:40:55,566 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:55,567 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-23 13:40:55,567 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:55,567 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 13:40:55,568 INFO L185 omatonBuilderFactory]: Interpolants [1280#(<= ULTIMATE.start_main_~x~4 17), 1281#(<= ULTIMATE.start_main_~x~4 18), 1261#true, 1262#false, 1263#(<= ULTIMATE.start_main_~x~4 0), 1264#(<= ULTIMATE.start_main_~x~4 1), 1265#(<= ULTIMATE.start_main_~x~4 2), 1266#(<= ULTIMATE.start_main_~x~4 3), 1267#(<= ULTIMATE.start_main_~x~4 4), 1268#(<= ULTIMATE.start_main_~x~4 5), 1269#(<= ULTIMATE.start_main_~x~4 6), 1270#(<= ULTIMATE.start_main_~x~4 7), 1271#(<= ULTIMATE.start_main_~x~4 8), 1272#(<= ULTIMATE.start_main_~x~4 9), 1273#(<= ULTIMATE.start_main_~x~4 10), 1274#(<= ULTIMATE.start_main_~x~4 11), 1275#(<= ULTIMATE.start_main_~x~4 12), 1276#(<= ULTIMATE.start_main_~x~4 13), 1277#(<= ULTIMATE.start_main_~x~4 14), 1278#(<= ULTIMATE.start_main_~x~4 15), 1279#(<= ULTIMATE.start_main_~x~4 16)] [2018-07-23 13:40:55,568 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 13:40:55,568 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 13:40:55,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 13:40:55,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:40:55,570 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-07-23 13:40:55,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:55,584 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-23 13:40:55,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:40:55,584 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-07-23 13:40:55,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:55,586 INFO L225 Difference]: With dead ends: 25 [2018-07-23 13:40:55,586 INFO L226 Difference]: Without dead ends: 23 [2018-07-23 13:40:55,587 INFO L575 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 13:40:55,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-23 13:40:55,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-23 13:40:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-23 13:40:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-23 13:40:55,591 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-07-23 13:40:55,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:55,591 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-23 13:40:55,592 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 13:40:55,592 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-23 13:40:55,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:40:55,592 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:55,593 INFO L357 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-07-23 13:40:55,593 INFO L414 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:55,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1317715645, now seen corresponding path program 19 times [2018-07-23 13:40:55,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:55,673 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 13:40:55,674 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:55,674 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-23 13:40:55,674 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:55,675 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 13:40:55,675 INFO L185 omatonBuilderFactory]: Interpolants [1378#true, 1379#false, 1380#(<= ULTIMATE.start_main_~x~4 0), 1381#(<= ULTIMATE.start_main_~x~4 1), 1382#(<= ULTIMATE.start_main_~x~4 2), 1383#(<= ULTIMATE.start_main_~x~4 3), 1384#(<= ULTIMATE.start_main_~x~4 4), 1385#(<= ULTIMATE.start_main_~x~4 5), 1386#(<= ULTIMATE.start_main_~x~4 6), 1387#(<= ULTIMATE.start_main_~x~4 7), 1388#(<= ULTIMATE.start_main_~x~4 8), 1389#(<= ULTIMATE.start_main_~x~4 9), 1390#(<= ULTIMATE.start_main_~x~4 10), 1391#(<= ULTIMATE.start_main_~x~4 11), 1392#(<= ULTIMATE.start_main_~x~4 12), 1393#(<= ULTIMATE.start_main_~x~4 13), 1394#(<= ULTIMATE.start_main_~x~4 14), 1395#(<= ULTIMATE.start_main_~x~4 15), 1396#(<= ULTIMATE.start_main_~x~4 16), 1397#(<= ULTIMATE.start_main_~x~4 17), 1398#(<= ULTIMATE.start_main_~x~4 18), 1399#(<= ULTIMATE.start_main_~x~4 19)] [2018-07-23 13:40:55,676 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 13:40:55,676 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-23 13:40:55,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-23 13:40:55,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:40:55,677 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-07-23 13:40:55,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:55,693 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-23 13:40:55,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:40:55,693 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-07-23 13:40:55,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:55,694 INFO L225 Difference]: With dead ends: 26 [2018-07-23 13:40:55,694 INFO L226 Difference]: Without dead ends: 24 [2018-07-23 13:40:55,695 INFO L575 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 13:40:55,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-23 13:40:55,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-23 13:40:55,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-23 13:40:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-23 13:40:55,699 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-07-23 13:40:55,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:55,700 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-23 13:40:55,700 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-23 13:40:55,700 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-23 13:40:55,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:40:55,701 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:55,701 INFO L357 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-07-23 13:40:55,701 INFO L414 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:55,701 INFO L82 PathProgramCache]: Analyzing trace with hash -2100475705, now seen corresponding path program 20 times [2018-07-23 13:40:55,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:55,806 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 13:40:55,806 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:55,807 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-23 13:40:55,807 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:55,807 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 13:40:55,810 INFO L185 omatonBuilderFactory]: Interpolants [1504#(<= ULTIMATE.start_main_~x~4 2), 1505#(<= ULTIMATE.start_main_~x~4 3), 1506#(<= ULTIMATE.start_main_~x~4 4), 1507#(<= ULTIMATE.start_main_~x~4 5), 1508#(<= ULTIMATE.start_main_~x~4 6), 1509#(<= ULTIMATE.start_main_~x~4 7), 1510#(<= ULTIMATE.start_main_~x~4 8), 1511#(<= ULTIMATE.start_main_~x~4 9), 1512#(<= ULTIMATE.start_main_~x~4 10), 1513#(<= ULTIMATE.start_main_~x~4 11), 1514#(<= ULTIMATE.start_main_~x~4 12), 1515#(<= ULTIMATE.start_main_~x~4 13), 1516#(<= ULTIMATE.start_main_~x~4 14), 1517#(<= ULTIMATE.start_main_~x~4 15), 1518#(<= ULTIMATE.start_main_~x~4 16), 1519#(<= ULTIMATE.start_main_~x~4 17), 1520#(<= ULTIMATE.start_main_~x~4 18), 1521#(<= ULTIMATE.start_main_~x~4 19), 1522#(<= ULTIMATE.start_main_~x~4 20), 1500#true, 1501#false, 1502#(<= ULTIMATE.start_main_~x~4 0), 1503#(<= ULTIMATE.start_main_~x~4 1)] [2018-07-23 13:40:55,810 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 13:40:55,811 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 13:40:55,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 13:40:55,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:40:55,812 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-07-23 13:40:55,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:55,835 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-23 13:40:55,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:40:55,835 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-07-23 13:40:55,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:55,836 INFO L225 Difference]: With dead ends: 27 [2018-07-23 13:40:55,836 INFO L226 Difference]: Without dead ends: 25 [2018-07-23 13:40:55,839 INFO L575 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 13:40:55,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-23 13:40:55,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-23 13:40:55,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 13:40:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-23 13:40:55,844 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-07-23 13:40:55,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:55,845 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-23 13:40:55,845 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 13:40:55,845 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-23 13:40:55,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 13:40:55,846 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:55,846 INFO L357 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-07-23 13:40:55,846 INFO L414 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:55,846 INFO L82 PathProgramCache]: Analyzing trace with hash -690225155, now seen corresponding path program 21 times [2018-07-23 13:40:55,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:55,961 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 13:40:55,961 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:55,961 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-23 13:40:55,961 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:55,962 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 13:40:55,963 INFO L185 omatonBuilderFactory]: Interpolants [1632#(<= ULTIMATE.start_main_~x~4 3), 1633#(<= ULTIMATE.start_main_~x~4 4), 1634#(<= ULTIMATE.start_main_~x~4 5), 1635#(<= ULTIMATE.start_main_~x~4 6), 1636#(<= ULTIMATE.start_main_~x~4 7), 1637#(<= ULTIMATE.start_main_~x~4 8), 1638#(<= ULTIMATE.start_main_~x~4 9), 1639#(<= ULTIMATE.start_main_~x~4 10), 1640#(<= ULTIMATE.start_main_~x~4 11), 1641#(<= ULTIMATE.start_main_~x~4 12), 1642#(<= ULTIMATE.start_main_~x~4 13), 1643#(<= ULTIMATE.start_main_~x~4 14), 1644#(<= ULTIMATE.start_main_~x~4 15), 1645#(<= ULTIMATE.start_main_~x~4 16), 1646#(<= ULTIMATE.start_main_~x~4 17), 1647#(<= ULTIMATE.start_main_~x~4 18), 1648#(<= ULTIMATE.start_main_~x~4 19), 1649#(<= ULTIMATE.start_main_~x~4 20), 1650#(<= ULTIMATE.start_main_~x~4 21), 1627#true, 1628#false, 1629#(<= ULTIMATE.start_main_~x~4 0), 1630#(<= ULTIMATE.start_main_~x~4 1), 1631#(<= ULTIMATE.start_main_~x~4 2)] [2018-07-23 13:40:55,963 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 13:40:55,964 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 13:40:55,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 13:40:55,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:40:55,965 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-07-23 13:40:55,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:55,988 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-23 13:40:55,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:40:55,993 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-07-23 13:40:55,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:55,994 INFO L225 Difference]: With dead ends: 28 [2018-07-23 13:40:55,994 INFO L226 Difference]: Without dead ends: 26 [2018-07-23 13:40:55,997 INFO L575 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 13:40:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-23 13:40:56,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-23 13:40:56,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-23 13:40:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-23 13:40:56,007 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-07-23 13:40:56,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:56,007 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-23 13:40:56,007 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 13:40:56,007 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-23 13:40:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:40:56,008 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:56,008 INFO L357 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-07-23 13:40:56,009 INFO L414 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:56,009 INFO L82 PathProgramCache]: Analyzing trace with hash 77868935, now seen corresponding path program 22 times [2018-07-23 13:40:56,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:56,150 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 13:40:56,150 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:56,150 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-23 13:40:56,150 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:56,151 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 13:40:56,152 INFO L185 omatonBuilderFactory]: Interpolants [1759#true, 1760#false, 1761#(<= ULTIMATE.start_main_~x~4 0), 1762#(<= ULTIMATE.start_main_~x~4 1), 1763#(<= ULTIMATE.start_main_~x~4 2), 1764#(<= ULTIMATE.start_main_~x~4 3), 1765#(<= ULTIMATE.start_main_~x~4 4), 1766#(<= ULTIMATE.start_main_~x~4 5), 1767#(<= ULTIMATE.start_main_~x~4 6), 1768#(<= ULTIMATE.start_main_~x~4 7), 1769#(<= ULTIMATE.start_main_~x~4 8), 1770#(<= ULTIMATE.start_main_~x~4 9), 1771#(<= ULTIMATE.start_main_~x~4 10), 1772#(<= ULTIMATE.start_main_~x~4 11), 1773#(<= ULTIMATE.start_main_~x~4 12), 1774#(<= ULTIMATE.start_main_~x~4 13), 1775#(<= ULTIMATE.start_main_~x~4 14), 1776#(<= ULTIMATE.start_main_~x~4 15), 1777#(<= ULTIMATE.start_main_~x~4 16), 1778#(<= ULTIMATE.start_main_~x~4 17), 1779#(<= ULTIMATE.start_main_~x~4 18), 1780#(<= ULTIMATE.start_main_~x~4 19), 1781#(<= ULTIMATE.start_main_~x~4 20), 1782#(<= ULTIMATE.start_main_~x~4 21), 1783#(<= ULTIMATE.start_main_~x~4 22)] [2018-07-23 13:40:56,153 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 13:40:56,153 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 13:40:56,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 13:40:56,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:40:56,154 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-07-23 13:40:56,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:56,181 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-23 13:40:56,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 13:40:56,181 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-07-23 13:40:56,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:56,182 INFO L225 Difference]: With dead ends: 29 [2018-07-23 13:40:56,182 INFO L226 Difference]: Without dead ends: 27 [2018-07-23 13:40:56,183 INFO L575 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 13:40:56,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-23 13:40:56,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-23 13:40:56,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-23 13:40:56,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-23 13:40:56,189 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-07-23 13:40:56,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:56,190 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-23 13:40:56,190 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 13:40:56,190 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-23 13:40:56,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 13:40:56,191 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:56,191 INFO L357 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-07-23 13:40:56,191 INFO L414 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:56,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1881018051, now seen corresponding path program 23 times [2018-07-23 13:40:56,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:56,320 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 13:40:56,320 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:56,321 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-23 13:40:56,321 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:56,321 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 13:40:56,322 INFO L185 omatonBuilderFactory]: Interpolants [1920#(<= ULTIMATE.start_main_~x~4 22), 1921#(<= ULTIMATE.start_main_~x~4 23), 1896#true, 1897#false, 1898#(<= ULTIMATE.start_main_~x~4 0), 1899#(<= ULTIMATE.start_main_~x~4 1), 1900#(<= ULTIMATE.start_main_~x~4 2), 1901#(<= ULTIMATE.start_main_~x~4 3), 1902#(<= ULTIMATE.start_main_~x~4 4), 1903#(<= ULTIMATE.start_main_~x~4 5), 1904#(<= ULTIMATE.start_main_~x~4 6), 1905#(<= ULTIMATE.start_main_~x~4 7), 1906#(<= ULTIMATE.start_main_~x~4 8), 1907#(<= ULTIMATE.start_main_~x~4 9), 1908#(<= ULTIMATE.start_main_~x~4 10), 1909#(<= ULTIMATE.start_main_~x~4 11), 1910#(<= ULTIMATE.start_main_~x~4 12), 1911#(<= ULTIMATE.start_main_~x~4 13), 1912#(<= ULTIMATE.start_main_~x~4 14), 1913#(<= ULTIMATE.start_main_~x~4 15), 1914#(<= ULTIMATE.start_main_~x~4 16), 1915#(<= ULTIMATE.start_main_~x~4 17), 1916#(<= ULTIMATE.start_main_~x~4 18), 1917#(<= ULTIMATE.start_main_~x~4 19), 1918#(<= ULTIMATE.start_main_~x~4 20), 1919#(<= ULTIMATE.start_main_~x~4 21)] [2018-07-23 13:40:56,322 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 13:40:56,323 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 13:40:56,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 13:40:56,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:40:56,327 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-07-23 13:40:56,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:56,348 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-23 13:40:56,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:40:56,348 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-07-23 13:40:56,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:56,349 INFO L225 Difference]: With dead ends: 30 [2018-07-23 13:40:56,349 INFO L226 Difference]: Without dead ends: 28 [2018-07-23 13:40:56,350 INFO L575 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 13:40:56,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-23 13:40:56,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-23 13:40:56,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-23 13:40:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-23 13:40:56,356 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-07-23 13:40:56,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:56,356 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-23 13:40:56,357 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 13:40:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-23 13:40:56,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-23 13:40:56,357 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:56,358 INFO L357 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-07-23 13:40:56,358 INFO L414 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:56,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1817994823, now seen corresponding path program 24 times [2018-07-23 13:40:56,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:56,480 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 13:40:56,481 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:56,481 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-23 13:40:56,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:56,482 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 13:40:56,482 INFO L185 omatonBuilderFactory]: Interpolants [2048#(<= ULTIMATE.start_main_~x~4 8), 2049#(<= ULTIMATE.start_main_~x~4 9), 2050#(<= ULTIMATE.start_main_~x~4 10), 2051#(<= ULTIMATE.start_main_~x~4 11), 2052#(<= ULTIMATE.start_main_~x~4 12), 2053#(<= ULTIMATE.start_main_~x~4 13), 2054#(<= ULTIMATE.start_main_~x~4 14), 2055#(<= ULTIMATE.start_main_~x~4 15), 2056#(<= ULTIMATE.start_main_~x~4 16), 2057#(<= ULTIMATE.start_main_~x~4 17), 2058#(<= ULTIMATE.start_main_~x~4 18), 2059#(<= ULTIMATE.start_main_~x~4 19), 2060#(<= ULTIMATE.start_main_~x~4 20), 2061#(<= ULTIMATE.start_main_~x~4 21), 2062#(<= ULTIMATE.start_main_~x~4 22), 2063#(<= ULTIMATE.start_main_~x~4 23), 2064#(<= ULTIMATE.start_main_~x~4 24), 2038#true, 2039#false, 2040#(<= ULTIMATE.start_main_~x~4 0), 2041#(<= ULTIMATE.start_main_~x~4 1), 2042#(<= ULTIMATE.start_main_~x~4 2), 2043#(<= ULTIMATE.start_main_~x~4 3), 2044#(<= ULTIMATE.start_main_~x~4 4), 2045#(<= ULTIMATE.start_main_~x~4 5), 2046#(<= ULTIMATE.start_main_~x~4 6), 2047#(<= ULTIMATE.start_main_~x~4 7)] [2018-07-23 13:40:56,483 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 13:40:56,483 INFO L450 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-23 13:40:56,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-23 13:40:56,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:40:56,484 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-07-23 13:40:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:56,502 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-23 13:40:56,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 13:40:56,503 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-07-23 13:40:56,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:56,503 INFO L225 Difference]: With dead ends: 31 [2018-07-23 13:40:56,503 INFO L226 Difference]: Without dead ends: 29 [2018-07-23 13:40:56,504 INFO L575 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 13:40:56,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-23 13:40:56,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-23 13:40:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-23 13:40:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-23 13:40:56,508 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-07-23 13:40:56,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:56,508 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-23 13:40:56,508 INFO L472 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-23 13:40:56,509 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-23 13:40:56,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 13:40:56,509 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:56,509 INFO L357 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-07-23 13:40:56,510 INFO L414 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:56,510 INFO L82 PathProgramCache]: Analyzing trace with hash 523276925, now seen corresponding path program 25 times [2018-07-23 13:40:56,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:56,632 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 13:40:56,632 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:56,633 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-23 13:40:56,633 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:56,633 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 13:40:56,634 INFO L185 omatonBuilderFactory]: Interpolants [2185#true, 2186#false, 2187#(<= ULTIMATE.start_main_~x~4 0), 2188#(<= ULTIMATE.start_main_~x~4 1), 2189#(<= ULTIMATE.start_main_~x~4 2), 2190#(<= ULTIMATE.start_main_~x~4 3), 2191#(<= ULTIMATE.start_main_~x~4 4), 2192#(<= ULTIMATE.start_main_~x~4 5), 2193#(<= ULTIMATE.start_main_~x~4 6), 2194#(<= ULTIMATE.start_main_~x~4 7), 2195#(<= ULTIMATE.start_main_~x~4 8), 2196#(<= ULTIMATE.start_main_~x~4 9), 2197#(<= ULTIMATE.start_main_~x~4 10), 2198#(<= ULTIMATE.start_main_~x~4 11), 2199#(<= ULTIMATE.start_main_~x~4 12), 2200#(<= ULTIMATE.start_main_~x~4 13), 2201#(<= ULTIMATE.start_main_~x~4 14), 2202#(<= ULTIMATE.start_main_~x~4 15), 2203#(<= ULTIMATE.start_main_~x~4 16), 2204#(<= ULTIMATE.start_main_~x~4 17), 2205#(<= ULTIMATE.start_main_~x~4 18), 2206#(<= ULTIMATE.start_main_~x~4 19), 2207#(<= ULTIMATE.start_main_~x~4 20), 2208#(<= ULTIMATE.start_main_~x~4 21), 2209#(<= ULTIMATE.start_main_~x~4 22), 2210#(<= ULTIMATE.start_main_~x~4 23), 2211#(<= ULTIMATE.start_main_~x~4 24), 2212#(<= ULTIMATE.start_main_~x~4 25)] [2018-07-23 13:40:56,634 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 13:40:56,634 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 13:40:56,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 13:40:56,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:40:56,637 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-07-23 13:40:56,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:56,658 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-23 13:40:56,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:40:56,659 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-07-23 13:40:56,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:56,662 INFO L225 Difference]: With dead ends: 32 [2018-07-23 13:40:56,662 INFO L226 Difference]: Without dead ends: 30 [2018-07-23 13:40:56,663 INFO L575 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 13:40:56,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-23 13:40:56,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-23 13:40:56,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-23 13:40:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-23 13:40:56,667 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-07-23 13:40:56,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:56,668 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-23 13:40:56,668 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 13:40:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-23 13:40:56,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:40:56,669 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:56,669 INFO L357 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-07-23 13:40:56,669 INFO L414 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:56,671 INFO L82 PathProgramCache]: Analyzing trace with hash -958272249, now seen corresponding path program 26 times [2018-07-23 13:40:56,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:56,810 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 13:40:56,810 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:56,810 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-23 13:40:56,811 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:56,811 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 13:40:56,811 INFO L185 omatonBuilderFactory]: Interpolants [2337#true, 2338#false, 2339#(<= ULTIMATE.start_main_~x~4 0), 2340#(<= ULTIMATE.start_main_~x~4 1), 2341#(<= ULTIMATE.start_main_~x~4 2), 2342#(<= ULTIMATE.start_main_~x~4 3), 2343#(<= ULTIMATE.start_main_~x~4 4), 2344#(<= ULTIMATE.start_main_~x~4 5), 2345#(<= ULTIMATE.start_main_~x~4 6), 2346#(<= ULTIMATE.start_main_~x~4 7), 2347#(<= ULTIMATE.start_main_~x~4 8), 2348#(<= ULTIMATE.start_main_~x~4 9), 2349#(<= ULTIMATE.start_main_~x~4 10), 2350#(<= ULTIMATE.start_main_~x~4 11), 2351#(<= ULTIMATE.start_main_~x~4 12), 2352#(<= ULTIMATE.start_main_~x~4 13), 2353#(<= ULTIMATE.start_main_~x~4 14), 2354#(<= ULTIMATE.start_main_~x~4 15), 2355#(<= ULTIMATE.start_main_~x~4 16), 2356#(<= ULTIMATE.start_main_~x~4 17), 2357#(<= ULTIMATE.start_main_~x~4 18), 2358#(<= ULTIMATE.start_main_~x~4 19), 2359#(<= ULTIMATE.start_main_~x~4 20), 2360#(<= ULTIMATE.start_main_~x~4 21), 2361#(<= ULTIMATE.start_main_~x~4 22), 2362#(<= ULTIMATE.start_main_~x~4 23), 2363#(<= ULTIMATE.start_main_~x~4 24), 2364#(<= ULTIMATE.start_main_~x~4 25), 2365#(<= ULTIMATE.start_main_~x~4 26)] [2018-07-23 13:40:56,812 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 13:40:56,812 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-23 13:40:56,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-23 13:40:56,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:40:56,814 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-07-23 13:40:56,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:56,835 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-23 13:40:56,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:40:56,836 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-07-23 13:40:56,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:56,836 INFO L225 Difference]: With dead ends: 33 [2018-07-23 13:40:56,836 INFO L226 Difference]: Without dead ends: 31 [2018-07-23 13:40:56,838 INFO L575 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 13:40:56,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-23 13:40:56,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-23 13:40:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-23 13:40:56,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-23 13:40:56,844 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-07-23 13:40:56,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:56,844 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-23 13:40:56,844 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-23 13:40:56,844 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-23 13:40:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-23 13:40:56,845 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:56,845 INFO L357 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-07-23 13:40:56,845 INFO L414 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:56,845 INFO L82 PathProgramCache]: Analyzing trace with hash 358343613, now seen corresponding path program 27 times [2018-07-23 13:40:56,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:56,987 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 13:40:56,988 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:56,988 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-23 13:40:56,988 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:56,988 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 13:40:56,989 INFO L185 omatonBuilderFactory]: Interpolants [2496#(<= ULTIMATE.start_main_~x~4 0), 2497#(<= ULTIMATE.start_main_~x~4 1), 2498#(<= ULTIMATE.start_main_~x~4 2), 2499#(<= ULTIMATE.start_main_~x~4 3), 2500#(<= ULTIMATE.start_main_~x~4 4), 2501#(<= ULTIMATE.start_main_~x~4 5), 2502#(<= ULTIMATE.start_main_~x~4 6), 2503#(<= ULTIMATE.start_main_~x~4 7), 2504#(<= ULTIMATE.start_main_~x~4 8), 2505#(<= ULTIMATE.start_main_~x~4 9), 2506#(<= ULTIMATE.start_main_~x~4 10), 2507#(<= ULTIMATE.start_main_~x~4 11), 2508#(<= ULTIMATE.start_main_~x~4 12), 2509#(<= ULTIMATE.start_main_~x~4 13), 2510#(<= ULTIMATE.start_main_~x~4 14), 2511#(<= ULTIMATE.start_main_~x~4 15), 2512#(<= ULTIMATE.start_main_~x~4 16), 2513#(<= ULTIMATE.start_main_~x~4 17), 2514#(<= ULTIMATE.start_main_~x~4 18), 2515#(<= ULTIMATE.start_main_~x~4 19), 2516#(<= ULTIMATE.start_main_~x~4 20), 2517#(<= ULTIMATE.start_main_~x~4 21), 2518#(<= ULTIMATE.start_main_~x~4 22), 2519#(<= ULTIMATE.start_main_~x~4 23), 2520#(<= ULTIMATE.start_main_~x~4 24), 2521#(<= ULTIMATE.start_main_~x~4 25), 2522#(<= ULTIMATE.start_main_~x~4 26), 2523#(<= ULTIMATE.start_main_~x~4 27), 2494#true, 2495#false] [2018-07-23 13:40:56,989 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 13:40:56,990 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 13:40:56,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 13:40:56,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:40:56,991 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-07-23 13:40:57,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:57,026 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-23 13:40:57,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 13:40:57,026 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-07-23 13:40:57,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:57,026 INFO L225 Difference]: With dead ends: 34 [2018-07-23 13:40:57,027 INFO L226 Difference]: Without dead ends: 32 [2018-07-23 13:40:57,027 INFO L575 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 13:40:57,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-23 13:40:57,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-23 13:40:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-23 13:40:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-23 13:40:57,035 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-07-23 13:40:57,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:57,035 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-23 13:40:57,036 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 13:40:57,036 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-23 13:40:57,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-23 13:40:57,039 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:57,039 INFO L357 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-07-23 13:40:57,039 INFO L414 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:57,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1776237625, now seen corresponding path program 28 times [2018-07-23 13:40:57,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:57,184 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 13:40:57,184 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:57,185 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-23 13:40:57,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:57,185 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 13:40:57,185 INFO L185 omatonBuilderFactory]: Interpolants [2656#true, 2657#false, 2658#(<= ULTIMATE.start_main_~x~4 0), 2659#(<= ULTIMATE.start_main_~x~4 1), 2660#(<= ULTIMATE.start_main_~x~4 2), 2661#(<= ULTIMATE.start_main_~x~4 3), 2662#(<= ULTIMATE.start_main_~x~4 4), 2663#(<= ULTIMATE.start_main_~x~4 5), 2664#(<= ULTIMATE.start_main_~x~4 6), 2665#(<= ULTIMATE.start_main_~x~4 7), 2666#(<= ULTIMATE.start_main_~x~4 8), 2667#(<= ULTIMATE.start_main_~x~4 9), 2668#(<= ULTIMATE.start_main_~x~4 10), 2669#(<= ULTIMATE.start_main_~x~4 11), 2670#(<= ULTIMATE.start_main_~x~4 12), 2671#(<= ULTIMATE.start_main_~x~4 13), 2672#(<= ULTIMATE.start_main_~x~4 14), 2673#(<= ULTIMATE.start_main_~x~4 15), 2674#(<= ULTIMATE.start_main_~x~4 16), 2675#(<= ULTIMATE.start_main_~x~4 17), 2676#(<= ULTIMATE.start_main_~x~4 18), 2677#(<= ULTIMATE.start_main_~x~4 19), 2678#(<= ULTIMATE.start_main_~x~4 20), 2679#(<= ULTIMATE.start_main_~x~4 21), 2680#(<= ULTIMATE.start_main_~x~4 22), 2681#(<= ULTIMATE.start_main_~x~4 23), 2682#(<= ULTIMATE.start_main_~x~4 24), 2683#(<= ULTIMATE.start_main_~x~4 25), 2684#(<= ULTIMATE.start_main_~x~4 26), 2685#(<= ULTIMATE.start_main_~x~4 27), 2686#(<= ULTIMATE.start_main_~x~4 28)] [2018-07-23 13:40:57,186 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 13:40:57,186 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 13:40:57,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 13:40:57,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:40:57,187 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-07-23 13:40:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:57,213 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-23 13:40:57,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 13:40:57,214 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-07-23 13:40:57,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:57,214 INFO L225 Difference]: With dead ends: 35 [2018-07-23 13:40:57,214 INFO L226 Difference]: Without dead ends: 33 [2018-07-23 13:40:57,215 INFO L575 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 13:40:57,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-23 13:40:57,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-23 13:40:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-23 13:40:57,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-23 13:40:57,222 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-07-23 13:40:57,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:57,222 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-23 13:40:57,222 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 13:40:57,222 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-23 13:40:57,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-23 13:40:57,223 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:57,223 INFO L357 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-07-23 13:40:57,223 INFO L414 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:57,224 INFO L82 PathProgramCache]: Analyzing trace with hash 771220733, now seen corresponding path program 29 times [2018-07-23 13:40:57,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:57,482 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 13:40:57,482 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:57,482 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-23 13:40:57,483 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:57,483 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 13:40:57,483 INFO L185 omatonBuilderFactory]: Interpolants [2823#true, 2824#false, 2825#(<= ULTIMATE.start_main_~x~4 0), 2826#(<= ULTIMATE.start_main_~x~4 1), 2827#(<= ULTIMATE.start_main_~x~4 2), 2828#(<= ULTIMATE.start_main_~x~4 3), 2829#(<= ULTIMATE.start_main_~x~4 4), 2830#(<= ULTIMATE.start_main_~x~4 5), 2831#(<= ULTIMATE.start_main_~x~4 6), 2832#(<= ULTIMATE.start_main_~x~4 7), 2833#(<= ULTIMATE.start_main_~x~4 8), 2834#(<= ULTIMATE.start_main_~x~4 9), 2835#(<= ULTIMATE.start_main_~x~4 10), 2836#(<= ULTIMATE.start_main_~x~4 11), 2837#(<= ULTIMATE.start_main_~x~4 12), 2838#(<= ULTIMATE.start_main_~x~4 13), 2839#(<= ULTIMATE.start_main_~x~4 14), 2840#(<= ULTIMATE.start_main_~x~4 15), 2841#(<= ULTIMATE.start_main_~x~4 16), 2842#(<= ULTIMATE.start_main_~x~4 17), 2843#(<= ULTIMATE.start_main_~x~4 18), 2844#(<= ULTIMATE.start_main_~x~4 19), 2845#(<= ULTIMATE.start_main_~x~4 20), 2846#(<= ULTIMATE.start_main_~x~4 21), 2847#(<= ULTIMATE.start_main_~x~4 22), 2848#(<= ULTIMATE.start_main_~x~4 23), 2849#(<= ULTIMATE.start_main_~x~4 24), 2850#(<= ULTIMATE.start_main_~x~4 25), 2851#(<= ULTIMATE.start_main_~x~4 26), 2852#(<= ULTIMATE.start_main_~x~4 27), 2853#(<= ULTIMATE.start_main_~x~4 28), 2854#(<= ULTIMATE.start_main_~x~4 29)] [2018-07-23 13:40:57,484 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 13:40:57,484 INFO L450 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-23 13:40:57,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-23 13:40:57,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:40:57,485 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-07-23 13:40:57,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:57,509 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-23 13:40:57,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-23 13:40:57,509 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-07-23 13:40:57,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:57,510 INFO L225 Difference]: With dead ends: 36 [2018-07-23 13:40:57,510 INFO L226 Difference]: Without dead ends: 34 [2018-07-23 13:40:57,511 INFO L575 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 13:40:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-23 13:40:57,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-23 13:40:57,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-23 13:40:57,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-23 13:40:57,515 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-07-23 13:40:57,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:57,516 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-23 13:40:57,516 INFO L472 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-23 13:40:57,516 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-23 13:40:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-23 13:40:57,516 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:57,516 INFO L357 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-07-23 13:40:57,517 INFO L414 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:57,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1861948793, now seen corresponding path program 30 times [2018-07-23 13:40:57,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:57,681 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 13:40:57,681 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:57,681 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-23 13:40:57,681 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:57,682 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 13:40:57,682 INFO L185 omatonBuilderFactory]: Interpolants [3008#(<= ULTIMATE.start_main_~x~4 11), 3009#(<= ULTIMATE.start_main_~x~4 12), 3010#(<= ULTIMATE.start_main_~x~4 13), 3011#(<= ULTIMATE.start_main_~x~4 14), 3012#(<= ULTIMATE.start_main_~x~4 15), 3013#(<= ULTIMATE.start_main_~x~4 16), 3014#(<= ULTIMATE.start_main_~x~4 17), 3015#(<= ULTIMATE.start_main_~x~4 18), 3016#(<= ULTIMATE.start_main_~x~4 19), 3017#(<= ULTIMATE.start_main_~x~4 20), 3018#(<= ULTIMATE.start_main_~x~4 21), 3019#(<= ULTIMATE.start_main_~x~4 22), 3020#(<= ULTIMATE.start_main_~x~4 23), 3021#(<= ULTIMATE.start_main_~x~4 24), 3022#(<= ULTIMATE.start_main_~x~4 25), 3023#(<= ULTIMATE.start_main_~x~4 26), 3024#(<= ULTIMATE.start_main_~x~4 27), 3025#(<= ULTIMATE.start_main_~x~4 28), 3026#(<= ULTIMATE.start_main_~x~4 29), 3027#(<= ULTIMATE.start_main_~x~4 30), 2995#true, 2996#false, 2997#(<= ULTIMATE.start_main_~x~4 0), 2998#(<= ULTIMATE.start_main_~x~4 1), 2999#(<= ULTIMATE.start_main_~x~4 2), 3000#(<= ULTIMATE.start_main_~x~4 3), 3001#(<= ULTIMATE.start_main_~x~4 4), 3002#(<= ULTIMATE.start_main_~x~4 5), 3003#(<= ULTIMATE.start_main_~x~4 6), 3004#(<= ULTIMATE.start_main_~x~4 7), 3005#(<= ULTIMATE.start_main_~x~4 8), 3006#(<= ULTIMATE.start_main_~x~4 9), 3007#(<= ULTIMATE.start_main_~x~4 10)] [2018-07-23 13:40:57,683 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 13:40:57,683 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 13:40:57,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 13:40:57,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:40:57,684 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-07-23 13:40:57,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:57,705 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-23 13:40:57,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 13:40:57,705 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-07-23 13:40:57,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:57,706 INFO L225 Difference]: With dead ends: 37 [2018-07-23 13:40:57,706 INFO L226 Difference]: Without dead ends: 35 [2018-07-23 13:40:57,707 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:40:57,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-23 13:40:57,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-23 13:40:57,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-23 13:40:57,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-23 13:40:57,712 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-07-23 13:40:57,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:57,713 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-23 13:40:57,713 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 13:40:57,713 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-23 13:40:57,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-23 13:40:57,713 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:57,713 INFO L357 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-07-23 13:40:57,714 INFO L414 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:57,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1885825475, now seen corresponding path program 31 times [2018-07-23 13:40:57,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:57,876 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 13:40:57,876 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:57,876 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-23 13:40:57,876 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:57,877 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 13:40:57,877 INFO L185 omatonBuilderFactory]: Interpolants [3200#(<= ULTIMATE.start_main_~x~4 26), 3201#(<= ULTIMATE.start_main_~x~4 27), 3202#(<= ULTIMATE.start_main_~x~4 28), 3203#(<= ULTIMATE.start_main_~x~4 29), 3204#(<= ULTIMATE.start_main_~x~4 30), 3205#(<= ULTIMATE.start_main_~x~4 31), 3172#true, 3173#false, 3174#(<= ULTIMATE.start_main_~x~4 0), 3175#(<= ULTIMATE.start_main_~x~4 1), 3176#(<= ULTIMATE.start_main_~x~4 2), 3177#(<= ULTIMATE.start_main_~x~4 3), 3178#(<= ULTIMATE.start_main_~x~4 4), 3179#(<= ULTIMATE.start_main_~x~4 5), 3180#(<= ULTIMATE.start_main_~x~4 6), 3181#(<= ULTIMATE.start_main_~x~4 7), 3182#(<= ULTIMATE.start_main_~x~4 8), 3183#(<= ULTIMATE.start_main_~x~4 9), 3184#(<= ULTIMATE.start_main_~x~4 10), 3185#(<= ULTIMATE.start_main_~x~4 11), 3186#(<= ULTIMATE.start_main_~x~4 12), 3187#(<= ULTIMATE.start_main_~x~4 13), 3188#(<= ULTIMATE.start_main_~x~4 14), 3189#(<= ULTIMATE.start_main_~x~4 15), 3190#(<= ULTIMATE.start_main_~x~4 16), 3191#(<= ULTIMATE.start_main_~x~4 17), 3192#(<= ULTIMATE.start_main_~x~4 18), 3193#(<= ULTIMATE.start_main_~x~4 19), 3194#(<= ULTIMATE.start_main_~x~4 20), 3195#(<= ULTIMATE.start_main_~x~4 21), 3196#(<= ULTIMATE.start_main_~x~4 22), 3197#(<= ULTIMATE.start_main_~x~4 23), 3198#(<= ULTIMATE.start_main_~x~4 24), 3199#(<= ULTIMATE.start_main_~x~4 25)] [2018-07-23 13:40:57,878 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 13:40:57,878 INFO L450 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-23 13:40:57,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-23 13:40:57,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:40:57,879 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-07-23 13:40:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:57,896 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-23 13:40:57,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 13:40:57,896 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-07-23 13:40:57,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:57,897 INFO L225 Difference]: With dead ends: 38 [2018-07-23 13:40:57,897 INFO L226 Difference]: Without dead ends: 36 [2018-07-23 13:40:57,898 INFO L575 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 13:40:57,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-23 13:40:57,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-23 13:40:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-23 13:40:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-23 13:40:57,911 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-07-23 13:40:57,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:57,911 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-23 13:40:57,911 INFO L472 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-23 13:40:57,912 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-23 13:40:57,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-23 13:40:57,912 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:57,912 INFO L357 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-07-23 13:40:57,912 INFO L414 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:57,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1668964679, now seen corresponding path program 32 times [2018-07-23 13:40:57,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:58,077 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 13:40:58,078 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:58,078 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-23 13:40:58,078 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:58,078 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 13:40:58,079 INFO L185 omatonBuilderFactory]: Interpolants [3354#true, 3355#false, 3356#(<= ULTIMATE.start_main_~x~4 0), 3357#(<= ULTIMATE.start_main_~x~4 1), 3358#(<= ULTIMATE.start_main_~x~4 2), 3359#(<= ULTIMATE.start_main_~x~4 3), 3360#(<= ULTIMATE.start_main_~x~4 4), 3361#(<= ULTIMATE.start_main_~x~4 5), 3362#(<= ULTIMATE.start_main_~x~4 6), 3363#(<= ULTIMATE.start_main_~x~4 7), 3364#(<= ULTIMATE.start_main_~x~4 8), 3365#(<= ULTIMATE.start_main_~x~4 9), 3366#(<= ULTIMATE.start_main_~x~4 10), 3367#(<= ULTIMATE.start_main_~x~4 11), 3368#(<= ULTIMATE.start_main_~x~4 12), 3369#(<= ULTIMATE.start_main_~x~4 13), 3370#(<= ULTIMATE.start_main_~x~4 14), 3371#(<= ULTIMATE.start_main_~x~4 15), 3372#(<= ULTIMATE.start_main_~x~4 16), 3373#(<= ULTIMATE.start_main_~x~4 17), 3374#(<= ULTIMATE.start_main_~x~4 18), 3375#(<= ULTIMATE.start_main_~x~4 19), 3376#(<= ULTIMATE.start_main_~x~4 20), 3377#(<= ULTIMATE.start_main_~x~4 21), 3378#(<= ULTIMATE.start_main_~x~4 22), 3379#(<= ULTIMATE.start_main_~x~4 23), 3380#(<= ULTIMATE.start_main_~x~4 24), 3381#(<= ULTIMATE.start_main_~x~4 25), 3382#(<= ULTIMATE.start_main_~x~4 26), 3383#(<= ULTIMATE.start_main_~x~4 27), 3384#(<= ULTIMATE.start_main_~x~4 28), 3385#(<= ULTIMATE.start_main_~x~4 29), 3386#(<= ULTIMATE.start_main_~x~4 30), 3387#(<= ULTIMATE.start_main_~x~4 31), 3388#(<= ULTIMATE.start_main_~x~4 32)] [2018-07-23 13:40:58,080 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 13:40:58,081 INFO L450 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-23 13:40:58,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-23 13:40:58,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:40:58,084 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-07-23 13:40:58,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:58,105 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-23 13:40:58,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 13:40:58,106 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-07-23 13:40:58,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:58,106 INFO L225 Difference]: With dead ends: 39 [2018-07-23 13:40:58,106 INFO L226 Difference]: Without dead ends: 37 [2018-07-23 13:40:58,107 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:40:58,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-23 13:40:58,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-23 13:40:58,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-23 13:40:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-23 13:40:58,111 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-07-23 13:40:58,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:58,111 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-23 13:40:58,111 INFO L472 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-23 13:40:58,111 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-23 13:40:58,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 13:40:58,112 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:58,112 INFO L357 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-07-23 13:40:58,112 INFO L414 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:58,112 INFO L82 PathProgramCache]: Analyzing trace with hash 198309757, now seen corresponding path program 33 times [2018-07-23 13:40:58,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:58,276 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 13:40:58,276 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:58,276 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-23 13:40:58,276 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:58,277 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 13:40:58,277 INFO L185 omatonBuilderFactory]: Interpolants [3541#true, 3542#false, 3543#(<= ULTIMATE.start_main_~x~4 0), 3544#(<= ULTIMATE.start_main_~x~4 1), 3545#(<= ULTIMATE.start_main_~x~4 2), 3546#(<= ULTIMATE.start_main_~x~4 3), 3547#(<= ULTIMATE.start_main_~x~4 4), 3548#(<= ULTIMATE.start_main_~x~4 5), 3549#(<= ULTIMATE.start_main_~x~4 6), 3550#(<= ULTIMATE.start_main_~x~4 7), 3551#(<= ULTIMATE.start_main_~x~4 8), 3552#(<= ULTIMATE.start_main_~x~4 9), 3553#(<= ULTIMATE.start_main_~x~4 10), 3554#(<= ULTIMATE.start_main_~x~4 11), 3555#(<= ULTIMATE.start_main_~x~4 12), 3556#(<= ULTIMATE.start_main_~x~4 13), 3557#(<= ULTIMATE.start_main_~x~4 14), 3558#(<= ULTIMATE.start_main_~x~4 15), 3559#(<= ULTIMATE.start_main_~x~4 16), 3560#(<= ULTIMATE.start_main_~x~4 17), 3561#(<= ULTIMATE.start_main_~x~4 18), 3562#(<= ULTIMATE.start_main_~x~4 19), 3563#(<= ULTIMATE.start_main_~x~4 20), 3564#(<= ULTIMATE.start_main_~x~4 21), 3565#(<= ULTIMATE.start_main_~x~4 22), 3566#(<= ULTIMATE.start_main_~x~4 23), 3567#(<= ULTIMATE.start_main_~x~4 24), 3568#(<= ULTIMATE.start_main_~x~4 25), 3569#(<= ULTIMATE.start_main_~x~4 26), 3570#(<= ULTIMATE.start_main_~x~4 27), 3571#(<= ULTIMATE.start_main_~x~4 28), 3572#(<= ULTIMATE.start_main_~x~4 29), 3573#(<= ULTIMATE.start_main_~x~4 30), 3574#(<= ULTIMATE.start_main_~x~4 31), 3575#(<= ULTIMATE.start_main_~x~4 32), 3576#(<= ULTIMATE.start_main_~x~4 33)] [2018-07-23 13:40:58,278 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 13:40:58,278 INFO L450 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-23 13:40:58,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-23 13:40:58,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 13:40:58,279 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-07-23 13:40:58,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:58,301 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-23 13:40:58,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 13:40:58,302 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-07-23 13:40:58,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:58,302 INFO L225 Difference]: With dead ends: 40 [2018-07-23 13:40:58,302 INFO L226 Difference]: Without dead ends: 38 [2018-07-23 13:40:58,303 INFO L575 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 13:40:58,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-23 13:40:58,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-23 13:40:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-23 13:40:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-23 13:40:58,306 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-07-23 13:40:58,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:58,306 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-23 13:40:58,307 INFO L472 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-23 13:40:58,307 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-23 13:40:58,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-23 13:40:58,307 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:58,307 INFO L357 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-07-23 13:40:58,307 INFO L414 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:58,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1852647431, now seen corresponding path program 34 times [2018-07-23 13:40:58,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:58,481 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 13:40:58,482 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:58,482 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-23 13:40:58,482 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:58,482 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 13:40:58,483 INFO L185 omatonBuilderFactory]: Interpolants [3733#true, 3734#false, 3735#(<= ULTIMATE.start_main_~x~4 0), 3736#(<= ULTIMATE.start_main_~x~4 1), 3737#(<= ULTIMATE.start_main_~x~4 2), 3738#(<= ULTIMATE.start_main_~x~4 3), 3739#(<= ULTIMATE.start_main_~x~4 4), 3740#(<= ULTIMATE.start_main_~x~4 5), 3741#(<= ULTIMATE.start_main_~x~4 6), 3742#(<= ULTIMATE.start_main_~x~4 7), 3743#(<= ULTIMATE.start_main_~x~4 8), 3744#(<= ULTIMATE.start_main_~x~4 9), 3745#(<= ULTIMATE.start_main_~x~4 10), 3746#(<= ULTIMATE.start_main_~x~4 11), 3747#(<= ULTIMATE.start_main_~x~4 12), 3748#(<= ULTIMATE.start_main_~x~4 13), 3749#(<= ULTIMATE.start_main_~x~4 14), 3750#(<= ULTIMATE.start_main_~x~4 15), 3751#(<= ULTIMATE.start_main_~x~4 16), 3752#(<= ULTIMATE.start_main_~x~4 17), 3753#(<= ULTIMATE.start_main_~x~4 18), 3754#(<= ULTIMATE.start_main_~x~4 19), 3755#(<= ULTIMATE.start_main_~x~4 20), 3756#(<= ULTIMATE.start_main_~x~4 21), 3757#(<= ULTIMATE.start_main_~x~4 22), 3758#(<= ULTIMATE.start_main_~x~4 23), 3759#(<= ULTIMATE.start_main_~x~4 24), 3760#(<= ULTIMATE.start_main_~x~4 25), 3761#(<= ULTIMATE.start_main_~x~4 26), 3762#(<= ULTIMATE.start_main_~x~4 27), 3763#(<= ULTIMATE.start_main_~x~4 28), 3764#(<= ULTIMATE.start_main_~x~4 29), 3765#(<= ULTIMATE.start_main_~x~4 30), 3766#(<= ULTIMATE.start_main_~x~4 31), 3767#(<= ULTIMATE.start_main_~x~4 32), 3768#(<= ULTIMATE.start_main_~x~4 33), 3769#(<= ULTIMATE.start_main_~x~4 34)] [2018-07-23 13:40:58,483 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 13:40:58,484 INFO L450 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-23 13:40:58,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-23 13:40:58,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:40:58,485 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-07-23 13:40:58,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:58,508 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-23 13:40:58,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-23 13:40:58,508 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-07-23 13:40:58,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:58,509 INFO L225 Difference]: With dead ends: 41 [2018-07-23 13:40:58,509 INFO L226 Difference]: Without dead ends: 39 [2018-07-23 13:40:58,510 INFO L575 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 13:40:58,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-23 13:40:58,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-23 13:40:58,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-23 13:40:58,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-23 13:40:58,513 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-07-23 13:40:58,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:58,513 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-23 13:40:58,513 INFO L472 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-23 13:40:58,513 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-23 13:40:58,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-23 13:40:58,513 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:58,514 INFO L357 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-07-23 13:40:58,514 INFO L414 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:58,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1597507773, now seen corresponding path program 35 times [2018-07-23 13:40:58,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:58,703 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 13:40:58,704 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:58,704 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-23 13:40:58,704 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:58,704 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 13:40:58,705 INFO L185 omatonBuilderFactory]: Interpolants [3930#true, 3931#false, 3932#(<= ULTIMATE.start_main_~x~4 0), 3933#(<= ULTIMATE.start_main_~x~4 1), 3934#(<= ULTIMATE.start_main_~x~4 2), 3935#(<= ULTIMATE.start_main_~x~4 3), 3936#(<= ULTIMATE.start_main_~x~4 4), 3937#(<= ULTIMATE.start_main_~x~4 5), 3938#(<= ULTIMATE.start_main_~x~4 6), 3939#(<= ULTIMATE.start_main_~x~4 7), 3940#(<= ULTIMATE.start_main_~x~4 8), 3941#(<= ULTIMATE.start_main_~x~4 9), 3942#(<= ULTIMATE.start_main_~x~4 10), 3943#(<= ULTIMATE.start_main_~x~4 11), 3944#(<= ULTIMATE.start_main_~x~4 12), 3945#(<= ULTIMATE.start_main_~x~4 13), 3946#(<= ULTIMATE.start_main_~x~4 14), 3947#(<= ULTIMATE.start_main_~x~4 15), 3948#(<= ULTIMATE.start_main_~x~4 16), 3949#(<= ULTIMATE.start_main_~x~4 17), 3950#(<= ULTIMATE.start_main_~x~4 18), 3951#(<= ULTIMATE.start_main_~x~4 19), 3952#(<= ULTIMATE.start_main_~x~4 20), 3953#(<= ULTIMATE.start_main_~x~4 21), 3954#(<= ULTIMATE.start_main_~x~4 22), 3955#(<= ULTIMATE.start_main_~x~4 23), 3956#(<= ULTIMATE.start_main_~x~4 24), 3957#(<= ULTIMATE.start_main_~x~4 25), 3958#(<= ULTIMATE.start_main_~x~4 26), 3959#(<= ULTIMATE.start_main_~x~4 27), 3960#(<= ULTIMATE.start_main_~x~4 28), 3961#(<= ULTIMATE.start_main_~x~4 29), 3962#(<= ULTIMATE.start_main_~x~4 30), 3963#(<= ULTIMATE.start_main_~x~4 31), 3964#(<= ULTIMATE.start_main_~x~4 32), 3965#(<= ULTIMATE.start_main_~x~4 33), 3966#(<= ULTIMATE.start_main_~x~4 34), 3967#(<= ULTIMATE.start_main_~x~4 35)] [2018-07-23 13:40:58,707 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 13:40:58,708 INFO L450 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-23 13:40:58,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-23 13:40:58,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:40:58,709 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-07-23 13:40:58,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:58,734 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-23 13:40:58,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 13:40:58,734 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-07-23 13:40:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:58,735 INFO L225 Difference]: With dead ends: 42 [2018-07-23 13:40:58,735 INFO L226 Difference]: Without dead ends: 40 [2018-07-23 13:40:58,736 INFO L575 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 13:40:58,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-23 13:40:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-23 13:40:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-23 13:40:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-23 13:40:58,739 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-07-23 13:40:58,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:58,739 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-23 13:40:58,739 INFO L472 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-23 13:40:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-23 13:40:58,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-23 13:40:58,740 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:58,740 INFO L357 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-07-23 13:40:58,740 INFO L414 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:58,743 INFO L82 PathProgramCache]: Analyzing trace with hash -2016854329, now seen corresponding path program 36 times [2018-07-23 13:40:58,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:58,930 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 13:40:58,930 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:58,930 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-23 13:40:58,930 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:58,931 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 13:40:58,931 INFO L185 omatonBuilderFactory]: Interpolants [4160#(<= ULTIMATE.start_main_~x~4 26), 4161#(<= ULTIMATE.start_main_~x~4 27), 4162#(<= ULTIMATE.start_main_~x~4 28), 4163#(<= ULTIMATE.start_main_~x~4 29), 4164#(<= ULTIMATE.start_main_~x~4 30), 4165#(<= ULTIMATE.start_main_~x~4 31), 4166#(<= ULTIMATE.start_main_~x~4 32), 4167#(<= ULTIMATE.start_main_~x~4 33), 4168#(<= ULTIMATE.start_main_~x~4 34), 4169#(<= ULTIMATE.start_main_~x~4 35), 4170#(<= ULTIMATE.start_main_~x~4 36), 4132#true, 4133#false, 4134#(<= ULTIMATE.start_main_~x~4 0), 4135#(<= ULTIMATE.start_main_~x~4 1), 4136#(<= ULTIMATE.start_main_~x~4 2), 4137#(<= ULTIMATE.start_main_~x~4 3), 4138#(<= ULTIMATE.start_main_~x~4 4), 4139#(<= ULTIMATE.start_main_~x~4 5), 4140#(<= ULTIMATE.start_main_~x~4 6), 4141#(<= ULTIMATE.start_main_~x~4 7), 4142#(<= ULTIMATE.start_main_~x~4 8), 4143#(<= ULTIMATE.start_main_~x~4 9), 4144#(<= ULTIMATE.start_main_~x~4 10), 4145#(<= ULTIMATE.start_main_~x~4 11), 4146#(<= ULTIMATE.start_main_~x~4 12), 4147#(<= ULTIMATE.start_main_~x~4 13), 4148#(<= ULTIMATE.start_main_~x~4 14), 4149#(<= ULTIMATE.start_main_~x~4 15), 4150#(<= ULTIMATE.start_main_~x~4 16), 4151#(<= ULTIMATE.start_main_~x~4 17), 4152#(<= ULTIMATE.start_main_~x~4 18), 4153#(<= ULTIMATE.start_main_~x~4 19), 4154#(<= ULTIMATE.start_main_~x~4 20), 4155#(<= ULTIMATE.start_main_~x~4 21), 4156#(<= ULTIMATE.start_main_~x~4 22), 4157#(<= ULTIMATE.start_main_~x~4 23), 4158#(<= ULTIMATE.start_main_~x~4 24), 4159#(<= ULTIMATE.start_main_~x~4 25)] [2018-07-23 13:40:58,931 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 13:40:58,932 INFO L450 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-23 13:40:58,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-23 13:40:58,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:40:58,934 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-07-23 13:40:58,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:58,951 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-23 13:40:58,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 13:40:58,952 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-07-23 13:40:58,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:58,952 INFO L225 Difference]: With dead ends: 43 [2018-07-23 13:40:58,952 INFO L226 Difference]: Without dead ends: 41 [2018-07-23 13:40:58,954 INFO L575 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 13:40:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-23 13:40:58,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-23 13:40:58,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-23 13:40:58,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-23 13:40:58,957 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-07-23 13:40:58,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:58,957 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-23 13:40:58,957 INFO L472 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-23 13:40:58,957 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-23 13:40:58,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 13:40:58,958 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:58,958 INFO L357 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-07-23 13:40:58,958 INFO L414 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:58,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1902037501, now seen corresponding path program 37 times [2018-07-23 13:40:58,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:59,156 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 13:40:59,157 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:59,157 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-23 13:40:59,157 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:59,157 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 13:40:59,158 INFO L185 omatonBuilderFactory]: Interpolants [4352#(<= ULTIMATE.start_main_~x~4 11), 4353#(<= ULTIMATE.start_main_~x~4 12), 4354#(<= ULTIMATE.start_main_~x~4 13), 4355#(<= ULTIMATE.start_main_~x~4 14), 4356#(<= ULTIMATE.start_main_~x~4 15), 4357#(<= ULTIMATE.start_main_~x~4 16), 4358#(<= ULTIMATE.start_main_~x~4 17), 4359#(<= ULTIMATE.start_main_~x~4 18), 4360#(<= ULTIMATE.start_main_~x~4 19), 4361#(<= ULTIMATE.start_main_~x~4 20), 4362#(<= ULTIMATE.start_main_~x~4 21), 4363#(<= ULTIMATE.start_main_~x~4 22), 4364#(<= ULTIMATE.start_main_~x~4 23), 4365#(<= ULTIMATE.start_main_~x~4 24), 4366#(<= ULTIMATE.start_main_~x~4 25), 4367#(<= ULTIMATE.start_main_~x~4 26), 4368#(<= ULTIMATE.start_main_~x~4 27), 4369#(<= ULTIMATE.start_main_~x~4 28), 4370#(<= ULTIMATE.start_main_~x~4 29), 4371#(<= ULTIMATE.start_main_~x~4 30), 4372#(<= ULTIMATE.start_main_~x~4 31), 4373#(<= ULTIMATE.start_main_~x~4 32), 4374#(<= ULTIMATE.start_main_~x~4 33), 4375#(<= ULTIMATE.start_main_~x~4 34), 4376#(<= ULTIMATE.start_main_~x~4 35), 4377#(<= ULTIMATE.start_main_~x~4 36), 4378#(<= ULTIMATE.start_main_~x~4 37), 4339#true, 4340#false, 4341#(<= ULTIMATE.start_main_~x~4 0), 4342#(<= ULTIMATE.start_main_~x~4 1), 4343#(<= ULTIMATE.start_main_~x~4 2), 4344#(<= ULTIMATE.start_main_~x~4 3), 4345#(<= ULTIMATE.start_main_~x~4 4), 4346#(<= ULTIMATE.start_main_~x~4 5), 4347#(<= ULTIMATE.start_main_~x~4 6), 4348#(<= ULTIMATE.start_main_~x~4 7), 4349#(<= ULTIMATE.start_main_~x~4 8), 4350#(<= ULTIMATE.start_main_~x~4 9), 4351#(<= ULTIMATE.start_main_~x~4 10)] [2018-07-23 13:40:59,158 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 13:40:59,158 INFO L450 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-23 13:40:59,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-23 13:40:59,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 13:40:59,160 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-07-23 13:40:59,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:59,182 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-23 13:40:59,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 13:40:59,183 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-07-23 13:40:59,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:59,184 INFO L225 Difference]: With dead ends: 44 [2018-07-23 13:40:59,184 INFO L226 Difference]: Without dead ends: 42 [2018-07-23 13:40:59,185 INFO L575 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 13:40:59,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-23 13:40:59,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-23 13:40:59,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-23 13:40:59,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-23 13:40:59,189 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-07-23 13:40:59,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:59,189 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-23 13:40:59,189 INFO L472 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-23 13:40:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-23 13:40:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-23 13:40:59,190 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:59,190 INFO L357 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-07-23 13:40:59,190 INFO L414 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:59,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1166367353, now seen corresponding path program 38 times [2018-07-23 13:40:59,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:59,387 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 13:40:59,388 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:59,388 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-23 13:40:59,388 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:59,388 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 13:40:59,389 INFO L185 omatonBuilderFactory]: Interpolants [4551#true, 4552#false, 4553#(<= ULTIMATE.start_main_~x~4 0), 4554#(<= ULTIMATE.start_main_~x~4 1), 4555#(<= ULTIMATE.start_main_~x~4 2), 4556#(<= ULTIMATE.start_main_~x~4 3), 4557#(<= ULTIMATE.start_main_~x~4 4), 4558#(<= ULTIMATE.start_main_~x~4 5), 4559#(<= ULTIMATE.start_main_~x~4 6), 4560#(<= ULTIMATE.start_main_~x~4 7), 4561#(<= ULTIMATE.start_main_~x~4 8), 4562#(<= ULTIMATE.start_main_~x~4 9), 4563#(<= ULTIMATE.start_main_~x~4 10), 4564#(<= ULTIMATE.start_main_~x~4 11), 4565#(<= ULTIMATE.start_main_~x~4 12), 4566#(<= ULTIMATE.start_main_~x~4 13), 4567#(<= ULTIMATE.start_main_~x~4 14), 4568#(<= ULTIMATE.start_main_~x~4 15), 4569#(<= ULTIMATE.start_main_~x~4 16), 4570#(<= ULTIMATE.start_main_~x~4 17), 4571#(<= ULTIMATE.start_main_~x~4 18), 4572#(<= ULTIMATE.start_main_~x~4 19), 4573#(<= ULTIMATE.start_main_~x~4 20), 4574#(<= ULTIMATE.start_main_~x~4 21), 4575#(<= ULTIMATE.start_main_~x~4 22), 4576#(<= ULTIMATE.start_main_~x~4 23), 4577#(<= ULTIMATE.start_main_~x~4 24), 4578#(<= ULTIMATE.start_main_~x~4 25), 4579#(<= ULTIMATE.start_main_~x~4 26), 4580#(<= ULTIMATE.start_main_~x~4 27), 4581#(<= ULTIMATE.start_main_~x~4 28), 4582#(<= ULTIMATE.start_main_~x~4 29), 4583#(<= ULTIMATE.start_main_~x~4 30), 4584#(<= ULTIMATE.start_main_~x~4 31), 4585#(<= ULTIMATE.start_main_~x~4 32), 4586#(<= ULTIMATE.start_main_~x~4 33), 4587#(<= ULTIMATE.start_main_~x~4 34), 4588#(<= ULTIMATE.start_main_~x~4 35), 4589#(<= ULTIMATE.start_main_~x~4 36), 4590#(<= ULTIMATE.start_main_~x~4 37), 4591#(<= ULTIMATE.start_main_~x~4 38)] [2018-07-23 13:40:59,389 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 13:40:59,389 INFO L450 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-23 13:40:59,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-23 13:40:59,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 13:40:59,391 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-07-23 13:40:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:59,417 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-23 13:40:59,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-23 13:40:59,417 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-07-23 13:40:59,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:59,418 INFO L225 Difference]: With dead ends: 45 [2018-07-23 13:40:59,418 INFO L226 Difference]: Without dead ends: 43 [2018-07-23 13:40:59,419 INFO L575 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 13:40:59,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-23 13:40:59,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-23 13:40:59,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-23 13:40:59,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-23 13:40:59,421 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-07-23 13:40:59,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:59,421 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-23 13:40:59,421 INFO L472 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-23 13:40:59,422 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-23 13:40:59,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 13:40:59,422 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:59,422 INFO L357 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-07-23 13:40:59,422 INFO L414 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:59,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1797637315, now seen corresponding path program 39 times [2018-07-23 13:40:59,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:59,618 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 13:40:59,618 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:59,618 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-23 13:40:59,619 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:59,619 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 13:40:59,619 INFO L185 omatonBuilderFactory]: Interpolants [4800#(<= ULTIMATE.start_main_~x~4 30), 4801#(<= ULTIMATE.start_main_~x~4 31), 4802#(<= ULTIMATE.start_main_~x~4 32), 4803#(<= ULTIMATE.start_main_~x~4 33), 4804#(<= ULTIMATE.start_main_~x~4 34), 4805#(<= ULTIMATE.start_main_~x~4 35), 4806#(<= ULTIMATE.start_main_~x~4 36), 4807#(<= ULTIMATE.start_main_~x~4 37), 4808#(<= ULTIMATE.start_main_~x~4 38), 4809#(<= ULTIMATE.start_main_~x~4 39), 4768#true, 4769#false, 4770#(<= ULTIMATE.start_main_~x~4 0), 4771#(<= ULTIMATE.start_main_~x~4 1), 4772#(<= ULTIMATE.start_main_~x~4 2), 4773#(<= ULTIMATE.start_main_~x~4 3), 4774#(<= ULTIMATE.start_main_~x~4 4), 4775#(<= ULTIMATE.start_main_~x~4 5), 4776#(<= ULTIMATE.start_main_~x~4 6), 4777#(<= ULTIMATE.start_main_~x~4 7), 4778#(<= ULTIMATE.start_main_~x~4 8), 4779#(<= ULTIMATE.start_main_~x~4 9), 4780#(<= ULTIMATE.start_main_~x~4 10), 4781#(<= ULTIMATE.start_main_~x~4 11), 4782#(<= ULTIMATE.start_main_~x~4 12), 4783#(<= ULTIMATE.start_main_~x~4 13), 4784#(<= ULTIMATE.start_main_~x~4 14), 4785#(<= ULTIMATE.start_main_~x~4 15), 4786#(<= ULTIMATE.start_main_~x~4 16), 4787#(<= ULTIMATE.start_main_~x~4 17), 4788#(<= ULTIMATE.start_main_~x~4 18), 4789#(<= ULTIMATE.start_main_~x~4 19), 4790#(<= ULTIMATE.start_main_~x~4 20), 4791#(<= ULTIMATE.start_main_~x~4 21), 4792#(<= ULTIMATE.start_main_~x~4 22), 4793#(<= ULTIMATE.start_main_~x~4 23), 4794#(<= ULTIMATE.start_main_~x~4 24), 4795#(<= ULTIMATE.start_main_~x~4 25), 4796#(<= ULTIMATE.start_main_~x~4 26), 4797#(<= ULTIMATE.start_main_~x~4 27), 4798#(<= ULTIMATE.start_main_~x~4 28), 4799#(<= ULTIMATE.start_main_~x~4 29)] [2018-07-23 13:40:59,619 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 13:40:59,620 INFO L450 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-23 13:40:59,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-23 13:40:59,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 13:40:59,622 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-07-23 13:40:59,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:59,642 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-23 13:40:59,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-23 13:40:59,643 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-07-23 13:40:59,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:59,643 INFO L225 Difference]: With dead ends: 46 [2018-07-23 13:40:59,643 INFO L226 Difference]: Without dead ends: 44 [2018-07-23 13:40:59,644 INFO L575 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 13:40:59,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-23 13:40:59,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-23 13:40:59,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-23 13:40:59,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-23 13:40:59,647 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-07-23 13:40:59,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:59,647 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-23 13:40:59,647 INFO L472 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-23 13:40:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-23 13:40:59,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-23 13:40:59,648 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:59,648 INFO L357 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-07-23 13:40:59,648 INFO L414 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:59,649 INFO L82 PathProgramCache]: Analyzing trace with hash 107830343, now seen corresponding path program 40 times [2018-07-23 13:40:59,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:59,862 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 13:40:59,862 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:59,862 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-23 13:40:59,863 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:59,863 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 13:40:59,863 INFO L185 omatonBuilderFactory]: Interpolants [4992#(<= ULTIMATE.start_main_~x~4 0), 4993#(<= ULTIMATE.start_main_~x~4 1), 4994#(<= ULTIMATE.start_main_~x~4 2), 4995#(<= ULTIMATE.start_main_~x~4 3), 4996#(<= ULTIMATE.start_main_~x~4 4), 4997#(<= ULTIMATE.start_main_~x~4 5), 4998#(<= ULTIMATE.start_main_~x~4 6), 4999#(<= ULTIMATE.start_main_~x~4 7), 5000#(<= ULTIMATE.start_main_~x~4 8), 5001#(<= ULTIMATE.start_main_~x~4 9), 5002#(<= ULTIMATE.start_main_~x~4 10), 5003#(<= ULTIMATE.start_main_~x~4 11), 5004#(<= ULTIMATE.start_main_~x~4 12), 5005#(<= ULTIMATE.start_main_~x~4 13), 5006#(<= ULTIMATE.start_main_~x~4 14), 5007#(<= ULTIMATE.start_main_~x~4 15), 5008#(<= ULTIMATE.start_main_~x~4 16), 5009#(<= ULTIMATE.start_main_~x~4 17), 5010#(<= ULTIMATE.start_main_~x~4 18), 5011#(<= ULTIMATE.start_main_~x~4 19), 5012#(<= ULTIMATE.start_main_~x~4 20), 5013#(<= ULTIMATE.start_main_~x~4 21), 5014#(<= ULTIMATE.start_main_~x~4 22), 5015#(<= ULTIMATE.start_main_~x~4 23), 5016#(<= ULTIMATE.start_main_~x~4 24), 5017#(<= ULTIMATE.start_main_~x~4 25), 5018#(<= ULTIMATE.start_main_~x~4 26), 5019#(<= ULTIMATE.start_main_~x~4 27), 5020#(<= ULTIMATE.start_main_~x~4 28), 5021#(<= ULTIMATE.start_main_~x~4 29), 5022#(<= ULTIMATE.start_main_~x~4 30), 5023#(<= ULTIMATE.start_main_~x~4 31), 5024#(<= ULTIMATE.start_main_~x~4 32), 5025#(<= ULTIMATE.start_main_~x~4 33), 5026#(<= ULTIMATE.start_main_~x~4 34), 5027#(<= ULTIMATE.start_main_~x~4 35), 5028#(<= ULTIMATE.start_main_~x~4 36), 5029#(<= ULTIMATE.start_main_~x~4 37), 5030#(<= ULTIMATE.start_main_~x~4 38), 5031#(<= ULTIMATE.start_main_~x~4 39), 5032#(<= ULTIMATE.start_main_~x~4 40), 4990#true, 4991#false] [2018-07-23 13:40:59,864 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 13:40:59,864 INFO L450 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-23 13:40:59,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-23 13:40:59,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 13:40:59,866 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-07-23 13:40:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:59,897 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-23 13:40:59,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 13:40:59,898 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-07-23 13:40:59,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:59,898 INFO L225 Difference]: With dead ends: 47 [2018-07-23 13:40:59,899 INFO L226 Difference]: Without dead ends: 45 [2018-07-23 13:40:59,900 INFO L575 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 13:40:59,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-23 13:40:59,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-23 13:40:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-23 13:40:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-23 13:40:59,903 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-07-23 13:40:59,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:59,903 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-23 13:40:59,904 INFO L472 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-23 13:40:59,904 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-23 13:40:59,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 13:40:59,905 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:59,905 INFO L357 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-07-23 13:40:59,905 INFO L414 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:59,905 INFO L82 PathProgramCache]: Analyzing trace with hash -952214403, now seen corresponding path program 41 times [2018-07-23 13:40:59,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:00,157 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 13:41:00,157 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:00,157 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-23 13:41:00,158 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:00,158 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 13:41:00,158 INFO L185 omatonBuilderFactory]: Interpolants [5248#(<= ULTIMATE.start_main_~x~4 29), 5249#(<= ULTIMATE.start_main_~x~4 30), 5250#(<= ULTIMATE.start_main_~x~4 31), 5251#(<= ULTIMATE.start_main_~x~4 32), 5252#(<= ULTIMATE.start_main_~x~4 33), 5253#(<= ULTIMATE.start_main_~x~4 34), 5254#(<= ULTIMATE.start_main_~x~4 35), 5255#(<= ULTIMATE.start_main_~x~4 36), 5256#(<= ULTIMATE.start_main_~x~4 37), 5257#(<= ULTIMATE.start_main_~x~4 38), 5258#(<= ULTIMATE.start_main_~x~4 39), 5259#(<= ULTIMATE.start_main_~x~4 40), 5260#(<= ULTIMATE.start_main_~x~4 41), 5217#true, 5218#false, 5219#(<= ULTIMATE.start_main_~x~4 0), 5220#(<= ULTIMATE.start_main_~x~4 1), 5221#(<= ULTIMATE.start_main_~x~4 2), 5222#(<= ULTIMATE.start_main_~x~4 3), 5223#(<= ULTIMATE.start_main_~x~4 4), 5224#(<= ULTIMATE.start_main_~x~4 5), 5225#(<= ULTIMATE.start_main_~x~4 6), 5226#(<= ULTIMATE.start_main_~x~4 7), 5227#(<= ULTIMATE.start_main_~x~4 8), 5228#(<= ULTIMATE.start_main_~x~4 9), 5229#(<= ULTIMATE.start_main_~x~4 10), 5230#(<= ULTIMATE.start_main_~x~4 11), 5231#(<= ULTIMATE.start_main_~x~4 12), 5232#(<= ULTIMATE.start_main_~x~4 13), 5233#(<= ULTIMATE.start_main_~x~4 14), 5234#(<= ULTIMATE.start_main_~x~4 15), 5235#(<= ULTIMATE.start_main_~x~4 16), 5236#(<= ULTIMATE.start_main_~x~4 17), 5237#(<= ULTIMATE.start_main_~x~4 18), 5238#(<= ULTIMATE.start_main_~x~4 19), 5239#(<= ULTIMATE.start_main_~x~4 20), 5240#(<= ULTIMATE.start_main_~x~4 21), 5241#(<= ULTIMATE.start_main_~x~4 22), 5242#(<= ULTIMATE.start_main_~x~4 23), 5243#(<= ULTIMATE.start_main_~x~4 24), 5244#(<= ULTIMATE.start_main_~x~4 25), 5245#(<= ULTIMATE.start_main_~x~4 26), 5246#(<= ULTIMATE.start_main_~x~4 27), 5247#(<= ULTIMATE.start_main_~x~4 28)] [2018-07-23 13:41:00,159 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 13:41:00,159 INFO L450 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-23 13:41:00,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-23 13:41:00,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 13:41:00,161 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-07-23 13:41:00,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:00,185 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-23 13:41:00,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-23 13:41:00,186 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-07-23 13:41:00,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:00,186 INFO L225 Difference]: With dead ends: 48 [2018-07-23 13:41:00,186 INFO L226 Difference]: Without dead ends: 46 [2018-07-23 13:41:00,188 INFO L575 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 13:41:00,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-23 13:41:00,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-23 13:41:00,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-23 13:41:00,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-23 13:41:00,191 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-07-23 13:41:00,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:00,192 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-23 13:41:00,192 INFO L472 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-23 13:41:00,192 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-23 13:41:00,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-23 13:41:00,193 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:00,193 INFO L357 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-07-23 13:41:00,193 INFO L414 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:00,194 INFO L82 PathProgramCache]: Analyzing trace with hash 546136839, now seen corresponding path program 42 times [2018-07-23 13:41:00,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:00,465 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 13:41:00,466 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:00,466 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-23 13:41:00,466 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:00,466 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 13:41:00,467 INFO L185 omatonBuilderFactory]: Interpolants [5449#true, 5450#false, 5451#(<= ULTIMATE.start_main_~x~4 0), 5452#(<= ULTIMATE.start_main_~x~4 1), 5453#(<= ULTIMATE.start_main_~x~4 2), 5454#(<= ULTIMATE.start_main_~x~4 3), 5455#(<= ULTIMATE.start_main_~x~4 4), 5456#(<= ULTIMATE.start_main_~x~4 5), 5457#(<= ULTIMATE.start_main_~x~4 6), 5458#(<= ULTIMATE.start_main_~x~4 7), 5459#(<= ULTIMATE.start_main_~x~4 8), 5460#(<= ULTIMATE.start_main_~x~4 9), 5461#(<= ULTIMATE.start_main_~x~4 10), 5462#(<= ULTIMATE.start_main_~x~4 11), 5463#(<= ULTIMATE.start_main_~x~4 12), 5464#(<= ULTIMATE.start_main_~x~4 13), 5465#(<= ULTIMATE.start_main_~x~4 14), 5466#(<= ULTIMATE.start_main_~x~4 15), 5467#(<= ULTIMATE.start_main_~x~4 16), 5468#(<= ULTIMATE.start_main_~x~4 17), 5469#(<= ULTIMATE.start_main_~x~4 18), 5470#(<= ULTIMATE.start_main_~x~4 19), 5471#(<= ULTIMATE.start_main_~x~4 20), 5472#(<= ULTIMATE.start_main_~x~4 21), 5473#(<= ULTIMATE.start_main_~x~4 22), 5474#(<= ULTIMATE.start_main_~x~4 23), 5475#(<= ULTIMATE.start_main_~x~4 24), 5476#(<= ULTIMATE.start_main_~x~4 25), 5477#(<= ULTIMATE.start_main_~x~4 26), 5478#(<= ULTIMATE.start_main_~x~4 27), 5479#(<= ULTIMATE.start_main_~x~4 28), 5480#(<= ULTIMATE.start_main_~x~4 29), 5481#(<= ULTIMATE.start_main_~x~4 30), 5482#(<= ULTIMATE.start_main_~x~4 31), 5483#(<= ULTIMATE.start_main_~x~4 32), 5484#(<= ULTIMATE.start_main_~x~4 33), 5485#(<= ULTIMATE.start_main_~x~4 34), 5486#(<= ULTIMATE.start_main_~x~4 35), 5487#(<= ULTIMATE.start_main_~x~4 36), 5488#(<= ULTIMATE.start_main_~x~4 37), 5489#(<= ULTIMATE.start_main_~x~4 38), 5490#(<= ULTIMATE.start_main_~x~4 39), 5491#(<= ULTIMATE.start_main_~x~4 40), 5492#(<= ULTIMATE.start_main_~x~4 41), 5493#(<= ULTIMATE.start_main_~x~4 42)] [2018-07-23 13:41:00,467 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 13:41:00,468 INFO L450 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-23 13:41:00,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-23 13:41:00,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 13:41:00,470 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-07-23 13:41:00,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:00,505 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-23 13:41:00,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 13:41:00,505 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-07-23 13:41:00,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:00,506 INFO L225 Difference]: With dead ends: 49 [2018-07-23 13:41:00,506 INFO L226 Difference]: Without dead ends: 47 [2018-07-23 13:41:00,507 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 13:41:00,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-23 13:41:00,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-23 13:41:00,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-23 13:41:00,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-23 13:41:00,511 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-07-23 13:41:00,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:00,512 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-23 13:41:00,512 INFO L472 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-23 13:41:00,512 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-23 13:41:00,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-23 13:41:00,513 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:00,513 INFO L357 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-07-23 13:41:00,513 INFO L414 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:00,513 INFO L82 PathProgramCache]: Analyzing trace with hash -249614915, now seen corresponding path program 43 times [2018-07-23 13:41:00,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:00,723 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 13:41:00,724 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:00,724 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-23 13:41:00,725 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:00,725 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 13:41:00,725 INFO L185 omatonBuilderFactory]: Interpolants [5696#(<= ULTIMATE.start_main_~x~4 8), 5697#(<= ULTIMATE.start_main_~x~4 9), 5698#(<= ULTIMATE.start_main_~x~4 10), 5699#(<= ULTIMATE.start_main_~x~4 11), 5700#(<= ULTIMATE.start_main_~x~4 12), 5701#(<= ULTIMATE.start_main_~x~4 13), 5702#(<= ULTIMATE.start_main_~x~4 14), 5703#(<= ULTIMATE.start_main_~x~4 15), 5704#(<= ULTIMATE.start_main_~x~4 16), 5705#(<= ULTIMATE.start_main_~x~4 17), 5706#(<= ULTIMATE.start_main_~x~4 18), 5707#(<= ULTIMATE.start_main_~x~4 19), 5708#(<= ULTIMATE.start_main_~x~4 20), 5709#(<= ULTIMATE.start_main_~x~4 21), 5710#(<= ULTIMATE.start_main_~x~4 22), 5711#(<= ULTIMATE.start_main_~x~4 23), 5712#(<= ULTIMATE.start_main_~x~4 24), 5713#(<= ULTIMATE.start_main_~x~4 25), 5714#(<= ULTIMATE.start_main_~x~4 26), 5715#(<= ULTIMATE.start_main_~x~4 27), 5716#(<= ULTIMATE.start_main_~x~4 28), 5717#(<= ULTIMATE.start_main_~x~4 29), 5718#(<= ULTIMATE.start_main_~x~4 30), 5719#(<= ULTIMATE.start_main_~x~4 31), 5720#(<= ULTIMATE.start_main_~x~4 32), 5721#(<= ULTIMATE.start_main_~x~4 33), 5722#(<= ULTIMATE.start_main_~x~4 34), 5723#(<= ULTIMATE.start_main_~x~4 35), 5724#(<= ULTIMATE.start_main_~x~4 36), 5725#(<= ULTIMATE.start_main_~x~4 37), 5726#(<= ULTIMATE.start_main_~x~4 38), 5727#(<= ULTIMATE.start_main_~x~4 39), 5728#(<= ULTIMATE.start_main_~x~4 40), 5729#(<= ULTIMATE.start_main_~x~4 41), 5730#(<= ULTIMATE.start_main_~x~4 42), 5731#(<= ULTIMATE.start_main_~x~4 43), 5686#true, 5687#false, 5688#(<= ULTIMATE.start_main_~x~4 0), 5689#(<= ULTIMATE.start_main_~x~4 1), 5690#(<= ULTIMATE.start_main_~x~4 2), 5691#(<= ULTIMATE.start_main_~x~4 3), 5692#(<= ULTIMATE.start_main_~x~4 4), 5693#(<= ULTIMATE.start_main_~x~4 5), 5694#(<= ULTIMATE.start_main_~x~4 6), 5695#(<= ULTIMATE.start_main_~x~4 7)] [2018-07-23 13:41:00,726 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 13:41:00,726 INFO L450 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-23 13:41:00,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-23 13:41:00,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 13:41:00,729 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-07-23 13:41:00,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:00,761 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-23 13:41:00,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 13:41:00,761 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-07-23 13:41:00,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:00,762 INFO L225 Difference]: With dead ends: 50 [2018-07-23 13:41:00,762 INFO L226 Difference]: Without dead ends: 48 [2018-07-23 13:41:00,763 INFO L575 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 13:41:00,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-23 13:41:00,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-23 13:41:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-23 13:41:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-23 13:41:00,767 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-07-23 13:41:00,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:00,767 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-23 13:41:00,767 INFO L472 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-23 13:41:00,768 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-23 13:41:00,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-23 13:41:00,768 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:00,768 INFO L357 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-07-23 13:41:00,768 INFO L414 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:00,769 INFO L82 PathProgramCache]: Analyzing trace with hash 851884487, now seen corresponding path program 44 times [2018-07-23 13:41:00,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:00,993 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 13:41:00,993 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:00,993 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-23 13:41:00,993 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:00,994 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 13:41:00,994 INFO L185 omatonBuilderFactory]: Interpolants [5952#(<= ULTIMATE.start_main_~x~4 22), 5953#(<= ULTIMATE.start_main_~x~4 23), 5954#(<= ULTIMATE.start_main_~x~4 24), 5955#(<= ULTIMATE.start_main_~x~4 25), 5956#(<= ULTIMATE.start_main_~x~4 26), 5957#(<= ULTIMATE.start_main_~x~4 27), 5958#(<= ULTIMATE.start_main_~x~4 28), 5959#(<= ULTIMATE.start_main_~x~4 29), 5960#(<= ULTIMATE.start_main_~x~4 30), 5961#(<= ULTIMATE.start_main_~x~4 31), 5962#(<= ULTIMATE.start_main_~x~4 32), 5963#(<= ULTIMATE.start_main_~x~4 33), 5964#(<= ULTIMATE.start_main_~x~4 34), 5965#(<= ULTIMATE.start_main_~x~4 35), 5966#(<= ULTIMATE.start_main_~x~4 36), 5967#(<= ULTIMATE.start_main_~x~4 37), 5968#(<= ULTIMATE.start_main_~x~4 38), 5969#(<= ULTIMATE.start_main_~x~4 39), 5970#(<= ULTIMATE.start_main_~x~4 40), 5971#(<= ULTIMATE.start_main_~x~4 41), 5972#(<= ULTIMATE.start_main_~x~4 42), 5973#(<= ULTIMATE.start_main_~x~4 43), 5974#(<= ULTIMATE.start_main_~x~4 44), 5928#true, 5929#false, 5930#(<= ULTIMATE.start_main_~x~4 0), 5931#(<= ULTIMATE.start_main_~x~4 1), 5932#(<= ULTIMATE.start_main_~x~4 2), 5933#(<= ULTIMATE.start_main_~x~4 3), 5934#(<= ULTIMATE.start_main_~x~4 4), 5935#(<= ULTIMATE.start_main_~x~4 5), 5936#(<= ULTIMATE.start_main_~x~4 6), 5937#(<= ULTIMATE.start_main_~x~4 7), 5938#(<= ULTIMATE.start_main_~x~4 8), 5939#(<= ULTIMATE.start_main_~x~4 9), 5940#(<= ULTIMATE.start_main_~x~4 10), 5941#(<= ULTIMATE.start_main_~x~4 11), 5942#(<= ULTIMATE.start_main_~x~4 12), 5943#(<= ULTIMATE.start_main_~x~4 13), 5944#(<= ULTIMATE.start_main_~x~4 14), 5945#(<= ULTIMATE.start_main_~x~4 15), 5946#(<= ULTIMATE.start_main_~x~4 16), 5947#(<= ULTIMATE.start_main_~x~4 17), 5948#(<= ULTIMATE.start_main_~x~4 18), 5949#(<= ULTIMATE.start_main_~x~4 19), 5950#(<= ULTIMATE.start_main_~x~4 20), 5951#(<= ULTIMATE.start_main_~x~4 21)] [2018-07-23 13:41:00,997 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 13:41:00,998 INFO L450 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-23 13:41:00,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-23 13:41:00,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 13:41:00,999 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-07-23 13:41:01,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:01,028 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-23 13:41:01,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-23 13:41:01,029 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-07-23 13:41:01,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:01,029 INFO L225 Difference]: With dead ends: 51 [2018-07-23 13:41:01,029 INFO L226 Difference]: Without dead ends: 49 [2018-07-23 13:41:01,031 INFO L575 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 13:41:01,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-23 13:41:01,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-23 13:41:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-23 13:41:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-23 13:41:01,034 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-07-23 13:41:01,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:01,034 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-23 13:41:01,034 INFO L472 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-23 13:41:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-23 13:41:01,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 13:41:01,035 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:01,035 INFO L357 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-07-23 13:41:01,035 INFO L414 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:01,035 INFO L82 PathProgramCache]: Analyzing trace with hash 638627581, now seen corresponding path program 45 times [2018-07-23 13:41:01,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:01,262 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 13:41:01,262 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:01,262 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-23 13:41:01,262 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:01,263 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 13:41:01,263 INFO L185 omatonBuilderFactory]: Interpolants [6208#(<= ULTIMATE.start_main_~x~4 31), 6209#(<= ULTIMATE.start_main_~x~4 32), 6210#(<= ULTIMATE.start_main_~x~4 33), 6211#(<= ULTIMATE.start_main_~x~4 34), 6212#(<= ULTIMATE.start_main_~x~4 35), 6213#(<= ULTIMATE.start_main_~x~4 36), 6214#(<= ULTIMATE.start_main_~x~4 37), 6215#(<= ULTIMATE.start_main_~x~4 38), 6216#(<= ULTIMATE.start_main_~x~4 39), 6217#(<= ULTIMATE.start_main_~x~4 40), 6218#(<= ULTIMATE.start_main_~x~4 41), 6219#(<= ULTIMATE.start_main_~x~4 42), 6220#(<= ULTIMATE.start_main_~x~4 43), 6221#(<= ULTIMATE.start_main_~x~4 44), 6222#(<= ULTIMATE.start_main_~x~4 45), 6175#true, 6176#false, 6177#(<= ULTIMATE.start_main_~x~4 0), 6178#(<= ULTIMATE.start_main_~x~4 1), 6179#(<= ULTIMATE.start_main_~x~4 2), 6180#(<= ULTIMATE.start_main_~x~4 3), 6181#(<= ULTIMATE.start_main_~x~4 4), 6182#(<= ULTIMATE.start_main_~x~4 5), 6183#(<= ULTIMATE.start_main_~x~4 6), 6184#(<= ULTIMATE.start_main_~x~4 7), 6185#(<= ULTIMATE.start_main_~x~4 8), 6186#(<= ULTIMATE.start_main_~x~4 9), 6187#(<= ULTIMATE.start_main_~x~4 10), 6188#(<= ULTIMATE.start_main_~x~4 11), 6189#(<= ULTIMATE.start_main_~x~4 12), 6190#(<= ULTIMATE.start_main_~x~4 13), 6191#(<= ULTIMATE.start_main_~x~4 14), 6192#(<= ULTIMATE.start_main_~x~4 15), 6193#(<= ULTIMATE.start_main_~x~4 16), 6194#(<= ULTIMATE.start_main_~x~4 17), 6195#(<= ULTIMATE.start_main_~x~4 18), 6196#(<= ULTIMATE.start_main_~x~4 19), 6197#(<= ULTIMATE.start_main_~x~4 20), 6198#(<= ULTIMATE.start_main_~x~4 21), 6199#(<= ULTIMATE.start_main_~x~4 22), 6200#(<= ULTIMATE.start_main_~x~4 23), 6201#(<= ULTIMATE.start_main_~x~4 24), 6202#(<= ULTIMATE.start_main_~x~4 25), 6203#(<= ULTIMATE.start_main_~x~4 26), 6204#(<= ULTIMATE.start_main_~x~4 27), 6205#(<= ULTIMATE.start_main_~x~4 28), 6206#(<= ULTIMATE.start_main_~x~4 29), 6207#(<= ULTIMATE.start_main_~x~4 30)] [2018-07-23 13:41:01,263 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 13:41:01,263 INFO L450 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-23 13:41:01,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-23 13:41:01,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 13:41:01,265 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-07-23 13:41:01,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:01,288 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-07-23 13:41:01,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-23 13:41:01,288 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-07-23 13:41:01,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:01,288 INFO L225 Difference]: With dead ends: 52 [2018-07-23 13:41:01,289 INFO L226 Difference]: Without dead ends: 50 [2018-07-23 13:41:01,289 INFO L575 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 13:41:01,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-23 13:41:01,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-23 13:41:01,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-23 13:41:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-23 13:41:01,292 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-07-23 13:41:01,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:01,292 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-23 13:41:01,292 INFO L472 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-23 13:41:01,292 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-23 13:41:01,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-23 13:41:01,293 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:01,293 INFO L357 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-07-23 13:41:01,293 INFO L414 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:01,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1677369209, now seen corresponding path program 46 times [2018-07-23 13:41:01,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:01,524 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 13:41:01,524 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:01,524 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-23 13:41:01,525 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:01,525 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 13:41:01,525 INFO L185 omatonBuilderFactory]: Interpolants [6427#true, 6428#false, 6429#(<= ULTIMATE.start_main_~x~4 0), 6430#(<= ULTIMATE.start_main_~x~4 1), 6431#(<= ULTIMATE.start_main_~x~4 2), 6432#(<= ULTIMATE.start_main_~x~4 3), 6433#(<= ULTIMATE.start_main_~x~4 4), 6434#(<= ULTIMATE.start_main_~x~4 5), 6435#(<= ULTIMATE.start_main_~x~4 6), 6436#(<= ULTIMATE.start_main_~x~4 7), 6437#(<= ULTIMATE.start_main_~x~4 8), 6438#(<= ULTIMATE.start_main_~x~4 9), 6439#(<= ULTIMATE.start_main_~x~4 10), 6440#(<= ULTIMATE.start_main_~x~4 11), 6441#(<= ULTIMATE.start_main_~x~4 12), 6442#(<= ULTIMATE.start_main_~x~4 13), 6443#(<= ULTIMATE.start_main_~x~4 14), 6444#(<= ULTIMATE.start_main_~x~4 15), 6445#(<= ULTIMATE.start_main_~x~4 16), 6446#(<= ULTIMATE.start_main_~x~4 17), 6447#(<= ULTIMATE.start_main_~x~4 18), 6448#(<= ULTIMATE.start_main_~x~4 19), 6449#(<= ULTIMATE.start_main_~x~4 20), 6450#(<= ULTIMATE.start_main_~x~4 21), 6451#(<= ULTIMATE.start_main_~x~4 22), 6452#(<= ULTIMATE.start_main_~x~4 23), 6453#(<= ULTIMATE.start_main_~x~4 24), 6454#(<= ULTIMATE.start_main_~x~4 25), 6455#(<= ULTIMATE.start_main_~x~4 26), 6456#(<= ULTIMATE.start_main_~x~4 27), 6457#(<= ULTIMATE.start_main_~x~4 28), 6458#(<= ULTIMATE.start_main_~x~4 29), 6459#(<= ULTIMATE.start_main_~x~4 30), 6460#(<= ULTIMATE.start_main_~x~4 31), 6461#(<= ULTIMATE.start_main_~x~4 32), 6462#(<= ULTIMATE.start_main_~x~4 33), 6463#(<= ULTIMATE.start_main_~x~4 34), 6464#(<= ULTIMATE.start_main_~x~4 35), 6465#(<= ULTIMATE.start_main_~x~4 36), 6466#(<= ULTIMATE.start_main_~x~4 37), 6467#(<= ULTIMATE.start_main_~x~4 38), 6468#(<= ULTIMATE.start_main_~x~4 39), 6469#(<= ULTIMATE.start_main_~x~4 40), 6470#(<= ULTIMATE.start_main_~x~4 41), 6471#(<= ULTIMATE.start_main_~x~4 42), 6472#(<= ULTIMATE.start_main_~x~4 43), 6473#(<= ULTIMATE.start_main_~x~4 44), 6474#(<= ULTIMATE.start_main_~x~4 45), 6475#(<= ULTIMATE.start_main_~x~4 46)] [2018-07-23 13:41:01,526 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 13:41:01,526 INFO L450 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-23 13:41:01,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-23 13:41:01,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 13:41:01,527 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-07-23 13:41:01,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:01,552 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-23 13:41:01,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-23 13:41:01,552 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-07-23 13:41:01,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:01,553 INFO L225 Difference]: With dead ends: 53 [2018-07-23 13:41:01,553 INFO L226 Difference]: Without dead ends: 51 [2018-07-23 13:41:01,554 INFO L575 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 13:41:01,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-23 13:41:01,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-23 13:41:01,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-23 13:41:01,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-23 13:41:01,556 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-07-23 13:41:01,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:01,557 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-23 13:41:01,557 INFO L472 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-23 13:41:01,557 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-23 13:41:01,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-23 13:41:01,557 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:01,558 INFO L357 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-07-23 13:41:01,558 INFO L414 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:01,558 INFO L82 PathProgramCache]: Analyzing trace with hash -458825667, now seen corresponding path program 47 times [2018-07-23 13:41:01,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:01,792 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 13:41:01,793 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:01,793 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-23 13:41:01,793 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:01,794 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 13:41:01,794 INFO L185 omatonBuilderFactory]: Interpolants [6684#true, 6685#false, 6686#(<= ULTIMATE.start_main_~x~4 0), 6687#(<= ULTIMATE.start_main_~x~4 1), 6688#(<= ULTIMATE.start_main_~x~4 2), 6689#(<= ULTIMATE.start_main_~x~4 3), 6690#(<= ULTIMATE.start_main_~x~4 4), 6691#(<= ULTIMATE.start_main_~x~4 5), 6692#(<= ULTIMATE.start_main_~x~4 6), 6693#(<= ULTIMATE.start_main_~x~4 7), 6694#(<= ULTIMATE.start_main_~x~4 8), 6695#(<= ULTIMATE.start_main_~x~4 9), 6696#(<= ULTIMATE.start_main_~x~4 10), 6697#(<= ULTIMATE.start_main_~x~4 11), 6698#(<= ULTIMATE.start_main_~x~4 12), 6699#(<= ULTIMATE.start_main_~x~4 13), 6700#(<= ULTIMATE.start_main_~x~4 14), 6701#(<= ULTIMATE.start_main_~x~4 15), 6702#(<= ULTIMATE.start_main_~x~4 16), 6703#(<= ULTIMATE.start_main_~x~4 17), 6704#(<= ULTIMATE.start_main_~x~4 18), 6705#(<= ULTIMATE.start_main_~x~4 19), 6706#(<= ULTIMATE.start_main_~x~4 20), 6707#(<= ULTIMATE.start_main_~x~4 21), 6708#(<= ULTIMATE.start_main_~x~4 22), 6709#(<= ULTIMATE.start_main_~x~4 23), 6710#(<= ULTIMATE.start_main_~x~4 24), 6711#(<= ULTIMATE.start_main_~x~4 25), 6712#(<= ULTIMATE.start_main_~x~4 26), 6713#(<= ULTIMATE.start_main_~x~4 27), 6714#(<= ULTIMATE.start_main_~x~4 28), 6715#(<= ULTIMATE.start_main_~x~4 29), 6716#(<= ULTIMATE.start_main_~x~4 30), 6717#(<= ULTIMATE.start_main_~x~4 31), 6718#(<= ULTIMATE.start_main_~x~4 32), 6719#(<= ULTIMATE.start_main_~x~4 33), 6720#(<= ULTIMATE.start_main_~x~4 34), 6721#(<= ULTIMATE.start_main_~x~4 35), 6722#(<= ULTIMATE.start_main_~x~4 36), 6723#(<= ULTIMATE.start_main_~x~4 37), 6724#(<= ULTIMATE.start_main_~x~4 38), 6725#(<= ULTIMATE.start_main_~x~4 39), 6726#(<= ULTIMATE.start_main_~x~4 40), 6727#(<= ULTIMATE.start_main_~x~4 41), 6728#(<= ULTIMATE.start_main_~x~4 42), 6729#(<= ULTIMATE.start_main_~x~4 43), 6730#(<= ULTIMATE.start_main_~x~4 44), 6731#(<= ULTIMATE.start_main_~x~4 45), 6732#(<= ULTIMATE.start_main_~x~4 46), 6733#(<= ULTIMATE.start_main_~x~4 47)] [2018-07-23 13:41:01,794 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 13:41:01,795 INFO L450 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-23 13:41:01,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-23 13:41:01,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 13:41:01,796 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-07-23 13:41:01,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:01,821 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-23 13:41:01,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-23 13:41:01,821 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-07-23 13:41:01,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:01,822 INFO L225 Difference]: With dead ends: 54 [2018-07-23 13:41:01,822 INFO L226 Difference]: Without dead ends: 52 [2018-07-23 13:41:01,823 INFO L575 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 13:41:01,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-23 13:41:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-07-23 13:41:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-23 13:41:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-07-23 13:41:01,826 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-07-23 13:41:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:01,826 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-07-23 13:41:01,826 INFO L472 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-23 13:41:01,826 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-07-23 13:41:01,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-23 13:41:01,827 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:01,827 INFO L357 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-07-23 13:41:01,827 INFO L414 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:01,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1338681529, now seen corresponding path program 48 times [2018-07-23 13:41:01,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:02,074 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 13:41:02,075 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:02,075 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-23 13:41:02,075 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:02,075 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 13:41:02,076 INFO L185 omatonBuilderFactory]: Interpolants [6946#true, 6947#false, 6948#(<= ULTIMATE.start_main_~x~4 0), 6949#(<= ULTIMATE.start_main_~x~4 1), 6950#(<= ULTIMATE.start_main_~x~4 2), 6951#(<= ULTIMATE.start_main_~x~4 3), 6952#(<= ULTIMATE.start_main_~x~4 4), 6953#(<= ULTIMATE.start_main_~x~4 5), 6954#(<= ULTIMATE.start_main_~x~4 6), 6955#(<= ULTIMATE.start_main_~x~4 7), 6956#(<= ULTIMATE.start_main_~x~4 8), 6957#(<= ULTIMATE.start_main_~x~4 9), 6958#(<= ULTIMATE.start_main_~x~4 10), 6959#(<= ULTIMATE.start_main_~x~4 11), 6960#(<= ULTIMATE.start_main_~x~4 12), 6961#(<= ULTIMATE.start_main_~x~4 13), 6962#(<= ULTIMATE.start_main_~x~4 14), 6963#(<= ULTIMATE.start_main_~x~4 15), 6964#(<= ULTIMATE.start_main_~x~4 16), 6965#(<= ULTIMATE.start_main_~x~4 17), 6966#(<= ULTIMATE.start_main_~x~4 18), 6967#(<= ULTIMATE.start_main_~x~4 19), 6968#(<= ULTIMATE.start_main_~x~4 20), 6969#(<= ULTIMATE.start_main_~x~4 21), 6970#(<= ULTIMATE.start_main_~x~4 22), 6971#(<= ULTIMATE.start_main_~x~4 23), 6972#(<= ULTIMATE.start_main_~x~4 24), 6973#(<= ULTIMATE.start_main_~x~4 25), 6974#(<= ULTIMATE.start_main_~x~4 26), 6975#(<= ULTIMATE.start_main_~x~4 27), 6976#(<= ULTIMATE.start_main_~x~4 28), 6977#(<= ULTIMATE.start_main_~x~4 29), 6978#(<= ULTIMATE.start_main_~x~4 30), 6979#(<= ULTIMATE.start_main_~x~4 31), 6980#(<= ULTIMATE.start_main_~x~4 32), 6981#(<= ULTIMATE.start_main_~x~4 33), 6982#(<= ULTIMATE.start_main_~x~4 34), 6983#(<= ULTIMATE.start_main_~x~4 35), 6984#(<= ULTIMATE.start_main_~x~4 36), 6985#(<= ULTIMATE.start_main_~x~4 37), 6986#(<= ULTIMATE.start_main_~x~4 38), 6987#(<= ULTIMATE.start_main_~x~4 39), 6988#(<= ULTIMATE.start_main_~x~4 40), 6989#(<= ULTIMATE.start_main_~x~4 41), 6990#(<= ULTIMATE.start_main_~x~4 42), 6991#(<= ULTIMATE.start_main_~x~4 43), 6992#(<= ULTIMATE.start_main_~x~4 44), 6993#(<= ULTIMATE.start_main_~x~4 45), 6994#(<= ULTIMATE.start_main_~x~4 46), 6995#(<= ULTIMATE.start_main_~x~4 47), 6996#(<= ULTIMATE.start_main_~x~4 48)] [2018-07-23 13:41:02,076 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 13:41:02,076 INFO L450 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-23 13:41:02,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-23 13:41:02,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 13:41:02,078 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-07-23 13:41:02,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:02,109 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-23 13:41:02,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-23 13:41:02,109 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-07-23 13:41:02,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:02,110 INFO L225 Difference]: With dead ends: 55 [2018-07-23 13:41:02,110 INFO L226 Difference]: Without dead ends: 53 [2018-07-23 13:41:02,111 INFO L575 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 13:41:02,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-23 13:41:02,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-23 13:41:02,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-23 13:41:02,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-23 13:41:02,114 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-07-23 13:41:02,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:02,114 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-23 13:41:02,114 INFO L472 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-23 13:41:02,114 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-23 13:41:02,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-23 13:41:02,115 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:02,115 INFO L357 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-07-23 13:41:02,115 INFO L414 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:02,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1450557821, now seen corresponding path program 49 times [2018-07-23 13:41:02,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:02,363 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 13:41:02,364 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:02,364 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-23 13:41:02,364 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:02,364 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 13:41:02,364 INFO L185 omatonBuilderFactory]: Interpolants [7213#true, 7214#false, 7215#(<= ULTIMATE.start_main_~x~4 0), 7216#(<= ULTIMATE.start_main_~x~4 1), 7217#(<= ULTIMATE.start_main_~x~4 2), 7218#(<= ULTIMATE.start_main_~x~4 3), 7219#(<= ULTIMATE.start_main_~x~4 4), 7220#(<= ULTIMATE.start_main_~x~4 5), 7221#(<= ULTIMATE.start_main_~x~4 6), 7222#(<= ULTIMATE.start_main_~x~4 7), 7223#(<= ULTIMATE.start_main_~x~4 8), 7224#(<= ULTIMATE.start_main_~x~4 9), 7225#(<= ULTIMATE.start_main_~x~4 10), 7226#(<= ULTIMATE.start_main_~x~4 11), 7227#(<= ULTIMATE.start_main_~x~4 12), 7228#(<= ULTIMATE.start_main_~x~4 13), 7229#(<= ULTIMATE.start_main_~x~4 14), 7230#(<= ULTIMATE.start_main_~x~4 15), 7231#(<= ULTIMATE.start_main_~x~4 16), 7232#(<= ULTIMATE.start_main_~x~4 17), 7233#(<= ULTIMATE.start_main_~x~4 18), 7234#(<= ULTIMATE.start_main_~x~4 19), 7235#(<= ULTIMATE.start_main_~x~4 20), 7236#(<= ULTIMATE.start_main_~x~4 21), 7237#(<= ULTIMATE.start_main_~x~4 22), 7238#(<= ULTIMATE.start_main_~x~4 23), 7239#(<= ULTIMATE.start_main_~x~4 24), 7240#(<= ULTIMATE.start_main_~x~4 25), 7241#(<= ULTIMATE.start_main_~x~4 26), 7242#(<= ULTIMATE.start_main_~x~4 27), 7243#(<= ULTIMATE.start_main_~x~4 28), 7244#(<= ULTIMATE.start_main_~x~4 29), 7245#(<= ULTIMATE.start_main_~x~4 30), 7246#(<= ULTIMATE.start_main_~x~4 31), 7247#(<= ULTIMATE.start_main_~x~4 32), 7248#(<= ULTIMATE.start_main_~x~4 33), 7249#(<= ULTIMATE.start_main_~x~4 34), 7250#(<= ULTIMATE.start_main_~x~4 35), 7251#(<= ULTIMATE.start_main_~x~4 36), 7252#(<= ULTIMATE.start_main_~x~4 37), 7253#(<= ULTIMATE.start_main_~x~4 38), 7254#(<= ULTIMATE.start_main_~x~4 39), 7255#(<= ULTIMATE.start_main_~x~4 40), 7256#(<= ULTIMATE.start_main_~x~4 41), 7257#(<= ULTIMATE.start_main_~x~4 42), 7258#(<= ULTIMATE.start_main_~x~4 43), 7259#(<= ULTIMATE.start_main_~x~4 44), 7260#(<= ULTIMATE.start_main_~x~4 45), 7261#(<= ULTIMATE.start_main_~x~4 46), 7262#(<= ULTIMATE.start_main_~x~4 47), 7263#(<= ULTIMATE.start_main_~x~4 48), 7264#(<= ULTIMATE.start_main_~x~4 49)] [2018-07-23 13:41:02,365 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 13:41:02,365 INFO L450 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-23 13:41:02,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-23 13:41:02,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 13:41:02,367 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-07-23 13:41:02,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:02,398 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-07-23 13:41:02,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-23 13:41:02,399 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-07-23 13:41:02,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:02,399 INFO L225 Difference]: With dead ends: 56 [2018-07-23 13:41:02,399 INFO L226 Difference]: Without dead ends: 54 [2018-07-23 13:41:02,400 INFO L575 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 13:41:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-23 13:41:02,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-07-23 13:41:02,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-23 13:41:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-07-23 13:41:02,403 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-07-23 13:41:02,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:02,404 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-07-23 13:41:02,404 INFO L472 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-23 13:41:02,404 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-07-23 13:41:02,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-23 13:41:02,404 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:02,404 INFO L357 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-07-23 13:41:02,405 INFO L414 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:02,405 INFO L82 PathProgramCache]: Analyzing trace with hash 2017631751, now seen corresponding path program 50 times [2018-07-23 13:41:02,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:02,655 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 13:41:02,655 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:02,656 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-23 13:41:02,656 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:02,656 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 13:41:02,656 INFO L185 omatonBuilderFactory]: Interpolants [7485#true, 7486#false, 7487#(<= ULTIMATE.start_main_~x~4 0), 7488#(<= ULTIMATE.start_main_~x~4 1), 7489#(<= ULTIMATE.start_main_~x~4 2), 7490#(<= ULTIMATE.start_main_~x~4 3), 7491#(<= ULTIMATE.start_main_~x~4 4), 7492#(<= ULTIMATE.start_main_~x~4 5), 7493#(<= ULTIMATE.start_main_~x~4 6), 7494#(<= ULTIMATE.start_main_~x~4 7), 7495#(<= ULTIMATE.start_main_~x~4 8), 7496#(<= ULTIMATE.start_main_~x~4 9), 7497#(<= ULTIMATE.start_main_~x~4 10), 7498#(<= ULTIMATE.start_main_~x~4 11), 7499#(<= ULTIMATE.start_main_~x~4 12), 7500#(<= ULTIMATE.start_main_~x~4 13), 7501#(<= ULTIMATE.start_main_~x~4 14), 7502#(<= ULTIMATE.start_main_~x~4 15), 7503#(<= ULTIMATE.start_main_~x~4 16), 7504#(<= ULTIMATE.start_main_~x~4 17), 7505#(<= ULTIMATE.start_main_~x~4 18), 7506#(<= ULTIMATE.start_main_~x~4 19), 7507#(<= ULTIMATE.start_main_~x~4 20), 7508#(<= ULTIMATE.start_main_~x~4 21), 7509#(<= ULTIMATE.start_main_~x~4 22), 7510#(<= ULTIMATE.start_main_~x~4 23), 7511#(<= ULTIMATE.start_main_~x~4 24), 7512#(<= ULTIMATE.start_main_~x~4 25), 7513#(<= ULTIMATE.start_main_~x~4 26), 7514#(<= ULTIMATE.start_main_~x~4 27), 7515#(<= ULTIMATE.start_main_~x~4 28), 7516#(<= ULTIMATE.start_main_~x~4 29), 7517#(<= ULTIMATE.start_main_~x~4 30), 7518#(<= ULTIMATE.start_main_~x~4 31), 7519#(<= ULTIMATE.start_main_~x~4 32), 7520#(<= ULTIMATE.start_main_~x~4 33), 7521#(<= ULTIMATE.start_main_~x~4 34), 7522#(<= ULTIMATE.start_main_~x~4 35), 7523#(<= ULTIMATE.start_main_~x~4 36), 7524#(<= ULTIMATE.start_main_~x~4 37), 7525#(<= ULTIMATE.start_main_~x~4 38), 7526#(<= ULTIMATE.start_main_~x~4 39), 7527#(<= ULTIMATE.start_main_~x~4 40), 7528#(<= ULTIMATE.start_main_~x~4 41), 7529#(<= ULTIMATE.start_main_~x~4 42), 7530#(<= ULTIMATE.start_main_~x~4 43), 7531#(<= ULTIMATE.start_main_~x~4 44), 7532#(<= ULTIMATE.start_main_~x~4 45), 7533#(<= ULTIMATE.start_main_~x~4 46), 7534#(<= ULTIMATE.start_main_~x~4 47), 7535#(<= ULTIMATE.start_main_~x~4 48), 7536#(<= ULTIMATE.start_main_~x~4 49), 7537#(<= ULTIMATE.start_main_~x~4 50)] [2018-07-23 13:41:02,657 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 13:41:02,658 INFO L450 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-23 13:41:02,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-23 13:41:02,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 13:41:02,659 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-07-23 13:41:02,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:02,699 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-23 13:41:02,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-23 13:41:02,700 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-07-23 13:41:02,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:02,700 INFO L225 Difference]: With dead ends: 57 [2018-07-23 13:41:02,700 INFO L226 Difference]: Without dead ends: 55 [2018-07-23 13:41:02,701 INFO L575 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 13:41:02,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-23 13:41:02,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-23 13:41:02,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-23 13:41:02,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-23 13:41:02,704 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-07-23 13:41:02,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:02,704 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-23 13:41:02,704 INFO L472 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-23 13:41:02,704 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-23 13:41:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-23 13:41:02,705 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:02,705 INFO L357 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-07-23 13:41:02,705 INFO L414 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:02,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1877912899, now seen corresponding path program 51 times [2018-07-23 13:41:02,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:03,053 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 13:41:03,054 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:03,054 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-23 13:41:03,054 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:03,054 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 13:41:03,055 INFO L185 omatonBuilderFactory]: Interpolants [7808#(<= ULTIMATE.start_main_~x~4 44), 7809#(<= ULTIMATE.start_main_~x~4 45), 7810#(<= ULTIMATE.start_main_~x~4 46), 7811#(<= ULTIMATE.start_main_~x~4 47), 7812#(<= ULTIMATE.start_main_~x~4 48), 7813#(<= ULTIMATE.start_main_~x~4 49), 7814#(<= ULTIMATE.start_main_~x~4 50), 7815#(<= ULTIMATE.start_main_~x~4 51), 7762#true, 7763#false, 7764#(<= ULTIMATE.start_main_~x~4 0), 7765#(<= ULTIMATE.start_main_~x~4 1), 7766#(<= ULTIMATE.start_main_~x~4 2), 7767#(<= ULTIMATE.start_main_~x~4 3), 7768#(<= ULTIMATE.start_main_~x~4 4), 7769#(<= ULTIMATE.start_main_~x~4 5), 7770#(<= ULTIMATE.start_main_~x~4 6), 7771#(<= ULTIMATE.start_main_~x~4 7), 7772#(<= ULTIMATE.start_main_~x~4 8), 7773#(<= ULTIMATE.start_main_~x~4 9), 7774#(<= ULTIMATE.start_main_~x~4 10), 7775#(<= ULTIMATE.start_main_~x~4 11), 7776#(<= ULTIMATE.start_main_~x~4 12), 7777#(<= ULTIMATE.start_main_~x~4 13), 7778#(<= ULTIMATE.start_main_~x~4 14), 7779#(<= ULTIMATE.start_main_~x~4 15), 7780#(<= ULTIMATE.start_main_~x~4 16), 7781#(<= ULTIMATE.start_main_~x~4 17), 7782#(<= ULTIMATE.start_main_~x~4 18), 7783#(<= ULTIMATE.start_main_~x~4 19), 7784#(<= ULTIMATE.start_main_~x~4 20), 7785#(<= ULTIMATE.start_main_~x~4 21), 7786#(<= ULTIMATE.start_main_~x~4 22), 7787#(<= ULTIMATE.start_main_~x~4 23), 7788#(<= ULTIMATE.start_main_~x~4 24), 7789#(<= ULTIMATE.start_main_~x~4 25), 7790#(<= ULTIMATE.start_main_~x~4 26), 7791#(<= ULTIMATE.start_main_~x~4 27), 7792#(<= ULTIMATE.start_main_~x~4 28), 7793#(<= ULTIMATE.start_main_~x~4 29), 7794#(<= ULTIMATE.start_main_~x~4 30), 7795#(<= ULTIMATE.start_main_~x~4 31), 7796#(<= ULTIMATE.start_main_~x~4 32), 7797#(<= ULTIMATE.start_main_~x~4 33), 7798#(<= ULTIMATE.start_main_~x~4 34), 7799#(<= ULTIMATE.start_main_~x~4 35), 7800#(<= ULTIMATE.start_main_~x~4 36), 7801#(<= ULTIMATE.start_main_~x~4 37), 7802#(<= ULTIMATE.start_main_~x~4 38), 7803#(<= ULTIMATE.start_main_~x~4 39), 7804#(<= ULTIMATE.start_main_~x~4 40), 7805#(<= ULTIMATE.start_main_~x~4 41), 7806#(<= ULTIMATE.start_main_~x~4 42), 7807#(<= ULTIMATE.start_main_~x~4 43)] [2018-07-23 13:41:03,055 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 13:41:03,056 INFO L450 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-23 13:41:03,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-23 13:41:03,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 13:41:03,057 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-07-23 13:41:03,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:03,097 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-07-23 13:41:03,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 13:41:03,098 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-07-23 13:41:03,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:03,098 INFO L225 Difference]: With dead ends: 58 [2018-07-23 13:41:03,099 INFO L226 Difference]: Without dead ends: 56 [2018-07-23 13:41:03,100 INFO L575 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 13:41:03,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-23 13:41:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-23 13:41:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-23 13:41:03,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-23 13:41:03,104 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-07-23 13:41:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:03,104 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-23 13:41:03,104 INFO L472 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-23 13:41:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-23 13:41:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-23 13:41:03,105 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:03,105 INFO L357 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-07-23 13:41:03,105 INFO L414 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:03,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1914254535, now seen corresponding path program 52 times [2018-07-23 13:41:03,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:03,706 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 13:41:03,706 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:03,706 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-23 13:41:03,706 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:03,707 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 13:41:03,707 INFO L185 omatonBuilderFactory]: Interpolants [8064#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 8065#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 8066#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 8067#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 8068#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 8069#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 8070#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 8071#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 8072#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 8073#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 8074#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 8075#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 8076#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 8077#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 8078#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 8079#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 8080#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 8081#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 8082#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 8083#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 8084#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 8085#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 8086#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 8087#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 8088#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 8089#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 8090#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 8091#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 8092#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 8093#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 8094#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 8095#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 8096#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 8097#(<= ULTIMATE.start_main_~x~4 51), 8098#(<= ULTIMATE.start_main_~x~4 52), 8044#true, 8045#false, 8046#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 8047#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 8048#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 8049#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 8050#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 8051#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 8052#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 8053#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 8054#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 8055#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 8056#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 8057#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 8058#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 8059#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 8060#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 8061#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 8062#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 8063#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4))] [2018-07-23 13:41:03,708 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 13:41:03,708 INFO L450 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-23 13:41:03,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-23 13:41:03,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2760, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 13:41:03,709 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-07-23 13:41:04,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:04,217 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-23 13:41:04,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-23 13:41:04,218 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-07-23 13:41:04,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:04,219 INFO L225 Difference]: With dead ends: 59 [2018-07-23 13:41:04,219 INFO L226 Difference]: Without dead ends: 57 [2018-07-23 13:41:04,220 INFO L575 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 13:41:04,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-23 13:41:04,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-23 13:41:04,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-23 13:41:04,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-23 13:41:04,230 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-07-23 13:41:04,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:04,230 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-23 13:41:04,230 INFO L472 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-23 13:41:04,230 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-23 13:41:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-23 13:41:04,231 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:04,231 INFO L357 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-07-23 13:41:04,231 INFO L414 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:04,231 INFO L82 PathProgramCache]: Analyzing trace with hash -787639299, now seen corresponding path program 53 times [2018-07-23 13:41:04,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:04,666 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 13:41:04,667 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:04,667 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-23 13:41:04,667 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:04,668 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 13:41:04,668 INFO L185 omatonBuilderFactory]: Interpolants [8331#true, 8332#false, 8333#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 8334#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 8335#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 8336#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 8337#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 8338#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 8339#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 8340#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 8341#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 8342#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 8343#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 8344#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 8345#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 8346#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 8347#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 8348#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 8349#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 8350#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 8351#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 8352#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 8353#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 8354#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 8355#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 8356#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 8357#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 8358#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 8359#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 8360#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 8361#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 8362#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 8363#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 8364#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 8365#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 8366#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 8367#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 8368#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 8369#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 8370#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 8371#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 8372#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 8373#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 8374#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 8375#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 8376#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 8377#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 8378#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 8379#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 8380#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 8381#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 8382#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 8383#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 8384#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 8385#(<= ULTIMATE.start_main_~x~4 52), 8386#(<= ULTIMATE.start_main_~x~4 53)] [2018-07-23 13:41:04,669 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 13:41:04,669 INFO L450 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-23 13:41:04,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-23 13:41:04,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2866, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 13:41:04,670 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-07-23 13:41:05,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:05,169 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-23 13:41:05,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-23 13:41:05,169 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-07-23 13:41:05,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:05,170 INFO L225 Difference]: With dead ends: 60 [2018-07-23 13:41:05,170 INFO L226 Difference]: Without dead ends: 58 [2018-07-23 13:41:05,172 INFO L575 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 13:41:05,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-23 13:41:05,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-07-23 13:41:05,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-23 13:41:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-07-23 13:41:05,177 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-07-23 13:41:05,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:05,177 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-07-23 13:41:05,177 INFO L472 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-23 13:41:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-07-23 13:41:05,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-23 13:41:05,178 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:05,178 INFO L357 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-07-23 13:41:05,178 INFO L414 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:05,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1352997767, now seen corresponding path program 54 times [2018-07-23 13:41:05,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:05,623 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 13:41:05,624 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:05,624 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-23 13:41:05,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:05,624 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 13:41:05,625 INFO L185 omatonBuilderFactory]: Interpolants [8623#true, 8624#false, 8625#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 8626#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 8627#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 8628#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 8629#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 8630#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 8631#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 8632#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 8633#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 8634#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 8635#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 8636#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 8637#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 8638#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 8639#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 8640#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 8641#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 8642#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 8643#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 8644#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 8645#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 8646#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 8647#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 8648#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 8649#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 8650#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 8651#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 8652#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 8653#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 8654#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 8655#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 8656#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 8657#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 8658#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 8659#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 8660#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 8661#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 8662#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 8663#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 8664#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 8665#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 8666#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 8667#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 8668#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 8669#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 8670#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 8671#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 8672#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 8673#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 8674#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 8675#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 8676#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 8677#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 8678#(<= ULTIMATE.start_main_~x~4 53), 8679#(<= ULTIMATE.start_main_~x~4 54)] [2018-07-23 13:41:05,625 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 13:41:05,626 INFO L450 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-23 13:41:05,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-23 13:41:05,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2974, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 13:41:05,627 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-07-23 13:41:06,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:06,126 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-23 13:41:06,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-23 13:41:06,127 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-07-23 13:41:06,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:06,127 INFO L225 Difference]: With dead ends: 61 [2018-07-23 13:41:06,127 INFO L226 Difference]: Without dead ends: 59 [2018-07-23 13:41:06,129 INFO L575 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 13:41:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-23 13:41:06,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-23 13:41:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-23 13:41:06,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-23 13:41:06,133 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-07-23 13:41:06,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:06,133 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-23 13:41:06,133 INFO L472 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-23 13:41:06,134 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-23 13:41:06,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-23 13:41:06,134 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:06,134 INFO L357 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-07-23 13:41:06,134 INFO L414 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:06,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1006729923, now seen corresponding path program 55 times [2018-07-23 13:41:06,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:06,557 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 13:41:06,557 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:06,557 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-23 13:41:06,558 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:06,558 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 13:41:06,558 INFO L185 omatonBuilderFactory]: Interpolants [8960#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 8961#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 8962#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 8963#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 8964#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 8965#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 8966#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 8967#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 8968#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 8969#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 8970#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 8971#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 8972#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 8973#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 8974#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 8975#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 8976#(<= ULTIMATE.start_main_~x~4 54), 8977#(<= ULTIMATE.start_main_~x~4 55), 8920#true, 8921#false, 8922#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 8923#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 8924#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 8925#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 8926#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 8927#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 8928#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 8929#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 8930#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 8931#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 8932#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 8933#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 8934#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 8935#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 8936#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 8937#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 8938#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 8939#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 8940#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 8941#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 8942#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 8943#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 8944#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 8945#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 8946#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 8947#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 8948#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 8949#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 8950#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 8951#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 8952#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 8953#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 8954#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 8955#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 8956#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 8957#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 8958#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 8959#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4))] [2018-07-23 13:41:06,559 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 13:41:06,559 INFO L450 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-23 13:41:06,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-23 13:41:06,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3084, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 13:41:06,562 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-07-23 13:41:07,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:07,041 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-07-23 13:41:07,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-23 13:41:07,042 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-07-23 13:41:07,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:07,042 INFO L225 Difference]: With dead ends: 62 [2018-07-23 13:41:07,042 INFO L226 Difference]: Without dead ends: 60 [2018-07-23 13:41:07,044 INFO L575 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 13:41:07,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-23 13:41:07,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-23 13:41:07,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-23 13:41:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-23 13:41:07,048 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-07-23 13:41:07,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:07,049 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-23 13:41:07,049 INFO L472 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-23 13:41:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-23 13:41:07,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-23 13:41:07,049 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:07,050 INFO L357 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-07-23 13:41:07,050 INFO L414 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:07,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1143844281, now seen corresponding path program 56 times [2018-07-23 13:41:07,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:07,498 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 13:41:07,499 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:07,499 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-23 13:41:07,499 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:07,500 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 13:41:07,500 INFO L185 omatonBuilderFactory]: Interpolants [9222#true, 9223#false, 9224#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 9225#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 9226#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 9227#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 9228#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 9229#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 9230#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 9231#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 9232#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 9233#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 9234#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 9235#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 9236#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 9237#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 9238#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 9239#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 9240#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 9241#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 9242#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 9243#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 9244#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 9245#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 9246#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 9247#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 9248#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 9249#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 9250#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 9251#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 9252#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 9253#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 9254#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 9255#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 9256#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 9257#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 9258#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 9259#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 9260#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 9261#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 9262#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 9263#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 9264#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 9265#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 9266#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 9267#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 9268#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 9269#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 9270#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 9271#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 9272#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 9273#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 9274#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 9275#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 9276#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 9277#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 9278#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 9279#(<= ULTIMATE.start_main_~x~4 55), 9280#(<= ULTIMATE.start_main_~x~4 56)] [2018-07-23 13:41:07,501 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 13:41:07,501 INFO L450 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-23 13:41:07,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-23 13:41:07,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=3196, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 13:41:07,503 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-07-23 13:41:08,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:08,010 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-23 13:41:08,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-23 13:41:08,010 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-07-23 13:41:08,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:08,011 INFO L225 Difference]: With dead ends: 63 [2018-07-23 13:41:08,011 INFO L226 Difference]: Without dead ends: 61 [2018-07-23 13:41:08,012 INFO L575 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 13:41:08,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-23 13:41:08,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-23 13:41:08,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-23 13:41:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-23 13:41:08,017 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-07-23 13:41:08,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:08,018 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-23 13:41:08,018 INFO L472 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-23 13:41:08,018 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-23 13:41:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-23 13:41:08,019 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:08,019 INFO L357 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-07-23 13:41:08,019 INFO L414 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:08,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1099422083, now seen corresponding path program 57 times [2018-07-23 13:41:08,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:08,379 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 13:41:08,380 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:08,380 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-23 13:41:08,380 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:08,380 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 13:41:08,381 INFO L185 omatonBuilderFactory]: Interpolants [9529#true, 9530#false, 9531#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 9532#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 9533#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 9534#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 9535#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 9536#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 9537#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 9538#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 9539#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 9540#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 9541#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 9542#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 9543#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 9544#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 9545#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 9546#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 9547#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 9548#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 9549#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 9550#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 9551#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 9552#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 9553#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 9554#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 9555#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 9556#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 9557#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 9558#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 9559#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 9560#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 9561#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 9562#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 9563#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 9564#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 9565#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 9566#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 9567#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 9568#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 9569#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 9570#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 9571#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 9572#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 9573#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 9574#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 9575#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 9576#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 9577#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 9578#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 9579#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 9580#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 9581#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 9582#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 9583#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 9584#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 9585#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 9586#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 9587#(<= ULTIMATE.start_main_~x~4 56), 9588#(<= ULTIMATE.start_main_~x~4 57)] [2018-07-23 13:41:08,381 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 13:41:08,382 INFO L450 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-23 13:41:08,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-23 13:41:08,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3310, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 13:41:08,383 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-07-23 13:41:08,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:08,819 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-07-23 13:41:08,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-23 13:41:08,820 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-07-23 13:41:08,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:08,820 INFO L225 Difference]: With dead ends: 64 [2018-07-23 13:41:08,820 INFO L226 Difference]: Without dead ends: 62 [2018-07-23 13:41:08,822 INFO L575 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 13:41:08,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-23 13:41:08,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-23 13:41:08,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-23 13:41:08,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-23 13:41:08,826 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-07-23 13:41:08,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:08,827 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-23 13:41:08,827 INFO L472 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-23 13:41:08,827 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-23 13:41:08,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-23 13:41:08,827 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:08,827 INFO L357 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-07-23 13:41:08,828 INFO L414 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:08,828 INFO L82 PathProgramCache]: Analyzing trace with hash 277666055, now seen corresponding path program 58 times [2018-07-23 13:41:08,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:09,192 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 13:41:09,192 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:09,192 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-23 13:41:09,193 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:09,193 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 13:41:09,193 INFO L185 omatonBuilderFactory]: Interpolants [9856#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 9857#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 9858#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 9859#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 9860#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 9861#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 9862#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 9863#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 9864#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 9865#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 9866#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 9867#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 9868#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 9869#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 9870#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 9871#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 9872#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 9873#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 9874#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 9875#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 9876#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 9877#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 9878#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 9879#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 9880#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 9881#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 9882#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 9883#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 9884#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 9885#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 9886#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 9887#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 9888#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 9889#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 9890#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 9891#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 9892#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 9893#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 9894#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 9895#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 9896#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 9897#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 9898#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 9899#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 9900#(<= ULTIMATE.start_main_~x~4 57), 9901#(<= ULTIMATE.start_main_~x~4 58), 9841#true, 9842#false, 9843#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 9844#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 9845#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 9846#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 9847#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 9848#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 9849#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 9850#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 9851#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 9852#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 9853#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 9854#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 9855#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12))] [2018-07-23 13:41:09,194 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 13:41:09,194 INFO L450 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-23 13:41:09,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-23 13:41:09,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3426, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 13:41:09,196 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-07-23 13:41:09,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:09,631 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-23 13:41:09,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-23 13:41:09,632 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-07-23 13:41:09,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:09,632 INFO L225 Difference]: With dead ends: 65 [2018-07-23 13:41:09,633 INFO L226 Difference]: Without dead ends: 63 [2018-07-23 13:41:09,633 INFO L575 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 13:41:09,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-23 13:41:09,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-23 13:41:09,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-23 13:41:09,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-23 13:41:09,638 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-07-23 13:41:09,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:09,639 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-23 13:41:09,639 INFO L472 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-23 13:41:09,639 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-23 13:41:09,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-23 13:41:09,639 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:09,639 INFO L357 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-07-23 13:41:09,640 INFO L414 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:09,640 INFO L82 PathProgramCache]: Analyzing trace with hash 17725373, now seen corresponding path program 59 times [2018-07-23 13:41:09,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:09,981 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 13:41:09,982 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:09,982 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-23 13:41:09,982 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:09,982 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 13:41:09,983 INFO L185 omatonBuilderFactory]: Interpolants [10158#true, 10159#false, 10160#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 10161#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 10162#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 10163#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 10164#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 10165#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 10166#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 10167#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 10168#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 10169#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 10170#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 10171#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 10172#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 10173#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 10174#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 10175#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 10176#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 10177#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 10178#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 10179#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 10180#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 10181#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 10182#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 10183#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 10184#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 10185#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 10186#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 10187#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 10188#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 10189#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 10190#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 10191#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 10192#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 10193#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 10194#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 10195#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 10196#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 10197#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 10198#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 10199#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 10200#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 10201#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 10202#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 10203#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 10204#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 10205#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 10206#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 10207#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 10208#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 10209#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 10210#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 10211#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 10212#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 10213#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 10214#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 10215#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 10216#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 10217#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 10218#(<= ULTIMATE.start_main_~x~4 58), 10219#(<= ULTIMATE.start_main_~x~4 59)] [2018-07-23 13:41:09,983 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 13:41:09,984 INFO L450 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-23 13:41:09,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-23 13:41:09,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=3544, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 13:41:09,985 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-07-23 13:41:10,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:10,432 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-23 13:41:10,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-23 13:41:10,432 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-07-23 13:41:10,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:10,433 INFO L225 Difference]: With dead ends: 66 [2018-07-23 13:41:10,433 INFO L226 Difference]: Without dead ends: 64 [2018-07-23 13:41:10,434 INFO L575 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 13:41:10,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-23 13:41:10,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-07-23 13:41:10,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-23 13:41:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-07-23 13:41:10,439 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-07-23 13:41:10,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:10,439 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-07-23 13:41:10,440 INFO L472 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-23 13:41:10,440 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-07-23 13:41:10,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-23 13:41:10,440 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:10,440 INFO L357 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-07-23 13:41:10,441 INFO L414 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:10,441 INFO L82 PathProgramCache]: Analyzing trace with hash 549498823, now seen corresponding path program 60 times [2018-07-23 13:41:10,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:10,826 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 13:41:10,826 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:10,826 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-23 13:41:10,826 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:10,827 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 13:41:10,827 INFO L185 omatonBuilderFactory]: Interpolants [10496#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 10497#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 10498#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 10499#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 10500#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 10501#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 10502#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 10503#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 10504#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 10505#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 10506#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 10507#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 10508#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 10509#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 10510#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 10511#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 10512#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 10513#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 10514#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 10515#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 10516#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 10517#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 10518#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 10519#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 10520#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 10521#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 10522#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 10523#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 10524#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 10525#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 10526#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 10527#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 10528#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 10529#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 10530#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 10531#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 10532#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 10533#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 10534#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 10535#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 10536#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 10537#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 10538#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 10539#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 10540#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 10541#(<= ULTIMATE.start_main_~x~4 59), 10542#(<= ULTIMATE.start_main_~x~4 60), 10480#true, 10481#false, 10482#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 10483#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 10484#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 10485#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 10486#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 10487#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 10488#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 10489#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 10490#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 10491#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 10492#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 10493#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 10494#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 10495#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4))] [2018-07-23 13:41:10,827 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 13:41:10,828 INFO L450 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-23 13:41:10,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-23 13:41:10,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=3664, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 13:41:10,829 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-07-23 13:41:11,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:11,269 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-23 13:41:11,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-23 13:41:11,269 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-07-23 13:41:11,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:11,270 INFO L225 Difference]: With dead ends: 67 [2018-07-23 13:41:11,270 INFO L226 Difference]: Without dead ends: 65 [2018-07-23 13:41:11,271 INFO L575 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 13:41:11,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-23 13:41:11,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-23 13:41:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 13:41:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-23 13:41:11,275 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-07-23 13:41:11,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:11,276 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-23 13:41:11,276 INFO L472 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-23 13:41:11,276 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-23 13:41:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-23 13:41:11,277 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:11,277 INFO L357 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-07-23 13:41:11,277 INFO L414 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:11,277 INFO L82 PathProgramCache]: Analyzing trace with hash -145393411, now seen corresponding path program 61 times [2018-07-23 13:41:11,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:11,679 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 13:41:11,680 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:11,680 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-23 13:41:11,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:11,680 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 13:41:11,681 INFO L185 omatonBuilderFactory]: Interpolants [10807#true, 10808#false, 10809#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 10810#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 10811#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 10812#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 10813#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 10814#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 10815#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 10816#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 10817#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 10818#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 10819#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 10820#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 10821#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 10822#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 10823#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 10824#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 10825#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 10826#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 10827#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 10828#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 10829#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 10830#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 10831#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 10832#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 10833#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 10834#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 10835#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 10836#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 10837#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 10838#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 10839#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 10840#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 10841#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 10842#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 10843#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 10844#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 10845#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 10846#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 10847#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 10848#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 10849#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 10850#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 10851#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 10852#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 10853#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 10854#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 10855#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 10856#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 10857#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 10858#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 10859#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 10860#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 10861#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 10862#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 10863#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 10864#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 10865#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 10866#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 10867#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 10868#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 10869#(<= ULTIMATE.start_main_~x~4 60), 10870#(<= ULTIMATE.start_main_~x~4 61)] [2018-07-23 13:41:11,681 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 13:41:11,682 INFO L450 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-23 13:41:11,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-23 13:41:11,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3786, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 13:41:11,683 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-07-23 13:41:12,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:12,120 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-07-23 13:41:12,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-23 13:41:12,120 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-07-23 13:41:12,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:12,121 INFO L225 Difference]: With dead ends: 68 [2018-07-23 13:41:12,121 INFO L226 Difference]: Without dead ends: 66 [2018-07-23 13:41:12,122 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=246, Invalid=3786, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 13:41:12,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-23 13:41:12,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-07-23 13:41:12,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-23 13:41:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-23 13:41:12,127 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-07-23 13:41:12,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:12,128 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-23 13:41:12,128 INFO L472 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-23 13:41:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-23 13:41:12,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-23 13:41:12,129 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:12,129 INFO L357 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-07-23 13:41:12,129 INFO L414 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:12,129 INFO L82 PathProgramCache]: Analyzing trace with hash -212216185, now seen corresponding path program 62 times [2018-07-23 13:41:12,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:12,476 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 13:41:12,477 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:12,477 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-23 13:41:12,477 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:12,477 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 13:41:12,478 INFO L185 omatonBuilderFactory]: Interpolants [11139#true, 11140#false, 11141#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 11142#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 11143#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 11144#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 11145#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 11146#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 11147#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 11148#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 11149#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 11150#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 11151#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 11152#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 11153#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 11154#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 11155#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 11156#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 11157#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 11158#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 11159#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 11160#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 11161#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 11162#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 11163#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 11164#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 11165#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 11166#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 11167#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 11168#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 11169#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 11170#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 11171#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 11172#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 11173#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 11174#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 11175#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 11176#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 11177#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 11178#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 11179#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 11180#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 11181#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 11182#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 11183#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 11184#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 11185#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 11186#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 11187#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 11188#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 11189#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 11190#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 11191#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 11192#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 11193#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 11194#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 11195#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 11196#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 11197#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 11198#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 11199#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 11200#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 11201#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 11202#(<= ULTIMATE.start_main_~x~4 61), 11203#(<= ULTIMATE.start_main_~x~4 62)] [2018-07-23 13:41:12,478 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 13:41:12,480 INFO L450 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-23 13:41:12,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-23 13:41:12,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=3910, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 13:41:12,482 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-07-23 13:41:12,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:12,914 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-23 13:41:12,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-23 13:41:12,914 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-07-23 13:41:12,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:12,915 INFO L225 Difference]: With dead ends: 69 [2018-07-23 13:41:12,915 INFO L226 Difference]: Without dead ends: 67 [2018-07-23 13:41:12,916 INFO L575 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 13:41:12,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-23 13:41:12,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-23 13:41:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-23 13:41:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-23 13:41:12,921 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-07-23 13:41:12,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:12,921 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-23 13:41:12,921 INFO L472 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-23 13:41:12,921 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-23 13:41:12,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-23 13:41:12,922 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:12,922 INFO L357 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-07-23 13:41:12,922 INFO L414 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:12,923 INFO L82 PathProgramCache]: Analyzing trace with hash 2011245117, now seen corresponding path program 63 times [2018-07-23 13:41:12,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:13,272 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 13:41:13,273 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:13,273 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-23 13:41:13,273 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:13,273 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 13:41:13,274 INFO L185 omatonBuilderFactory]: Interpolants [11520#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 11521#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 11522#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 11523#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 11524#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 11525#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 11526#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 11527#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 11528#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 11529#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 11530#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 11531#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 11532#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 11533#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 11534#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 11535#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 11536#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 11537#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 11538#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 11539#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 11540#(<= ULTIMATE.start_main_~x~4 62), 11541#(<= ULTIMATE.start_main_~x~4 63), 11476#true, 11477#false, 11478#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 11479#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 11480#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 11481#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 11482#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 11483#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 11484#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 11485#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 11486#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 11487#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 11488#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 11489#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 11490#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 11491#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 11492#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 11493#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 11494#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 11495#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 11496#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 11497#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 11498#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 11499#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 11500#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 11501#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 11502#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 11503#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 11504#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 11505#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 11506#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 11507#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 11508#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 11509#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 11510#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 11511#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 11512#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 11513#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 11514#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 11515#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 11516#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 11517#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 11518#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 11519#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4))] [2018-07-23 13:41:13,274 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 13:41:13,275 INFO L450 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-23 13:41:13,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-23 13:41:13,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=4036, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 13:41:13,276 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-07-23 13:41:13,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:13,766 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-23 13:41:13,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-23 13:41:13,767 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-07-23 13:41:13,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:13,767 INFO L225 Difference]: With dead ends: 70 [2018-07-23 13:41:13,767 INFO L226 Difference]: Without dead ends: 68 [2018-07-23 13:41:13,768 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=4036, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 13:41:13,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-23 13:41:13,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-23 13:41:13,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-23 13:41:13,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-23 13:41:13,777 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-07-23 13:41:13,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:13,778 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-23 13:41:13,778 INFO L472 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-23 13:41:13,778 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-23 13:41:13,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-23 13:41:13,779 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:13,779 INFO L357 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-07-23 13:41:13,779 INFO L414 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:13,779 INFO L82 PathProgramCache]: Analyzing trace with hash -2075898553, now seen corresponding path program 64 times [2018-07-23 13:41:13,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:14,250 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 13:41:14,251 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:14,251 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-23 13:41:14,251 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:14,251 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 13:41:14,252 INFO L185 omatonBuilderFactory]: Interpolants [11818#true, 11819#false, 11820#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 11821#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 11822#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 11823#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 11824#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 11825#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 11826#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 11827#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 11828#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 11829#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 11830#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 11831#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 11832#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 11833#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 11834#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 11835#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 11836#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 11837#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 11838#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 11839#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 11840#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 11841#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 11842#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 11843#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 11844#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 11845#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 11846#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 11847#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 11848#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 11849#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 11850#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 11851#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 11852#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 11853#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 11854#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 11855#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 11856#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 11857#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 11858#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 11859#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 11860#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 11861#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 11862#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 11863#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 11864#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 11865#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 11866#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 11867#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 11868#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 11869#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 11870#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 11871#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 11872#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 11873#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 11874#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 11875#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 11876#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 11877#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 11878#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 11879#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 11880#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 11881#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 11882#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 11883#(<= ULTIMATE.start_main_~x~4 63), 11884#(<= ULTIMATE.start_main_~x~4 64)] [2018-07-23 13:41:14,253 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 13:41:14,253 INFO L450 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-23 13:41:14,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-23 13:41:14,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=4164, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 13:41:14,254 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-07-23 13:41:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:14,698 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-23 13:41:14,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-23 13:41:14,699 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-07-23 13:41:14,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:14,700 INFO L225 Difference]: With dead ends: 71 [2018-07-23 13:41:14,700 INFO L226 Difference]: Without dead ends: 69 [2018-07-23 13:41:14,700 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=258, Invalid=4164, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 13:41:14,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-23 13:41:14,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-23 13:41:14,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-23 13:41:14,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-23 13:41:14,705 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-07-23 13:41:14,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:14,705 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-23 13:41:14,705 INFO L472 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-23 13:41:14,705 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-23 13:41:14,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-23 13:41:14,706 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:14,706 INFO L357 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-07-23 13:41:14,706 INFO L414 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:14,707 INFO L82 PathProgramCache]: Analyzing trace with hash 71666557, now seen corresponding path program 65 times [2018-07-23 13:41:14,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:15,060 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 13:41:15,060 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:15,061 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-23 13:41:15,061 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:15,061 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 13:41:15,061 INFO L185 omatonBuilderFactory]: Interpolants [12165#true, 12166#false, 12167#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 12168#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 12169#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 12170#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 12171#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 12172#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 12173#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 12174#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 12175#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 12176#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 12177#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 12178#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 12179#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 12180#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 12181#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 12182#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 12183#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 12184#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 12185#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 12186#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 12187#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 12188#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 12189#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 12190#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 12191#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 12192#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 12193#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 12194#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 12195#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 12196#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 12197#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 12198#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 12199#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 12200#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 12201#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 12202#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 12203#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 12204#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 12205#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 12206#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 12207#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 12208#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 12209#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 12210#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 12211#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 12212#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 12213#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 12214#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 12215#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 12216#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 12217#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 12218#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 12219#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 12220#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 12221#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 12222#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 12223#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 12224#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 12225#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 12226#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 12227#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 12228#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 12229#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 12230#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 12231#(<= ULTIMATE.start_main_~x~4 64), 12232#(<= ULTIMATE.start_main_~x~4 65)] [2018-07-23 13:41:15,062 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 13:41:15,062 INFO L450 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-23 13:41:15,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-23 13:41:15,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=4294, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 13:41:15,063 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-07-23 13:41:15,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:15,481 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-23 13:41:15,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-23 13:41:15,481 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-07-23 13:41:15,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:15,482 INFO L225 Difference]: With dead ends: 72 [2018-07-23 13:41:15,482 INFO L226 Difference]: Without dead ends: 70 [2018-07-23 13:41:15,482 INFO L575 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 13:41:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-23 13:41:15,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-23 13:41:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-23 13:41:15,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-07-23 13:41:15,487 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-07-23 13:41:15,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:15,487 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-07-23 13:41:15,487 INFO L472 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-23 13:41:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-07-23 13:41:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-23 13:41:15,488 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:15,488 INFO L357 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-07-23 13:41:15,488 INFO L414 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:15,488 INFO L82 PathProgramCache]: Analyzing trace with hash -2073291769, now seen corresponding path program 66 times [2018-07-23 13:41:15,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:15,888 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 13:41:15,888 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:15,888 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-23 13:41:15,889 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:15,889 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 13:41:15,889 INFO L185 omatonBuilderFactory]: Interpolants [12544#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 12545#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 12546#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 12547#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 12548#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 12549#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 12550#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 12551#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 12552#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 12553#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 12554#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 12555#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 12556#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 12557#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 12558#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 12559#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 12560#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 12561#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 12562#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 12563#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 12564#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 12565#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 12566#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 12567#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 12568#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 12569#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 12570#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 12571#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 12572#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 12573#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 12574#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 12575#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 12576#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 12577#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 12578#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 12579#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 12580#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 12581#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 12582#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 12583#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 12584#(<= ULTIMATE.start_main_~x~4 65), 12585#(<= ULTIMATE.start_main_~x~4 66), 12517#true, 12518#false, 12519#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 12520#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 12521#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 12522#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 12523#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 12524#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 12525#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 12526#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 12527#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 12528#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 12529#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 12530#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 12531#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 12532#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 12533#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 12534#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 12535#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 12536#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 12537#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 12538#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 12539#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 12540#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 12541#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 12542#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 12543#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4))] [2018-07-23 13:41:15,890 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 13:41:15,890 INFO L450 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-23 13:41:15,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-23 13:41:15,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=4426, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 13:41:15,891 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-07-23 13:41:16,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:16,379 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-23 13:41:16,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-23 13:41:16,380 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-07-23 13:41:16,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:16,381 INFO L225 Difference]: With dead ends: 73 [2018-07-23 13:41:16,381 INFO L226 Difference]: Without dead ends: 71 [2018-07-23 13:41:16,382 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=266, Invalid=4426, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 13:41:16,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-23 13:41:16,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-23 13:41:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-23 13:41:16,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-23 13:41:16,387 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-07-23 13:41:16,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:16,387 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-23 13:41:16,387 INFO L472 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-23 13:41:16,388 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-23 13:41:16,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-23 13:41:16,388 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:16,388 INFO L357 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-07-23 13:41:16,389 INFO L414 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:16,389 INFO L82 PathProgramCache]: Analyzing trace with hash 152476861, now seen corresponding path program 67 times [2018-07-23 13:41:16,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:16,733 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 13:41:16,734 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:16,734 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-23 13:41:16,734 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:16,735 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 13:41:16,735 INFO L185 omatonBuilderFactory]: Interpolants [12928#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 12929#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 12930#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 12931#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 12932#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 12933#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 12934#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 12935#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 12936#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 12937#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 12938#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 12939#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 12940#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 12941#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 12942#(<= ULTIMATE.start_main_~x~4 66), 12943#(<= ULTIMATE.start_main_~x~4 67), 12874#true, 12875#false, 12876#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 12877#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 12878#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 12879#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 12880#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 12881#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 12882#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 12883#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 12884#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 12885#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 12886#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 12887#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 12888#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 12889#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 12890#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 12891#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 12892#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 12893#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 12894#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 12895#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 12896#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 12897#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 12898#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 12899#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 12900#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 12901#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 12902#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 12903#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 12904#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 12905#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 12906#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 12907#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 12908#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 12909#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 12910#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 12911#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 12912#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 12913#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 12914#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 12915#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 12916#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 12917#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 12918#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 12919#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 12920#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 12921#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 12922#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 12923#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 12924#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 12925#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 12926#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 12927#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51))] [2018-07-23 13:41:16,735 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 13:41:16,736 INFO L450 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-23 13:41:16,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-23 13:41:16,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=4560, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 13:41:16,737 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-07-23 13:41:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:17,129 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-07-23 13:41:17,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-23 13:41:17,129 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-07-23 13:41:17,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:17,130 INFO L225 Difference]: With dead ends: 74 [2018-07-23 13:41:17,130 INFO L226 Difference]: Without dead ends: 72 [2018-07-23 13:41:17,131 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=270, Invalid=4560, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 13:41:17,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-23 13:41:17,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-23 13:41:17,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-23 13:41:17,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-23 13:41:17,136 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-07-23 13:41:17,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:17,136 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-23 13:41:17,136 INFO L472 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-23 13:41:17,137 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-23 13:41:17,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-23 13:41:17,137 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:17,137 INFO L357 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-07-23 13:41:17,137 INFO L414 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:17,138 INFO L82 PathProgramCache]: Analyzing trace with hash 431827655, now seen corresponding path program 68 times [2018-07-23 13:41:17,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:17,499 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 13:41:17,499 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:17,499 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-23 13:41:17,499 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:17,500 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 13:41:17,500 INFO L185 omatonBuilderFactory]: Interpolants [13236#true, 13237#false, 13238#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 13239#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 13240#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 13241#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 13242#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 13243#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 13244#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 13245#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 13246#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 13247#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 13248#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 13249#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 13250#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 13251#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 13252#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 13253#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 13254#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 13255#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 13256#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 13257#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 13258#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 13259#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 13260#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 13261#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 13262#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 13263#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 13264#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 13265#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 13266#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 13267#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 13268#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 13269#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 13270#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 13271#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 13272#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 13273#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 13274#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 13275#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 13276#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 13277#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 13278#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 13279#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 13280#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 13281#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 13282#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 13283#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 13284#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 13285#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 13286#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 13287#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 13288#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 13289#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 13290#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 13291#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 13292#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 13293#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 13294#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 13295#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 13296#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 13297#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 13298#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 13299#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 13300#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 13301#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 13302#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 13303#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 13304#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 13305#(<= ULTIMATE.start_main_~x~4 67), 13306#(<= ULTIMATE.start_main_~x~4 68)] [2018-07-23 13:41:17,501 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 13:41:17,501 INFO L450 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-23 13:41:17,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-23 13:41:17,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=4696, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 13:41:17,502 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-07-23 13:41:17,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:17,842 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-23 13:41:17,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-23 13:41:17,843 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-07-23 13:41:17,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:17,843 INFO L225 Difference]: With dead ends: 75 [2018-07-23 13:41:17,843 INFO L226 Difference]: Without dead ends: 73 [2018-07-23 13:41:17,844 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=274, Invalid=4696, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 13:41:17,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-23 13:41:17,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-23 13:41:17,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-23 13:41:17,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-23 13:41:17,848 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-07-23 13:41:17,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:17,848 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-23 13:41:17,848 INFO L472 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-23 13:41:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-23 13:41:17,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-23 13:41:17,849 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:17,849 INFO L357 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-07-23 13:41:17,849 INFO L414 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:17,849 INFO L82 PathProgramCache]: Analyzing trace with hash 501767677, now seen corresponding path program 69 times [2018-07-23 13:41:17,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:18,253 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 13:41:18,253 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:18,253 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-23 13:41:18,254 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:18,254 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 13:41:18,254 INFO L185 omatonBuilderFactory]: Interpolants [13603#true, 13604#false, 13605#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 13606#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 13607#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 13608#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 13609#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 13610#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 13611#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 13612#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 13613#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 13614#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 13615#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 13616#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 13617#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 13618#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 13619#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 13620#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 13621#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 13622#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 13623#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 13624#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 13625#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 13626#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 13627#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 13628#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 13629#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 13630#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 13631#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 13632#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 13633#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 13634#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 13635#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 13636#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 13637#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 13638#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 13639#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 13640#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 13641#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 13642#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 13643#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 13644#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 13645#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 13646#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 13647#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 13648#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 13649#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 13650#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 13651#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 13652#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 13653#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 13654#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 13655#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 13656#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 13657#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 13658#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 13659#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 13660#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 13661#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 13662#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 13663#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 13664#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 13665#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 13666#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 13667#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 13668#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 13669#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 13670#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 13671#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 13672#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 13673#(<= ULTIMATE.start_main_~x~4 68), 13674#(<= ULTIMATE.start_main_~x~4 69)] [2018-07-23 13:41:18,255 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 13:41:18,255 INFO L450 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-23 13:41:18,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-23 13:41:18,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=4834, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 13:41:18,256 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-07-23 13:41:18,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:18,747 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-07-23 13:41:18,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-23 13:41:18,747 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-07-23 13:41:18,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:18,748 INFO L225 Difference]: With dead ends: 76 [2018-07-23 13:41:18,748 INFO L226 Difference]: Without dead ends: 74 [2018-07-23 13:41:18,748 INFO L575 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 13:41:18,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-23 13:41:18,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-23 13:41:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-23 13:41:18,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-23 13:41:18,753 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-07-23 13:41:18,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:18,753 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-23 13:41:18,753 INFO L472 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-23 13:41:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-23 13:41:18,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-23 13:41:18,754 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:18,754 INFO L357 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-07-23 13:41:18,755 INFO L414 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:18,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1625058937, now seen corresponding path program 70 times [2018-07-23 13:41:18,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:19,124 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 13:41:19,125 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:19,125 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-23 13:41:19,125 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:19,125 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 13:41:19,125 INFO L185 omatonBuilderFactory]: Interpolants [13975#true, 13976#false, 13977#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 13978#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 13979#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 13980#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 13981#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 13982#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 13983#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 13984#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 13985#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 13986#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 13987#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 13988#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 13989#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 13990#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 13991#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 13992#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 13993#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 13994#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 13995#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 13996#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 13997#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 13998#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 13999#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 14000#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 14001#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 14002#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 14003#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 14004#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 14005#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 14006#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 14007#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 14008#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 14009#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 14010#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 14011#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 14012#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 14013#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 14014#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 14015#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 14016#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 14017#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 14018#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 14019#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 14020#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 14021#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 14022#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 14023#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 14024#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 14025#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 14026#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 14027#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 14028#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 14029#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 14030#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 14031#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 14032#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 14033#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 14034#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 14035#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 14036#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 14037#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 14038#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 14039#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 14040#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 14041#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 14042#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 14043#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 14044#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 14045#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 14046#(<= ULTIMATE.start_main_~x~4 69), 14047#(<= ULTIMATE.start_main_~x~4 70)] [2018-07-23 13:41:19,126 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 13:41:19,126 INFO L450 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-23 13:41:19,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-23 13:41:19,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=4974, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 13:41:19,127 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-07-23 13:41:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:19,531 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-23 13:41:19,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-23 13:41:19,531 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-07-23 13:41:19,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:19,532 INFO L225 Difference]: With dead ends: 77 [2018-07-23 13:41:19,532 INFO L226 Difference]: Without dead ends: 75 [2018-07-23 13:41:19,533 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=282, Invalid=4974, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 13:41:19,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-23 13:41:19,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-23 13:41:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-23 13:41:19,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-23 13:41:19,540 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-07-23 13:41:19,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:19,540 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-23 13:41:19,540 INFO L472 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-23 13:41:19,540 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-23 13:41:19,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-23 13:41:19,541 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:19,541 INFO L357 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-07-23 13:41:19,541 INFO L414 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:19,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1162792765, now seen corresponding path program 71 times [2018-07-23 13:41:19,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:19,994 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 13:41:19,995 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:19,995 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-23 13:41:19,995 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:19,995 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 13:41:19,996 INFO L185 omatonBuilderFactory]: Interpolants [14352#true, 14353#false, 14354#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 14355#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 14356#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 14357#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 14358#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 14359#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 14360#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 14361#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 14362#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 14363#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 14364#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 14365#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 14366#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 14367#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 14368#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 14369#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 14370#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 14371#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 14372#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 14373#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 14374#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 14375#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 14376#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 14377#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 14378#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 14379#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 14380#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 14381#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 14382#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 14383#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 14384#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 14385#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 14386#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 14387#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 14388#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 14389#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 14390#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 14391#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 14392#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 14393#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 14394#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 14395#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 14396#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 14397#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 14398#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 14399#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 14400#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 14401#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 14402#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 14403#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 14404#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 14405#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 14406#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 14407#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 14408#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 14409#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 14410#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 14411#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 14412#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 14413#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 14414#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 14415#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 14416#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 14417#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 14418#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 14419#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 14420#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 14421#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 14422#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 14423#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 14424#(<= ULTIMATE.start_main_~x~4 70), 14425#(<= ULTIMATE.start_main_~x~4 71)] [2018-07-23 13:41:19,997 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 13:41:19,997 INFO L450 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-23 13:41:19,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-23 13:41:19,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=5116, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 13:41:19,998 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-07-23 13:41:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:20,455 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-23 13:41:20,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-23 13:41:20,455 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-07-23 13:41:20,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:20,455 INFO L225 Difference]: With dead ends: 78 [2018-07-23 13:41:20,456 INFO L226 Difference]: Without dead ends: 76 [2018-07-23 13:41:20,456 INFO L575 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 13:41:20,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-23 13:41:20,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-23 13:41:20,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-23 13:41:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-23 13:41:20,461 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-07-23 13:41:20,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:20,462 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-23 13:41:20,462 INFO L472 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-23 13:41:20,462 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-23 13:41:20,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-23 13:41:20,463 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:20,463 INFO L357 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-07-23 13:41:20,463 INFO L414 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:20,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1686849607, now seen corresponding path program 72 times [2018-07-23 13:41:20,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:20,859 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 13:41:20,859 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:20,859 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-23 13:41:20,860 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:20,860 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 13:41:20,860 INFO L185 omatonBuilderFactory]: Interpolants [14734#true, 14735#false, 14736#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 14737#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 14738#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 14739#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 14740#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 14741#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 14742#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 14743#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 14744#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 14745#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 14746#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 14747#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 14748#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 14749#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 14750#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 14751#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 14752#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 14753#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 14754#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 14755#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 14756#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 14757#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 14758#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 14759#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 14760#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 14761#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 14762#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 14763#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 14764#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 14765#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 14766#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 14767#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 14768#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 14769#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 14770#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 14771#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 14772#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 14773#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 14774#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 14775#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 14776#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 14777#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 14778#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 14779#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 14780#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 14781#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 14782#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 14783#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 14784#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 14785#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 14786#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 14787#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 14788#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 14789#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 14790#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 14791#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 14792#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 14793#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 14794#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 14795#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 14796#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 14797#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 14798#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 14799#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 14800#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 14801#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 14802#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 14803#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 14804#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 14805#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 14806#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 14807#(<= ULTIMATE.start_main_~x~4 71), 14808#(<= ULTIMATE.start_main_~x~4 72)] [2018-07-23 13:41:20,861 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 13:41:20,861 INFO L450 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-23 13:41:20,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-23 13:41:20,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=5260, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 13:41:20,862 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-07-23 13:41:21,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:21,255 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-23 13:41:21,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-23 13:41:21,255 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-07-23 13:41:21,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:21,256 INFO L225 Difference]: With dead ends: 79 [2018-07-23 13:41:21,256 INFO L226 Difference]: Without dead ends: 77 [2018-07-23 13:41:21,257 INFO L575 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 13:41:21,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-23 13:41:21,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-23 13:41:21,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-23 13:41:21,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-23 13:41:21,261 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-07-23 13:41:21,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:21,261 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-23 13:41:21,261 INFO L472 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-23 13:41:21,261 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-23 13:41:21,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-23 13:41:21,262 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:21,262 INFO L357 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-07-23 13:41:21,263 INFO L414 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:21,263 INFO L82 PathProgramCache]: Analyzing trace with hash 752742525, now seen corresponding path program 73 times [2018-07-23 13:41:21,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:21,625 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 13:41:21,625 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:21,625 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-23 13:41:21,626 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:21,626 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 13:41:21,626 INFO L185 omatonBuilderFactory]: Interpolants [15121#true, 15122#false, 15123#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 15124#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 15125#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 15126#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 15127#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 15128#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 15129#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 15130#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 15131#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 15132#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 15133#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 15134#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 15135#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 15136#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 15137#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 15138#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 15139#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 15140#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 15141#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 15142#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 15143#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 15144#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 15145#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 15146#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 15147#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 15148#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 15149#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 15150#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 15151#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 15152#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 15153#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 15154#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 15155#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 15156#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 15157#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 15158#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 15159#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 15160#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 15161#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 15162#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 15163#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 15164#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 15165#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 15166#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 15167#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 15168#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 15169#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 15170#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 15171#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 15172#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 15173#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 15174#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 15175#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 15176#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 15177#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 15178#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 15179#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 15180#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 15181#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 15182#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 15183#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 15184#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 15185#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 15186#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 15187#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 15188#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 15189#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 15190#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 15191#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 15192#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 15193#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 15194#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 15195#(<= ULTIMATE.start_main_~x~4 72), 15196#(<= ULTIMATE.start_main_~x~4 73)] [2018-07-23 13:41:21,627 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 13:41:21,627 INFO L450 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-23 13:41:21,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-23 13:41:21,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=5406, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 13:41:21,628 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-07-23 13:41:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:22,004 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-23 13:41:22,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-23 13:41:22,004 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-07-23 13:41:22,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:22,005 INFO L225 Difference]: With dead ends: 80 [2018-07-23 13:41:22,005 INFO L226 Difference]: Without dead ends: 78 [2018-07-23 13:41:22,005 INFO L575 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 13:41:22,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-23 13:41:22,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-23 13:41:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-23 13:41:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-07-23 13:41:22,010 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-07-23 13:41:22,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:22,010 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-07-23 13:41:22,010 INFO L472 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-23 13:41:22,010 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-07-23 13:41:22,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-23 13:41:22,011 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:22,011 INFO L357 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-07-23 13:41:22,011 INFO L414 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:22,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1860194055, now seen corresponding path program 74 times [2018-07-23 13:41:22,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:22,478 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 13:41:22,478 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:22,478 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-23 13:41:22,479 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:22,479 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 13:41:22,479 INFO L185 omatonBuilderFactory]: Interpolants [15513#true, 15514#false, 15515#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 15516#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 15517#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 15518#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 15519#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 15520#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 15521#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 15522#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 15523#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 15524#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 15525#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 15526#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 15527#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 15528#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 15529#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 15530#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 15531#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 15532#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 15533#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 15534#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 15535#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 15536#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 15537#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 15538#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 15539#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 15540#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 15541#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 15542#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 15543#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 15544#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 15545#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 15546#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 15547#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 15548#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 15549#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 15550#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 15551#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 15552#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 15553#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 15554#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 15555#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 15556#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 15557#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 15558#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 15559#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 15560#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 15561#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 15562#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 15563#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 15564#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 15565#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 15566#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 15567#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 15568#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 15569#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 15570#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 15571#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 15572#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 15573#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 15574#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 15575#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 15576#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 15577#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 15578#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 15579#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 15580#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 15581#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 15582#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 15583#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 15584#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 15585#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 15586#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 15587#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 15588#(<= ULTIMATE.start_main_~x~4 73), 15589#(<= ULTIMATE.start_main_~x~4 74)] [2018-07-23 13:41:22,480 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 13:41:22,480 INFO L450 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-23 13:41:22,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-23 13:41:22,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=5554, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 13:41:22,481 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-07-23 13:41:23,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:23,050 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-23 13:41:23,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-23 13:41:23,050 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-07-23 13:41:23,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:23,051 INFO L225 Difference]: With dead ends: 81 [2018-07-23 13:41:23,051 INFO L226 Difference]: Without dead ends: 79 [2018-07-23 13:41:23,052 INFO L575 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 13:41:23,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-23 13:41:23,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-23 13:41:23,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-23 13:41:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-23 13:41:23,059 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-07-23 13:41:23,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:23,059 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-23 13:41:23,060 INFO L472 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-23 13:41:23,060 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-23 13:41:23,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-23 13:41:23,060 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:23,060 INFO L357 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-07-23 13:41:23,060 INFO L414 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:23,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1831453117, now seen corresponding path program 75 times [2018-07-23 13:41:23,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:23,582 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 13:41:23,582 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:23,582 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-23 13:41:23,583 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:23,583 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 13:41:23,584 INFO L185 omatonBuilderFactory]: Interpolants [15910#true, 15911#false, 15912#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 15913#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 15914#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 15915#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 15916#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 15917#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 15918#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 15919#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 15920#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 15921#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 15922#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 15923#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 15924#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 15925#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 15926#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 15927#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 15928#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 15929#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 15930#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 15931#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 15932#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 15933#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 15934#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 15935#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 15936#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 15937#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 15938#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 15939#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 15940#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 15941#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 15942#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 15943#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 15944#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 15945#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 15946#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 15947#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 15948#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 15949#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 15950#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 15951#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 15952#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 15953#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 15954#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 15955#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 15956#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 15957#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 15958#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 15959#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 15960#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 15961#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 15962#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 15963#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 15964#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 15965#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 15966#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 15967#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 15968#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 15969#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 15970#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 15971#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 15972#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 15973#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 15974#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 15975#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 15976#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 15977#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 15978#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 15979#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 15980#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 15981#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 15982#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 15983#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 15984#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 15985#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 15986#(<= ULTIMATE.start_main_~x~4 74), 15987#(<= ULTIMATE.start_main_~x~4 75)] [2018-07-23 13:41:23,584 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 13:41:23,584 INFO L450 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-23 13:41:23,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-23 13:41:23,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=5704, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 13:41:23,585 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-07-23 13:41:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:24,048 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-07-23 13:41:24,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-23 13:41:24,048 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-07-23 13:41:24,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:24,048 INFO L225 Difference]: With dead ends: 82 [2018-07-23 13:41:24,048 INFO L226 Difference]: Without dead ends: 80 [2018-07-23 13:41:24,049 INFO L575 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 13:41:24,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-23 13:41:24,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-23 13:41:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-23 13:41:24,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-23 13:41:24,054 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-07-23 13:41:24,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:24,055 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-23 13:41:24,055 INFO L472 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-23 13:41:24,055 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-23 13:41:24,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-23 13:41:24,058 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:24,058 INFO L357 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-07-23 13:41:24,058 INFO L414 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:24,058 INFO L82 PathProgramCache]: Analyzing trace with hash 940484039, now seen corresponding path program 76 times [2018-07-23 13:41:24,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:24,433 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 13:41:24,433 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:24,433 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-23 13:41:24,434 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:24,434 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 13:41:24,434 INFO L185 omatonBuilderFactory]: Interpolants [16384#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 16385#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 16386#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 16387#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 16388#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 16389#(<= ULTIMATE.start_main_~x~4 75), 16390#(<= ULTIMATE.start_main_~x~4 76), 16312#true, 16313#false, 16314#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 16315#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 16316#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 16317#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 16318#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 16319#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 16320#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 16321#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 16322#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 16323#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 16324#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 16325#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 16326#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 16327#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 16328#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 16329#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 16330#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 16331#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 16332#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 16333#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 16334#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 16335#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 16336#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 16337#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 16338#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 16339#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 16340#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 16341#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 16342#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 16343#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 16344#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 16345#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 16346#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 16347#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 16348#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 16349#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 16350#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 16351#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 16352#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 16353#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 16354#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 16355#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 16356#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 16357#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 16358#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 16359#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 16360#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 16361#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 16362#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 16363#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 16364#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 16365#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 16366#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 16367#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 16368#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 16369#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 16370#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 16371#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 16372#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 16373#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 16374#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 16375#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 16376#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 16377#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 16378#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 16379#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 16380#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 16381#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 16382#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 16383#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69))] [2018-07-23 13:41:24,434 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 13:41:24,435 INFO L450 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-23 13:41:24,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-23 13:41:24,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=5856, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 13:41:24,436 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-07-23 13:41:24,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:24,833 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-23 13:41:24,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-23 13:41:24,833 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-07-23 13:41:24,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:24,834 INFO L225 Difference]: With dead ends: 83 [2018-07-23 13:41:24,834 INFO L226 Difference]: Without dead ends: 81 [2018-07-23 13:41:24,835 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=306, Invalid=5856, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 13:41:24,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-23 13:41:24,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-23 13:41:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-23 13:41:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-23 13:41:24,839 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-07-23 13:41:24,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:24,839 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-23 13:41:24,840 INFO L472 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-23 13:41:24,840 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-23 13:41:24,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-23 13:41:24,840 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:24,840 INFO L357 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-07-23 13:41:24,840 INFO L414 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:24,841 INFO L82 PathProgramCache]: Analyzing trace with hash -909753603, now seen corresponding path program 77 times [2018-07-23 13:41:24,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:25,238 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 13:41:25,239 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:25,239 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-23 13:41:25,239 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:25,239 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 13:41:25,240 INFO L185 omatonBuilderFactory]: Interpolants [16768#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 16769#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 16770#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 16771#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 16772#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 16773#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 16774#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 16775#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 16776#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 16777#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 16778#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 16779#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 16780#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 16781#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 16782#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 16783#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 16784#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 16785#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 16786#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 16787#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 16788#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 16789#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 16790#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 16791#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 16792#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 16793#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 16794#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 16795#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 16796#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 16797#(<= ULTIMATE.start_main_~x~4 76), 16798#(<= ULTIMATE.start_main_~x~4 77), 16719#true, 16720#false, 16721#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 16722#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 16723#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 16724#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 16725#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 16726#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 16727#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 16728#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 16729#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 16730#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 16731#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 16732#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 16733#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 16734#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 16735#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 16736#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 16737#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 16738#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 16739#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 16740#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 16741#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 16742#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 16743#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 16744#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 16745#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 16746#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 16747#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 16748#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 16749#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 16750#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 16751#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 16752#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 16753#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 16754#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 16755#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 16756#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 16757#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 16758#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 16759#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 16760#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 16761#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 16762#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 16763#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 16764#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 16765#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 16766#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 16767#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4))] [2018-07-23 13:41:25,240 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 13:41:25,240 INFO L450 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-23 13:41:25,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-23 13:41:25,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=6010, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 13:41:25,241 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-07-23 13:41:25,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:25,651 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-23 13:41:25,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-23 13:41:25,651 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-07-23 13:41:25,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:25,652 INFO L225 Difference]: With dead ends: 84 [2018-07-23 13:41:25,652 INFO L226 Difference]: Without dead ends: 82 [2018-07-23 13:41:25,652 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=310, Invalid=6010, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 13:41:25,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-23 13:41:25,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-07-23 13:41:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-23 13:41:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-07-23 13:41:25,656 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-07-23 13:41:25,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:25,656 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-07-23 13:41:25,656 INFO L472 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-23 13:41:25,656 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-07-23 13:41:25,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-23 13:41:25,657 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:25,657 INFO L357 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-07-23 13:41:25,657 INFO L414 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:25,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1862421639, now seen corresponding path program 78 times [2018-07-23 13:41:25,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:26,028 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 13:41:26,029 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:26,029 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-23 13:41:26,029 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:26,029 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 13:41:26,030 INFO L185 omatonBuilderFactory]: Interpolants [17152#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 17153#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 17154#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 17155#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 17156#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 17157#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 17158#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 17159#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 17160#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 17161#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 17162#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 17163#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 17164#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 17165#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 17166#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 17167#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 17168#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 17169#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 17170#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 17171#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 17172#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 17173#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 17174#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 17175#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 17176#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 17177#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 17178#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 17179#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 17180#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 17181#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 17182#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 17183#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 17184#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 17185#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 17186#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 17187#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 17188#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 17189#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 17190#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 17191#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 17192#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 17193#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 17194#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 17195#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 17196#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 17197#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 17198#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 17199#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 17200#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 17201#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 17202#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 17203#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 17204#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 17205#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 17206#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 17207#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 17208#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 17209#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 17210#(<= ULTIMATE.start_main_~x~4 77), 17211#(<= ULTIMATE.start_main_~x~4 78), 17131#true, 17132#false, 17133#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 17134#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 17135#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 17136#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 17137#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 17138#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 17139#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 17140#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 17141#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 17142#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 17143#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 17144#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 17145#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 17146#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 17147#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 17148#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 17149#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 17150#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 17151#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18))] [2018-07-23 13:41:26,030 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 13:41:26,030 INFO L450 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-23 13:41:26,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-23 13:41:26,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=6166, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 13:41:26,031 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-07-23 13:41:26,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:26,458 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-23 13:41:26,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-23 13:41:26,458 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-07-23 13:41:26,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:26,459 INFO L225 Difference]: With dead ends: 85 [2018-07-23 13:41:26,459 INFO L226 Difference]: Without dead ends: 83 [2018-07-23 13:41:26,460 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=314, Invalid=6166, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 13:41:26,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-23 13:41:26,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-23 13:41:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-23 13:41:26,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-23 13:41:26,466 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-07-23 13:41:26,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:26,466 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-23 13:41:26,466 INFO L472 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-23 13:41:26,466 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-23 13:41:26,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-23 13:41:26,467 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:26,467 INFO L357 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-07-23 13:41:26,467 INFO L414 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:26,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1900508221, now seen corresponding path program 79 times [2018-07-23 13:41:26,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:26,948 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 13:41:26,948 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:26,948 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-23 13:41:26,948 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:26,948 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 13:41:26,949 INFO L185 omatonBuilderFactory]: Interpolants [17548#true, 17549#false, 17550#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 17551#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 17552#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 17553#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 17554#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 17555#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 17556#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 17557#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 17558#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 17559#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 17560#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 17561#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 17562#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 17563#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 17564#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 17565#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 17566#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 17567#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 17568#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 17569#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 17570#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 17571#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 17572#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 17573#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 17574#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 17575#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 17576#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 17577#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 17578#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 17579#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 17580#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 17581#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 17582#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 17583#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 17584#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 17585#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 17586#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 17587#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 17588#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 17589#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 17590#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 17591#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 17592#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 17593#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 17594#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 17595#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 17596#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 17597#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 17598#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 17599#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 17600#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 17601#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 17602#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 17603#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 17604#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 17605#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 17606#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 17607#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 17608#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 17609#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 17610#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 17611#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 17612#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 17613#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 17614#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 17615#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 17616#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 17617#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 17618#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 17619#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 17620#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 17621#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 17622#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 17623#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 17624#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 17625#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 17626#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 17627#(and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4)), 17628#(<= ULTIMATE.start_main_~x~4 78), 17629#(<= ULTIMATE.start_main_~x~4 79)] [2018-07-23 13:41:26,949 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 13:41:26,949 INFO L450 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-23 13:41:26,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-23 13:41:26,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=6324, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 13:41:26,950 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-07-23 13:41:27,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:27,359 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-07-23 13:41:27,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-23 13:41:27,359 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-07-23 13:41:27,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:27,360 INFO L225 Difference]: With dead ends: 86 [2018-07-23 13:41:27,360 INFO L226 Difference]: Without dead ends: 84 [2018-07-23 13:41:27,361 INFO L575 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 13:41:27,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-23 13:41:27,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-07-23 13:41:27,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-23 13:41:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-07-23 13:41:27,364 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-07-23 13:41:27,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:27,365 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-07-23 13:41:27,365 INFO L472 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-23 13:41:27,365 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-07-23 13:41:27,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-23 13:41:27,365 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:27,365 INFO L357 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-07-23 13:41:27,365 INFO L414 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:27,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1213775033, now seen corresponding path program 80 times [2018-07-23 13:41:27,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:27,734 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 13:41:27,735 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:27,735 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-23 13:41:27,735 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:27,735 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 13:41:27,735 INFO L185 omatonBuilderFactory]: Interpolants [18048#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 18049#(and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4)), 18050#(and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)), 18051#(<= ULTIMATE.start_main_~x~4 79), 18052#(<= ULTIMATE.start_main_~x~4 80), 17970#true, 17971#false, 17972#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 17973#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 17974#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 17975#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 17976#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 17977#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 17978#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 17979#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 17980#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 17981#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 17982#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 17983#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 17984#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 17985#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 17986#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 17987#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 17988#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 17989#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 17990#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 17991#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 17992#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 17993#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 17994#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 17995#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 17996#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 17997#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 17998#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 17999#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 18000#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 18001#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 18002#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 18003#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 18004#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 18005#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 18006#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 18007#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 18008#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 18009#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 18010#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 18011#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 18012#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 18013#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 18014#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 18015#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 18016#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 18017#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 18018#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 18019#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 18020#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 18021#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 18022#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 18023#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 18024#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 18025#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 18026#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 18027#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 18028#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 18029#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 18030#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 18031#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 18032#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 18033#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 18034#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 18035#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 18036#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 18037#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 18038#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 18039#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 18040#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 18041#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 18042#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 18043#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 18044#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 18045#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 18046#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 18047#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4))] [2018-07-23 13:41:27,736 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 13:41:27,736 INFO L450 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-23 13:41:27,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-23 13:41:27,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=6484, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 13:41:27,737 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-07-23 13:41:28,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:28,199 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-23 13:41:28,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-23 13:41:28,199 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-07-23 13:41:28,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:28,200 INFO L225 Difference]: With dead ends: 87 [2018-07-23 13:41:28,200 INFO L226 Difference]: Without dead ends: 85 [2018-07-23 13:41:28,201 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=322, Invalid=6484, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 13:41:28,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-23 13:41:28,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-23 13:41:28,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-23 13:41:28,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-23 13:41:28,206 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-07-23 13:41:28,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:28,206 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-23 13:41:28,206 INFO L472 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-23 13:41:28,206 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-23 13:41:28,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-23 13:41:28,207 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:28,207 INFO L357 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-07-23 13:41:28,207 INFO L414 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:28,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1027691901, now seen corresponding path program 81 times [2018-07-23 13:41:28,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:28,575 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 13:41:28,575 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:28,575 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-23 13:41:28,576 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:28,576 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 13:41:28,576 INFO L185 omatonBuilderFactory]: Interpolants [18432#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 18433#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 18434#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 18435#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 18436#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 18437#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 18438#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 18439#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 18440#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 18441#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 18442#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 18443#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 18444#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 18445#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 18446#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 18447#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 18448#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 18449#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 18450#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 18451#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 18452#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 18453#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 18454#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 18455#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 18456#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 18457#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 18458#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 18459#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 18460#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 18461#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 18462#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 18463#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 18464#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 18465#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 18466#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 18467#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 18468#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 18469#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 18470#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 18471#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 18472#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 18473#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 18474#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 18475#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 18476#(and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4)), 18477#(and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)), 18478#(and (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79)), 18479#(<= ULTIMATE.start_main_~x~4 80), 18480#(<= ULTIMATE.start_main_~x~4 81), 18397#true, 18398#false, 18399#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 18400#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 18401#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 18402#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 18403#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 18404#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 18405#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 18406#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 18407#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 18408#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 18409#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 18410#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 18411#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 18412#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 18413#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 18414#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 18415#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 18416#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 18417#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 18418#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 18419#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 18420#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 18421#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 18422#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 18423#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 18424#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 18425#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 18426#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 18427#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 18428#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 18429#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 18430#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 18431#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4))] [2018-07-23 13:41:28,576 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 13:41:28,577 INFO L450 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-23 13:41:28,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-23 13:41:28,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=6646, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 13:41:28,577 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-07-23 13:41:29,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:29,036 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-07-23 13:41:29,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-23 13:41:29,036 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-07-23 13:41:29,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:29,037 INFO L225 Difference]: With dead ends: 88 [2018-07-23 13:41:29,037 INFO L226 Difference]: Without dead ends: 86 [2018-07-23 13:41:29,037 INFO L575 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 13:41:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-23 13:41:29,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-23 13:41:29,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-23 13:41:29,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-23 13:41:29,042 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-07-23 13:41:29,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:29,042 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-23 13:41:29,042 INFO L472 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-23 13:41:29,042 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-23 13:41:29,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-23 13:41:29,043 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:29,043 INFO L357 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-07-23 13:41:29,043 INFO L414 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:29,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1793690119, now seen corresponding path program 82 times [2018-07-23 13:41:29,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:29,442 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 13:41:29,443 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:29,443 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-23 13:41:29,443 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:29,443 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 13:41:29,444 INFO L185 omatonBuilderFactory]: Interpolants [18829#true, 18830#false, 18831#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 18832#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 18833#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 18834#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 18835#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 18836#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 18837#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 18838#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 18839#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 18840#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 18841#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 18842#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 18843#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 18844#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 18845#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 18846#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 18847#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 18848#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 18849#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 18850#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 18851#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 18852#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 18853#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 18854#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 18855#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 18856#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 18857#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 18858#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 18859#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 18860#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 18861#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 18862#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 18863#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 18864#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 18865#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 18866#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 18867#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 18868#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 18869#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 18870#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 18871#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 18872#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 18873#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 18874#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 18875#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 18876#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 18877#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 18878#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 18879#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 18880#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 18881#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 18882#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 18883#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 18884#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 18885#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 18886#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 18887#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 18888#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 18889#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 18890#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 18891#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 18892#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 18893#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 18894#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 18895#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 18896#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 18897#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 18898#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 18899#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 18900#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 18901#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 18902#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 18903#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 18904#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 18905#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 18906#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 18907#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 18908#(and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4)), 18909#(and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)), 18910#(and (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79)), 18911#(and (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4)), 18912#(<= ULTIMATE.start_main_~x~4 81), 18913#(<= ULTIMATE.start_main_~x~4 82)] [2018-07-23 13:41:29,444 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 13:41:29,444 INFO L450 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-23 13:41:29,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-23 13:41:29,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=6810, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 13:41:29,445 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-07-23 13:41:29,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:29,933 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-23 13:41:29,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-23 13:41:29,933 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-07-23 13:41:29,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:29,934 INFO L225 Difference]: With dead ends: 89 [2018-07-23 13:41:29,934 INFO L226 Difference]: Without dead ends: 87 [2018-07-23 13:41:29,934 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=330, Invalid=6810, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 13:41:29,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-23 13:41:29,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-23 13:41:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-23 13:41:29,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-23 13:41:29,939 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-07-23 13:41:29,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:29,939 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-23 13:41:29,940 INFO L472 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-23 13:41:29,940 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-23 13:41:29,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-23 13:41:29,940 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:29,940 INFO L357 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-07-23 13:41:29,940 INFO L414 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:29,940 INFO L82 PathProgramCache]: Analyzing trace with hash -230168899, now seen corresponding path program 83 times [2018-07-23 13:41:29,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:30,360 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 13:41:30,360 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:30,360 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-23 13:41:30,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:30,360 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 13:41:30,361 INFO L185 omatonBuilderFactory]: Interpolants [19328#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 19329#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 19330#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 19331#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 19332#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 19333#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 19334#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 19335#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 19336#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 19337#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 19338#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 19339#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 19340#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 19341#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 19342#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 19343#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 19344#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 19345#(and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4)), 19346#(and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)), 19347#(and (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79)), 19348#(and (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4)), 19349#(and (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4)), 19350#(<= ULTIMATE.start_main_~x~4 82), 19351#(<= ULTIMATE.start_main_~x~4 83), 19266#true, 19267#false, 19268#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 19269#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 19270#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 19271#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 19272#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 19273#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 19274#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 19275#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 19276#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 19277#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 19278#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 19279#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 19280#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 19281#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 19282#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 19283#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 19284#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 19285#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 19286#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 19287#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 19288#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 19289#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 19290#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 19291#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 19292#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 19293#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 19294#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 19295#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 19296#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 19297#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 19298#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 19299#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 19300#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 19301#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 19302#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 19303#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 19304#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 19305#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 19306#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 19307#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 19308#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 19309#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 19310#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 19311#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 19312#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 19313#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 19314#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 19315#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 19316#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 19317#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 19318#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 19319#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 19320#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 19321#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 19322#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 19323#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 19324#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 19325#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 19326#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 19327#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4))] [2018-07-23 13:41:30,361 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 13:41:30,361 INFO L450 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-23 13:41:30,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-23 13:41:30,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=6976, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 13:41:30,362 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-07-23 13:41:30,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:30,846 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-23 13:41:30,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-23 13:41:30,846 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-07-23 13:41:30,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:30,847 INFO L225 Difference]: With dead ends: 90 [2018-07-23 13:41:30,847 INFO L226 Difference]: Without dead ends: 88 [2018-07-23 13:41:30,848 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=334, Invalid=6976, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 13:41:30,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-23 13:41:30,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-07-23 13:41:30,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-23 13:41:30,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-07-23 13:41:30,853 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-07-23 13:41:30,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:30,853 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-07-23 13:41:30,853 INFO L472 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-23 13:41:30,853 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-07-23 13:41:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-23 13:41:30,853 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:30,854 INFO L357 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-07-23 13:41:30,854 INFO L414 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:30,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1454710983, now seen corresponding path program 84 times [2018-07-23 13:41:30,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:31,248 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 13:41:31,249 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:31,249 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-23 13:41:31,249 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:31,249 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 13:41:31,250 INFO L185 omatonBuilderFactory]: Interpolants [19712#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 19713#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 19714#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 19715#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 19716#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 19717#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 19718#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 19719#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 19720#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 19721#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 19722#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 19723#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 19724#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 19725#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 19726#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 19727#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 19728#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 19729#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 19730#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 19731#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 19732#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 19733#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 19734#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 19735#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 19736#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 19737#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 19738#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 19739#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 19740#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 19741#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 19742#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 19743#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 19744#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 19745#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 19746#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 19747#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 19748#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 19749#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 19750#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 19751#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 19752#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 19753#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 19754#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 19755#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 19756#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 19757#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 19758#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 19759#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 19760#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 19761#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 19762#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 19763#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 19764#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 19765#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 19766#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 19767#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 19768#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 19769#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 19770#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 19771#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 19772#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 19773#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 19774#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 19775#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 19776#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 19777#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 19778#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 19779#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 19780#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 19781#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 19782#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 19783#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 19784#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 19785#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 19786#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 19787#(and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4)), 19788#(and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)), 19789#(and (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79)), 19790#(and (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4)), 19791#(and (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4)), 19792#(and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4)), 19793#(<= ULTIMATE.start_main_~x~4 83), 19794#(<= ULTIMATE.start_main_~x~4 84), 19708#true, 19709#false, 19710#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 19711#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4))] [2018-07-23 13:41:31,250 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 13:41:31,250 INFO L450 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-23 13:41:31,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-23 13:41:31,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=7144, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 13:41:31,251 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-07-23 13:41:31,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:31,754 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-23 13:41:31,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-23 13:41:31,754 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-07-23 13:41:31,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:31,755 INFO L225 Difference]: With dead ends: 91 [2018-07-23 13:41:31,755 INFO L226 Difference]: Without dead ends: 89 [2018-07-23 13:41:31,756 INFO L575 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 13:41:31,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-23 13:41:31,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-23 13:41:31,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-23 13:41:31,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-23 13:41:31,761 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-07-23 13:41:31,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:31,761 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-23 13:41:31,761 INFO L472 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-23 13:41:31,761 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-23 13:41:31,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-23 13:41:31,762 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:31,762 INFO L357 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-07-23 13:41:31,762 INFO L414 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:31,762 INFO L82 PathProgramCache]: Analyzing trace with hash 2146379773, now seen corresponding path program 85 times [2018-07-23 13:41:31,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:32,172 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 13:41:32,172 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:32,172 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-23 13:41:32,173 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:32,173 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 13:41:32,173 INFO L185 omatonBuilderFactory]: Interpolants [20224#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 20225#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 20226#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 20227#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 20228#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 20229#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 20230#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 20231#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 20232#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 20233#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 20234#(and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4)), 20235#(and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)), 20236#(and (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79)), 20237#(and (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4)), 20238#(and (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4)), 20239#(and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4)), 20240#(and (<= 83 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 83)), 20241#(<= ULTIMATE.start_main_~x~4 84), 20242#(<= ULTIMATE.start_main_~x~4 85), 20155#true, 20156#false, 20157#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 20158#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 20159#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 20160#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 20161#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 20162#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 20163#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 20164#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 20165#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 20166#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 20167#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 20168#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 20169#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 20170#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 20171#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 20172#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 20173#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 20174#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 20175#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 20176#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 20177#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 20178#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 20179#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 20180#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 20181#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 20182#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 20183#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 20184#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 20185#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 20186#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 20187#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 20188#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 20189#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 20190#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 20191#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 20192#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 20193#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 20194#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 20195#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 20196#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 20197#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 20198#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 20199#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 20200#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 20201#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 20202#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 20203#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 20204#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 20205#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 20206#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 20207#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 20208#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 20209#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 20210#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 20211#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 20212#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 20213#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 20214#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 20215#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 20216#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 20217#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 20218#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 20219#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 20220#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 20221#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 20222#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 20223#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66))] [2018-07-23 13:41:32,173 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 13:41:32,173 INFO L450 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-23 13:41:32,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-23 13:41:32,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=7314, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 13:41:32,174 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-07-23 13:41:32,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:32,700 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-07-23 13:41:32,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-23 13:41:32,700 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-07-23 13:41:32,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:32,701 INFO L225 Difference]: With dead ends: 92 [2018-07-23 13:41:32,701 INFO L226 Difference]: Without dead ends: 90 [2018-07-23 13:41:32,702 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=342, Invalid=7314, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 13:41:32,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-23 13:41:32,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-07-23 13:41:32,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-23 13:41:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-07-23 13:41:32,707 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-07-23 13:41:32,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:32,708 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-07-23 13:41:32,708 INFO L472 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-23 13:41:32,708 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-07-23 13:41:32,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-23 13:41:32,709 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:32,709 INFO L357 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-07-23 13:41:32,709 INFO L414 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:32,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2113275783, now seen corresponding path program 86 times [2018-07-23 13:41:32,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:33,223 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 13:41:33,223 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:33,223 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-23 13:41:33,224 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:33,224 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 13:41:33,224 INFO L185 omatonBuilderFactory]: Interpolants [20608#false, 20609#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 20610#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 20611#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 20612#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 20613#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 20614#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 20615#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 20616#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 20617#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 20618#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 20619#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 20620#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 20621#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 20622#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 20623#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 20624#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 20625#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 20626#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 20627#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 20628#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 20629#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 20630#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 20631#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 20632#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 20633#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 20634#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 20635#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 20636#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 20637#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 20638#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 20639#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 20640#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 20641#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 20642#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 20643#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 20644#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 20645#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 20646#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 20647#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 20648#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 20649#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 20650#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 20651#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 20652#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 20653#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 20654#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 20655#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 20656#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 20657#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 20658#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 20659#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 20660#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 20661#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 20662#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 20663#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 20664#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 20665#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 20666#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 20667#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 20668#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 20669#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 20670#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 20671#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 20672#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 20673#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 20674#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 20675#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 20676#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 20677#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 20678#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 20679#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 20680#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 20681#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 20682#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 20683#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 20684#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 20685#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 20686#(and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4)), 20687#(and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)), 20688#(and (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79)), 20689#(and (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4)), 20690#(and (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4)), 20691#(and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4)), 20692#(and (<= 83 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 83)), 20693#(and (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~x~4)), 20694#(<= ULTIMATE.start_main_~x~4 85), 20695#(<= ULTIMATE.start_main_~x~4 86), 20607#true] [2018-07-23 13:41:33,224 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 13:41:33,225 INFO L450 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-23 13:41:33,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-23 13:41:33,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=7486, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 13:41:33,226 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-07-23 13:41:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:33,754 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-23 13:41:33,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-23 13:41:33,754 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-07-23 13:41:33,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:33,755 INFO L225 Difference]: With dead ends: 93 [2018-07-23 13:41:33,755 INFO L226 Difference]: Without dead ends: 91 [2018-07-23 13:41:33,756 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=346, Invalid=7486, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 13:41:33,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-23 13:41:33,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-23 13:41:33,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-23 13:41:33,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-23 13:41:33,761 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-07-23 13:41:33,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:33,761 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-23 13:41:33,761 INFO L472 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-23 13:41:33,762 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-23 13:41:33,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-23 13:41:33,762 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:33,762 INFO L357 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-07-23 13:41:33,763 INFO L414 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:33,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1087052093, now seen corresponding path program 87 times [2018-07-23 13:41:33,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:34,220 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 13:41:34,221 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:34,221 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-23 13:41:34,221 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:34,221 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 13:41:34,222 INFO L185 omatonBuilderFactory]: Interpolants [21120#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 21121#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 21122#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 21123#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 21124#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 21125#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 21126#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 21127#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 21128#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 21129#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 21130#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 21131#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 21132#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 21133#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 21134#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 21135#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 21136#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 21137#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 21138#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 21139#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 21140#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 21141#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 21142#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 21143#(and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4)), 21144#(and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)), 21145#(and (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79)), 21146#(and (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4)), 21147#(and (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4)), 21148#(and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4)), 21149#(and (<= 83 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 83)), 21150#(and (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~x~4)), 21151#(and (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)), 21152#(<= ULTIMATE.start_main_~x~4 86), 21153#(<= ULTIMATE.start_main_~x~4 87), 21064#true, 21065#false, 21066#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 21067#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 21068#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 21069#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 21070#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 21071#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 21072#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 21073#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 21074#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 21075#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 21076#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 21077#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 21078#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 21079#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 21080#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 21081#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 21082#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 21083#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 21084#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 21085#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 21086#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 21087#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 21088#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 21089#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 21090#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 21091#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 21092#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 21093#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 21094#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 21095#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 21096#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 21097#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 21098#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 21099#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 21100#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 21101#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 21102#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 21103#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 21104#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 21105#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 21106#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 21107#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 21108#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 21109#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 21110#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 21111#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 21112#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 21113#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 21114#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 21115#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 21116#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 21117#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 21118#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 21119#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53))] [2018-07-23 13:41:34,222 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 13:41:34,222 INFO L450 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-23 13:41:34,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-23 13:41:34,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=7660, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 13:41:34,223 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-07-23 13:41:34,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:34,741 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-07-23 13:41:34,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-23 13:41:34,741 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-07-23 13:41:34,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:34,742 INFO L225 Difference]: With dead ends: 94 [2018-07-23 13:41:34,742 INFO L226 Difference]: Without dead ends: 92 [2018-07-23 13:41:34,743 INFO L575 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 13:41:34,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-23 13:41:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-23 13:41:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-23 13:41:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-07-23 13:41:34,748 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-07-23 13:41:34,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:34,749 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-07-23 13:41:34,749 INFO L472 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-23 13:41:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-07-23 13:41:34,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-23 13:41:34,749 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:34,750 INFO L357 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-07-23 13:41:34,750 INFO L414 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:34,750 INFO L82 PathProgramCache]: Analyzing trace with hash -661111225, now seen corresponding path program 88 times [2018-07-23 13:41:34,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:35,174 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 13:41:35,175 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:35,175 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-23 13:41:35,175 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:35,175 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 13:41:35,175 INFO L185 omatonBuilderFactory]: Interpolants [21526#true, 21527#false, 21528#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 21529#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 21530#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 21531#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 21532#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 21533#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 21534#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 21535#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 21536#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 21537#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 21538#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 21539#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 21540#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 21541#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 21542#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 21543#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 21544#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 21545#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 21546#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 21547#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 21548#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 21549#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 21550#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 21551#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 21552#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 21553#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 21554#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 21555#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 21556#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 21557#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 21558#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 21559#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 21560#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 21561#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 21562#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 21563#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 21564#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 21565#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 21566#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 21567#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 21568#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 21569#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 21570#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 21571#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 21572#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 21573#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 21574#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 21575#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 21576#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 21577#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 21578#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 21579#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 21580#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 21581#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 21582#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 21583#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 21584#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 21585#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 21586#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 21587#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 21588#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 21589#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 21590#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 21591#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 21592#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 21593#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 21594#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 21595#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 21596#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 21597#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 21598#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 21599#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 21600#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 21601#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 21602#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 21603#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 21604#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 21605#(and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4)), 21606#(and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)), 21607#(and (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79)), 21608#(and (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4)), 21609#(and (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4)), 21610#(and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4)), 21611#(and (<= 83 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 83)), 21612#(and (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~x~4)), 21613#(and (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)), 21614#(and (<= 86 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 86)), 21615#(<= ULTIMATE.start_main_~x~4 87), 21616#(<= ULTIMATE.start_main_~x~4 88)] [2018-07-23 13:41:35,176 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 13:41:35,176 INFO L450 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-23 13:41:35,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-23 13:41:35,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=7836, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 13:41:35,177 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-07-23 13:41:35,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:35,726 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-23 13:41:35,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-23 13:41:35,726 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-07-23 13:41:35,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:35,727 INFO L225 Difference]: With dead ends: 95 [2018-07-23 13:41:35,727 INFO L226 Difference]: Without dead ends: 93 [2018-07-23 13:41:35,728 INFO L575 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 13:41:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-23 13:41:35,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-23 13:41:35,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-23 13:41:35,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-23 13:41:35,732 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-07-23 13:41:35,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:35,733 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-23 13:41:35,733 INFO L472 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-23 13:41:35,733 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-23 13:41:35,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-23 13:41:35,733 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:35,734 INFO L357 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-07-23 13:41:35,734 INFO L414 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:35,734 INFO L82 PathProgramCache]: Analyzing trace with hash 980400765, now seen corresponding path program 89 times [2018-07-23 13:41:35,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:36,214 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 13:41:36,215 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:36,215 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-23 13:41:36,215 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:36,215 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 13:41:36,216 INFO L185 omatonBuilderFactory]: Interpolants [22016#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 22017#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 22018#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 22019#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 22020#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 22021#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 22022#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 22023#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 22024#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 22025#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 22026#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 22027#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 22028#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 22029#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 22030#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 22031#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 22032#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 22033#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 22034#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 22035#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 22036#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 22037#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 22038#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 22039#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 22040#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 22041#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 22042#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 22043#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 22044#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 22045#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 22046#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 22047#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 22048#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 22049#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 22050#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 22051#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 22052#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 22053#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 22054#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 22055#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 22056#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 22057#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 22058#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 22059#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 22060#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 22061#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 22062#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 22063#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 22064#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 22065#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 22066#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 22067#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 22068#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 22069#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 22070#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 22071#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 22072#(and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4)), 22073#(and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)), 22074#(and (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79)), 22075#(and (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4)), 22076#(and (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4)), 22077#(and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4)), 22078#(and (<= 83 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 83)), 22079#(and (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~x~4)), 22080#(and (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)), 22081#(and (<= 86 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 86)), 22082#(and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~x~4)), 22083#(<= ULTIMATE.start_main_~x~4 88), 22084#(<= ULTIMATE.start_main_~x~4 89), 21993#true, 21994#false, 21995#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 21996#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 21997#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 21998#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 21999#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 22000#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 22001#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 22002#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 22003#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 22004#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 22005#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 22006#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 22007#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 22008#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 22009#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 22010#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 22011#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 22012#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 22013#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 22014#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 22015#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20))] [2018-07-23 13:41:36,216 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 13:41:36,216 INFO L450 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-23 13:41:36,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-23 13:41:36,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=8014, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 13:41:36,217 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-07-23 13:41:36,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:36,748 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-07-23 13:41:36,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-23 13:41:36,748 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-07-23 13:41:36,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:36,749 INFO L225 Difference]: With dead ends: 96 [2018-07-23 13:41:36,749 INFO L226 Difference]: Without dead ends: 94 [2018-07-23 13:41:36,749 INFO L575 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 13:41:36,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-23 13:41:36,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-23 13:41:36,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-23 13:41:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-07-23 13:41:36,755 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-07-23 13:41:36,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:36,755 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-07-23 13:41:36,755 INFO L472 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-23 13:41:36,755 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-07-23 13:41:36,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-23 13:41:36,757 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:36,757 INFO L357 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-07-23 13:41:36,757 INFO L414 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:36,758 INFO L82 PathProgramCache]: Analyzing trace with hash 327664903, now seen corresponding path program 90 times [2018-07-23 13:41:36,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:37,179 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 13:41:37,180 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:37,180 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-23 13:41:37,180 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:37,180 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 13:41:37,180 INFO L185 omatonBuilderFactory]: Interpolants [22528#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 22529#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 22530#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 22531#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 22532#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 22533#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 22534#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 22535#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 22536#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 22537#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 22538#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 22539#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 22540#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 22541#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 22542#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 22543#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 22544#(and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4)), 22545#(and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)), 22546#(and (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79)), 22547#(and (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4)), 22548#(and (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4)), 22549#(and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4)), 22550#(and (<= 83 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 83)), 22551#(and (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~x~4)), 22552#(and (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)), 22553#(and (<= 86 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 86)), 22554#(and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~x~4)), 22555#(and (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88)), 22556#(<= ULTIMATE.start_main_~x~4 89), 22557#(<= ULTIMATE.start_main_~x~4 90), 22465#true, 22466#false, 22467#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 22468#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 22469#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 22470#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 22471#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 22472#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 22473#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 22474#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 22475#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 22476#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 22477#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 22478#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 22479#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 22480#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 22481#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 22482#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 22483#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 22484#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 22485#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 22486#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 22487#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 22488#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 22489#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 22490#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 22491#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 22492#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 22493#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 22494#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 22495#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 22496#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 22497#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 22498#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 22499#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 22500#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 22501#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 22502#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 22503#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 22504#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 22505#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 22506#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 22507#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 22508#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 22509#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 22510#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 22511#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 22512#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 22513#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 22514#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 22515#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 22516#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 22517#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 22518#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 22519#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 22520#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 22521#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 22522#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 22523#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 22524#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 22525#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 22526#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 22527#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60))] [2018-07-23 13:41:37,181 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 13:41:37,181 INFO L450 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-23 13:41:37,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-23 13:41:37,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=8194, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 13:41:37,182 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-07-23 13:41:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:37,741 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-23 13:41:37,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-23 13:41:37,741 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-07-23 13:41:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:37,742 INFO L225 Difference]: With dead ends: 97 [2018-07-23 13:41:37,742 INFO L226 Difference]: Without dead ends: 95 [2018-07-23 13:41:37,742 INFO L575 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 13:41:37,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-23 13:41:37,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-23 13:41:37,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-23 13:41:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-23 13:41:37,747 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-07-23 13:41:37,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:37,748 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-23 13:41:37,748 INFO L472 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-23 13:41:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-23 13:41:37,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-23 13:41:37,749 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:37,749 INFO L357 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-07-23 13:41:37,749 INFO L414 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:37,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1567689661, now seen corresponding path program 91 times [2018-07-23 13:41:37,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:38,206 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 13:41:38,206 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:38,206 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-23 13:41:38,206 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:38,207 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 13:41:38,207 INFO L185 omatonBuilderFactory]: Interpolants [22942#true, 22943#false, 22944#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 22945#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 22946#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 22947#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 22948#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 22949#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 22950#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 22951#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 22952#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 22953#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 22954#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 22955#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 22956#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 22957#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 22958#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 22959#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 22960#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 22961#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 22962#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 22963#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 22964#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 22965#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 22966#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 22967#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 22968#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 22969#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 22970#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 22971#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 22972#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 22973#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 22974#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 22975#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 22976#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 22977#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 22978#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 22979#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 22980#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 22981#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 22982#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 22983#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 22984#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 22985#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 22986#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 22987#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 22988#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 22989#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 22990#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 22991#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 22992#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 22993#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 22994#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 22995#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 22996#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 22997#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 22998#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 22999#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 23000#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 23001#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 23002#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 23003#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 23004#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 23005#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 23006#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 23007#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 23008#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 23009#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 23010#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 23011#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 23012#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 23013#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 23014#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 23015#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 23016#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 23017#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 23018#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 23019#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 23020#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 23021#(and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4)), 23022#(and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)), 23023#(and (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79)), 23024#(and (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4)), 23025#(and (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4)), 23026#(and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4)), 23027#(and (<= 83 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 83)), 23028#(and (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~x~4)), 23029#(and (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)), 23030#(and (<= 86 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 86)), 23031#(and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~x~4)), 23032#(and (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88)), 23033#(and (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4)), 23034#(<= ULTIMATE.start_main_~x~4 90), 23035#(<= ULTIMATE.start_main_~x~4 91)] [2018-07-23 13:41:38,207 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 13:41:38,207 INFO L450 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-23 13:41:38,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-23 13:41:38,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=8376, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 13:41:38,208 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-07-23 13:41:38,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:38,780 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-07-23 13:41:38,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-23 13:41:38,781 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-07-23 13:41:38,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:38,781 INFO L225 Difference]: With dead ends: 98 [2018-07-23 13:41:38,782 INFO L226 Difference]: Without dead ends: 96 [2018-07-23 13:41:38,782 INFO L575 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 13:41:38,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-23 13:41:38,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-23 13:41:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-23 13:41:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-07-23 13:41:38,787 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-07-23 13:41:38,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:38,787 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-07-23 13:41:38,787 INFO L472 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-23 13:41:38,787 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-07-23 13:41:38,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-23 13:41:38,788 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:38,788 INFO L357 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-07-23 13:41:38,788 INFO L414 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:38,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1353751495, now seen corresponding path program 92 times [2018-07-23 13:41:38,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:39,261 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 13:41:39,261 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:39,261 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-23 13:41:39,261 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:39,262 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 13:41:39,262 INFO L185 omatonBuilderFactory]: Interpolants [23424#true, 23425#false, 23426#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 23427#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 23428#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 23429#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 23430#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 23431#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 23432#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 23433#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 23434#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 23435#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 23436#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 23437#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 23438#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 23439#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 23440#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 23441#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 23442#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 23443#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 23444#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 23445#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 23446#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 23447#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 23448#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 23449#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 23450#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 23451#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 23452#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 23453#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 23454#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 23455#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 23456#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 23457#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 23458#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 23459#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 23460#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 23461#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 23462#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 23463#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 23464#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 23465#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 23466#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 23467#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 23468#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 23469#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 23470#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 23471#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 23472#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 23473#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 23474#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 23475#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 23476#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 23477#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 23478#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 23479#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 23480#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 23481#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 23482#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 23483#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 23484#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 23485#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 23486#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 23487#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 23488#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 23489#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 23490#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 23491#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 23492#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 23493#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 23494#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 23495#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 23496#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 23497#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 23498#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 23499#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 23500#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 23501#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 23502#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 23503#(and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4)), 23504#(and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)), 23505#(and (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79)), 23506#(and (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4)), 23507#(and (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4)), 23508#(and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4)), 23509#(and (<= 83 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 83)), 23510#(and (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~x~4)), 23511#(and (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)), 23512#(and (<= 86 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 86)), 23513#(and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~x~4)), 23514#(and (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88)), 23515#(and (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4)), 23516#(and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~x~4)), 23517#(<= ULTIMATE.start_main_~x~4 91), 23518#(<= ULTIMATE.start_main_~x~4 92)] [2018-07-23 13:41:39,262 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 13:41:39,262 INFO L450 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-23 13:41:39,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-23 13:41:39,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=8560, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 13:41:39,263 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-07-23 13:41:40,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:40,017 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-23 13:41:40,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-23 13:41:40,017 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-07-23 13:41:40,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:40,017 INFO L225 Difference]: With dead ends: 99 [2018-07-23 13:41:40,017 INFO L226 Difference]: Without dead ends: 97 [2018-07-23 13:41:40,018 INFO L575 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 13:41:40,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-23 13:41:40,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-23 13:41:40,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-23 13:41:40,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-23 13:41:40,022 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-07-23 13:41:40,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:40,022 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-23 13:41:40,022 INFO L472 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-23 13:41:40,022 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-23 13:41:40,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-23 13:41:40,022 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:40,022 INFO L357 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-07-23 13:41:40,023 INFO L414 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:40,023 INFO L82 PathProgramCache]: Analyzing trace with hash -983364355, now seen corresponding path program 93 times [2018-07-23 13:41:40,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:40,511 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 13:41:40,511 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:40,512 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-23 13:41:40,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:40,512 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 13:41:40,512 INFO L185 omatonBuilderFactory]: Interpolants [23936#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 23937#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 23938#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 23939#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 23940#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 23941#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 23942#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 23943#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 23944#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 23945#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 23946#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 23947#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 23948#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 23949#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 23950#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 23951#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 23952#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 23953#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 23954#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 23955#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 23956#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 23957#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 23958#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 23959#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 23960#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 23961#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 23962#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 23963#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 23964#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 23965#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 23966#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 23967#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 23968#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 23969#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 23970#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 23971#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 23972#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 23973#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 23974#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 23975#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 23976#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 23977#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 23978#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 23979#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 23980#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 23981#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 23982#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 23983#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 23984#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 23985#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 23986#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 23987#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 23988#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 23989#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 23990#(and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4)), 23991#(and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)), 23992#(and (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79)), 23993#(and (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4)), 23994#(and (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4)), 23995#(and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4)), 23996#(and (<= 83 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 83)), 23997#(and (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~x~4)), 23998#(and (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)), 23999#(and (<= 86 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 86)), 24000#(and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~x~4)), 24001#(and (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88)), 24002#(and (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4)), 24003#(and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~x~4)), 24004#(and (<= ULTIMATE.start_main_~x~4 91) (<= 91 ULTIMATE.start_main_~x~4)), 24005#(<= ULTIMATE.start_main_~x~4 92), 24006#(<= ULTIMATE.start_main_~x~4 93), 23911#true, 23912#false, 23913#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 23914#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 23915#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 23916#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 23917#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 23918#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 23919#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 23920#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 23921#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 23922#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 23923#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 23924#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 23925#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 23926#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 23927#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 23928#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 23929#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 23930#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 23931#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 23932#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 23933#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 23934#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 23935#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4))] [2018-07-23 13:41:40,513 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 13:41:40,513 INFO L450 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-23 13:41:40,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-23 13:41:40,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=8746, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 13:41:40,514 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-07-23 13:41:41,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:41,111 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-07-23 13:41:41,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-23 13:41:41,111 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-07-23 13:41:41,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:41,112 INFO L225 Difference]: With dead ends: 100 [2018-07-23 13:41:41,112 INFO L226 Difference]: Without dead ends: 98 [2018-07-23 13:41:41,113 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=374, Invalid=8746, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 13:41:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-23 13:41:41,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-07-23 13:41:41,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-23 13:41:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-07-23 13:41:41,117 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-07-23 13:41:41,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:41,118 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-07-23 13:41:41,118 INFO L472 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-23 13:41:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-07-23 13:41:41,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-07-23 13:41:41,118 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:41,118 INFO L357 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-07-23 13:41:41,118 INFO L414 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:41,119 INFO L82 PathProgramCache]: Analyzing trace with hash -419511673, now seen corresponding path program 94 times [2018-07-23 13:41:41,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:41,582 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 13:41:41,582 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:41,582 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-23 13:41:41,583 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:41,583 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 13:41:41,583 INFO L185 omatonBuilderFactory]: Interpolants [24403#true, 24404#false, 24405#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 24406#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 24407#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 24408#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 24409#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 24410#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 24411#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 24412#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 24413#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 24414#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 24415#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 24416#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 24417#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 24418#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 24419#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 24420#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 24421#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 24422#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 24423#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 24424#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 24425#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 24426#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 24427#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 24428#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 24429#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 24430#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 24431#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 24432#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 24433#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 24434#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 24435#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 24436#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 24437#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 24438#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 24439#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 24440#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 24441#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 24442#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 24443#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 24444#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 24445#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 24446#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 24447#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 24448#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 24449#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 24450#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 24451#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 24452#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 24453#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 24454#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 24455#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 24456#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 24457#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 24458#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 24459#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 24460#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 24461#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 24462#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 24463#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 24464#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 24465#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 24466#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 24467#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 24468#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 24469#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 24470#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 24471#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 24472#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 24473#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 24474#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 24475#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 24476#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 24477#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 24478#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 24479#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 24480#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 24481#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 24482#(and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4)), 24483#(and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)), 24484#(and (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79)), 24485#(and (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4)), 24486#(and (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4)), 24487#(and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4)), 24488#(and (<= 83 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 83)), 24489#(and (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~x~4)), 24490#(and (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)), 24491#(and (<= 86 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 86)), 24492#(and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~x~4)), 24493#(and (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88)), 24494#(and (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4)), 24495#(and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~x~4)), 24496#(and (<= ULTIMATE.start_main_~x~4 91) (<= 91 ULTIMATE.start_main_~x~4)), 24497#(and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~x~4)), 24498#(<= ULTIMATE.start_main_~x~4 93), 24499#(<= ULTIMATE.start_main_~x~4 94)] [2018-07-23 13:41:41,583 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 13:41:41,583 INFO L450 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-23 13:41:41,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-23 13:41:41,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=8934, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 13:41:41,584 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-07-23 13:41:42,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:42,192 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-23 13:41:42,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-23 13:41:42,193 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-07-23 13:41:42,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:42,193 INFO L225 Difference]: With dead ends: 101 [2018-07-23 13:41:42,193 INFO L226 Difference]: Without dead ends: 99 [2018-07-23 13:41:42,194 INFO L575 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 13:41:42,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-23 13:41:42,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-23 13:41:42,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-23 13:41:42,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-23 13:41:42,198 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-07-23 13:41:42,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:42,198 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-23 13:41:42,198 INFO L472 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-23 13:41:42,198 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-23 13:41:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-23 13:41:42,199 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:42,199 INFO L357 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-07-23 13:41:42,199 INFO L414 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:42,199 INFO L82 PathProgramCache]: Analyzing trace with hash -119947715, now seen corresponding path program 95 times [2018-07-23 13:41:42,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:42,720 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 13:41:42,721 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:42,721 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-23 13:41:42,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:42,721 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 13:41:42,722 INFO L185 omatonBuilderFactory]: Interpolants [24900#true, 24901#false, 24902#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 24903#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 24904#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 24905#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 24906#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 24907#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 24908#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 24909#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 24910#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 24911#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 24912#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 24913#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 24914#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 24915#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 24916#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 24917#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 24918#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 24919#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 24920#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 24921#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 24922#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 24923#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 24924#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 24925#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 24926#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 24927#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 24928#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 24929#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 24930#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 24931#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 24932#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 24933#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 24934#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 24935#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 24936#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 24937#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 24938#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 24939#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 24940#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 24941#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 24942#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 24943#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 24944#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 24945#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 24946#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 24947#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 24948#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 24949#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 24950#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 24951#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 24952#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 24953#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 24954#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 24955#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 24956#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 24957#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 24958#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 24959#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 24960#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 24961#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 24962#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 24963#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 24964#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 24965#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 24966#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 24967#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 24968#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 24969#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 24970#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 24971#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 24972#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 24973#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 24974#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 24975#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 24976#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 24977#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 24978#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 24979#(and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4)), 24980#(and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)), 24981#(and (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79)), 24982#(and (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4)), 24983#(and (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4)), 24984#(and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4)), 24985#(and (<= 83 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 83)), 24986#(and (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~x~4)), 24987#(and (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)), 24988#(and (<= 86 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 86)), 24989#(and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~x~4)), 24990#(and (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88)), 24991#(and (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4)), 24992#(and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~x~4)), 24993#(and (<= ULTIMATE.start_main_~x~4 91) (<= 91 ULTIMATE.start_main_~x~4)), 24994#(and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~x~4)), 24995#(and (<= ULTIMATE.start_main_~x~4 93) (<= 93 ULTIMATE.start_main_~x~4)), 24996#(<= ULTIMATE.start_main_~x~4 94), 24997#(<= ULTIMATE.start_main_~x~4 95)] [2018-07-23 13:41:42,722 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 13:41:42,722 INFO L450 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-23 13:41:42,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-23 13:41:42,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=9124, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 13:41:42,723 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-07-23 13:41:43,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:43,370 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-07-23 13:41:43,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-23 13:41:43,370 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-07-23 13:41:43,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:43,371 INFO L225 Difference]: With dead ends: 102 [2018-07-23 13:41:43,371 INFO L226 Difference]: Without dead ends: 100 [2018-07-23 13:41:43,372 INFO L575 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 13:41:43,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-23 13:41:43,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-07-23 13:41:43,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-23 13:41:43,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-07-23 13:41:43,376 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-07-23 13:41:43,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:43,376 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-07-23 13:41:43,376 INFO L472 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-23 13:41:43,376 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-07-23 13:41:43,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-07-23 13:41:43,377 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:43,377 INFO L357 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-07-23 13:41:43,377 INFO L414 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:43,377 INFO L82 PathProgramCache]: Analyzing trace with hash 576600391, now seen corresponding path program 96 times [2018-07-23 13:41:43,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:43,894 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 13:41:43,895 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:43,895 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-23 13:41:43,895 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:43,895 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 13:41:43,896 INFO L185 omatonBuilderFactory]: Interpolants [25402#true, 25403#false, 25404#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 25405#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 25406#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 25407#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 25408#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 25409#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 25410#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 25411#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 25412#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 25413#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 25414#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 25415#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 25416#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 25417#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 25418#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 25419#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 25420#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 25421#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 25422#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 25423#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 25424#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 25425#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 25426#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 25427#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 25428#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 25429#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 25430#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 25431#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 25432#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 25433#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 25434#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 25435#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 25436#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 25437#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 25438#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 25439#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 25440#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 25441#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 25442#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 25443#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 25444#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 25445#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 25446#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 25447#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 25448#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 25449#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 25450#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 25451#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 25452#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 25453#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 25454#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 25455#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 25456#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 25457#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 25458#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 25459#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 25460#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 25461#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 25462#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 25463#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 25464#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 25465#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 25466#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 25467#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 25468#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 25469#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 25470#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 25471#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 25472#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 25473#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 25474#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 25475#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 25476#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 25477#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 25478#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 25479#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 25480#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 25481#(and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4)), 25482#(and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)), 25483#(and (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79)), 25484#(and (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4)), 25485#(and (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4)), 25486#(and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4)), 25487#(and (<= 83 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 83)), 25488#(and (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~x~4)), 25489#(and (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)), 25490#(and (<= 86 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 86)), 25491#(and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~x~4)), 25492#(and (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88)), 25493#(and (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4)), 25494#(and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~x~4)), 25495#(and (<= ULTIMATE.start_main_~x~4 91) (<= 91 ULTIMATE.start_main_~x~4)), 25496#(and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~x~4)), 25497#(and (<= ULTIMATE.start_main_~x~4 93) (<= 93 ULTIMATE.start_main_~x~4)), 25498#(and (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~x~4)), 25499#(<= ULTIMATE.start_main_~x~4 95), 25500#(<= ULTIMATE.start_main_~x~4 96)] [2018-07-23 13:41:43,896 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 13:41:43,896 INFO L450 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-23 13:41:43,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-23 13:41:43,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=9316, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 13:41:43,897 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-07-23 13:41:44,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:44,519 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-23 13:41:44,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-23 13:41:44,519 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-07-23 13:41:44,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:44,520 INFO L225 Difference]: With dead ends: 103 [2018-07-23 13:41:44,520 INFO L226 Difference]: Without dead ends: 101 [2018-07-23 13:41:44,520 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=386, Invalid=9316, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 13:41:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-23 13:41:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-23 13:41:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-23 13:41:44,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-23 13:41:44,525 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-07-23 13:41:44,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:44,526 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-23 13:41:44,526 INFO L472 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-23 13:41:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-23 13:41:44,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-23 13:41:44,527 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:44,527 INFO L357 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-07-23 13:41:44,527 INFO L414 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:44,527 INFO L82 PathProgramCache]: Analyzing trace with hash 694755197, now seen corresponding path program 97 times [2018-07-23 13:41:44,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:45,014 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 13:41:45,015 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:45,015 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-23 13:41:45,015 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:45,015 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 13:41:45,015 INFO L185 omatonBuilderFactory]: Interpolants [25909#true, 25910#false, 25911#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 25912#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 25913#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 25914#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 25915#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 25916#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 25917#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 25918#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 25919#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 25920#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 25921#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 25922#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 25923#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 25924#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 25925#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 25926#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 25927#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 25928#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 25929#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 25930#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 25931#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 25932#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 25933#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 25934#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 25935#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 25936#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 25937#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 25938#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 25939#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 25940#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 25941#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 25942#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 25943#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 25944#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 25945#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 25946#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 25947#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 25948#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 25949#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 25950#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 25951#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 25952#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 25953#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 25954#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 25955#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 25956#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 25957#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 25958#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 25959#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 25960#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 25961#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 25962#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 25963#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 25964#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 25965#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 25966#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 25967#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 25968#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 25969#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 25970#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 25971#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 25972#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 25973#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 25974#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 25975#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 25976#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 25977#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 25978#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 25979#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 25980#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 25981#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 25982#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 25983#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 25984#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 25985#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 25986#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 25987#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 25988#(and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4)), 25989#(and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)), 25990#(and (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79)), 25991#(and (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4)), 25992#(and (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4)), 25993#(and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4)), 25994#(and (<= 83 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 83)), 25995#(and (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~x~4)), 25996#(and (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)), 25997#(and (<= 86 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 86)), 25998#(and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~x~4)), 25999#(and (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88)), 26000#(and (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4)), 26001#(and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~x~4)), 26002#(and (<= ULTIMATE.start_main_~x~4 91) (<= 91 ULTIMATE.start_main_~x~4)), 26003#(and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~x~4)), 26004#(and (<= ULTIMATE.start_main_~x~4 93) (<= 93 ULTIMATE.start_main_~x~4)), 26005#(and (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~x~4)), 26006#(and (<= 95 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 95)), 26007#(<= ULTIMATE.start_main_~x~4 96), 26008#(<= ULTIMATE.start_main_~x~4 97)] [2018-07-23 13:41:45,016 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 13:41:45,016 INFO L450 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-23 13:41:45,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-23 13:41:45,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=9510, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 13:41:45,017 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-07-23 13:41:45,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:45,656 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-07-23 13:41:45,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-23 13:41:45,656 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-07-23 13:41:45,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:45,657 INFO L225 Difference]: With dead ends: 104 [2018-07-23 13:41:45,657 INFO L226 Difference]: Without dead ends: 102 [2018-07-23 13:41:45,658 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=390, Invalid=9510, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 13:41:45,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-23 13:41:45,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-07-23 13:41:45,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-23 13:41:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-07-23 13:41:45,663 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-07-23 13:41:45,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:45,664 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-07-23 13:41:45,664 INFO L472 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-23 13:41:45,664 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-07-23 13:41:45,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-07-23 13:41:45,664 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:45,664 INFO L357 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-07-23 13:41:45,665 INFO L414 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:45,665 INFO L82 PathProgramCache]: Analyzing trace with hash 62586887, now seen corresponding path program 98 times [2018-07-23 13:41:45,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:46,178 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 13:41:46,178 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:46,178 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-23 13:41:46,179 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:46,179 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 13:41:46,179 INFO L185 omatonBuilderFactory]: Interpolants [26421#true, 26422#false, 26423#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 26424#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 26425#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 26426#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 26427#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 26428#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 26429#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 26430#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 26431#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 26432#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 26433#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 26434#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 26435#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 26436#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 26437#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 26438#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 26439#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 26440#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 26441#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 26442#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 26443#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 26444#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 26445#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 26446#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 26447#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 26448#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 26449#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 26450#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 26451#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 26452#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 26453#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 26454#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 26455#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 26456#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 26457#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 26458#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 26459#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 26460#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 26461#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 26462#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 26463#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 26464#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 26465#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 26466#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 26467#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 26468#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 26469#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 26470#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 26471#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 26472#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 26473#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 26474#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 26475#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 26476#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 26477#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 26478#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 26479#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 26480#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 26481#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 26482#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 26483#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 26484#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 26485#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 26486#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 26487#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 26488#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 26489#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 26490#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 26491#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 26492#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 26493#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 26494#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 26495#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 26496#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 26497#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 26498#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 26499#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 26500#(and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4)), 26501#(and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)), 26502#(and (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79)), 26503#(and (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4)), 26504#(and (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4)), 26505#(and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4)), 26506#(and (<= 83 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 83)), 26507#(and (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~x~4)), 26508#(and (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)), 26509#(and (<= 86 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 86)), 26510#(and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~x~4)), 26511#(and (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88)), 26512#(and (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4)), 26513#(and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~x~4)), 26514#(and (<= ULTIMATE.start_main_~x~4 91) (<= 91 ULTIMATE.start_main_~x~4)), 26515#(and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~x~4)), 26516#(and (<= ULTIMATE.start_main_~x~4 93) (<= 93 ULTIMATE.start_main_~x~4)), 26517#(and (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~x~4)), 26518#(and (<= 95 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 95)), 26519#(and (<= ULTIMATE.start_main_~x~4 96) (<= 96 ULTIMATE.start_main_~x~4)), 26520#(<= ULTIMATE.start_main_~x~4 97), 26521#(<= ULTIMATE.start_main_~x~4 98)] [2018-07-23 13:41:46,180 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 13:41:46,180 INFO L450 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-23 13:41:46,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-23 13:41:46,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=9706, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 13:41:46,181 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-07-23 13:41:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:46,849 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-23 13:41:46,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-23 13:41:46,849 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-07-23 13:41:46,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:46,850 INFO L225 Difference]: With dead ends: 105 [2018-07-23 13:41:46,850 INFO L226 Difference]: Without dead ends: 103 [2018-07-23 13:41:46,850 INFO L575 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 13:41:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-23 13:41:46,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-23 13:41:46,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-23 13:41:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-23 13:41:46,854 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-07-23 13:41:46,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:46,855 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-23 13:41:46,855 INFO L472 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-23 13:41:46,855 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-23 13:41:46,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-23 13:41:46,855 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:46,855 INFO L357 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-07-23 13:41:46,855 INFO L414 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:46,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1940205757, now seen corresponding path program 99 times [2018-07-23 13:41:46,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:47,556 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 13:41:47,557 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:47,557 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-23 13:41:47,557 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:47,557 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 13:41:47,558 INFO L185 omatonBuilderFactory]: Interpolants [26938#true, 26939#false, 26940#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 26941#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 26942#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 26943#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 26944#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 26945#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 26946#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 26947#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 26948#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 26949#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 26950#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 26951#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 26952#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 26953#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 26954#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 26955#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 26956#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 26957#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 26958#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 26959#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 26960#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 26961#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 26962#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 26963#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 26964#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 26965#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 26966#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 26967#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 26968#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 26969#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 26970#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 26971#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 26972#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 26973#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 26974#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 26975#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 26976#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 26977#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 26978#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 26979#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 26980#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 26981#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 26982#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 26983#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 26984#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 26985#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 26986#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 26987#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 26988#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 26989#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 26990#(and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4)), 26991#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 51)), 26992#(and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4)), 26993#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53)), 26994#(and (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 26995#(and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)), 26996#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56)), 26997#(and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)), 26998#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)), 26999#(and (<= ULTIMATE.start_main_~x~4 59) (<= 59 ULTIMATE.start_main_~x~4)), 27000#(and (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)), 27001#(and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61)), 27002#(and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 27003#(and (<= 63 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 63)), 27004#(and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4)), 27005#(and (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)), 27006#(and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66)), 27007#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 67)), 27008#(and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4)), 27009#(and (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)), 27010#(and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4)), 27011#(and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71)), 27012#(and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72)), 27013#(and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)), 27014#(and (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74)), 27015#(and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4)), 27016#(and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 27017#(and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4)), 27018#(and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4)), 27019#(and (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79)), 27020#(and (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4)), 27021#(and (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4)), 27022#(and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4)), 27023#(and (<= 83 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 83)), 27024#(and (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~x~4)), 27025#(and (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)), 27026#(and (<= 86 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 86)), 27027#(and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~x~4)), 27028#(and (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88)), 27029#(and (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4)), 27030#(and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~x~4)), 27031#(and (<= ULTIMATE.start_main_~x~4 91) (<= 91 ULTIMATE.start_main_~x~4)), 27032#(and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~x~4)), 27033#(and (<= ULTIMATE.start_main_~x~4 93) (<= 93 ULTIMATE.start_main_~x~4)), 27034#(and (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~x~4)), 27035#(and (<= 95 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 95)), 27036#(and (<= ULTIMATE.start_main_~x~4 96) (<= 96 ULTIMATE.start_main_~x~4)), 27037#(and (<= 97 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 97)), 27038#(<= ULTIMATE.start_main_~x~4 98), 27039#(<= ULTIMATE.start_main_~x~4 99)] [2018-07-23 13:41:47,558 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 13:41:47,558 INFO L450 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-23 13:41:47,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-23 13:41:47,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=9904, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 13:41:47,559 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-07-23 13:41:48,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:48,232 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-07-23 13:41:48,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-23 13:41:48,232 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-07-23 13:41:48,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:48,233 INFO L225 Difference]: With dead ends: 106 [2018-07-23 13:41:48,233 INFO L226 Difference]: Without dead ends: 104 [2018-07-23 13:41:48,233 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=398, Invalid=9904, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 13:41:48,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-23 13:41:48,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-23 13:41:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-23 13:41:48,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-07-23 13:41:48,238 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-07-23 13:41:48,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:48,238 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-07-23 13:41:48,238 INFO L472 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-23 13:41:48,238 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-07-23 13:41:48,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-23 13:41:48,239 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:48,239 INFO L357 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-07-23 13:41:48,239 INFO L414 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:48,239 INFO L82 PathProgramCache]: Analyzing trace with hash 16848583, now seen corresponding path program 100 times [2018-07-23 13:41:48,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:49,590 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 13:41:49,590 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:49,591 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-23 13:41:49,591 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:49,591 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 13:41:49,592 INFO L185 omatonBuilderFactory]: Interpolants [27460#true, 27461#false, 27462#(and (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)), 27463#(and (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 1) (<= 50 ULTIMATE.start_main_~y~4) (<= 1 ULTIMATE.start_main_~x~4)), 27464#(and (<= ULTIMATE.start_main_~y~4 50) (<= 2 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 2)), 27465#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 3) (<= 50 ULTIMATE.start_main_~y~4)), 27466#(and (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 4) (<= 50 ULTIMATE.start_main_~y~4) (<= 4 ULTIMATE.start_main_~x~4)), 27467#(and (<= ULTIMATE.start_main_~x~4 5) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4) (<= 5 ULTIMATE.start_main_~x~4)), 27468#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 6)), 27469#(and (<= ULTIMATE.start_main_~x~4 7) (<= ULTIMATE.start_main_~y~4 50) (<= 7 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)), 27470#(and (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 8) (<= 50 ULTIMATE.start_main_~y~4) (<= 8 ULTIMATE.start_main_~x~4)), 27471#(and (<= ULTIMATE.start_main_~y~4 50) (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9) (<= 50 ULTIMATE.start_main_~y~4)), 27472#(and (<= ULTIMATE.start_main_~x~4 10) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4) (<= 10 ULTIMATE.start_main_~x~4)), 27473#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4)), 27474#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 12) (<= 50 ULTIMATE.start_main_~y~4)), 27475#(and (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)), 27476#(and (<= ULTIMATE.start_main_~y~4 50) (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14) (<= 50 ULTIMATE.start_main_~y~4)), 27477#(and (<= ULTIMATE.start_main_~y~4 50) (<= 15 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 15)), 27478#(and (<= ULTIMATE.start_main_~x~4 16) (<= ULTIMATE.start_main_~y~4 50) (<= 16 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)), 27479#(and (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 17) (<= 50 ULTIMATE.start_main_~y~4) (<= 17 ULTIMATE.start_main_~x~4)), 27480#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4)), 27481#(and (<= ULTIMATE.start_main_~y~4 50) (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19) (<= 50 ULTIMATE.start_main_~y~4)), 27482#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 20) (<= 50 ULTIMATE.start_main_~y~4)), 27483#(and (<= ULTIMATE.start_main_~x~4 21) (<= ULTIMATE.start_main_~y~4 50) (<= 21 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)), 27484#(and (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 27485#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4)), 27486#(and (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)), 27487#(and (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 25) (<= 50 ULTIMATE.start_main_~y~4) (<= 25 ULTIMATE.start_main_~x~4)), 27488#(and (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 26) (<= 50 ULTIMATE.start_main_~y~4) (<= 26 ULTIMATE.start_main_~x~4)), 27489#(and (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)), 27490#(and (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 28) (<= 50 ULTIMATE.start_main_~y~4) (<= 28 ULTIMATE.start_main_~x~4)), 27491#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 29)), 27492#(and (<= ULTIMATE.start_main_~x~4 30) (<= ULTIMATE.start_main_~y~4 50) (<= 30 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)), 27493#(and (<= ULTIMATE.start_main_~x~4 31) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4) (<= 31 ULTIMATE.start_main_~x~4)), 27494#(and (<= ULTIMATE.start_main_~x~4 32) (<= ULTIMATE.start_main_~y~4 50) (<= 32 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)), 27495#(and (<= ULTIMATE.start_main_~x~4 33) (<= ULTIMATE.start_main_~y~4 50) (<= 33 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)), 27496#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 34) (<= 50 ULTIMATE.start_main_~y~4)), 27497#(and (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)), 27498#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 36) (<= 50 ULTIMATE.start_main_~y~4)), 27499#(and (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 37) (<= 50 ULTIMATE.start_main_~y~4) (<= 37 ULTIMATE.start_main_~x~4)), 27500#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 38) (<= 50 ULTIMATE.start_main_~y~4)), 27501#(and (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)), 27502#(and (<= ULTIMATE.start_main_~x~4 40) (<= ULTIMATE.start_main_~y~4 50) (<= 40 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)), 27503#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4)), 27504#(and (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)), 27505#(and (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)), 27506#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 44) (<= 50 ULTIMATE.start_main_~y~4)), 27507#(and (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4) (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 27508#(and (<= ULTIMATE.start_main_~x~4 46) (<= ULTIMATE.start_main_~y~4 50) (<= 46 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)), 27509#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 47) (<= 50 ULTIMATE.start_main_~y~4)), 27510#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 48) (<= 50 ULTIMATE.start_main_~y~4)), 27511#(and (<= ULTIMATE.start_main_~y~4 50) (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49) (<= 50 ULTIMATE.start_main_~y~4)), 27512#(and (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)), 27513#(and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4)), 27514#(and (<= 52 ULTIMATE.start_main_~x~4) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52)), 27515#(and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4)), 27516#(and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 54) (<= 54 ULTIMATE.start_main_~x~4)), 27517#(and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= 55 ULTIMATE.start_main_~x~4)), 27518#(and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 56) (<= 56 ULTIMATE.start_main_~y~4)), 27519#(and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= 57 ULTIMATE.start_main_~x~4)), 27520#(and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 58) (<= 58 ULTIMATE.start_main_~y~4)), 27521#(and (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4) (<= 59 ULTIMATE.start_main_~x~4)), 27522#(and (<= ULTIMATE.start_main_~y~4 60) (<= 60 ULTIMATE.start_main_~x~4) (<= 60 ULTIMATE.start_main_~y~4)), 27523#(and (<= 61 ULTIMATE.start_main_~x~4) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61)), 27524#(and (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62) (<= 62 ULTIMATE.start_main_~x~4)), 27525#(and (<= 63 ULTIMATE.start_main_~x~4) (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63)), 27526#(and (<= 64 ULTIMATE.start_main_~x~4) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64)), 27527#(and (<= ULTIMATE.start_main_~y~4 65) (<= 65 ULTIMATE.start_main_~x~4) (<= 65 ULTIMATE.start_main_~y~4)), 27528#(and (<= 66 ULTIMATE.start_main_~y~4) (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 66)), 27529#(and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4)), 27530#(and (<= 68 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4)), 27531#(and (<= ULTIMATE.start_main_~y~4 69) (<= 69 ULTIMATE.start_main_~x~4) (<= 69 ULTIMATE.start_main_~y~4)), 27532#(and (<= 70 ULTIMATE.start_main_~y~4) (<= 70 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 70)), 27533#(and (<= 71 ULTIMATE.start_main_~y~4) (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 71)), 27534#(and (<= 72 ULTIMATE.start_main_~x~4) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)), 27535#(and (<= 73 ULTIMATE.start_main_~y~4) (<= 73 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 73)), 27536#(and (<= 74 ULTIMATE.start_main_~y~4) (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 74)), 27537#(and (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~x~4) (<= 75 ULTIMATE.start_main_~y~4)), 27538#(and (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76) (<= 76 ULTIMATE.start_main_~x~4)), 27539#(and (<= 77 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4)), 27540#(and (<= 78 ULTIMATE.start_main_~y~4) (<= 78 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 78)), 27541#(and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~x~4) (<= 79 ULTIMATE.start_main_~y~4)), 27542#(and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 80) (<= 80 ULTIMATE.start_main_~x~4)), 27543#(and (<= ULTIMATE.start_main_~y~4 81) (<= 81 ULTIMATE.start_main_~x~4) (<= 81 ULTIMATE.start_main_~y~4)), 27544#(and (<= 82 ULTIMATE.start_main_~x~4) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)), 27545#(and (<= 83 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4)), 27546#(and (<= ULTIMATE.start_main_~y~4 84) (<= 84 ULTIMATE.start_main_~y~4) (<= 84 ULTIMATE.start_main_~x~4)), 27547#(and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= 85 ULTIMATE.start_main_~x~4)), 27548#(and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= 86 ULTIMATE.start_main_~x~4)), 27549#(and (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87) (<= 87 ULTIMATE.start_main_~x~4)), 27550#(and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= 88 ULTIMATE.start_main_~x~4)), 27551#(and (<= ULTIMATE.start_main_~y~4 89) (<= 89 ULTIMATE.start_main_~x~4) (<= 89 ULTIMATE.start_main_~y~4)), 27552#(and (<= 90 ULTIMATE.start_main_~y~4) (<= 90 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 90)), 27553#(and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 91) (<= 91 ULTIMATE.start_main_~x~4)), 27554#(and (<= 92 ULTIMATE.start_main_~y~4) (<= 92 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 92)), 27555#(and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= 93 ULTIMATE.start_main_~x~4)), 27556#(and (<= ULTIMATE.start_main_~y~4 94) (<= 94 ULTIMATE.start_main_~y~4) (<= 94 ULTIMATE.start_main_~x~4)), 27557#(and (<= 95 ULTIMATE.start_main_~x~4) (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95)), 27558#(and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= 96 ULTIMATE.start_main_~x~4)), 27559#(and (<= 97 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 97) (<= 97 ULTIMATE.start_main_~y~4)), 27560#(and (<= 98 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4)), 27561#(and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= 99 ULTIMATE.start_main_~x~4)), 27562#(and (<= ULTIMATE.start_main_~y~4 100) (< 99 ULTIMATE.start_main_~y~4))] [2018-07-23 13:41:49,592 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 13:41:49,593 INFO L450 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-23 13:41:49,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-23 13:41:49,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:41:49,598 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-07-23 13:41:50,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:50,729 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-23 13:41:50,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-23 13:41:50,730 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-07-23 13:41:50,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:50,730 INFO L225 Difference]: With dead ends: 107 [2018-07-23 13:41:50,731 INFO L226 Difference]: Without dead ends: 105 [2018-07-23 13:41:50,732 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:41:50,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-23 13:41:50,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-23 13:41:50,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-23 13:41:50,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-23 13:41:50,739 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-07-23 13:41:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:50,739 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-23 13:41:50,739 INFO L472 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-23 13:41:50,739 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-23 13:41:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-23 13:41:50,740 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:50,740 INFO L357 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-07-23 13:41:50,740 INFO L414 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:50,741 INFO L82 PathProgramCache]: Analyzing trace with hash 522318333, now seen corresponding path program 101 times [2018-07-23 13:41:50,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:51,461 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 13:41:51,461 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:51,461 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-23 13:41:51,462 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:51,462 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 13:41:51,463 INFO L185 omatonBuilderFactory]: Interpolants [27987#true, 27988#false, 27989#(and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)), 27990#(and (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)), 27991#(and (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)), 27992#(and (<= 3 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 3)), 27993#(and (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)), 27994#(and (<= ULTIMATE.start_main_~x~4 5) (<= 5 ULTIMATE.start_main_~x~4)), 27995#(and (<= 6 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 6)), 27996#(and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4)), 27997#(and (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4)), 27998#(and (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9)), 27999#(and (<= ULTIMATE.start_main_~x~4 10) (<= 10 ULTIMATE.start_main_~x~4)), 28000#(and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4)), 28001#(and (<= 12 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 12)), 28002#(and (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)), 28003#(and (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14)), 28004#(and (<= 15 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 15)), 28005#(and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4)), 28006#(and (<= ULTIMATE.start_main_~x~4 17) (<= 17 ULTIMATE.start_main_~x~4)), 28007#(and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18)), 28008#(and (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19)), 28009#(and (<= 20 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 20)), 28010#(and (<= ULTIMATE.start_main_~x~4 21) (<= 21 ULTIMATE.start_main_~x~4)), 28011#(and (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)), 28012#(and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4)), 28013#(and (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4)), 28014#(and (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)), 28015#(and (<= ULTIMATE.start_main_~x~4 26) (<= 26 ULTIMATE.start_main_~x~4)), 28016#(and (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4)), 28017#(and (<= ULTIMATE.start_main_~x~4 28) (<= 28 ULTIMATE.start_main_~x~4)), 28018#(and (<= 29 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 29)), 28019#(and (<= ULTIMATE.start_main_~x~4 30) (<= 30 ULTIMATE.start_main_~x~4)), 28020#(and (<= ULTIMATE.start_main_~x~4 31) (<= 31 ULTIMATE.start_main_~x~4)), 28021#(and (<= ULTIMATE.start_main_~x~4 32) (<= 32 ULTIMATE.start_main_~x~4)), 28022#(and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4)), 28023#(and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34)), 28024#(and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4)), 28025#(and (<= 36 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 36)), 28026#(and (<= ULTIMATE.start_main_~x~4 37) (<= 37 ULTIMATE.start_main_~x~4)), 28027#(and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38)), 28028#(and (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4)), 28029#(and (<= ULTIMATE.start_main_~x~4 40) (<= 40 ULTIMATE.start_main_~x~4)), 28030#(and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4)), 28031#(and (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)), 28032#(and (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4)), 28033#(and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44)), 28034#(and (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)), 28035#(and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4)), 28036#(and (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47)), 28037#(and (<= 48 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 48)), 28038#(and (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49)), 28039#(<= 50 ULTIMATE.start_main_~x~4), 28040#(<= 51 ULTIMATE.start_main_~x~4), 28041#(<= 52 ULTIMATE.start_main_~x~4), 28042#(<= 53 ULTIMATE.start_main_~x~4), 28043#(<= 54 ULTIMATE.start_main_~x~4), 28044#(<= 55 ULTIMATE.start_main_~x~4), 28045#(<= 56 ULTIMATE.start_main_~x~4), 28046#(<= 57 ULTIMATE.start_main_~x~4), 28047#(<= 58 ULTIMATE.start_main_~x~4), 28048#(<= 59 ULTIMATE.start_main_~x~4), 28049#(<= 60 ULTIMATE.start_main_~x~4), 28050#(<= 61 ULTIMATE.start_main_~x~4), 28051#(<= 62 ULTIMATE.start_main_~x~4), 28052#(<= 63 ULTIMATE.start_main_~x~4), 28053#(<= 64 ULTIMATE.start_main_~x~4), 28054#(<= 65 ULTIMATE.start_main_~x~4), 28055#(<= 66 ULTIMATE.start_main_~x~4), 28056#(<= 67 ULTIMATE.start_main_~x~4), 28057#(<= 68 ULTIMATE.start_main_~x~4), 28058#(<= 69 ULTIMATE.start_main_~x~4), 28059#(<= 70 ULTIMATE.start_main_~x~4), 28060#(<= 71 ULTIMATE.start_main_~x~4), 28061#(<= 72 ULTIMATE.start_main_~x~4), 28062#(<= 73 ULTIMATE.start_main_~x~4), 28063#(<= 74 ULTIMATE.start_main_~x~4), 28064#(<= 75 ULTIMATE.start_main_~x~4), 28065#(<= 76 ULTIMATE.start_main_~x~4), 28066#(<= 77 ULTIMATE.start_main_~x~4), 28067#(<= 78 ULTIMATE.start_main_~x~4), 28068#(<= 79 ULTIMATE.start_main_~x~4), 28069#(<= 80 ULTIMATE.start_main_~x~4), 28070#(<= 81 ULTIMATE.start_main_~x~4), 28071#(<= 82 ULTIMATE.start_main_~x~4), 28072#(<= 83 ULTIMATE.start_main_~x~4), 28073#(<= 84 ULTIMATE.start_main_~x~4), 28074#(<= 85 ULTIMATE.start_main_~x~4), 28075#(<= 86 ULTIMATE.start_main_~x~4), 28076#(<= 87 ULTIMATE.start_main_~x~4), 28077#(<= 88 ULTIMATE.start_main_~x~4), 28078#(<= 89 ULTIMATE.start_main_~x~4), 28079#(<= 90 ULTIMATE.start_main_~x~4), 28080#(<= 91 ULTIMATE.start_main_~x~4), 28081#(<= 92 ULTIMATE.start_main_~x~4), 28082#(<= 93 ULTIMATE.start_main_~x~4), 28083#(<= 94 ULTIMATE.start_main_~x~4), 28084#(<= 95 ULTIMATE.start_main_~x~4), 28085#(<= 96 ULTIMATE.start_main_~x~4), 28086#(<= 97 ULTIMATE.start_main_~x~4), 28087#(<= 98 ULTIMATE.start_main_~x~4), 28088#(<= 99 ULTIMATE.start_main_~x~4), 28089#(<= 100 ULTIMATE.start_main_~x~4)] [2018-07-23 13:41:51,464 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 13:41:51,464 INFO L450 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-23 13:41:51,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-23 13:41:51,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1478, Invalid=9028, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:41:51,466 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 103 states. [2018-07-23 13:41:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:52,033 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-23 13:41:52,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-23 13:41:52,033 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 104 [2018-07-23 13:41:52,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:52,033 INFO L225 Difference]: With dead ends: 105 [2018-07-23 13:41:52,033 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:41:52,034 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1478, Invalid=9028, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:41:52,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:41:52,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:41:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:41:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:41:52,035 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2018-07-23 13:41:52,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:52,035 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:41:52,035 INFO L472 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-23 13:41:52,036 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:41:52,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:41:52,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:41:52,160 WARN L169 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 508 [2018-07-23 13:41:52,749 WARN L169 SmtUtils]: Spent 582.00 ms on a formula simplification that was a NOOP. DAG size: 508 [2018-07-23 13:41:52,757 INFO L417 ceAbstractionStarter]: At program point L30(lines 30 42) the Hoare annotation is: false [2018-07-23 13:41:52,771 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 13:41:52,772 INFO L421 ceAbstractionStarter]: For program point L22(lines 22 37) no Hoare annotation was computed. [2018-07-23 13:41:52,772 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 43) the Hoare annotation is: false [2018-07-23 13:41:52,772 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 44) the Hoare annotation is: true [2018-07-23 13:41:52,772 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 44) no Hoare annotation was computed. [2018-07-23 13:41:52,772 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 1 44) the Hoare annotation is: false [2018-07-23 13:41:52,813 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 01:41:52 BoogieIcfgContainer [2018-07-23 13:41:52,813 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:41:52,814 INFO L168 Benchmark]: Toolchain (without parser) took 59897.70 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-07-23 13:41:52,817 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 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 13:41:52,817 INFO L168 Benchmark]: Boogie Preprocessor took 49.31 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 13:41:52,818 INFO L168 Benchmark]: RCFGBuilder took 250.49 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 13:41:52,818 INFO L168 Benchmark]: TraceAbstraction took 59593.29 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-07-23 13:41:52,822 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.31 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 250.49 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 59593.29 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.3 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, 59.4s OverallTime, 102 OverallIterations, 101 TraceHistogramMax, 27.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 304 SDtfs, 0 SDslu, 3924 SDs, 0 SdLazy, 300152 SolverSat, 3649 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5354 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.5s Time, 0.1s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 1376/176851 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 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.3s SatisfiabilityAnalysisTime, 28.1s 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_13-41-52-838.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_13-41-52-838.csv Received shutdown request...