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/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:51:36,766 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:51:36,768 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:51:36,780 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:51:36,781 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:51:36,782 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:51:36,783 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:51:36,785 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:51:36,786 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:51:36,787 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:51:36,788 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:51:36,788 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:51:36,789 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:51:36,790 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:51:36,791 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:51:36,792 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:51:36,793 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:51:36,795 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:51:36,797 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:51:36,798 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:51:36,800 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:51:36,801 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:51:36,803 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:51:36,804 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:51:36,804 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:51:36,805 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:51:36,806 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:51:36,810 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:51:36,811 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:51:36,817 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:51:36,817 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:51:36,818 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:51:36,818 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:51:36,818 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:51:36,819 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:51:36,820 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:51:36,820 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:51:36,840 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:51:36,840 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:51:36,842 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:51:36,842 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:51:36,842 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:51:36,843 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:51:36,843 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:51:36,843 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:51:36,893 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:51:36,912 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:51:36,917 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:51:36,919 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:51:36,920 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:51:36,920 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl [2018-07-23 13:51:36,921 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl' [2018-07-23 13:51:36,971 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:51:36,972 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:51:36,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:51:36,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:51:36,974 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:51:37,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:51:36" (1/1) ... [2018-07-23 13:51:37,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:51:36" (1/1) ... [2018-07-23 13:51:37,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:51:36" (1/1) ... [2018-07-23 13:51:37,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:51:36" (1/1) ... [2018-07-23 13:51:37,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:51:36" (1/1) ... [2018-07-23 13:51:37,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:51:36" (1/1) ... [2018-07-23 13:51:37,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:51:36" (1/1) ... [2018-07-23 13:51:37,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:51:37,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:51:37,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:51:37,027 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:51:37,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:51:36" (1/1) ... [2018-07-23 13:51:37,113 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2018-07-23 13:51:37,113 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2018-07-23 13:51:37,238 INFO L258 CfgBuilder]: Using library mode [2018-07-23 13:51:37,239 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:51:37 BoogieIcfgContainer [2018-07-23 13:51:37,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:51:37,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:51:37,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:51:37,244 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:51:37,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:51:36" (1/2) ... [2018-07-23 13:51:37,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f86d9d and model type LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:51:37, skipping insertion in model container [2018-07-23 13:51:37,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:51:37" (2/2) ... [2018-07-23 13:51:37,249 INFO L112 eAbstractionObserver]: Analyzing ICFG LargeConstant-ForwardSuccess.bpl [2018-07-23 13:51:37,259 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:51:37,268 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:51:37,316 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:51:37,316 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:51:37,317 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:51:37,317 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:51:37,317 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:51:37,317 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:51:37,317 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:51:37,317 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:51:37,318 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:51:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-07-23 13:51:37,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-23 13:51:37,338 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:37,339 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-23 13:51:37,340 INFO L414 AbstractCegarLoop]: === Iteration 1 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:37,344 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2018-07-23 13:51:37,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:37,406 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:51:37,408 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:51:37,409 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-07-23 13:51:37,411 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:37,411 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:51:37,412 INFO L185 omatonBuilderFactory]: Interpolants [8#true, 9#false, 10#(<= proc_i 0)] [2018-07-23 13:51:37,412 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:51:37,413 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:51:37,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:51:37,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:51:37,432 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-07-23 13:51:37,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:37,460 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-23 13:51:37,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:51:37,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-23 13:51:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:37,473 INFO L225 Difference]: With dead ends: 9 [2018-07-23 13:51:37,474 INFO L226 Difference]: Without dead ends: 6 [2018-07-23 13:51:37,478 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:51:37,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-23 13:51:37,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-23 13:51:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-23 13:51:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-23 13:51:37,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2018-07-23 13:51:37,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:37,517 INFO L471 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-23 13:51:37,517 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:51:37,517 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-23 13:51:37,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-23 13:51:37,518 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:37,518 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-23 13:51:37,519 INFO L414 AbstractCegarLoop]: === Iteration 2 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:37,519 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2018-07-23 13:51:37,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:37,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:37,546 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:37,546 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2018-07-23 13:51:37,547 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:37,547 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:51:37,547 INFO L185 omatonBuilderFactory]: Interpolants [41#true, 42#false, 43#(<= proc_i 0), 44#(<= proc_i 4)] [2018-07-23 13:51:37,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:37,550 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:51:37,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:51:37,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:51:37,551 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 4 states. [2018-07-23 13:51:37,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:37,571 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-23 13:51:37,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:51:37,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-07-23 13:51:37,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:37,572 INFO L225 Difference]: With dead ends: 9 [2018-07-23 13:51:37,572 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:51:37,574 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:51:37,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:51:37,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-23 13:51:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-23 13:51:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-23 13:51:37,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-07-23 13:51:37,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:37,578 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-23 13:51:37,578 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:51:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-23 13:51:37,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:51:37,579 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:37,579 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2018-07-23 13:51:37,579 INFO L414 AbstractCegarLoop]: === Iteration 3 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:37,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2018-07-23 13:51:37,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:37,619 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:51:37,619 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:37,620 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:51:37,620 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:37,620 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:51:37,620 INFO L185 omatonBuilderFactory]: Interpolants [80#false, 81#(<= proc_i 0), 82#(<= proc_i 4), 83#(<= proc_i 8), 79#true] [2018-07-23 13:51:37,621 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:51:37,621 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:51:37,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:51:37,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:51:37,622 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2018-07-23 13:51:37,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:37,640 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-23 13:51:37,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:51:37,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-07-23 13:51:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:37,641 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:51:37,641 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 13:51:37,641 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:51:37,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 13:51:37,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-23 13:51:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-23 13:51:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-23 13:51:37,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-07-23 13:51:37,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:37,646 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-23 13:51:37,646 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:51:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-23 13:51:37,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 13:51:37,647 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:37,647 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2018-07-23 13:51:37,647 INFO L414 AbstractCegarLoop]: === Iteration 4 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:37,647 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2018-07-23 13:51:37,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:37,688 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:37,688 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:51:37,688 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:37,689 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:51:37,689 INFO L185 omatonBuilderFactory]: Interpolants [128#(<= proc_i 0), 129#(<= proc_i 4), 130#(<= proc_i 8), 131#(<= proc_i 12), 126#true, 127#false] [2018-07-23 13:51:37,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:37,690 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:51:37,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:51:37,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:51:37,691 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 6 states. [2018-07-23 13:51:37,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:37,730 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 13:51:37,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:51:37,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-07-23 13:51:37,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:37,735 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:51:37,735 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 13:51:37,736 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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:51:37,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 13:51:37,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-23 13:51:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-23 13:51:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-23 13:51:37,745 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-07-23 13:51:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:37,745 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-23 13:51:37,745 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:51:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-23 13:51:37,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:51:37,746 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:37,746 INFO L357 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2018-07-23 13:51:37,746 INFO L414 AbstractCegarLoop]: === Iteration 5 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:37,747 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2018-07-23 13:51:37,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:37,805 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:37,805 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:51:37,805 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:37,806 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:51:37,806 INFO L185 omatonBuilderFactory]: Interpolants [182#true, 183#false, 184#(<= proc_i 0), 185#(<= proc_i 4), 186#(<= proc_i 8), 187#(<= proc_i 12), 188#(<= proc_i 16)] [2018-07-23 13:51:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:37,807 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:51:37,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:51:37,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:51:37,808 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 7 states. [2018-07-23 13:51:37,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:37,835 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 13:51:37,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:51:37,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-23 13:51:37,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:37,837 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:51:37,837 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 13:51:37,838 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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:51:37,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 13:51:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-23 13:51:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-23 13:51:37,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-23 13:51:37,842 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-07-23 13:51:37,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:37,842 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-23 13:51:37,843 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:51:37,843 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-23 13:51:37,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:51:37,843 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:37,844 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2018-07-23 13:51:37,844 INFO L414 AbstractCegarLoop]: === Iteration 6 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:37,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2018-07-23 13:51:37,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:37,912 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:37,914 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:51:37,915 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:37,915 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:51:37,915 INFO L185 omatonBuilderFactory]: Interpolants [247#true, 248#false, 249#(<= proc_i 0), 250#(<= proc_i 4), 251#(<= proc_i 8), 252#(<= proc_i 12), 253#(<= proc_i 16), 254#(<= proc_i 20)] [2018-07-23 13:51:37,916 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:37,916 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:51:37,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:51:37,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:51:37,917 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 8 states. [2018-07-23 13:51:37,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:37,965 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 13:51:37,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:51:37,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-07-23 13:51:37,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:37,966 INFO L225 Difference]: With dead ends: 17 [2018-07-23 13:51:37,967 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 13:51:37,968 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 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:51:37,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 13:51:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-23 13:51:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-23 13:51:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-23 13:51:37,976 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-07-23 13:51:37,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:37,977 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-23 13:51:37,978 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:51:37,978 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-23 13:51:37,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:51:37,978 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:37,979 INFO L357 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2018-07-23 13:51:37,979 INFO L414 AbstractCegarLoop]: === Iteration 7 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:37,980 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2018-07-23 13:51:37,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:38,032 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:38,032 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:51:38,032 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:38,032 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:51:38,033 INFO L185 omatonBuilderFactory]: Interpolants [321#true, 322#false, 323#(<= proc_i 0), 324#(<= proc_i 4), 325#(<= proc_i 8), 326#(<= proc_i 12), 327#(<= proc_i 16), 328#(<= proc_i 20), 329#(<= proc_i 24)] [2018-07-23 13:51:38,033 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:38,034 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:51:38,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:51:38,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:51:38,035 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2018-07-23 13:51:38,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:38,057 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-23 13:51:38,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:51:38,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-07-23 13:51:38,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:38,058 INFO L225 Difference]: With dead ends: 19 [2018-07-23 13:51:38,059 INFO L226 Difference]: Without dead ends: 18 [2018-07-23 13:51:38,059 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 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:51:38,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-23 13:51:38,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-23 13:51:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-23 13:51:38,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-23 13:51:38,065 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-07-23 13:51:38,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:38,065 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-23 13:51:38,065 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:51:38,066 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-23 13:51:38,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:51:38,066 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:38,067 INFO L357 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2018-07-23 13:51:38,067 INFO L414 AbstractCegarLoop]: === Iteration 8 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:38,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2018-07-23 13:51:38,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:38,167 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:38,168 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:51:38,168 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:38,168 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:51:38,169 INFO L185 omatonBuilderFactory]: Interpolants [404#true, 405#false, 406#(<= proc_i 0), 407#(<= proc_i 4), 408#(<= proc_i 8), 409#(<= proc_i 12), 410#(<= proc_i 16), 411#(<= proc_i 20), 412#(<= proc_i 24), 413#(<= proc_i 28)] [2018-07-23 13:51:38,169 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:38,169 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:51:38,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:51:38,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:51:38,171 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2018-07-23 13:51:38,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:38,192 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-23 13:51:38,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:51:38,193 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-07-23 13:51:38,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:38,194 INFO L225 Difference]: With dead ends: 21 [2018-07-23 13:51:38,194 INFO L226 Difference]: Without dead ends: 20 [2018-07-23 13:51:38,195 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 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:51:38,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-23 13:51:38,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-23 13:51:38,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-23 13:51:38,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-23 13:51:38,200 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-07-23 13:51:38,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:38,201 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-23 13:51:38,201 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:51:38,201 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-23 13:51:38,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:51:38,202 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:38,202 INFO L357 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2018-07-23 13:51:38,203 INFO L414 AbstractCegarLoop]: === Iteration 9 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:38,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2018-07-23 13:51:38,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:38,272 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:38,273 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:51:38,273 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:38,276 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:51:38,277 INFO L185 omatonBuilderFactory]: Interpolants [496#true, 497#false, 498#(<= proc_i 0), 499#(<= proc_i 4), 500#(<= proc_i 8), 501#(<= proc_i 12), 502#(<= proc_i 16), 503#(<= proc_i 20), 504#(<= proc_i 24), 505#(<= proc_i 28), 506#(<= proc_i 32)] [2018-07-23 13:51:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:38,281 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:51:38,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:51:38,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:51:38,282 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 11 states. [2018-07-23 13:51:38,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:38,331 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-23 13:51:38,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:51:38,331 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-07-23 13:51:38,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:38,333 INFO L225 Difference]: With dead ends: 23 [2018-07-23 13:51:38,333 INFO L226 Difference]: Without dead ends: 22 [2018-07-23 13:51:38,333 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 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:51:38,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-23 13:51:38,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-23 13:51:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-23 13:51:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-23 13:51:38,339 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-07-23 13:51:38,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:38,339 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-23 13:51:38,339 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:51:38,340 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-23 13:51:38,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:51:38,340 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:38,341 INFO L357 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2018-07-23 13:51:38,341 INFO L414 AbstractCegarLoop]: === Iteration 10 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:38,341 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2018-07-23 13:51:38,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:38,387 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:38,387 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:38,387 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:51:38,388 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:38,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:51:38,388 INFO L185 omatonBuilderFactory]: Interpolants [608#(<= proc_i 36), 597#true, 598#false, 599#(<= proc_i 0), 600#(<= proc_i 4), 601#(<= proc_i 8), 602#(<= proc_i 12), 603#(<= proc_i 16), 604#(<= proc_i 20), 605#(<= proc_i 24), 606#(<= proc_i 28), 607#(<= proc_i 32)] [2018-07-23 13:51:38,389 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:38,389 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:51:38,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:51:38,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:51:38,390 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2018-07-23 13:51:38,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:38,428 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-23 13:51:38,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:51:38,429 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:51:38,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:38,430 INFO L225 Difference]: With dead ends: 25 [2018-07-23 13:51:38,430 INFO L226 Difference]: Without dead ends: 24 [2018-07-23 13:51:38,431 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 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:51:38,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-23 13:51:38,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-23 13:51:38,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-23 13:51:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-23 13:51:38,437 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-07-23 13:51:38,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:38,437 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-23 13:51:38,437 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:51:38,438 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-23 13:51:38,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:51:38,438 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:38,439 INFO L357 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2018-07-23 13:51:38,439 INFO L414 AbstractCegarLoop]: === Iteration 11 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:38,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2018-07-23 13:51:38,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:38,496 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:38,497 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:38,497 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:51:38,497 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:38,498 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:51:38,498 INFO L185 omatonBuilderFactory]: Interpolants [707#true, 708#false, 709#(<= proc_i 0), 710#(<= proc_i 4), 711#(<= proc_i 8), 712#(<= proc_i 12), 713#(<= proc_i 16), 714#(<= proc_i 20), 715#(<= proc_i 24), 716#(<= proc_i 28), 717#(<= proc_i 32), 718#(<= proc_i 36), 719#(<= proc_i 40)] [2018-07-23 13:51:38,498 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:38,499 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:51:38,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:51:38,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:51:38,500 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 13 states. [2018-07-23 13:51:38,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:38,521 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-23 13:51:38,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:51:38,521 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-07-23 13:51:38,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:38,522 INFO L225 Difference]: With dead ends: 27 [2018-07-23 13:51:38,522 INFO L226 Difference]: Without dead ends: 26 [2018-07-23 13:51:38,523 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 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:51:38,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-23 13:51:38,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-23 13:51:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-23 13:51:38,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-23 13:51:38,529 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-07-23 13:51:38,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:38,529 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-23 13:51:38,530 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:51:38,530 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-23 13:51:38,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:51:38,531 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:38,531 INFO L357 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2018-07-23 13:51:38,531 INFO L414 AbstractCegarLoop]: === Iteration 12 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:38,531 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2018-07-23 13:51:38,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:38,583 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:38,584 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:38,584 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:51:38,584 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:38,585 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:51:38,585 INFO L185 omatonBuilderFactory]: Interpolants [832#(<= proc_i 16), 833#(<= proc_i 20), 834#(<= proc_i 24), 835#(<= proc_i 28), 836#(<= proc_i 32), 837#(<= proc_i 36), 838#(<= proc_i 40), 839#(<= proc_i 44), 826#true, 827#false, 828#(<= proc_i 0), 829#(<= proc_i 4), 830#(<= proc_i 8), 831#(<= proc_i 12)] [2018-07-23 13:51:38,586 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:38,586 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:51:38,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:51:38,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:51:38,587 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2018-07-23 13:51:38,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:38,619 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-23 13:51:38,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:51:38,620 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-07-23 13:51:38,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:38,621 INFO L225 Difference]: With dead ends: 29 [2018-07-23 13:51:38,621 INFO L226 Difference]: Without dead ends: 28 [2018-07-23 13:51:38,622 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 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:51:38,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-23 13:51:38,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-23 13:51:38,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-23 13:51:38,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-23 13:51:38,640 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-07-23 13:51:38,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:38,642 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-23 13:51:38,642 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:51:38,642 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-23 13:51:38,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-23 13:51:38,643 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:38,643 INFO L357 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2018-07-23 13:51:38,645 INFO L414 AbstractCegarLoop]: === Iteration 13 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:38,646 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2018-07-23 13:51:38,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:38,728 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:38,730 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:51:38,730 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:38,731 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:51:38,731 INFO L185 omatonBuilderFactory]: Interpolants [960#(<= proc_i 16), 961#(<= proc_i 20), 962#(<= proc_i 24), 963#(<= proc_i 28), 964#(<= proc_i 32), 965#(<= proc_i 36), 966#(<= proc_i 40), 967#(<= proc_i 44), 968#(<= proc_i 48), 954#true, 955#false, 956#(<= proc_i 0), 957#(<= proc_i 4), 958#(<= proc_i 8), 959#(<= proc_i 12)] [2018-07-23 13:51:38,732 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:38,732 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:51:38,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:51:38,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:51:38,733 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 15 states. [2018-07-23 13:51:38,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:38,773 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-23 13:51:38,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:51:38,773 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2018-07-23 13:51:38,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:38,774 INFO L225 Difference]: With dead ends: 31 [2018-07-23 13:51:38,778 INFO L226 Difference]: Without dead ends: 30 [2018-07-23 13:51:38,779 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 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:51:38,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-23 13:51:38,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-23 13:51:38,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-23 13:51:38,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-23 13:51:38,785 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-07-23 13:51:38,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:38,786 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-23 13:51:38,786 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:51:38,786 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-23 13:51:38,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:51:38,787 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:38,787 INFO L357 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2018-07-23 13:51:38,787 INFO L414 AbstractCegarLoop]: === Iteration 14 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:38,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2018-07-23 13:51:38,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:38,844 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:38,845 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:38,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:51:38,845 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:38,847 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:51:38,847 INFO L185 omatonBuilderFactory]: Interpolants [1091#true, 1092#false, 1093#(<= proc_i 0), 1094#(<= proc_i 4), 1095#(<= proc_i 8), 1096#(<= proc_i 12), 1097#(<= proc_i 16), 1098#(<= proc_i 20), 1099#(<= proc_i 24), 1100#(<= proc_i 28), 1101#(<= proc_i 32), 1102#(<= proc_i 36), 1103#(<= proc_i 40), 1104#(<= proc_i 44), 1105#(<= proc_i 48), 1106#(<= proc_i 52)] [2018-07-23 13:51:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:38,848 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:51:38,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:51:38,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:51:38,849 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 16 states. [2018-07-23 13:51:38,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:38,870 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-23 13:51:38,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:51:38,870 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-07-23 13:51:38,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:38,871 INFO L225 Difference]: With dead ends: 33 [2018-07-23 13:51:38,871 INFO L226 Difference]: Without dead ends: 32 [2018-07-23 13:51:38,872 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 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:51:38,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-23 13:51:38,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-23 13:51:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-23 13:51:38,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-23 13:51:38,878 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-07-23 13:51:38,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:38,879 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-23 13:51:38,879 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:51:38,879 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-23 13:51:38,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-23 13:51:38,880 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:38,880 INFO L357 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2018-07-23 13:51:38,881 INFO L414 AbstractCegarLoop]: === Iteration 15 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:38,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2018-07-23 13:51:38,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:38,947 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:51:38,948 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:38,948 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:51:38,948 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:38,949 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:51:38,949 INFO L185 omatonBuilderFactory]: Interpolants [1248#(<= proc_i 36), 1249#(<= proc_i 40), 1250#(<= proc_i 44), 1251#(<= proc_i 48), 1252#(<= proc_i 52), 1253#(<= proc_i 56), 1237#true, 1238#false, 1239#(<= proc_i 0), 1240#(<= proc_i 4), 1241#(<= proc_i 8), 1242#(<= proc_i 12), 1243#(<= proc_i 16), 1244#(<= proc_i 20), 1245#(<= proc_i 24), 1246#(<= proc_i 28), 1247#(<= proc_i 32)] [2018-07-23 13:51:38,950 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:51:38,950 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 13:51:38,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 13:51:38,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:51:38,952 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 17 states. [2018-07-23 13:51:38,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:38,976 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-23 13:51:38,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:51:38,977 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2018-07-23 13:51:38,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:38,978 INFO L225 Difference]: With dead ends: 35 [2018-07-23 13:51:38,978 INFO L226 Difference]: Without dead ends: 34 [2018-07-23 13:51:38,978 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 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:51:38,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-23 13:51:38,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-23 13:51:38,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-23 13:51:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-23 13:51:38,983 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-07-23 13:51:38,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:38,984 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-23 13:51:38,984 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 13:51:38,984 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-23 13:51:38,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-23 13:51:38,985 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:38,985 INFO L357 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2018-07-23 13:51:38,985 INFO L414 AbstractCegarLoop]: === Iteration 16 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:38,985 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2018-07-23 13:51:38,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:39,062 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:39,063 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:39,063 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 13:51:39,064 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:39,064 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:51:39,065 INFO L185 omatonBuilderFactory]: Interpolants [1408#(<= proc_i 56), 1409#(<= proc_i 60), 1392#true, 1393#false, 1394#(<= proc_i 0), 1395#(<= proc_i 4), 1396#(<= proc_i 8), 1397#(<= proc_i 12), 1398#(<= proc_i 16), 1399#(<= proc_i 20), 1400#(<= proc_i 24), 1401#(<= proc_i 28), 1402#(<= proc_i 32), 1403#(<= proc_i 36), 1404#(<= proc_i 40), 1405#(<= proc_i 44), 1406#(<= proc_i 48), 1407#(<= proc_i 52)] [2018-07-23 13:51:39,065 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:39,065 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 13:51:39,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 13:51:39,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:51:39,066 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 18 states. [2018-07-23 13:51:39,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:39,083 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-23 13:51:39,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:51:39,084 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-07-23 13:51:39,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:39,085 INFO L225 Difference]: With dead ends: 37 [2018-07-23 13:51:39,085 INFO L226 Difference]: Without dead ends: 36 [2018-07-23 13:51:39,086 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 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:51:39,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-23 13:51:39,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-23 13:51:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-23 13:51:39,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-23 13:51:39,091 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-07-23 13:51:39,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:39,091 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-23 13:51:39,092 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 13:51:39,092 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-23 13:51:39,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-23 13:51:39,093 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:39,093 INFO L357 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2018-07-23 13:51:39,093 INFO L414 AbstractCegarLoop]: === Iteration 17 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:39,093 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2018-07-23 13:51:39,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:39,161 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:39,162 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:39,162 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 13:51:39,163 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:39,163 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:51:39,163 INFO L185 omatonBuilderFactory]: Interpolants [1568#(<= proc_i 40), 1569#(<= proc_i 44), 1570#(<= proc_i 48), 1571#(<= proc_i 52), 1572#(<= proc_i 56), 1573#(<= proc_i 60), 1574#(<= proc_i 64), 1556#true, 1557#false, 1558#(<= proc_i 0), 1559#(<= proc_i 4), 1560#(<= proc_i 8), 1561#(<= proc_i 12), 1562#(<= proc_i 16), 1563#(<= proc_i 20), 1564#(<= proc_i 24), 1565#(<= proc_i 28), 1566#(<= proc_i 32), 1567#(<= proc_i 36)] [2018-07-23 13:51:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:39,164 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-23 13:51:39,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-23 13:51:39,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:51:39,165 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 19 states. [2018-07-23 13:51:39,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:39,182 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-23 13:51:39,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:51:39,183 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2018-07-23 13:51:39,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:39,183 INFO L225 Difference]: With dead ends: 39 [2018-07-23 13:51:39,184 INFO L226 Difference]: Without dead ends: 38 [2018-07-23 13:51:39,184 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 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:51:39,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-23 13:51:39,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-23 13:51:39,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-23 13:51:39,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-23 13:51:39,190 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-07-23 13:51:39,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:39,190 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-23 13:51:39,190 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-23 13:51:39,190 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-23 13:51:39,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-23 13:51:39,191 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:39,191 INFO L357 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2018-07-23 13:51:39,191 INFO L414 AbstractCegarLoop]: === Iteration 18 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:39,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2018-07-23 13:51:39,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:39,263 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:39,264 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:39,264 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-23 13:51:39,264 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:39,265 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:51:39,265 INFO L185 omatonBuilderFactory]: Interpolants [1729#true, 1730#false, 1731#(<= proc_i 0), 1732#(<= proc_i 4), 1733#(<= proc_i 8), 1734#(<= proc_i 12), 1735#(<= proc_i 16), 1736#(<= proc_i 20), 1737#(<= proc_i 24), 1738#(<= proc_i 28), 1739#(<= proc_i 32), 1740#(<= proc_i 36), 1741#(<= proc_i 40), 1742#(<= proc_i 44), 1743#(<= proc_i 48), 1744#(<= proc_i 52), 1745#(<= proc_i 56), 1746#(<= proc_i 60), 1747#(<= proc_i 64), 1748#(<= proc_i 68)] [2018-07-23 13:51:39,266 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:39,266 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 13:51:39,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 13:51:39,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:51:39,267 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 20 states. [2018-07-23 13:51:39,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:39,289 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-23 13:51:39,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:51:39,290 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2018-07-23 13:51:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:39,291 INFO L225 Difference]: With dead ends: 41 [2018-07-23 13:51:39,291 INFO L226 Difference]: Without dead ends: 40 [2018-07-23 13:51:39,294 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 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:51:39,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-23 13:51:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-23 13:51:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-23 13:51:39,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-23 13:51:39,306 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-07-23 13:51:39,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:39,307 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-23 13:51:39,307 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 13:51:39,307 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-23 13:51:39,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-23 13:51:39,308 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:39,310 INFO L357 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2018-07-23 13:51:39,310 INFO L414 AbstractCegarLoop]: === Iteration 19 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:39,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2018-07-23 13:51:39,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:39,427 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:39,427 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:39,427 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-23 13:51:39,428 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:39,428 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:51:39,429 INFO L185 omatonBuilderFactory]: Interpolants [1920#(<= proc_i 28), 1921#(<= proc_i 32), 1922#(<= proc_i 36), 1923#(<= proc_i 40), 1924#(<= proc_i 44), 1925#(<= proc_i 48), 1926#(<= proc_i 52), 1927#(<= proc_i 56), 1928#(<= proc_i 60), 1929#(<= proc_i 64), 1930#(<= proc_i 68), 1931#(<= proc_i 72), 1911#true, 1912#false, 1913#(<= proc_i 0), 1914#(<= proc_i 4), 1915#(<= proc_i 8), 1916#(<= proc_i 12), 1917#(<= proc_i 16), 1918#(<= proc_i 20), 1919#(<= proc_i 24)] [2018-07-23 13:51:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:39,429 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 13:51:39,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 13:51:39,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:51:39,432 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 21 states. [2018-07-23 13:51:39,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:39,455 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-23 13:51:39,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:51:39,456 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2018-07-23 13:51:39,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:39,458 INFO L225 Difference]: With dead ends: 43 [2018-07-23 13:51:39,458 INFO L226 Difference]: Without dead ends: 42 [2018-07-23 13:51:39,459 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 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:51:39,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-23 13:51:39,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-23 13:51:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-23 13:51:39,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-23 13:51:39,466 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-07-23 13:51:39,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:39,466 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-23 13:51:39,467 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 13:51:39,467 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-23 13:51:39,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-23 13:51:39,468 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:39,468 INFO L357 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2018-07-23 13:51:39,469 INFO L414 AbstractCegarLoop]: === Iteration 20 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:39,469 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2018-07-23 13:51:39,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:39,563 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:39,563 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:39,564 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-23 13:51:39,564 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:39,564 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:51:39,565 INFO L185 omatonBuilderFactory]: Interpolants [2112#(<= proc_i 32), 2113#(<= proc_i 36), 2114#(<= proc_i 40), 2115#(<= proc_i 44), 2116#(<= proc_i 48), 2117#(<= proc_i 52), 2118#(<= proc_i 56), 2119#(<= proc_i 60), 2120#(<= proc_i 64), 2121#(<= proc_i 68), 2122#(<= proc_i 72), 2123#(<= proc_i 76), 2102#true, 2103#false, 2104#(<= proc_i 0), 2105#(<= proc_i 4), 2106#(<= proc_i 8), 2107#(<= proc_i 12), 2108#(<= proc_i 16), 2109#(<= proc_i 20), 2110#(<= proc_i 24), 2111#(<= proc_i 28)] [2018-07-23 13:51:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:39,566 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-23 13:51:39,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-23 13:51:39,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:51:39,567 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 22 states. [2018-07-23 13:51:39,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:39,588 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-23 13:51:39,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:51:39,589 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2018-07-23 13:51:39,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:39,590 INFO L225 Difference]: With dead ends: 45 [2018-07-23 13:51:39,590 INFO L226 Difference]: Without dead ends: 44 [2018-07-23 13:51:39,591 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 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:51:39,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-23 13:51:39,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-23 13:51:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-23 13:51:39,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-23 13:51:39,599 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-07-23 13:51:39,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:39,600 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-23 13:51:39,600 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-23 13:51:39,600 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-23 13:51:39,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-23 13:51:39,603 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:39,603 INFO L357 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2018-07-23 13:51:39,603 INFO L414 AbstractCegarLoop]: === Iteration 21 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:39,603 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2018-07-23 13:51:39,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:39,700 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:39,701 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:39,701 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-23 13:51:39,701 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:39,702 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:51:39,702 INFO L185 omatonBuilderFactory]: Interpolants [2304#(<= proc_i 0), 2305#(<= proc_i 4), 2306#(<= proc_i 8), 2307#(<= proc_i 12), 2308#(<= proc_i 16), 2309#(<= proc_i 20), 2310#(<= proc_i 24), 2311#(<= proc_i 28), 2312#(<= proc_i 32), 2313#(<= proc_i 36), 2314#(<= proc_i 40), 2315#(<= proc_i 44), 2316#(<= proc_i 48), 2317#(<= proc_i 52), 2318#(<= proc_i 56), 2319#(<= proc_i 60), 2320#(<= proc_i 64), 2321#(<= proc_i 68), 2322#(<= proc_i 72), 2323#(<= proc_i 76), 2324#(<= proc_i 80), 2302#true, 2303#false] [2018-07-23 13:51:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:39,703 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 13:51:39,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 13:51:39,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:51:39,704 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 23 states. [2018-07-23 13:51:39,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:39,731 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-23 13:51:39,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:51:39,731 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2018-07-23 13:51:39,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:39,732 INFO L225 Difference]: With dead ends: 47 [2018-07-23 13:51:39,732 INFO L226 Difference]: Without dead ends: 46 [2018-07-23 13:51:39,733 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 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:51:39,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-23 13:51:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-23 13:51:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-23 13:51:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-23 13:51:39,747 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-07-23 13:51:39,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:39,748 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-23 13:51:39,748 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 13:51:39,748 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-23 13:51:39,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-23 13:51:39,749 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:39,749 INFO L357 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2018-07-23 13:51:39,749 INFO L414 AbstractCegarLoop]: === Iteration 22 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:39,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2018-07-23 13:51:39,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:39,875 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:39,875 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-23 13:51:39,875 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:39,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:51:39,876 INFO L185 omatonBuilderFactory]: Interpolants [2528#(<= proc_i 60), 2529#(<= proc_i 64), 2530#(<= proc_i 68), 2531#(<= proc_i 72), 2532#(<= proc_i 76), 2533#(<= proc_i 80), 2534#(<= proc_i 84), 2511#true, 2512#false, 2513#(<= proc_i 0), 2514#(<= proc_i 4), 2515#(<= proc_i 8), 2516#(<= proc_i 12), 2517#(<= proc_i 16), 2518#(<= proc_i 20), 2519#(<= proc_i 24), 2520#(<= proc_i 28), 2521#(<= proc_i 32), 2522#(<= proc_i 36), 2523#(<= proc_i 40), 2524#(<= proc_i 44), 2525#(<= proc_i 48), 2526#(<= proc_i 52), 2527#(<= proc_i 56)] [2018-07-23 13:51:39,877 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:39,880 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 13:51:39,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 13:51:39,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:51:39,881 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 24 states. [2018-07-23 13:51:39,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:39,903 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-23 13:51:39,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:51:39,903 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-07-23 13:51:39,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:39,904 INFO L225 Difference]: With dead ends: 49 [2018-07-23 13:51:39,904 INFO L226 Difference]: Without dead ends: 48 [2018-07-23 13:51:39,907 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 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:51:39,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-23 13:51:39,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-23 13:51:39,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-23 13:51:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-23 13:51:39,914 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-07-23 13:51:39,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:39,914 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-23 13:51:39,914 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 13:51:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-23 13:51:39,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-23 13:51:39,915 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:39,915 INFO L357 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2018-07-23 13:51:39,915 INFO L414 AbstractCegarLoop]: === Iteration 23 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:39,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2018-07-23 13:51:39,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:40,049 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:40,049 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-23 13:51:40,049 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:40,050 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:51:40,050 INFO L185 omatonBuilderFactory]: Interpolants [2752#(<= proc_i 84), 2753#(<= proc_i 88), 2729#true, 2730#false, 2731#(<= proc_i 0), 2732#(<= proc_i 4), 2733#(<= proc_i 8), 2734#(<= proc_i 12), 2735#(<= proc_i 16), 2736#(<= proc_i 20), 2737#(<= proc_i 24), 2738#(<= proc_i 28), 2739#(<= proc_i 32), 2740#(<= proc_i 36), 2741#(<= proc_i 40), 2742#(<= proc_i 44), 2743#(<= proc_i 48), 2744#(<= proc_i 52), 2745#(<= proc_i 56), 2746#(<= proc_i 60), 2747#(<= proc_i 64), 2748#(<= proc_i 68), 2749#(<= proc_i 72), 2750#(<= proc_i 76), 2751#(<= proc_i 80)] [2018-07-23 13:51:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:40,051 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 13:51:40,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 13:51:40,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:51:40,052 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 25 states. [2018-07-23 13:51:40,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:40,078 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-23 13:51:40,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 13:51:40,079 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-07-23 13:51:40,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:40,079 INFO L225 Difference]: With dead ends: 51 [2018-07-23 13:51:40,079 INFO L226 Difference]: Without dead ends: 50 [2018-07-23 13:51:40,080 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 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:51:40,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-23 13:51:40,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-23 13:51:40,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-23 13:51:40,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-23 13:51:40,093 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-07-23 13:51:40,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:40,093 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-23 13:51:40,093 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 13:51:40,094 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-23 13:51:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-23 13:51:40,094 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:40,094 INFO L357 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2018-07-23 13:51:40,095 INFO L414 AbstractCegarLoop]: === Iteration 24 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:40,095 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2018-07-23 13:51:40,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:40,199 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:40,199 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-23 13:51:40,200 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:40,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:51:40,201 INFO L185 omatonBuilderFactory]: Interpolants [2956#true, 2957#false, 2958#(<= proc_i 0), 2959#(<= proc_i 4), 2960#(<= proc_i 8), 2961#(<= proc_i 12), 2962#(<= proc_i 16), 2963#(<= proc_i 20), 2964#(<= proc_i 24), 2965#(<= proc_i 28), 2966#(<= proc_i 32), 2967#(<= proc_i 36), 2968#(<= proc_i 40), 2969#(<= proc_i 44), 2970#(<= proc_i 48), 2971#(<= proc_i 52), 2972#(<= proc_i 56), 2973#(<= proc_i 60), 2974#(<= proc_i 64), 2975#(<= proc_i 68), 2976#(<= proc_i 72), 2977#(<= proc_i 76), 2978#(<= proc_i 80), 2979#(<= proc_i 84), 2980#(<= proc_i 88), 2981#(<= proc_i 92)] [2018-07-23 13:51:40,201 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:40,202 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 13:51:40,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 13:51:40,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:51:40,203 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 26 states. [2018-07-23 13:51:40,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:40,227 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-23 13:51:40,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:51:40,228 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2018-07-23 13:51:40,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:40,229 INFO L225 Difference]: With dead ends: 53 [2018-07-23 13:51:40,229 INFO L226 Difference]: Without dead ends: 52 [2018-07-23 13:51:40,230 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 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:51:40,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-23 13:51:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-07-23 13:51:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-23 13:51:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-07-23 13:51:40,241 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-07-23 13:51:40,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:40,241 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-07-23 13:51:40,241 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 13:51:40,242 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-07-23 13:51:40,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-23 13:51:40,242 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:40,242 INFO L357 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2018-07-23 13:51:40,243 INFO L414 AbstractCegarLoop]: === Iteration 25 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:40,243 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2018-07-23 13:51:40,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:40,377 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:40,378 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:40,378 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-23 13:51:40,378 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:40,379 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:51:40,379 INFO L185 omatonBuilderFactory]: Interpolants [3200#(<= proc_i 24), 3201#(<= proc_i 28), 3202#(<= proc_i 32), 3203#(<= proc_i 36), 3204#(<= proc_i 40), 3205#(<= proc_i 44), 3206#(<= proc_i 48), 3207#(<= proc_i 52), 3208#(<= proc_i 56), 3209#(<= proc_i 60), 3210#(<= proc_i 64), 3211#(<= proc_i 68), 3212#(<= proc_i 72), 3213#(<= proc_i 76), 3214#(<= proc_i 80), 3215#(<= proc_i 84), 3216#(<= proc_i 88), 3217#(<= proc_i 92), 3218#(<= proc_i 96), 3192#true, 3193#false, 3194#(<= proc_i 0), 3195#(<= proc_i 4), 3196#(<= proc_i 8), 3197#(<= proc_i 12), 3198#(<= proc_i 16), 3199#(<= proc_i 20)] [2018-07-23 13:51:40,380 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:40,380 INFO L450 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-23 13:51:40,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-23 13:51:40,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:51:40,382 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 27 states. [2018-07-23 13:51:40,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:40,408 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-23 13:51:40,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 13:51:40,408 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2018-07-23 13:51:40,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:40,409 INFO L225 Difference]: With dead ends: 55 [2018-07-23 13:51:40,409 INFO L226 Difference]: Without dead ends: 54 [2018-07-23 13:51:40,410 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 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:51:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-23 13:51:40,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-07-23 13:51:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-23 13:51:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-07-23 13:51:40,415 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-07-23 13:51:40,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:40,416 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-07-23 13:51:40,416 INFO L472 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-23 13:51:40,416 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-07-23 13:51:40,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-23 13:51:40,416 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:40,417 INFO L357 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2018-07-23 13:51:40,417 INFO L414 AbstractCegarLoop]: === Iteration 26 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:40,417 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2018-07-23 13:51:40,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:40,549 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:40,549 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:40,549 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-23 13:51:40,550 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:40,550 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:51:40,550 INFO L185 omatonBuilderFactory]: Interpolants [3456#(<= proc_i 68), 3457#(<= proc_i 72), 3458#(<= proc_i 76), 3459#(<= proc_i 80), 3460#(<= proc_i 84), 3461#(<= proc_i 88), 3462#(<= proc_i 92), 3463#(<= proc_i 96), 3464#(<= proc_i 100), 3437#true, 3438#false, 3439#(<= proc_i 0), 3440#(<= proc_i 4), 3441#(<= proc_i 8), 3442#(<= proc_i 12), 3443#(<= proc_i 16), 3444#(<= proc_i 20), 3445#(<= proc_i 24), 3446#(<= proc_i 28), 3447#(<= proc_i 32), 3448#(<= proc_i 36), 3449#(<= proc_i 40), 3450#(<= proc_i 44), 3451#(<= proc_i 48), 3452#(<= proc_i 52), 3453#(<= proc_i 56), 3454#(<= proc_i 60), 3455#(<= proc_i 64)] [2018-07-23 13:51:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:40,551 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 13:51:40,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 13:51:40,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:51:40,553 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 28 states. [2018-07-23 13:51:40,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:40,573 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-23 13:51:40,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:51:40,574 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2018-07-23 13:51:40,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:40,575 INFO L225 Difference]: With dead ends: 57 [2018-07-23 13:51:40,575 INFO L226 Difference]: Without dead ends: 56 [2018-07-23 13:51:40,576 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 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:51:40,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-23 13:51:40,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-23 13:51:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-23 13:51:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-23 13:51:40,584 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-07-23 13:51:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:40,585 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-23 13:51:40,585 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 13:51:40,585 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-23 13:51:40,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-23 13:51:40,588 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:40,589 INFO L357 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2018-07-23 13:51:40,589 INFO L414 AbstractCegarLoop]: === Iteration 27 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:40,589 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2018-07-23 13:51:40,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:40,714 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:40,714 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-23 13:51:40,715 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:40,715 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:51:40,715 INFO L185 omatonBuilderFactory]: Interpolants [3712#(<= proc_i 76), 3713#(<= proc_i 80), 3714#(<= proc_i 84), 3715#(<= proc_i 88), 3716#(<= proc_i 92), 3717#(<= proc_i 96), 3718#(<= proc_i 100), 3719#(<= proc_i 104), 3691#true, 3692#false, 3693#(<= proc_i 0), 3694#(<= proc_i 4), 3695#(<= proc_i 8), 3696#(<= proc_i 12), 3697#(<= proc_i 16), 3698#(<= proc_i 20), 3699#(<= proc_i 24), 3700#(<= proc_i 28), 3701#(<= proc_i 32), 3702#(<= proc_i 36), 3703#(<= proc_i 40), 3704#(<= proc_i 44), 3705#(<= proc_i 48), 3706#(<= proc_i 52), 3707#(<= proc_i 56), 3708#(<= proc_i 60), 3709#(<= proc_i 64), 3710#(<= proc_i 68), 3711#(<= proc_i 72)] [2018-07-23 13:51:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:40,716 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-23 13:51:40,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-23 13:51:40,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:51:40,718 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 29 states. [2018-07-23 13:51:40,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:40,738 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-23 13:51:40,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:51:40,738 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2018-07-23 13:51:40,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:40,739 INFO L225 Difference]: With dead ends: 59 [2018-07-23 13:51:40,739 INFO L226 Difference]: Without dead ends: 58 [2018-07-23 13:51:40,740 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 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:51:40,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-23 13:51:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-07-23 13:51:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-23 13:51:40,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-07-23 13:51:40,744 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-07-23 13:51:40,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:40,744 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-07-23 13:51:40,745 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-23 13:51:40,745 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-07-23 13:51:40,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-23 13:51:40,745 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:40,745 INFO L357 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2018-07-23 13:51:40,746 INFO L414 AbstractCegarLoop]: === Iteration 28 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:40,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2018-07-23 13:51:40,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:40,873 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:40,874 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-23 13:51:40,874 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:40,874 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:51:40,875 INFO L185 omatonBuilderFactory]: Interpolants [3968#(<= proc_i 48), 3969#(<= proc_i 52), 3970#(<= proc_i 56), 3971#(<= proc_i 60), 3972#(<= proc_i 64), 3973#(<= proc_i 68), 3974#(<= proc_i 72), 3975#(<= proc_i 76), 3976#(<= proc_i 80), 3977#(<= proc_i 84), 3978#(<= proc_i 88), 3979#(<= proc_i 92), 3980#(<= proc_i 96), 3981#(<= proc_i 100), 3982#(<= proc_i 104), 3983#(<= proc_i 108), 3954#true, 3955#false, 3956#(<= proc_i 0), 3957#(<= proc_i 4), 3958#(<= proc_i 8), 3959#(<= proc_i 12), 3960#(<= proc_i 16), 3961#(<= proc_i 20), 3962#(<= proc_i 24), 3963#(<= proc_i 28), 3964#(<= proc_i 32), 3965#(<= proc_i 36), 3966#(<= proc_i 40), 3967#(<= proc_i 44)] [2018-07-23 13:51:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:40,876 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 13:51:40,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 13:51:40,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:51:40,877 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 30 states. [2018-07-23 13:51:40,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:40,904 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-23 13:51:40,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 13:51:40,904 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2018-07-23 13:51:40,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:40,905 INFO L225 Difference]: With dead ends: 61 [2018-07-23 13:51:40,905 INFO L226 Difference]: Without dead ends: 60 [2018-07-23 13:51:40,906 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 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:51:40,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-23 13:51:40,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-23 13:51:40,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-23 13:51:40,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-23 13:51:40,909 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-07-23 13:51:40,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:40,910 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-23 13:51:40,910 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 13:51:40,910 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-23 13:51:40,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-23 13:51:40,910 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:40,911 INFO L357 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2018-07-23 13:51:40,911 INFO L414 AbstractCegarLoop]: === Iteration 29 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:40,911 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2018-07-23 13:51:40,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:41,048 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:41,049 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:41,049 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-23 13:51:41,049 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:41,049 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:51:41,050 INFO L185 omatonBuilderFactory]: Interpolants [4226#true, 4227#false, 4228#(<= proc_i 0), 4229#(<= proc_i 4), 4230#(<= proc_i 8), 4231#(<= proc_i 12), 4232#(<= proc_i 16), 4233#(<= proc_i 20), 4234#(<= proc_i 24), 4235#(<= proc_i 28), 4236#(<= proc_i 32), 4237#(<= proc_i 36), 4238#(<= proc_i 40), 4239#(<= proc_i 44), 4240#(<= proc_i 48), 4241#(<= proc_i 52), 4242#(<= proc_i 56), 4243#(<= proc_i 60), 4244#(<= proc_i 64), 4245#(<= proc_i 68), 4246#(<= proc_i 72), 4247#(<= proc_i 76), 4248#(<= proc_i 80), 4249#(<= proc_i 84), 4250#(<= proc_i 88), 4251#(<= proc_i 92), 4252#(<= proc_i 96), 4253#(<= proc_i 100), 4254#(<= proc_i 104), 4255#(<= proc_i 108), 4256#(<= proc_i 112)] [2018-07-23 13:51:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:41,051 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 13:51:41,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 13:51:41,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:51:41,053 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 31 states. [2018-07-23 13:51:41,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:41,079 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-23 13:51:41,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 13:51:41,080 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2018-07-23 13:51:41,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:41,081 INFO L225 Difference]: With dead ends: 63 [2018-07-23 13:51:41,081 INFO L226 Difference]: Without dead ends: 62 [2018-07-23 13:51:41,082 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 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:51:41,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-23 13:51:41,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-23 13:51:41,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-23 13:51:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-23 13:51:41,087 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-07-23 13:51:41,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:41,088 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-23 13:51:41,088 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 13:51:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-23 13:51:41,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-23 13:51:41,089 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:41,089 INFO L357 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2018-07-23 13:51:41,089 INFO L414 AbstractCegarLoop]: === Iteration 30 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:41,089 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2018-07-23 13:51:41,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:41,283 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:41,283 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-23 13:51:41,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:41,283 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:51:41,283 INFO L185 omatonBuilderFactory]: Interpolants [4507#true, 4508#false, 4509#(<= proc_i 0), 4510#(<= proc_i 4), 4511#(<= proc_i 8), 4512#(<= proc_i 12), 4513#(<= proc_i 16), 4514#(<= proc_i 20), 4515#(<= proc_i 24), 4516#(<= proc_i 28), 4517#(<= proc_i 32), 4518#(<= proc_i 36), 4519#(<= proc_i 40), 4520#(<= proc_i 44), 4521#(<= proc_i 48), 4522#(<= proc_i 52), 4523#(<= proc_i 56), 4524#(<= proc_i 60), 4525#(<= proc_i 64), 4526#(<= proc_i 68), 4527#(<= proc_i 72), 4528#(<= proc_i 76), 4529#(<= proc_i 80), 4530#(<= proc_i 84), 4531#(<= proc_i 88), 4532#(<= proc_i 92), 4533#(<= proc_i 96), 4534#(<= proc_i 100), 4535#(<= proc_i 104), 4536#(<= proc_i 108), 4537#(<= proc_i 112), 4538#(<= proc_i 116)] [2018-07-23 13:51:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:41,285 INFO L450 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-23 13:51:41,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-23 13:51:41,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:51:41,286 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 32 states. [2018-07-23 13:51:41,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:41,309 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-23 13:51:41,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-23 13:51:41,312 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2018-07-23 13:51:41,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:41,312 INFO L225 Difference]: With dead ends: 65 [2018-07-23 13:51:41,312 INFO L226 Difference]: Without dead ends: 64 [2018-07-23 13:51:41,313 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:51:41,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-23 13:51:41,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-07-23 13:51:41,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-23 13:51:41,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-07-23 13:51:41,317 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-07-23 13:51:41,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:41,318 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-07-23 13:51:41,318 INFO L472 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-23 13:51:41,318 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-07-23 13:51:41,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-23 13:51:41,318 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:41,318 INFO L357 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2018-07-23 13:51:41,319 INFO L414 AbstractCegarLoop]: === Iteration 31 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:41,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2018-07-23 13:51:41,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:41,447 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:41,447 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:41,447 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-23 13:51:41,447 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:41,448 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:51:41,448 INFO L185 omatonBuilderFactory]: Interpolants [4800#(<= proc_i 4), 4801#(<= proc_i 8), 4802#(<= proc_i 12), 4803#(<= proc_i 16), 4804#(<= proc_i 20), 4805#(<= proc_i 24), 4806#(<= proc_i 28), 4807#(<= proc_i 32), 4808#(<= proc_i 36), 4809#(<= proc_i 40), 4810#(<= proc_i 44), 4811#(<= proc_i 48), 4812#(<= proc_i 52), 4813#(<= proc_i 56), 4814#(<= proc_i 60), 4815#(<= proc_i 64), 4816#(<= proc_i 68), 4817#(<= proc_i 72), 4818#(<= proc_i 76), 4819#(<= proc_i 80), 4820#(<= proc_i 84), 4821#(<= proc_i 88), 4822#(<= proc_i 92), 4823#(<= proc_i 96), 4824#(<= proc_i 100), 4825#(<= proc_i 104), 4826#(<= proc_i 108), 4827#(<= proc_i 112), 4828#(<= proc_i 116), 4829#(<= proc_i 120), 4797#true, 4798#false, 4799#(<= proc_i 0)] [2018-07-23 13:51:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:41,449 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 13:51:41,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 13:51:41,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:51:41,450 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 33 states. [2018-07-23 13:51:41,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:41,473 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-23 13:51:41,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 13:51:41,474 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2018-07-23 13:51:41,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:41,474 INFO L225 Difference]: With dead ends: 67 [2018-07-23 13:51:41,475 INFO L226 Difference]: Without dead ends: 66 [2018-07-23 13:51:41,476 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:51:41,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-23 13:51:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-07-23 13:51:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-23 13:51:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-23 13:51:41,479 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-07-23 13:51:41,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:41,479 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-23 13:51:41,479 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 13:51:41,479 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-23 13:51:41,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-23 13:51:41,480 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:41,480 INFO L357 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2018-07-23 13:51:41,480 INFO L414 AbstractCegarLoop]: === Iteration 32 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:41,480 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2018-07-23 13:51:41,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:41,625 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:41,626 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:41,626 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-23 13:51:41,626 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:41,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:51:41,626 INFO L185 omatonBuilderFactory]: Interpolants [5120#(<= proc_i 88), 5121#(<= proc_i 92), 5122#(<= proc_i 96), 5123#(<= proc_i 100), 5124#(<= proc_i 104), 5125#(<= proc_i 108), 5126#(<= proc_i 112), 5127#(<= proc_i 116), 5128#(<= proc_i 120), 5129#(<= proc_i 124), 5096#true, 5097#false, 5098#(<= proc_i 0), 5099#(<= proc_i 4), 5100#(<= proc_i 8), 5101#(<= proc_i 12), 5102#(<= proc_i 16), 5103#(<= proc_i 20), 5104#(<= proc_i 24), 5105#(<= proc_i 28), 5106#(<= proc_i 32), 5107#(<= proc_i 36), 5108#(<= proc_i 40), 5109#(<= proc_i 44), 5110#(<= proc_i 48), 5111#(<= proc_i 52), 5112#(<= proc_i 56), 5113#(<= proc_i 60), 5114#(<= proc_i 64), 5115#(<= proc_i 68), 5116#(<= proc_i 72), 5117#(<= proc_i 76), 5118#(<= proc_i 80), 5119#(<= proc_i 84)] [2018-07-23 13:51:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:41,628 INFO L450 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-23 13:51:41,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-23 13:51:41,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:51:41,629 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 34 states. [2018-07-23 13:51:41,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:41,651 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-23 13:51:41,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 13:51:41,652 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2018-07-23 13:51:41,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:41,653 INFO L225 Difference]: With dead ends: 69 [2018-07-23 13:51:41,653 INFO L226 Difference]: Without dead ends: 68 [2018-07-23 13:51:41,654 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 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:51:41,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-23 13:51:41,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-23 13:51:41,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-23 13:51:41,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-23 13:51:41,658 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-07-23 13:51:41,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:41,658 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-23 13:51:41,659 INFO L472 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-23 13:51:41,659 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-23 13:51:41,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-23 13:51:41,660 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:41,660 INFO L357 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2018-07-23 13:51:41,660 INFO L414 AbstractCegarLoop]: === Iteration 33 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:41,660 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2018-07-23 13:51:41,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:41,807 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:41,807 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-23 13:51:41,807 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:41,808 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:51:41,808 INFO L185 omatonBuilderFactory]: Interpolants [5404#true, 5405#false, 5406#(<= proc_i 0), 5407#(<= proc_i 4), 5408#(<= proc_i 8), 5409#(<= proc_i 12), 5410#(<= proc_i 16), 5411#(<= proc_i 20), 5412#(<= proc_i 24), 5413#(<= proc_i 28), 5414#(<= proc_i 32), 5415#(<= proc_i 36), 5416#(<= proc_i 40), 5417#(<= proc_i 44), 5418#(<= proc_i 48), 5419#(<= proc_i 52), 5420#(<= proc_i 56), 5421#(<= proc_i 60), 5422#(<= proc_i 64), 5423#(<= proc_i 68), 5424#(<= proc_i 72), 5425#(<= proc_i 76), 5426#(<= proc_i 80), 5427#(<= proc_i 84), 5428#(<= proc_i 88), 5429#(<= proc_i 92), 5430#(<= proc_i 96), 5431#(<= proc_i 100), 5432#(<= proc_i 104), 5433#(<= proc_i 108), 5434#(<= proc_i 112), 5435#(<= proc_i 116), 5436#(<= proc_i 120), 5437#(<= proc_i 124), 5438#(<= proc_i 128)] [2018-07-23 13:51:41,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:41,809 INFO L450 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-23 13:51:41,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-23 13:51:41,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:51:41,813 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 35 states. [2018-07-23 13:51:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:41,840 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-23 13:51:41,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 13:51:41,841 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2018-07-23 13:51:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:41,842 INFO L225 Difference]: With dead ends: 71 [2018-07-23 13:51:41,842 INFO L226 Difference]: Without dead ends: 70 [2018-07-23 13:51:41,843 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 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:51:41,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-23 13:51:41,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-23 13:51:41,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-23 13:51:41,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-07-23 13:51:41,848 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-07-23 13:51:41,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:41,848 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-07-23 13:51:41,848 INFO L472 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-23 13:51:41,848 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-07-23 13:51:41,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-23 13:51:41,849 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:41,849 INFO L357 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2018-07-23 13:51:41,849 INFO L414 AbstractCegarLoop]: === Iteration 34 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:41,849 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2018-07-23 13:51:41,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:41,990 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:41,991 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-23 13:51:41,991 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:41,991 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:51:41,991 INFO L185 omatonBuilderFactory]: Interpolants [5721#true, 5722#false, 5723#(<= proc_i 0), 5724#(<= proc_i 4), 5725#(<= proc_i 8), 5726#(<= proc_i 12), 5727#(<= proc_i 16), 5728#(<= proc_i 20), 5729#(<= proc_i 24), 5730#(<= proc_i 28), 5731#(<= proc_i 32), 5732#(<= proc_i 36), 5733#(<= proc_i 40), 5734#(<= proc_i 44), 5735#(<= proc_i 48), 5736#(<= proc_i 52), 5737#(<= proc_i 56), 5738#(<= proc_i 60), 5739#(<= proc_i 64), 5740#(<= proc_i 68), 5741#(<= proc_i 72), 5742#(<= proc_i 76), 5743#(<= proc_i 80), 5744#(<= proc_i 84), 5745#(<= proc_i 88), 5746#(<= proc_i 92), 5747#(<= proc_i 96), 5748#(<= proc_i 100), 5749#(<= proc_i 104), 5750#(<= proc_i 108), 5751#(<= proc_i 112), 5752#(<= proc_i 116), 5753#(<= proc_i 120), 5754#(<= proc_i 124), 5755#(<= proc_i 128), 5756#(<= proc_i 132)] [2018-07-23 13:51:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:41,993 INFO L450 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-23 13:51:41,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-23 13:51:41,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 13:51:41,994 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 36 states. [2018-07-23 13:51:42,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:42,026 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-23 13:51:42,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 13:51:42,026 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 69 [2018-07-23 13:51:42,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:42,027 INFO L225 Difference]: With dead ends: 73 [2018-07-23 13:51:42,027 INFO L226 Difference]: Without dead ends: 72 [2018-07-23 13:51:42,028 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 13:51:42,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-23 13:51:42,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-23 13:51:42,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-23 13:51:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-23 13:51:42,031 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-07-23 13:51:42,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:42,032 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-23 13:51:42,032 INFO L472 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-23 13:51:42,032 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-23 13:51:42,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-23 13:51:42,032 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:42,033 INFO L357 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2018-07-23 13:51:42,033 INFO L414 AbstractCegarLoop]: === Iteration 35 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:42,033 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2018-07-23 13:51:42,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:42,170 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:42,171 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-23 13:51:42,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:42,171 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:51:42,171 INFO L185 omatonBuilderFactory]: Interpolants [6080#(<= proc_i 124), 6081#(<= proc_i 128), 6082#(<= proc_i 132), 6083#(<= proc_i 136), 6047#true, 6048#false, 6049#(<= proc_i 0), 6050#(<= proc_i 4), 6051#(<= proc_i 8), 6052#(<= proc_i 12), 6053#(<= proc_i 16), 6054#(<= proc_i 20), 6055#(<= proc_i 24), 6056#(<= proc_i 28), 6057#(<= proc_i 32), 6058#(<= proc_i 36), 6059#(<= proc_i 40), 6060#(<= proc_i 44), 6061#(<= proc_i 48), 6062#(<= proc_i 52), 6063#(<= proc_i 56), 6064#(<= proc_i 60), 6065#(<= proc_i 64), 6066#(<= proc_i 68), 6067#(<= proc_i 72), 6068#(<= proc_i 76), 6069#(<= proc_i 80), 6070#(<= proc_i 84), 6071#(<= proc_i 88), 6072#(<= proc_i 92), 6073#(<= proc_i 96), 6074#(<= proc_i 100), 6075#(<= proc_i 104), 6076#(<= proc_i 108), 6077#(<= proc_i 112), 6078#(<= proc_i 116), 6079#(<= proc_i 120)] [2018-07-23 13:51:42,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:42,172 INFO L450 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-23 13:51:42,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-23 13:51:42,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:51:42,174 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 37 states. [2018-07-23 13:51:42,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:42,197 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-23 13:51:42,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-23 13:51:42,198 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2018-07-23 13:51:42,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:42,198 INFO L225 Difference]: With dead ends: 75 [2018-07-23 13:51:42,199 INFO L226 Difference]: Without dead ends: 74 [2018-07-23 13:51:42,200 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:51:42,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-23 13:51:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-23 13:51:42,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-23 13:51:42,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-23 13:51:42,203 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-07-23 13:51:42,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:42,203 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-23 13:51:42,203 INFO L472 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-23 13:51:42,203 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-23 13:51:42,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-23 13:51:42,204 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:42,206 INFO L357 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2018-07-23 13:51:42,206 INFO L414 AbstractCegarLoop]: === Iteration 36 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:42,206 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2018-07-23 13:51:42,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:42,360 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:42,360 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-23 13:51:42,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:42,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:51:42,363 INFO L185 omatonBuilderFactory]: Interpolants [6400#(<= proc_i 64), 6401#(<= proc_i 68), 6402#(<= proc_i 72), 6403#(<= proc_i 76), 6404#(<= proc_i 80), 6405#(<= proc_i 84), 6406#(<= proc_i 88), 6407#(<= proc_i 92), 6408#(<= proc_i 96), 6409#(<= proc_i 100), 6410#(<= proc_i 104), 6411#(<= proc_i 108), 6412#(<= proc_i 112), 6413#(<= proc_i 116), 6414#(<= proc_i 120), 6415#(<= proc_i 124), 6416#(<= proc_i 128), 6417#(<= proc_i 132), 6418#(<= proc_i 136), 6419#(<= proc_i 140), 6382#true, 6383#false, 6384#(<= proc_i 0), 6385#(<= proc_i 4), 6386#(<= proc_i 8), 6387#(<= proc_i 12), 6388#(<= proc_i 16), 6389#(<= proc_i 20), 6390#(<= proc_i 24), 6391#(<= proc_i 28), 6392#(<= proc_i 32), 6393#(<= proc_i 36), 6394#(<= proc_i 40), 6395#(<= proc_i 44), 6396#(<= proc_i 48), 6397#(<= proc_i 52), 6398#(<= proc_i 56), 6399#(<= proc_i 60)] [2018-07-23 13:51:42,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:42,364 INFO L450 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-23 13:51:42,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-23 13:51:42,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:51:42,366 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 38 states. [2018-07-23 13:51:42,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:42,389 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-23 13:51:42,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 13:51:42,389 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2018-07-23 13:51:42,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:42,390 INFO L225 Difference]: With dead ends: 77 [2018-07-23 13:51:42,390 INFO L226 Difference]: Without dead ends: 76 [2018-07-23 13:51:42,391 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 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:51:42,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-23 13:51:42,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-23 13:51:42,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-23 13:51:42,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-23 13:51:42,395 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-07-23 13:51:42,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:42,395 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-23 13:51:42,395 INFO L472 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-23 13:51:42,395 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-23 13:51:42,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-23 13:51:42,396 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:42,396 INFO L357 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2018-07-23 13:51:42,396 INFO L414 AbstractCegarLoop]: === Iteration 37 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:42,397 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2018-07-23 13:51:42,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:42,536 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:42,537 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-23 13:51:42,537 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:42,537 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:51:42,537 INFO L185 omatonBuilderFactory]: Interpolants [6726#true, 6727#false, 6728#(<= proc_i 0), 6729#(<= proc_i 4), 6730#(<= proc_i 8), 6731#(<= proc_i 12), 6732#(<= proc_i 16), 6733#(<= proc_i 20), 6734#(<= proc_i 24), 6735#(<= proc_i 28), 6736#(<= proc_i 32), 6737#(<= proc_i 36), 6738#(<= proc_i 40), 6739#(<= proc_i 44), 6740#(<= proc_i 48), 6741#(<= proc_i 52), 6742#(<= proc_i 56), 6743#(<= proc_i 60), 6744#(<= proc_i 64), 6745#(<= proc_i 68), 6746#(<= proc_i 72), 6747#(<= proc_i 76), 6748#(<= proc_i 80), 6749#(<= proc_i 84), 6750#(<= proc_i 88), 6751#(<= proc_i 92), 6752#(<= proc_i 96), 6753#(<= proc_i 100), 6754#(<= proc_i 104), 6755#(<= proc_i 108), 6756#(<= proc_i 112), 6757#(<= proc_i 116), 6758#(<= proc_i 120), 6759#(<= proc_i 124), 6760#(<= proc_i 128), 6761#(<= proc_i 132), 6762#(<= proc_i 136), 6763#(<= proc_i 140), 6764#(<= proc_i 144)] [2018-07-23 13:51:42,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:42,538 INFO L450 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-23 13:51:42,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-23 13:51:42,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:51:42,540 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 39 states. [2018-07-23 13:51:42,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:42,570 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-23 13:51:42,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 13:51:42,571 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2018-07-23 13:51:42,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:42,572 INFO L225 Difference]: With dead ends: 79 [2018-07-23 13:51:42,572 INFO L226 Difference]: Without dead ends: 78 [2018-07-23 13:51:42,573 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:51:42,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-23 13:51:42,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-23 13:51:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-23 13:51:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-07-23 13:51:42,576 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-07-23 13:51:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:42,577 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-07-23 13:51:42,577 INFO L472 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-23 13:51:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-07-23 13:51:42,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-23 13:51:42,578 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:42,578 INFO L357 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2018-07-23 13:51:42,578 INFO L414 AbstractCegarLoop]: === Iteration 38 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:42,578 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2018-07-23 13:51:42,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:42,727 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:42,727 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-23 13:51:42,727 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:42,728 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:51:42,728 INFO L185 omatonBuilderFactory]: Interpolants [7104#(<= proc_i 92), 7105#(<= proc_i 96), 7106#(<= proc_i 100), 7107#(<= proc_i 104), 7108#(<= proc_i 108), 7109#(<= proc_i 112), 7110#(<= proc_i 116), 7111#(<= proc_i 120), 7112#(<= proc_i 124), 7113#(<= proc_i 128), 7114#(<= proc_i 132), 7115#(<= proc_i 136), 7116#(<= proc_i 140), 7117#(<= proc_i 144), 7118#(<= proc_i 148), 7079#true, 7080#false, 7081#(<= proc_i 0), 7082#(<= proc_i 4), 7083#(<= proc_i 8), 7084#(<= proc_i 12), 7085#(<= proc_i 16), 7086#(<= proc_i 20), 7087#(<= proc_i 24), 7088#(<= proc_i 28), 7089#(<= proc_i 32), 7090#(<= proc_i 36), 7091#(<= proc_i 40), 7092#(<= proc_i 44), 7093#(<= proc_i 48), 7094#(<= proc_i 52), 7095#(<= proc_i 56), 7096#(<= proc_i 60), 7097#(<= proc_i 64), 7098#(<= proc_i 68), 7099#(<= proc_i 72), 7100#(<= proc_i 76), 7101#(<= proc_i 80), 7102#(<= proc_i 84), 7103#(<= proc_i 88)] [2018-07-23 13:51:42,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:42,729 INFO L450 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-23 13:51:42,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-23 13:51:42,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 13:51:42,731 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 40 states. [2018-07-23 13:51:42,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:42,759 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-23 13:51:42,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 13:51:42,759 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 77 [2018-07-23 13:51:42,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:42,760 INFO L225 Difference]: With dead ends: 81 [2018-07-23 13:51:42,760 INFO L226 Difference]: Without dead ends: 80 [2018-07-23 13:51:42,761 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 13:51:42,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-23 13:51:42,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-23 13:51:42,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-23 13:51:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-23 13:51:42,766 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-07-23 13:51:42,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:42,766 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-23 13:51:42,766 INFO L472 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-23 13:51:42,766 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-23 13:51:42,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-23 13:51:42,767 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:42,767 INFO L357 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2018-07-23 13:51:42,767 INFO L414 AbstractCegarLoop]: === Iteration 39 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:42,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2018-07-23 13:51:42,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:42,923 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:42,923 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-23 13:51:42,923 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:42,924 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:51:42,924 INFO L185 omatonBuilderFactory]: Interpolants [7441#true, 7442#false, 7443#(<= proc_i 0), 7444#(<= proc_i 4), 7445#(<= proc_i 8), 7446#(<= proc_i 12), 7447#(<= proc_i 16), 7448#(<= proc_i 20), 7449#(<= proc_i 24), 7450#(<= proc_i 28), 7451#(<= proc_i 32), 7452#(<= proc_i 36), 7453#(<= proc_i 40), 7454#(<= proc_i 44), 7455#(<= proc_i 48), 7456#(<= proc_i 52), 7457#(<= proc_i 56), 7458#(<= proc_i 60), 7459#(<= proc_i 64), 7460#(<= proc_i 68), 7461#(<= proc_i 72), 7462#(<= proc_i 76), 7463#(<= proc_i 80), 7464#(<= proc_i 84), 7465#(<= proc_i 88), 7466#(<= proc_i 92), 7467#(<= proc_i 96), 7468#(<= proc_i 100), 7469#(<= proc_i 104), 7470#(<= proc_i 108), 7471#(<= proc_i 112), 7472#(<= proc_i 116), 7473#(<= proc_i 120), 7474#(<= proc_i 124), 7475#(<= proc_i 128), 7476#(<= proc_i 132), 7477#(<= proc_i 136), 7478#(<= proc_i 140), 7479#(<= proc_i 144), 7480#(<= proc_i 148), 7481#(<= proc_i 152)] [2018-07-23 13:51:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:42,925 INFO L450 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-23 13:51:42,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-23 13:51:42,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 13:51:42,926 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 41 states. [2018-07-23 13:51:42,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:42,957 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-23 13:51:42,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-23 13:51:42,957 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2018-07-23 13:51:42,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:42,958 INFO L225 Difference]: With dead ends: 83 [2018-07-23 13:51:42,959 INFO L226 Difference]: Without dead ends: 82 [2018-07-23 13:51:42,960 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 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:51:42,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-23 13:51:42,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-07-23 13:51:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-23 13:51:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-07-23 13:51:42,964 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-07-23 13:51:42,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:42,964 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-07-23 13:51:42,964 INFO L472 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-23 13:51:42,965 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-07-23 13:51:42,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-23 13:51:42,966 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:42,966 INFO L357 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2018-07-23 13:51:42,966 INFO L414 AbstractCegarLoop]: === Iteration 40 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:42,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2018-07-23 13:51:42,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:43,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:43,133 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:43,133 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-23 13:51:43,134 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:43,134 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:51:43,134 INFO L185 omatonBuilderFactory]: Interpolants [7812#true, 7813#false, 7814#(<= proc_i 0), 7815#(<= proc_i 4), 7816#(<= proc_i 8), 7817#(<= proc_i 12), 7818#(<= proc_i 16), 7819#(<= proc_i 20), 7820#(<= proc_i 24), 7821#(<= proc_i 28), 7822#(<= proc_i 32), 7823#(<= proc_i 36), 7824#(<= proc_i 40), 7825#(<= proc_i 44), 7826#(<= proc_i 48), 7827#(<= proc_i 52), 7828#(<= proc_i 56), 7829#(<= proc_i 60), 7830#(<= proc_i 64), 7831#(<= proc_i 68), 7832#(<= proc_i 72), 7833#(<= proc_i 76), 7834#(<= proc_i 80), 7835#(<= proc_i 84), 7836#(<= proc_i 88), 7837#(<= proc_i 92), 7838#(<= proc_i 96), 7839#(<= proc_i 100), 7840#(<= proc_i 104), 7841#(<= proc_i 108), 7842#(<= proc_i 112), 7843#(<= proc_i 116), 7844#(<= proc_i 120), 7845#(<= proc_i 124), 7846#(<= proc_i 128), 7847#(<= proc_i 132), 7848#(<= proc_i 136), 7849#(<= proc_i 140), 7850#(<= proc_i 144), 7851#(<= proc_i 148), 7852#(<= proc_i 152), 7853#(<= proc_i 156)] [2018-07-23 13:51:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:43,135 INFO L450 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-23 13:51:43,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-23 13:51:43,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 13:51:43,137 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 42 states. [2018-07-23 13:51:43,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:43,172 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-23 13:51:43,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-23 13:51:43,173 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 81 [2018-07-23 13:51:43,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:43,174 INFO L225 Difference]: With dead ends: 85 [2018-07-23 13:51:43,174 INFO L226 Difference]: Without dead ends: 84 [2018-07-23 13:51:43,175 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 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:51:43,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-23 13:51:43,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-07-23 13:51:43,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-23 13:51:43,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-07-23 13:51:43,179 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-07-23 13:51:43,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:43,180 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-07-23 13:51:43,180 INFO L472 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-23 13:51:43,180 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-07-23 13:51:43,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-23 13:51:43,181 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:43,181 INFO L357 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2018-07-23 13:51:43,181 INFO L414 AbstractCegarLoop]: === Iteration 41 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:43,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2018-07-23 13:51:43,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:43,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:43,377 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:43,378 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-23 13:51:43,378 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:43,381 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:51:43,381 INFO L185 omatonBuilderFactory]: Interpolants [8192#true, 8193#false, 8194#(<= proc_i 0), 8195#(<= proc_i 4), 8196#(<= proc_i 8), 8197#(<= proc_i 12), 8198#(<= proc_i 16), 8199#(<= proc_i 20), 8200#(<= proc_i 24), 8201#(<= proc_i 28), 8202#(<= proc_i 32), 8203#(<= proc_i 36), 8204#(<= proc_i 40), 8205#(<= proc_i 44), 8206#(<= proc_i 48), 8207#(<= proc_i 52), 8208#(<= proc_i 56), 8209#(<= proc_i 60), 8210#(<= proc_i 64), 8211#(<= proc_i 68), 8212#(<= proc_i 72), 8213#(<= proc_i 76), 8214#(<= proc_i 80), 8215#(<= proc_i 84), 8216#(<= proc_i 88), 8217#(<= proc_i 92), 8218#(<= proc_i 96), 8219#(<= proc_i 100), 8220#(<= proc_i 104), 8221#(<= proc_i 108), 8222#(<= proc_i 112), 8223#(<= proc_i 116), 8224#(<= proc_i 120), 8225#(<= proc_i 124), 8226#(<= proc_i 128), 8227#(<= proc_i 132), 8228#(<= proc_i 136), 8229#(<= proc_i 140), 8230#(<= proc_i 144), 8231#(<= proc_i 148), 8232#(<= proc_i 152), 8233#(<= proc_i 156), 8234#(<= proc_i 160)] [2018-07-23 13:51:43,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:43,383 INFO L450 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-23 13:51:43,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-23 13:51:43,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 13:51:43,385 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 43 states. [2018-07-23 13:51:43,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:43,421 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-23 13:51:43,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 13:51:43,422 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2018-07-23 13:51:43,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:43,423 INFO L225 Difference]: With dead ends: 87 [2018-07-23 13:51:43,423 INFO L226 Difference]: Without dead ends: 86 [2018-07-23 13:51:43,424 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 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:51:43,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-23 13:51:43,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-23 13:51:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-23 13:51:43,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-23 13:51:43,429 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-07-23 13:51:43,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:43,429 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-23 13:51:43,429 INFO L472 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-23 13:51:43,429 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-23 13:51:43,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-23 13:51:43,430 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:43,431 INFO L357 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2018-07-23 13:51:43,431 INFO L414 AbstractCegarLoop]: === Iteration 42 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:43,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2018-07-23 13:51:43,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:43,642 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:43,642 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-23 13:51:43,642 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:43,643 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:51:43,643 INFO L185 omatonBuilderFactory]: Interpolants [8581#true, 8582#false, 8583#(<= proc_i 0), 8584#(<= proc_i 4), 8585#(<= proc_i 8), 8586#(<= proc_i 12), 8587#(<= proc_i 16), 8588#(<= proc_i 20), 8589#(<= proc_i 24), 8590#(<= proc_i 28), 8591#(<= proc_i 32), 8592#(<= proc_i 36), 8593#(<= proc_i 40), 8594#(<= proc_i 44), 8595#(<= proc_i 48), 8596#(<= proc_i 52), 8597#(<= proc_i 56), 8598#(<= proc_i 60), 8599#(<= proc_i 64), 8600#(<= proc_i 68), 8601#(<= proc_i 72), 8602#(<= proc_i 76), 8603#(<= proc_i 80), 8604#(<= proc_i 84), 8605#(<= proc_i 88), 8606#(<= proc_i 92), 8607#(<= proc_i 96), 8608#(<= proc_i 100), 8609#(<= proc_i 104), 8610#(<= proc_i 108), 8611#(<= proc_i 112), 8612#(<= proc_i 116), 8613#(<= proc_i 120), 8614#(<= proc_i 124), 8615#(<= proc_i 128), 8616#(<= proc_i 132), 8617#(<= proc_i 136), 8618#(<= proc_i 140), 8619#(<= proc_i 144), 8620#(<= proc_i 148), 8621#(<= proc_i 152), 8622#(<= proc_i 156), 8623#(<= proc_i 160), 8624#(<= proc_i 164)] [2018-07-23 13:51:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:43,644 INFO L450 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-23 13:51:43,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-23 13:51:43,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 13:51:43,645 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 44 states. [2018-07-23 13:51:43,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:43,685 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-23 13:51:43,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-23 13:51:43,686 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 85 [2018-07-23 13:51:43,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:43,687 INFO L225 Difference]: With dead ends: 89 [2018-07-23 13:51:43,687 INFO L226 Difference]: Without dead ends: 88 [2018-07-23 13:51:43,688 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 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:51:43,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-23 13:51:43,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-07-23 13:51:43,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-23 13:51:43,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-07-23 13:51:43,693 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-07-23 13:51:43,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:43,693 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-07-23 13:51:43,693 INFO L472 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-23 13:51:43,694 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-07-23 13:51:43,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-23 13:51:43,694 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:43,695 INFO L357 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2018-07-23 13:51:43,695 INFO L414 AbstractCegarLoop]: === Iteration 43 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:43,695 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2018-07-23 13:51:43,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:43,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:43,871 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:43,871 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-23 13:51:43,872 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:43,872 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:51:43,872 INFO L185 omatonBuilderFactory]: Interpolants [8979#true, 8980#false, 8981#(<= proc_i 0), 8982#(<= proc_i 4), 8983#(<= proc_i 8), 8984#(<= proc_i 12), 8985#(<= proc_i 16), 8986#(<= proc_i 20), 8987#(<= proc_i 24), 8988#(<= proc_i 28), 8989#(<= proc_i 32), 8990#(<= proc_i 36), 8991#(<= proc_i 40), 8992#(<= proc_i 44), 8993#(<= proc_i 48), 8994#(<= proc_i 52), 8995#(<= proc_i 56), 8996#(<= proc_i 60), 8997#(<= proc_i 64), 8998#(<= proc_i 68), 8999#(<= proc_i 72), 9000#(<= proc_i 76), 9001#(<= proc_i 80), 9002#(<= proc_i 84), 9003#(<= proc_i 88), 9004#(<= proc_i 92), 9005#(<= proc_i 96), 9006#(<= proc_i 100), 9007#(<= proc_i 104), 9008#(<= proc_i 108), 9009#(<= proc_i 112), 9010#(<= proc_i 116), 9011#(<= proc_i 120), 9012#(<= proc_i 124), 9013#(<= proc_i 128), 9014#(<= proc_i 132), 9015#(<= proc_i 136), 9016#(<= proc_i 140), 9017#(<= proc_i 144), 9018#(<= proc_i 148), 9019#(<= proc_i 152), 9020#(<= proc_i 156), 9021#(<= proc_i 160), 9022#(<= proc_i 164), 9023#(<= proc_i 168)] [2018-07-23 13:51:43,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:43,873 INFO L450 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-23 13:51:43,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-23 13:51:43,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 13:51:43,875 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 45 states. [2018-07-23 13:51:43,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:43,916 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-23 13:51:43,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 13:51:43,916 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2018-07-23 13:51:43,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:43,917 INFO L225 Difference]: With dead ends: 91 [2018-07-23 13:51:43,917 INFO L226 Difference]: Without dead ends: 90 [2018-07-23 13:51:43,918 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 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:51:43,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-23 13:51:43,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-07-23 13:51:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-23 13:51:43,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-07-23 13:51:43,925 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-07-23 13:51:43,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:43,925 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-07-23 13:51:43,925 INFO L472 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-23 13:51:43,925 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-07-23 13:51:43,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-23 13:51:43,926 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:43,926 INFO L357 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2018-07-23 13:51:43,926 INFO L414 AbstractCegarLoop]: === Iteration 44 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:43,927 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2018-07-23 13:51:43,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:44,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:44,097 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:44,097 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-23 13:51:44,097 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:44,098 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:51:44,098 INFO L185 omatonBuilderFactory]: Interpolants [9408#(<= proc_i 80), 9409#(<= proc_i 84), 9410#(<= proc_i 88), 9411#(<= proc_i 92), 9412#(<= proc_i 96), 9413#(<= proc_i 100), 9414#(<= proc_i 104), 9415#(<= proc_i 108), 9416#(<= proc_i 112), 9417#(<= proc_i 116), 9418#(<= proc_i 120), 9419#(<= proc_i 124), 9420#(<= proc_i 128), 9421#(<= proc_i 132), 9422#(<= proc_i 136), 9423#(<= proc_i 140), 9424#(<= proc_i 144), 9425#(<= proc_i 148), 9426#(<= proc_i 152), 9427#(<= proc_i 156), 9428#(<= proc_i 160), 9429#(<= proc_i 164), 9430#(<= proc_i 168), 9431#(<= proc_i 172), 9386#true, 9387#false, 9388#(<= proc_i 0), 9389#(<= proc_i 4), 9390#(<= proc_i 8), 9391#(<= proc_i 12), 9392#(<= proc_i 16), 9393#(<= proc_i 20), 9394#(<= proc_i 24), 9395#(<= proc_i 28), 9396#(<= proc_i 32), 9397#(<= proc_i 36), 9398#(<= proc_i 40), 9399#(<= proc_i 44), 9400#(<= proc_i 48), 9401#(<= proc_i 52), 9402#(<= proc_i 56), 9403#(<= proc_i 60), 9404#(<= proc_i 64), 9405#(<= proc_i 68), 9406#(<= proc_i 72), 9407#(<= proc_i 76)] [2018-07-23 13:51:44,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:44,099 INFO L450 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-23 13:51:44,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-23 13:51:44,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 13:51:44,102 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 46 states. [2018-07-23 13:51:44,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:44,135 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-23 13:51:44,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 13:51:44,135 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 89 [2018-07-23 13:51:44,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:44,136 INFO L225 Difference]: With dead ends: 93 [2018-07-23 13:51:44,136 INFO L226 Difference]: Without dead ends: 92 [2018-07-23 13:51:44,137 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 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:51:44,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-23 13:51:44,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-23 13:51:44,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-23 13:51:44,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-07-23 13:51:44,142 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-07-23 13:51:44,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:44,143 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-07-23 13:51:44,143 INFO L472 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-23 13:51:44,143 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-07-23 13:51:44,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-23 13:51:44,144 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:44,144 INFO L357 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2018-07-23 13:51:44,144 INFO L414 AbstractCegarLoop]: === Iteration 45 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:44,144 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2018-07-23 13:51:44,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:44,340 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:44,340 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-23 13:51:44,340 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:44,340 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:51:44,341 INFO L185 omatonBuilderFactory]: Interpolants [9802#true, 9803#false, 9804#(<= proc_i 0), 9805#(<= proc_i 4), 9806#(<= proc_i 8), 9807#(<= proc_i 12), 9808#(<= proc_i 16), 9809#(<= proc_i 20), 9810#(<= proc_i 24), 9811#(<= proc_i 28), 9812#(<= proc_i 32), 9813#(<= proc_i 36), 9814#(<= proc_i 40), 9815#(<= proc_i 44), 9816#(<= proc_i 48), 9817#(<= proc_i 52), 9818#(<= proc_i 56), 9819#(<= proc_i 60), 9820#(<= proc_i 64), 9821#(<= proc_i 68), 9822#(<= proc_i 72), 9823#(<= proc_i 76), 9824#(<= proc_i 80), 9825#(<= proc_i 84), 9826#(<= proc_i 88), 9827#(<= proc_i 92), 9828#(<= proc_i 96), 9829#(<= proc_i 100), 9830#(<= proc_i 104), 9831#(<= proc_i 108), 9832#(<= proc_i 112), 9833#(<= proc_i 116), 9834#(<= proc_i 120), 9835#(<= proc_i 124), 9836#(<= proc_i 128), 9837#(<= proc_i 132), 9838#(<= proc_i 136), 9839#(<= proc_i 140), 9840#(<= proc_i 144), 9841#(<= proc_i 148), 9842#(<= proc_i 152), 9843#(<= proc_i 156), 9844#(<= proc_i 160), 9845#(<= proc_i 164), 9846#(<= proc_i 168), 9847#(<= proc_i 172), 9848#(<= proc_i 176)] [2018-07-23 13:51:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:44,342 INFO L450 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-23 13:51:44,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-23 13:51:44,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 13:51:44,343 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 47 states. [2018-07-23 13:51:44,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:44,383 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-23 13:51:44,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-23 13:51:44,383 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2018-07-23 13:51:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:44,384 INFO L225 Difference]: With dead ends: 95 [2018-07-23 13:51:44,384 INFO L226 Difference]: Without dead ends: 94 [2018-07-23 13:51:44,385 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 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:51:44,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-23 13:51:44,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-23 13:51:44,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-23 13:51:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-07-23 13:51:44,389 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-07-23 13:51:44,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:44,390 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-07-23 13:51:44,390 INFO L472 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-23 13:51:44,390 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-07-23 13:51:44,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-23 13:51:44,391 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:44,391 INFO L357 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2018-07-23 13:51:44,391 INFO L414 AbstractCegarLoop]: === Iteration 46 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:44,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2018-07-23 13:51:44,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:44,589 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:44,589 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-23 13:51:44,590 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:44,590 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:51:44,590 INFO L185 omatonBuilderFactory]: Interpolants [10240#(<= proc_i 44), 10241#(<= proc_i 48), 10242#(<= proc_i 52), 10243#(<= proc_i 56), 10244#(<= proc_i 60), 10245#(<= proc_i 64), 10246#(<= proc_i 68), 10247#(<= proc_i 72), 10248#(<= proc_i 76), 10249#(<= proc_i 80), 10250#(<= proc_i 84), 10251#(<= proc_i 88), 10252#(<= proc_i 92), 10253#(<= proc_i 96), 10254#(<= proc_i 100), 10255#(<= proc_i 104), 10256#(<= proc_i 108), 10257#(<= proc_i 112), 10258#(<= proc_i 116), 10259#(<= proc_i 120), 10260#(<= proc_i 124), 10261#(<= proc_i 128), 10262#(<= proc_i 132), 10263#(<= proc_i 136), 10264#(<= proc_i 140), 10265#(<= proc_i 144), 10266#(<= proc_i 148), 10267#(<= proc_i 152), 10268#(<= proc_i 156), 10269#(<= proc_i 160), 10270#(<= proc_i 164), 10271#(<= proc_i 168), 10272#(<= proc_i 172), 10273#(<= proc_i 176), 10274#(<= proc_i 180), 10227#true, 10228#false, 10229#(<= proc_i 0), 10230#(<= proc_i 4), 10231#(<= proc_i 8), 10232#(<= proc_i 12), 10233#(<= proc_i 16), 10234#(<= proc_i 20), 10235#(<= proc_i 24), 10236#(<= proc_i 28), 10237#(<= proc_i 32), 10238#(<= proc_i 36), 10239#(<= proc_i 40)] [2018-07-23 13:51:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:44,591 INFO L450 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-23 13:51:44,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-23 13:51:44,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 13:51:44,593 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 48 states. [2018-07-23 13:51:44,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:44,627 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-23 13:51:44,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-23 13:51:44,628 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 93 [2018-07-23 13:51:44,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:44,629 INFO L225 Difference]: With dead ends: 97 [2018-07-23 13:51:44,629 INFO L226 Difference]: Without dead ends: 96 [2018-07-23 13:51:44,630 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 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:51:44,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-23 13:51:44,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-23 13:51:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-23 13:51:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-07-23 13:51:44,633 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-07-23 13:51:44,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:44,634 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-07-23 13:51:44,634 INFO L472 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-23 13:51:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-07-23 13:51:44,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-23 13:51:44,635 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:44,635 INFO L357 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2018-07-23 13:51:44,635 INFO L414 AbstractCegarLoop]: === Iteration 47 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:44,635 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2018-07-23 13:51:44,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:44,812 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:44,812 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-23 13:51:44,812 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:44,813 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:51:44,813 INFO L185 omatonBuilderFactory]: Interpolants [10661#true, 10662#false, 10663#(<= proc_i 0), 10664#(<= proc_i 4), 10665#(<= proc_i 8), 10666#(<= proc_i 12), 10667#(<= proc_i 16), 10668#(<= proc_i 20), 10669#(<= proc_i 24), 10670#(<= proc_i 28), 10671#(<= proc_i 32), 10672#(<= proc_i 36), 10673#(<= proc_i 40), 10674#(<= proc_i 44), 10675#(<= proc_i 48), 10676#(<= proc_i 52), 10677#(<= proc_i 56), 10678#(<= proc_i 60), 10679#(<= proc_i 64), 10680#(<= proc_i 68), 10681#(<= proc_i 72), 10682#(<= proc_i 76), 10683#(<= proc_i 80), 10684#(<= proc_i 84), 10685#(<= proc_i 88), 10686#(<= proc_i 92), 10687#(<= proc_i 96), 10688#(<= proc_i 100), 10689#(<= proc_i 104), 10690#(<= proc_i 108), 10691#(<= proc_i 112), 10692#(<= proc_i 116), 10693#(<= proc_i 120), 10694#(<= proc_i 124), 10695#(<= proc_i 128), 10696#(<= proc_i 132), 10697#(<= proc_i 136), 10698#(<= proc_i 140), 10699#(<= proc_i 144), 10700#(<= proc_i 148), 10701#(<= proc_i 152), 10702#(<= proc_i 156), 10703#(<= proc_i 160), 10704#(<= proc_i 164), 10705#(<= proc_i 168), 10706#(<= proc_i 172), 10707#(<= proc_i 176), 10708#(<= proc_i 180), 10709#(<= proc_i 184)] [2018-07-23 13:51:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:44,814 INFO L450 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-23 13:51:44,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-23 13:51:44,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 13:51:44,815 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 49 states. [2018-07-23 13:51:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:44,848 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-23 13:51:44,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-23 13:51:44,848 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2018-07-23 13:51:44,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:44,849 INFO L225 Difference]: With dead ends: 99 [2018-07-23 13:51:44,849 INFO L226 Difference]: Without dead ends: 98 [2018-07-23 13:51:44,850 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 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:51:44,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-23 13:51:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-07-23 13:51:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-23 13:51:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-07-23 13:51:44,855 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-07-23 13:51:44,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:44,855 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-07-23 13:51:44,855 INFO L472 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-23 13:51:44,855 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-07-23 13:51:44,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-07-23 13:51:44,856 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:44,857 INFO L357 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2018-07-23 13:51:44,857 INFO L414 AbstractCegarLoop]: === Iteration 48 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:44,857 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2018-07-23 13:51:44,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:45,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:45,037 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:45,037 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-23 13:51:45,038 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:45,038 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:51:45,038 INFO L185 omatonBuilderFactory]: Interpolants [11136#(<= proc_i 120), 11137#(<= proc_i 124), 11138#(<= proc_i 128), 11139#(<= proc_i 132), 11140#(<= proc_i 136), 11141#(<= proc_i 140), 11142#(<= proc_i 144), 11143#(<= proc_i 148), 11144#(<= proc_i 152), 11145#(<= proc_i 156), 11146#(<= proc_i 160), 11147#(<= proc_i 164), 11148#(<= proc_i 168), 11149#(<= proc_i 172), 11150#(<= proc_i 176), 11151#(<= proc_i 180), 11152#(<= proc_i 184), 11153#(<= proc_i 188), 11104#true, 11105#false, 11106#(<= proc_i 0), 11107#(<= proc_i 4), 11108#(<= proc_i 8), 11109#(<= proc_i 12), 11110#(<= proc_i 16), 11111#(<= proc_i 20), 11112#(<= proc_i 24), 11113#(<= proc_i 28), 11114#(<= proc_i 32), 11115#(<= proc_i 36), 11116#(<= proc_i 40), 11117#(<= proc_i 44), 11118#(<= proc_i 48), 11119#(<= proc_i 52), 11120#(<= proc_i 56), 11121#(<= proc_i 60), 11122#(<= proc_i 64), 11123#(<= proc_i 68), 11124#(<= proc_i 72), 11125#(<= proc_i 76), 11126#(<= proc_i 80), 11127#(<= proc_i 84), 11128#(<= proc_i 88), 11129#(<= proc_i 92), 11130#(<= proc_i 96), 11131#(<= proc_i 100), 11132#(<= proc_i 104), 11133#(<= proc_i 108), 11134#(<= proc_i 112), 11135#(<= proc_i 116)] [2018-07-23 13:51:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:45,039 INFO L450 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-23 13:51:45,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-23 13:51:45,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 13:51:45,040 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 50 states. [2018-07-23 13:51:45,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:45,075 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-23 13:51:45,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-23 13:51:45,075 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 97 [2018-07-23 13:51:45,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:45,076 INFO L225 Difference]: With dead ends: 101 [2018-07-23 13:51:45,077 INFO L226 Difference]: Without dead ends: 100 [2018-07-23 13:51:45,078 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 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:51:45,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-23 13:51:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-07-23 13:51:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-23 13:51:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-07-23 13:51:45,085 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-07-23 13:51:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:45,085 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-07-23 13:51:45,085 INFO L472 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-23 13:51:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-07-23 13:51:45,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-07-23 13:51:45,086 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:45,087 INFO L357 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2018-07-23 13:51:45,087 INFO L414 AbstractCegarLoop]: === Iteration 49 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:45,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2018-07-23 13:51:45,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:45,261 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:45,261 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-23 13:51:45,261 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:45,261 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:51:45,262 INFO L185 omatonBuilderFactory]: Interpolants [11556#true, 11557#false, 11558#(<= proc_i 0), 11559#(<= proc_i 4), 11560#(<= proc_i 8), 11561#(<= proc_i 12), 11562#(<= proc_i 16), 11563#(<= proc_i 20), 11564#(<= proc_i 24), 11565#(<= proc_i 28), 11566#(<= proc_i 32), 11567#(<= proc_i 36), 11568#(<= proc_i 40), 11569#(<= proc_i 44), 11570#(<= proc_i 48), 11571#(<= proc_i 52), 11572#(<= proc_i 56), 11573#(<= proc_i 60), 11574#(<= proc_i 64), 11575#(<= proc_i 68), 11576#(<= proc_i 72), 11577#(<= proc_i 76), 11578#(<= proc_i 80), 11579#(<= proc_i 84), 11580#(<= proc_i 88), 11581#(<= proc_i 92), 11582#(<= proc_i 96), 11583#(<= proc_i 100), 11584#(<= proc_i 104), 11585#(<= proc_i 108), 11586#(<= proc_i 112), 11587#(<= proc_i 116), 11588#(<= proc_i 120), 11589#(<= proc_i 124), 11590#(<= proc_i 128), 11591#(<= proc_i 132), 11592#(<= proc_i 136), 11593#(<= proc_i 140), 11594#(<= proc_i 144), 11595#(<= proc_i 148), 11596#(<= proc_i 152), 11597#(<= proc_i 156), 11598#(<= proc_i 160), 11599#(<= proc_i 164), 11600#(<= proc_i 168), 11601#(<= proc_i 172), 11602#(<= proc_i 176), 11603#(<= proc_i 180), 11604#(<= proc_i 184), 11605#(<= proc_i 188), 11606#(<= proc_i 192)] [2018-07-23 13:51:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:45,262 INFO L450 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-23 13:51:45,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-23 13:51:45,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 13:51:45,264 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 51 states. [2018-07-23 13:51:45,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:45,303 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-23 13:51:45,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-23 13:51:45,303 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2018-07-23 13:51:45,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:45,304 INFO L225 Difference]: With dead ends: 103 [2018-07-23 13:51:45,304 INFO L226 Difference]: Without dead ends: 102 [2018-07-23 13:51:45,308 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 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:51:45,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-23 13:51:45,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-07-23 13:51:45,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-23 13:51:45,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-07-23 13:51:45,312 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-07-23 13:51:45,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:45,313 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-07-23 13:51:45,313 INFO L472 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-23 13:51:45,313 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-07-23 13:51:45,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-07-23 13:51:45,315 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:45,315 INFO L357 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2018-07-23 13:51:45,315 INFO L414 AbstractCegarLoop]: === Iteration 50 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:45,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2018-07-23 13:51:45,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:45,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:45,517 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:45,517 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-23 13:51:45,518 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:45,518 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:51:45,518 INFO L185 omatonBuilderFactory]: Interpolants [12032#(<= proc_i 52), 12033#(<= proc_i 56), 12034#(<= proc_i 60), 12035#(<= proc_i 64), 12036#(<= proc_i 68), 12037#(<= proc_i 72), 12038#(<= proc_i 76), 12039#(<= proc_i 80), 12040#(<= proc_i 84), 12041#(<= proc_i 88), 12042#(<= proc_i 92), 12043#(<= proc_i 96), 12044#(<= proc_i 100), 12045#(<= proc_i 104), 12046#(<= proc_i 108), 12047#(<= proc_i 112), 12048#(<= proc_i 116), 12049#(<= proc_i 120), 12050#(<= proc_i 124), 12051#(<= proc_i 128), 12052#(<= proc_i 132), 12053#(<= proc_i 136), 12054#(<= proc_i 140), 12055#(<= proc_i 144), 12056#(<= proc_i 148), 12057#(<= proc_i 152), 12058#(<= proc_i 156), 12059#(<= proc_i 160), 12060#(<= proc_i 164), 12061#(<= proc_i 168), 12062#(<= proc_i 172), 12063#(<= proc_i 176), 12064#(<= proc_i 180), 12065#(<= proc_i 184), 12066#(<= proc_i 188), 12067#(<= proc_i 192), 12068#(<= proc_i 196), 12017#true, 12018#false, 12019#(<= proc_i 0), 12020#(<= proc_i 4), 12021#(<= proc_i 8), 12022#(<= proc_i 12), 12023#(<= proc_i 16), 12024#(<= proc_i 20), 12025#(<= proc_i 24), 12026#(<= proc_i 28), 12027#(<= proc_i 32), 12028#(<= proc_i 36), 12029#(<= proc_i 40), 12030#(<= proc_i 44), 12031#(<= proc_i 48)] [2018-07-23 13:51:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:45,519 INFO L450 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-23 13:51:45,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-23 13:51:45,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 13:51:45,521 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 52 states. [2018-07-23 13:51:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:45,568 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-23 13:51:45,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-23 13:51:45,568 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 101 [2018-07-23 13:51:45,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:45,569 INFO L225 Difference]: With dead ends: 105 [2018-07-23 13:51:45,569 INFO L226 Difference]: Without dead ends: 104 [2018-07-23 13:51:45,571 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 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:51:45,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-23 13:51:45,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-23 13:51:45,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-23 13:51:45,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-07-23 13:51:45,576 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2018-07-23 13:51:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:45,576 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-07-23 13:51:45,576 INFO L472 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-23 13:51:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-07-23 13:51:45,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-23 13:51:45,578 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:45,578 INFO L357 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2018-07-23 13:51:45,578 INFO L414 AbstractCegarLoop]: === Iteration 51 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:45,578 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2018-07-23 13:51:45,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:45,829 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:45,830 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-23 13:51:45,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:45,830 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:51:45,831 INFO L185 omatonBuilderFactory]: Interpolants [12487#true, 12488#false, 12489#(<= proc_i 0), 12490#(<= proc_i 4), 12491#(<= proc_i 8), 12492#(<= proc_i 12), 12493#(<= proc_i 16), 12494#(<= proc_i 20), 12495#(<= proc_i 24), 12496#(<= proc_i 28), 12497#(<= proc_i 32), 12498#(<= proc_i 36), 12499#(<= proc_i 40), 12500#(<= proc_i 44), 12501#(<= proc_i 48), 12502#(<= proc_i 52), 12503#(<= proc_i 56), 12504#(<= proc_i 60), 12505#(<= proc_i 64), 12506#(<= proc_i 68), 12507#(<= proc_i 72), 12508#(<= proc_i 76), 12509#(<= proc_i 80), 12510#(<= proc_i 84), 12511#(<= proc_i 88), 12512#(<= proc_i 92), 12513#(<= proc_i 96), 12514#(<= proc_i 100), 12515#(<= proc_i 104), 12516#(<= proc_i 108), 12517#(<= proc_i 112), 12518#(<= proc_i 116), 12519#(<= proc_i 120), 12520#(<= proc_i 124), 12521#(<= proc_i 128), 12522#(<= proc_i 132), 12523#(<= proc_i 136), 12524#(<= proc_i 140), 12525#(<= proc_i 144), 12526#(<= proc_i 148), 12527#(<= proc_i 152), 12528#(<= proc_i 156), 12529#(<= proc_i 160), 12530#(<= proc_i 164), 12531#(<= proc_i 168), 12532#(<= proc_i 172), 12533#(<= proc_i 176), 12534#(<= proc_i 180), 12535#(<= proc_i 184), 12536#(<= proc_i 188), 12537#(<= proc_i 192), 12538#(<= proc_i 196), 12539#(<= proc_i 200)] [2018-07-23 13:51:45,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:45,832 INFO L450 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-23 13:51:45,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-23 13:51:45,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 13:51:45,835 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 53 states. [2018-07-23 13:51:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:45,895 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-23 13:51:45,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-23 13:51:45,895 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2018-07-23 13:51:45,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:45,896 INFO L225 Difference]: With dead ends: 107 [2018-07-23 13:51:45,896 INFO L226 Difference]: Without dead ends: 106 [2018-07-23 13:51:45,898 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 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:51:45,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-23 13:51:45,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-07-23 13:51:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-07-23 13:51:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-07-23 13:51:45,912 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2018-07-23 13:51:45,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:45,913 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-07-23 13:51:45,913 INFO L472 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-23 13:51:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-07-23 13:51:45,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-07-23 13:51:45,917 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:45,917 INFO L357 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2018-07-23 13:51:45,917 INFO L414 AbstractCegarLoop]: === Iteration 52 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:45,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2018-07-23 13:51:45,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:46,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:46,168 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:46,168 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-23 13:51:46,168 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:46,168 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:51:46,169 INFO L185 omatonBuilderFactory]: Interpolants [12966#true, 12967#false, 12968#(<= proc_i 0), 12969#(<= proc_i 4), 12970#(<= proc_i 8), 12971#(<= proc_i 12), 12972#(<= proc_i 16), 12973#(<= proc_i 20), 12974#(<= proc_i 24), 12975#(<= proc_i 28), 12976#(<= proc_i 32), 12977#(<= proc_i 36), 12978#(<= proc_i 40), 12979#(<= proc_i 44), 12980#(<= proc_i 48), 12981#(<= proc_i 52), 12982#(<= proc_i 56), 12983#(<= proc_i 60), 12984#(<= proc_i 64), 12985#(<= proc_i 68), 12986#(<= proc_i 72), 12987#(<= proc_i 76), 12988#(<= proc_i 80), 12989#(<= proc_i 84), 12990#(<= proc_i 88), 12991#(<= proc_i 92), 12992#(<= proc_i 96), 12993#(<= proc_i 100), 12994#(<= proc_i 104), 12995#(<= proc_i 108), 12996#(<= proc_i 112), 12997#(<= proc_i 116), 12998#(<= proc_i 120), 12999#(<= proc_i 124), 13000#(<= proc_i 128), 13001#(<= proc_i 132), 13002#(<= proc_i 136), 13003#(<= proc_i 140), 13004#(<= proc_i 144), 13005#(<= proc_i 148), 13006#(<= proc_i 152), 13007#(<= proc_i 156), 13008#(<= proc_i 160), 13009#(<= proc_i 164), 13010#(<= proc_i 168), 13011#(<= proc_i 172), 13012#(<= proc_i 176), 13013#(<= proc_i 180), 13014#(<= proc_i 184), 13015#(<= proc_i 188), 13016#(<= proc_i 192), 13017#(<= proc_i 196), 13018#(<= proc_i 200), 13019#(<= proc_i 204)] [2018-07-23 13:51:46,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:46,170 INFO L450 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-23 13:51:46,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-23 13:51:46,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 13:51:46,171 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 54 states. [2018-07-23 13:51:46,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:46,214 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-23 13:51:46,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 13:51:46,214 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 105 [2018-07-23 13:51:46,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:46,215 INFO L225 Difference]: With dead ends: 109 [2018-07-23 13:51:46,215 INFO L226 Difference]: Without dead ends: 108 [2018-07-23 13:51:46,216 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 13:51:46,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-07-23 13:51:46,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-07-23 13:51:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-07-23 13:51:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-07-23 13:51:46,222 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2018-07-23 13:51:46,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:46,222 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-07-23 13:51:46,222 INFO L472 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-23 13:51:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-07-23 13:51:46,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-07-23 13:51:46,223 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:46,224 INFO L357 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2018-07-23 13:51:46,224 INFO L414 AbstractCegarLoop]: === Iteration 53 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:46,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2018-07-23 13:51:46,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:46,433 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:46,433 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-23 13:51:46,434 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:46,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:51:46,434 INFO L185 omatonBuilderFactory]: Interpolants [13454#true, 13455#false, 13456#(<= proc_i 0), 13457#(<= proc_i 4), 13458#(<= proc_i 8), 13459#(<= proc_i 12), 13460#(<= proc_i 16), 13461#(<= proc_i 20), 13462#(<= proc_i 24), 13463#(<= proc_i 28), 13464#(<= proc_i 32), 13465#(<= proc_i 36), 13466#(<= proc_i 40), 13467#(<= proc_i 44), 13468#(<= proc_i 48), 13469#(<= proc_i 52), 13470#(<= proc_i 56), 13471#(<= proc_i 60), 13472#(<= proc_i 64), 13473#(<= proc_i 68), 13474#(<= proc_i 72), 13475#(<= proc_i 76), 13476#(<= proc_i 80), 13477#(<= proc_i 84), 13478#(<= proc_i 88), 13479#(<= proc_i 92), 13480#(<= proc_i 96), 13481#(<= proc_i 100), 13482#(<= proc_i 104), 13483#(<= proc_i 108), 13484#(<= proc_i 112), 13485#(<= proc_i 116), 13486#(<= proc_i 120), 13487#(<= proc_i 124), 13488#(<= proc_i 128), 13489#(<= proc_i 132), 13490#(<= proc_i 136), 13491#(<= proc_i 140), 13492#(<= proc_i 144), 13493#(<= proc_i 148), 13494#(<= proc_i 152), 13495#(<= proc_i 156), 13496#(<= proc_i 160), 13497#(<= proc_i 164), 13498#(<= proc_i 168), 13499#(<= proc_i 172), 13500#(<= proc_i 176), 13501#(<= proc_i 180), 13502#(<= proc_i 184), 13503#(<= proc_i 188), 13504#(<= proc_i 192), 13505#(<= proc_i 196), 13506#(<= proc_i 200), 13507#(<= proc_i 204), 13508#(<= proc_i 208)] [2018-07-23 13:51:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:46,435 INFO L450 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-23 13:51:46,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-23 13:51:46,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 13:51:46,436 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 55 states. [2018-07-23 13:51:46,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:46,493 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-23 13:51:46,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-23 13:51:46,493 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2018-07-23 13:51:46,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:46,494 INFO L225 Difference]: With dead ends: 111 [2018-07-23 13:51:46,494 INFO L226 Difference]: Without dead ends: 110 [2018-07-23 13:51:46,496 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 13:51:46,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-07-23 13:51:46,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-07-23 13:51:46,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-07-23 13:51:46,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-07-23 13:51:46,501 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2018-07-23 13:51:46,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:46,504 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-07-23 13:51:46,505 INFO L472 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-23 13:51:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-07-23 13:51:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-07-23 13:51:46,506 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:46,506 INFO L357 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2018-07-23 13:51:46,506 INFO L414 AbstractCegarLoop]: === Iteration 54 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:46,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2018-07-23 13:51:46,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:46,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:46,732 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:46,732 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-23 13:51:46,732 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:46,733 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:51:46,733 INFO L185 omatonBuilderFactory]: Interpolants [13952#false, 13953#(<= proc_i 0), 13954#(<= proc_i 4), 13955#(<= proc_i 8), 13956#(<= proc_i 12), 13957#(<= proc_i 16), 13958#(<= proc_i 20), 13959#(<= proc_i 24), 13960#(<= proc_i 28), 13961#(<= proc_i 32), 13962#(<= proc_i 36), 13963#(<= proc_i 40), 13964#(<= proc_i 44), 13965#(<= proc_i 48), 13966#(<= proc_i 52), 13967#(<= proc_i 56), 13968#(<= proc_i 60), 13969#(<= proc_i 64), 13970#(<= proc_i 68), 13971#(<= proc_i 72), 13972#(<= proc_i 76), 13973#(<= proc_i 80), 13974#(<= proc_i 84), 13975#(<= proc_i 88), 13976#(<= proc_i 92), 13977#(<= proc_i 96), 13978#(<= proc_i 100), 13979#(<= proc_i 104), 13980#(<= proc_i 108), 13981#(<= proc_i 112), 13982#(<= proc_i 116), 13983#(<= proc_i 120), 13984#(<= proc_i 124), 13985#(<= proc_i 128), 13986#(<= proc_i 132), 13987#(<= proc_i 136), 13988#(<= proc_i 140), 13989#(<= proc_i 144), 13990#(<= proc_i 148), 13991#(<= proc_i 152), 13992#(<= proc_i 156), 13993#(<= proc_i 160), 13994#(<= proc_i 164), 13995#(<= proc_i 168), 13996#(<= proc_i 172), 13997#(<= proc_i 176), 13998#(<= proc_i 180), 13999#(<= proc_i 184), 14000#(<= proc_i 188), 14001#(<= proc_i 192), 14002#(<= proc_i 196), 14003#(<= proc_i 200), 14004#(<= proc_i 204), 14005#(<= proc_i 208), 14006#(<= proc_i 212), 13951#true] [2018-07-23 13:51:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:46,734 INFO L450 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-23 13:51:46,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-23 13:51:46,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 13:51:46,735 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 56 states. [2018-07-23 13:51:46,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:46,796 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-23 13:51:46,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-23 13:51:46,796 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 109 [2018-07-23 13:51:46,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:46,797 INFO L225 Difference]: With dead ends: 113 [2018-07-23 13:51:46,797 INFO L226 Difference]: Without dead ends: 112 [2018-07-23 13:51:46,799 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 13:51:46,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-07-23 13:51:46,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-07-23 13:51:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-07-23 13:51:46,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-07-23 13:51:46,803 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2018-07-23 13:51:46,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:46,804 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-07-23 13:51:46,804 INFO L472 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-23 13:51:46,804 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-07-23 13:51:46,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-07-23 13:51:46,805 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:46,806 INFO L357 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2018-07-23 13:51:46,806 INFO L414 AbstractCegarLoop]: === Iteration 55 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:46,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2018-07-23 13:51:46,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:47,028 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:47,028 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-23 13:51:47,028 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:47,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:51:47,029 INFO L185 omatonBuilderFactory]: Interpolants [14464#(<= proc_i 20), 14465#(<= proc_i 24), 14466#(<= proc_i 28), 14467#(<= proc_i 32), 14468#(<= proc_i 36), 14469#(<= proc_i 40), 14470#(<= proc_i 44), 14471#(<= proc_i 48), 14472#(<= proc_i 52), 14473#(<= proc_i 56), 14474#(<= proc_i 60), 14475#(<= proc_i 64), 14476#(<= proc_i 68), 14477#(<= proc_i 72), 14478#(<= proc_i 76), 14479#(<= proc_i 80), 14480#(<= proc_i 84), 14481#(<= proc_i 88), 14482#(<= proc_i 92), 14483#(<= proc_i 96), 14484#(<= proc_i 100), 14485#(<= proc_i 104), 14486#(<= proc_i 108), 14487#(<= proc_i 112), 14488#(<= proc_i 116), 14489#(<= proc_i 120), 14490#(<= proc_i 124), 14491#(<= proc_i 128), 14492#(<= proc_i 132), 14493#(<= proc_i 136), 14494#(<= proc_i 140), 14495#(<= proc_i 144), 14496#(<= proc_i 148), 14497#(<= proc_i 152), 14498#(<= proc_i 156), 14499#(<= proc_i 160), 14500#(<= proc_i 164), 14501#(<= proc_i 168), 14502#(<= proc_i 172), 14503#(<= proc_i 176), 14504#(<= proc_i 180), 14505#(<= proc_i 184), 14506#(<= proc_i 188), 14507#(<= proc_i 192), 14508#(<= proc_i 196), 14509#(<= proc_i 200), 14510#(<= proc_i 204), 14511#(<= proc_i 208), 14512#(<= proc_i 212), 14513#(<= proc_i 216), 14457#true, 14458#false, 14459#(<= proc_i 0), 14460#(<= proc_i 4), 14461#(<= proc_i 8), 14462#(<= proc_i 12), 14463#(<= proc_i 16)] [2018-07-23 13:51:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:47,030 INFO L450 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-23 13:51:47,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-23 13:51:47,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 13:51:47,031 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 57 states. [2018-07-23 13:51:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:47,090 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-23 13:51:47,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-23 13:51:47,091 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 111 [2018-07-23 13:51:47,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:47,092 INFO L225 Difference]: With dead ends: 115 [2018-07-23 13:51:47,092 INFO L226 Difference]: Without dead ends: 114 [2018-07-23 13:51:47,093 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 13:51:47,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-07-23 13:51:47,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-07-23 13:51:47,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-07-23 13:51:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-07-23 13:51:47,098 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2018-07-23 13:51:47,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:47,098 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-07-23 13:51:47,098 INFO L472 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-23 13:51:47,098 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-07-23 13:51:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-07-23 13:51:47,099 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:47,100 INFO L357 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2018-07-23 13:51:47,100 INFO L414 AbstractCegarLoop]: === Iteration 56 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:47,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2018-07-23 13:51:47,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:47,323 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:47,324 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-23 13:51:47,324 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:47,324 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:51:47,324 INFO L185 omatonBuilderFactory]: Interpolants [14976#(<= proc_i 8), 14977#(<= proc_i 12), 14978#(<= proc_i 16), 14979#(<= proc_i 20), 14980#(<= proc_i 24), 14981#(<= proc_i 28), 14982#(<= proc_i 32), 14983#(<= proc_i 36), 14984#(<= proc_i 40), 14985#(<= proc_i 44), 14986#(<= proc_i 48), 14987#(<= proc_i 52), 14988#(<= proc_i 56), 14989#(<= proc_i 60), 14990#(<= proc_i 64), 14991#(<= proc_i 68), 14992#(<= proc_i 72), 14993#(<= proc_i 76), 14994#(<= proc_i 80), 14995#(<= proc_i 84), 14996#(<= proc_i 88), 14997#(<= proc_i 92), 14998#(<= proc_i 96), 14999#(<= proc_i 100), 15000#(<= proc_i 104), 15001#(<= proc_i 108), 15002#(<= proc_i 112), 15003#(<= proc_i 116), 15004#(<= proc_i 120), 15005#(<= proc_i 124), 15006#(<= proc_i 128), 15007#(<= proc_i 132), 15008#(<= proc_i 136), 15009#(<= proc_i 140), 15010#(<= proc_i 144), 15011#(<= proc_i 148), 15012#(<= proc_i 152), 15013#(<= proc_i 156), 15014#(<= proc_i 160), 15015#(<= proc_i 164), 15016#(<= proc_i 168), 15017#(<= proc_i 172), 15018#(<= proc_i 176), 15019#(<= proc_i 180), 15020#(<= proc_i 184), 15021#(<= proc_i 188), 15022#(<= proc_i 192), 15023#(<= proc_i 196), 15024#(<= proc_i 200), 15025#(<= proc_i 204), 15026#(<= proc_i 208), 15027#(<= proc_i 212), 15028#(<= proc_i 216), 15029#(<= proc_i 220), 14972#true, 14973#false, 14974#(<= proc_i 0), 14975#(<= proc_i 4)] [2018-07-23 13:51:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:47,325 INFO L450 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-23 13:51:47,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-23 13:51:47,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 13:51:47,327 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 58 states. [2018-07-23 13:51:47,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:47,387 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-23 13:51:47,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-23 13:51:47,387 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 113 [2018-07-23 13:51:47,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:47,388 INFO L225 Difference]: With dead ends: 117 [2018-07-23 13:51:47,388 INFO L226 Difference]: Without dead ends: 116 [2018-07-23 13:51:47,390 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 13:51:47,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-07-23 13:51:47,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-07-23 13:51:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-07-23 13:51:47,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-07-23 13:51:47,394 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2018-07-23 13:51:47,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:47,394 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-07-23 13:51:47,395 INFO L472 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-23 13:51:47,395 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-07-23 13:51:47,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-07-23 13:51:47,396 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:47,396 INFO L357 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2018-07-23 13:51:47,396 INFO L414 AbstractCegarLoop]: === Iteration 57 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:47,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2018-07-23 13:51:47,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:47,635 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:47,635 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-23 13:51:47,635 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:47,635 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:51:47,636 INFO L185 omatonBuilderFactory]: Interpolants [15496#true, 15497#false, 15498#(<= proc_i 0), 15499#(<= proc_i 4), 15500#(<= proc_i 8), 15501#(<= proc_i 12), 15502#(<= proc_i 16), 15503#(<= proc_i 20), 15504#(<= proc_i 24), 15505#(<= proc_i 28), 15506#(<= proc_i 32), 15507#(<= proc_i 36), 15508#(<= proc_i 40), 15509#(<= proc_i 44), 15510#(<= proc_i 48), 15511#(<= proc_i 52), 15512#(<= proc_i 56), 15513#(<= proc_i 60), 15514#(<= proc_i 64), 15515#(<= proc_i 68), 15516#(<= proc_i 72), 15517#(<= proc_i 76), 15518#(<= proc_i 80), 15519#(<= proc_i 84), 15520#(<= proc_i 88), 15521#(<= proc_i 92), 15522#(<= proc_i 96), 15523#(<= proc_i 100), 15524#(<= proc_i 104), 15525#(<= proc_i 108), 15526#(<= proc_i 112), 15527#(<= proc_i 116), 15528#(<= proc_i 120), 15529#(<= proc_i 124), 15530#(<= proc_i 128), 15531#(<= proc_i 132), 15532#(<= proc_i 136), 15533#(<= proc_i 140), 15534#(<= proc_i 144), 15535#(<= proc_i 148), 15536#(<= proc_i 152), 15537#(<= proc_i 156), 15538#(<= proc_i 160), 15539#(<= proc_i 164), 15540#(<= proc_i 168), 15541#(<= proc_i 172), 15542#(<= proc_i 176), 15543#(<= proc_i 180), 15544#(<= proc_i 184), 15545#(<= proc_i 188), 15546#(<= proc_i 192), 15547#(<= proc_i 196), 15548#(<= proc_i 200), 15549#(<= proc_i 204), 15550#(<= proc_i 208), 15551#(<= proc_i 212), 15552#(<= proc_i 216), 15553#(<= proc_i 220), 15554#(<= proc_i 224)] [2018-07-23 13:51:47,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:47,636 INFO L450 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-23 13:51:47,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-23 13:51:47,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 13:51:47,638 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 59 states. [2018-07-23 13:51:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:47,710 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-23 13:51:47,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-23 13:51:47,710 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 115 [2018-07-23 13:51:47,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:47,712 INFO L225 Difference]: With dead ends: 119 [2018-07-23 13:51:47,712 INFO L226 Difference]: Without dead ends: 118 [2018-07-23 13:51:47,713 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 13:51:47,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-07-23 13:51:47,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-07-23 13:51:47,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-07-23 13:51:47,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-07-23 13:51:47,718 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2018-07-23 13:51:47,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:47,718 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-07-23 13:51:47,718 INFO L472 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-23 13:51:47,718 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-07-23 13:51:47,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-07-23 13:51:47,720 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:47,720 INFO L357 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2018-07-23 13:51:47,720 INFO L414 AbstractCegarLoop]: === Iteration 58 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:47,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2018-07-23 13:51:47,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:47,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:47,969 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:47,969 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-23 13:51:47,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:47,970 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:51:47,970 INFO L185 omatonBuilderFactory]: Interpolants [16029#true, 16030#false, 16031#(<= proc_i 0), 16032#(<= proc_i 4), 16033#(<= proc_i 8), 16034#(<= proc_i 12), 16035#(<= proc_i 16), 16036#(<= proc_i 20), 16037#(<= proc_i 24), 16038#(<= proc_i 28), 16039#(<= proc_i 32), 16040#(<= proc_i 36), 16041#(<= proc_i 40), 16042#(<= proc_i 44), 16043#(<= proc_i 48), 16044#(<= proc_i 52), 16045#(<= proc_i 56), 16046#(<= proc_i 60), 16047#(<= proc_i 64), 16048#(<= proc_i 68), 16049#(<= proc_i 72), 16050#(<= proc_i 76), 16051#(<= proc_i 80), 16052#(<= proc_i 84), 16053#(<= proc_i 88), 16054#(<= proc_i 92), 16055#(<= proc_i 96), 16056#(<= proc_i 100), 16057#(<= proc_i 104), 16058#(<= proc_i 108), 16059#(<= proc_i 112), 16060#(<= proc_i 116), 16061#(<= proc_i 120), 16062#(<= proc_i 124), 16063#(<= proc_i 128), 16064#(<= proc_i 132), 16065#(<= proc_i 136), 16066#(<= proc_i 140), 16067#(<= proc_i 144), 16068#(<= proc_i 148), 16069#(<= proc_i 152), 16070#(<= proc_i 156), 16071#(<= proc_i 160), 16072#(<= proc_i 164), 16073#(<= proc_i 168), 16074#(<= proc_i 172), 16075#(<= proc_i 176), 16076#(<= proc_i 180), 16077#(<= proc_i 184), 16078#(<= proc_i 188), 16079#(<= proc_i 192), 16080#(<= proc_i 196), 16081#(<= proc_i 200), 16082#(<= proc_i 204), 16083#(<= proc_i 208), 16084#(<= proc_i 212), 16085#(<= proc_i 216), 16086#(<= proc_i 220), 16087#(<= proc_i 224), 16088#(<= proc_i 228)] [2018-07-23 13:51:47,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:47,971 INFO L450 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-23 13:51:47,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-23 13:51:47,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 13:51:47,973 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 60 states. [2018-07-23 13:51:48,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:48,032 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-23 13:51:48,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-23 13:51:48,033 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 117 [2018-07-23 13:51:48,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:48,034 INFO L225 Difference]: With dead ends: 121 [2018-07-23 13:51:48,034 INFO L226 Difference]: Without dead ends: 120 [2018-07-23 13:51:48,036 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 13:51:48,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-07-23 13:51:48,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-07-23 13:51:48,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-07-23 13:51:48,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-07-23 13:51:48,041 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2018-07-23 13:51:48,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:48,042 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-07-23 13:51:48,042 INFO L472 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-23 13:51:48,042 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-07-23 13:51:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-07-23 13:51:48,043 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:48,043 INFO L357 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2018-07-23 13:51:48,043 INFO L414 AbstractCegarLoop]: === Iteration 59 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:48,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2018-07-23 13:51:48,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:48,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:48,331 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:48,332 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-23 13:51:48,332 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:48,332 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:51:48,333 INFO L185 omatonBuilderFactory]: Interpolants [16571#true, 16572#false, 16573#(<= proc_i 0), 16574#(<= proc_i 4), 16575#(<= proc_i 8), 16576#(<= proc_i 12), 16577#(<= proc_i 16), 16578#(<= proc_i 20), 16579#(<= proc_i 24), 16580#(<= proc_i 28), 16581#(<= proc_i 32), 16582#(<= proc_i 36), 16583#(<= proc_i 40), 16584#(<= proc_i 44), 16585#(<= proc_i 48), 16586#(<= proc_i 52), 16587#(<= proc_i 56), 16588#(<= proc_i 60), 16589#(<= proc_i 64), 16590#(<= proc_i 68), 16591#(<= proc_i 72), 16592#(<= proc_i 76), 16593#(<= proc_i 80), 16594#(<= proc_i 84), 16595#(<= proc_i 88), 16596#(<= proc_i 92), 16597#(<= proc_i 96), 16598#(<= proc_i 100), 16599#(<= proc_i 104), 16600#(<= proc_i 108), 16601#(<= proc_i 112), 16602#(<= proc_i 116), 16603#(<= proc_i 120), 16604#(<= proc_i 124), 16605#(<= proc_i 128), 16606#(<= proc_i 132), 16607#(<= proc_i 136), 16608#(<= proc_i 140), 16609#(<= proc_i 144), 16610#(<= proc_i 148), 16611#(<= proc_i 152), 16612#(<= proc_i 156), 16613#(<= proc_i 160), 16614#(<= proc_i 164), 16615#(<= proc_i 168), 16616#(<= proc_i 172), 16617#(<= proc_i 176), 16618#(<= proc_i 180), 16619#(<= proc_i 184), 16620#(<= proc_i 188), 16621#(<= proc_i 192), 16622#(<= proc_i 196), 16623#(<= proc_i 200), 16624#(<= proc_i 204), 16625#(<= proc_i 208), 16626#(<= proc_i 212), 16627#(<= proc_i 216), 16628#(<= proc_i 220), 16629#(<= proc_i 224), 16630#(<= proc_i 228), 16631#(<= proc_i 232)] [2018-07-23 13:51:48,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:48,333 INFO L450 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-23 13:51:48,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-23 13:51:48,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 13:51:48,337 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 61 states. [2018-07-23 13:51:48,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:48,409 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-23 13:51:48,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-23 13:51:48,410 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 119 [2018-07-23 13:51:48,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:48,411 INFO L225 Difference]: With dead ends: 123 [2018-07-23 13:51:48,411 INFO L226 Difference]: Without dead ends: 122 [2018-07-23 13:51:48,412 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 13:51:48,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-23 13:51:48,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-07-23 13:51:48,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-07-23 13:51:48,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-07-23 13:51:48,418 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2018-07-23 13:51:48,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:48,418 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-07-23 13:51:48,418 INFO L472 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-23 13:51:48,418 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-07-23 13:51:48,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-07-23 13:51:48,420 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:48,420 INFO L357 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2018-07-23 13:51:48,420 INFO L414 AbstractCegarLoop]: === Iteration 60 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:48,421 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2018-07-23 13:51:48,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:48,750 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:48,750 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-23 13:51:48,750 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:48,750 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:51:48,751 INFO L185 omatonBuilderFactory]: Interpolants [17152#(<= proc_i 112), 17153#(<= proc_i 116), 17154#(<= proc_i 120), 17155#(<= proc_i 124), 17156#(<= proc_i 128), 17157#(<= proc_i 132), 17158#(<= proc_i 136), 17159#(<= proc_i 140), 17160#(<= proc_i 144), 17161#(<= proc_i 148), 17162#(<= proc_i 152), 17163#(<= proc_i 156), 17164#(<= proc_i 160), 17165#(<= proc_i 164), 17166#(<= proc_i 168), 17167#(<= proc_i 172), 17168#(<= proc_i 176), 17169#(<= proc_i 180), 17170#(<= proc_i 184), 17171#(<= proc_i 188), 17172#(<= proc_i 192), 17173#(<= proc_i 196), 17174#(<= proc_i 200), 17175#(<= proc_i 204), 17176#(<= proc_i 208), 17177#(<= proc_i 212), 17178#(<= proc_i 216), 17179#(<= proc_i 220), 17180#(<= proc_i 224), 17181#(<= proc_i 228), 17182#(<= proc_i 232), 17183#(<= proc_i 236), 17122#true, 17123#false, 17124#(<= proc_i 0), 17125#(<= proc_i 4), 17126#(<= proc_i 8), 17127#(<= proc_i 12), 17128#(<= proc_i 16), 17129#(<= proc_i 20), 17130#(<= proc_i 24), 17131#(<= proc_i 28), 17132#(<= proc_i 32), 17133#(<= proc_i 36), 17134#(<= proc_i 40), 17135#(<= proc_i 44), 17136#(<= proc_i 48), 17137#(<= proc_i 52), 17138#(<= proc_i 56), 17139#(<= proc_i 60), 17140#(<= proc_i 64), 17141#(<= proc_i 68), 17142#(<= proc_i 72), 17143#(<= proc_i 76), 17144#(<= proc_i 80), 17145#(<= proc_i 84), 17146#(<= proc_i 88), 17147#(<= proc_i 92), 17148#(<= proc_i 96), 17149#(<= proc_i 100), 17150#(<= proc_i 104), 17151#(<= proc_i 108)] [2018-07-23 13:51:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:48,752 INFO L450 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-23 13:51:48,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-23 13:51:48,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 13:51:48,753 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 62 states. [2018-07-23 13:51:48,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:48,797 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-23 13:51:48,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-23 13:51:48,798 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 121 [2018-07-23 13:51:48,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:48,799 INFO L225 Difference]: With dead ends: 125 [2018-07-23 13:51:48,799 INFO L226 Difference]: Without dead ends: 124 [2018-07-23 13:51:48,800 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 13:51:48,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-07-23 13:51:48,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-07-23 13:51:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-07-23 13:51:48,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-07-23 13:51:48,804 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2018-07-23 13:51:48,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:48,805 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-07-23 13:51:48,805 INFO L472 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-23 13:51:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-07-23 13:51:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-07-23 13:51:48,806 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:48,806 INFO L357 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2018-07-23 13:51:48,806 INFO L414 AbstractCegarLoop]: === Iteration 61 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:48,807 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2018-07-23 13:51:48,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:49,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:49,020 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:49,020 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-23 13:51:49,020 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:49,021 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:51:49,021 INFO L185 omatonBuilderFactory]: Interpolants [17682#true, 17683#false, 17684#(<= proc_i 0), 17685#(<= proc_i 4), 17686#(<= proc_i 8), 17687#(<= proc_i 12), 17688#(<= proc_i 16), 17689#(<= proc_i 20), 17690#(<= proc_i 24), 17691#(<= proc_i 28), 17692#(<= proc_i 32), 17693#(<= proc_i 36), 17694#(<= proc_i 40), 17695#(<= proc_i 44), 17696#(<= proc_i 48), 17697#(<= proc_i 52), 17698#(<= proc_i 56), 17699#(<= proc_i 60), 17700#(<= proc_i 64), 17701#(<= proc_i 68), 17702#(<= proc_i 72), 17703#(<= proc_i 76), 17704#(<= proc_i 80), 17705#(<= proc_i 84), 17706#(<= proc_i 88), 17707#(<= proc_i 92), 17708#(<= proc_i 96), 17709#(<= proc_i 100), 17710#(<= proc_i 104), 17711#(<= proc_i 108), 17712#(<= proc_i 112), 17713#(<= proc_i 116), 17714#(<= proc_i 120), 17715#(<= proc_i 124), 17716#(<= proc_i 128), 17717#(<= proc_i 132), 17718#(<= proc_i 136), 17719#(<= proc_i 140), 17720#(<= proc_i 144), 17721#(<= proc_i 148), 17722#(<= proc_i 152), 17723#(<= proc_i 156), 17724#(<= proc_i 160), 17725#(<= proc_i 164), 17726#(<= proc_i 168), 17727#(<= proc_i 172), 17728#(<= proc_i 176), 17729#(<= proc_i 180), 17730#(<= proc_i 184), 17731#(<= proc_i 188), 17732#(<= proc_i 192), 17733#(<= proc_i 196), 17734#(<= proc_i 200), 17735#(<= proc_i 204), 17736#(<= proc_i 208), 17737#(<= proc_i 212), 17738#(<= proc_i 216), 17739#(<= proc_i 220), 17740#(<= proc_i 224), 17741#(<= proc_i 228), 17742#(<= proc_i 232), 17743#(<= proc_i 236), 17744#(<= proc_i 240)] [2018-07-23 13:51:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:49,022 INFO L450 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-23 13:51:49,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-23 13:51:49,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 13:51:49,023 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 63 states. [2018-07-23 13:51:49,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:49,094 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-23 13:51:49,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-23 13:51:49,095 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 123 [2018-07-23 13:51:49,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:49,096 INFO L225 Difference]: With dead ends: 127 [2018-07-23 13:51:49,096 INFO L226 Difference]: Without dead ends: 126 [2018-07-23 13:51:49,097 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 13:51:49,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-07-23 13:51:49,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-07-23 13:51:49,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-07-23 13:51:49,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-07-23 13:51:49,103 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2018-07-23 13:51:49,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:49,103 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-07-23 13:51:49,103 INFO L472 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-23 13:51:49,103 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-07-23 13:51:49,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-07-23 13:51:49,104 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:49,105 INFO L357 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2018-07-23 13:51:49,105 INFO L414 AbstractCegarLoop]: === Iteration 62 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:49,105 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2018-07-23 13:51:49,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:49,334 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:49,334 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-23 13:51:49,334 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:49,334 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:51:49,335 INFO L185 omatonBuilderFactory]: Interpolants [18304#(<= proc_i 204), 18305#(<= proc_i 208), 18306#(<= proc_i 212), 18307#(<= proc_i 216), 18308#(<= proc_i 220), 18309#(<= proc_i 224), 18310#(<= proc_i 228), 18311#(<= proc_i 232), 18312#(<= proc_i 236), 18313#(<= proc_i 240), 18314#(<= proc_i 244), 18251#true, 18252#false, 18253#(<= proc_i 0), 18254#(<= proc_i 4), 18255#(<= proc_i 8), 18256#(<= proc_i 12), 18257#(<= proc_i 16), 18258#(<= proc_i 20), 18259#(<= proc_i 24), 18260#(<= proc_i 28), 18261#(<= proc_i 32), 18262#(<= proc_i 36), 18263#(<= proc_i 40), 18264#(<= proc_i 44), 18265#(<= proc_i 48), 18266#(<= proc_i 52), 18267#(<= proc_i 56), 18268#(<= proc_i 60), 18269#(<= proc_i 64), 18270#(<= proc_i 68), 18271#(<= proc_i 72), 18272#(<= proc_i 76), 18273#(<= proc_i 80), 18274#(<= proc_i 84), 18275#(<= proc_i 88), 18276#(<= proc_i 92), 18277#(<= proc_i 96), 18278#(<= proc_i 100), 18279#(<= proc_i 104), 18280#(<= proc_i 108), 18281#(<= proc_i 112), 18282#(<= proc_i 116), 18283#(<= proc_i 120), 18284#(<= proc_i 124), 18285#(<= proc_i 128), 18286#(<= proc_i 132), 18287#(<= proc_i 136), 18288#(<= proc_i 140), 18289#(<= proc_i 144), 18290#(<= proc_i 148), 18291#(<= proc_i 152), 18292#(<= proc_i 156), 18293#(<= proc_i 160), 18294#(<= proc_i 164), 18295#(<= proc_i 168), 18296#(<= proc_i 172), 18297#(<= proc_i 176), 18298#(<= proc_i 180), 18299#(<= proc_i 184), 18300#(<= proc_i 188), 18301#(<= proc_i 192), 18302#(<= proc_i 196), 18303#(<= proc_i 200)] [2018-07-23 13:51:49,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:49,335 INFO L450 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-23 13:51:49,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-23 13:51:49,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 13:51:49,337 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 64 states. [2018-07-23 13:51:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:49,392 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-23 13:51:49,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-23 13:51:49,392 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 125 [2018-07-23 13:51:49,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:49,393 INFO L225 Difference]: With dead ends: 129 [2018-07-23 13:51:49,393 INFO L226 Difference]: Without dead ends: 128 [2018-07-23 13:51:49,394 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 13:51:49,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-07-23 13:51:49,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-07-23 13:51:49,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-07-23 13:51:49,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-07-23 13:51:49,399 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2018-07-23 13:51:49,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:49,400 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-07-23 13:51:49,400 INFO L472 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-23 13:51:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-07-23 13:51:49,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-07-23 13:51:49,401 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:49,401 INFO L357 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2018-07-23 13:51:49,401 INFO L414 AbstractCegarLoop]: === Iteration 63 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:49,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2018-07-23 13:51:49,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:49,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:49,638 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:49,638 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-23 13:51:49,638 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:49,638 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:51:49,639 INFO L185 omatonBuilderFactory]: Interpolants [18829#true, 18830#false, 18831#(<= proc_i 0), 18832#(<= proc_i 4), 18833#(<= proc_i 8), 18834#(<= proc_i 12), 18835#(<= proc_i 16), 18836#(<= proc_i 20), 18837#(<= proc_i 24), 18838#(<= proc_i 28), 18839#(<= proc_i 32), 18840#(<= proc_i 36), 18841#(<= proc_i 40), 18842#(<= proc_i 44), 18843#(<= proc_i 48), 18844#(<= proc_i 52), 18845#(<= proc_i 56), 18846#(<= proc_i 60), 18847#(<= proc_i 64), 18848#(<= proc_i 68), 18849#(<= proc_i 72), 18850#(<= proc_i 76), 18851#(<= proc_i 80), 18852#(<= proc_i 84), 18853#(<= proc_i 88), 18854#(<= proc_i 92), 18855#(<= proc_i 96), 18856#(<= proc_i 100), 18857#(<= proc_i 104), 18858#(<= proc_i 108), 18859#(<= proc_i 112), 18860#(<= proc_i 116), 18861#(<= proc_i 120), 18862#(<= proc_i 124), 18863#(<= proc_i 128), 18864#(<= proc_i 132), 18865#(<= proc_i 136), 18866#(<= proc_i 140), 18867#(<= proc_i 144), 18868#(<= proc_i 148), 18869#(<= proc_i 152), 18870#(<= proc_i 156), 18871#(<= proc_i 160), 18872#(<= proc_i 164), 18873#(<= proc_i 168), 18874#(<= proc_i 172), 18875#(<= proc_i 176), 18876#(<= proc_i 180), 18877#(<= proc_i 184), 18878#(<= proc_i 188), 18879#(<= proc_i 192), 18880#(<= proc_i 196), 18881#(<= proc_i 200), 18882#(<= proc_i 204), 18883#(<= proc_i 208), 18884#(<= proc_i 212), 18885#(<= proc_i 216), 18886#(<= proc_i 220), 18887#(<= proc_i 224), 18888#(<= proc_i 228), 18889#(<= proc_i 232), 18890#(<= proc_i 236), 18891#(<= proc_i 240), 18892#(<= proc_i 244), 18893#(<= proc_i 248)] [2018-07-23 13:51:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:49,642 INFO L450 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-23 13:51:49,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-23 13:51:49,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 13:51:49,643 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 65 states. [2018-07-23 13:51:49,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:49,726 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-23 13:51:49,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-23 13:51:49,726 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 127 [2018-07-23 13:51:49,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:49,727 INFO L225 Difference]: With dead ends: 131 [2018-07-23 13:51:49,727 INFO L226 Difference]: Without dead ends: 130 [2018-07-23 13:51:49,728 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 13:51:49,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-07-23 13:51:49,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-07-23 13:51:49,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-07-23 13:51:49,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-07-23 13:51:49,734 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2018-07-23 13:51:49,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:49,734 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-07-23 13:51:49,735 INFO L472 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-23 13:51:49,735 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-07-23 13:51:49,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-07-23 13:51:49,736 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:49,736 INFO L357 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2018-07-23 13:51:49,736 INFO L414 AbstractCegarLoop]: === Iteration 64 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:49,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2018-07-23 13:51:49,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:49,967 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:49,967 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-23 13:51:49,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:49,967 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:51:49,968 INFO L185 omatonBuilderFactory]: Interpolants [19456#(<= proc_i 152), 19457#(<= proc_i 156), 19458#(<= proc_i 160), 19459#(<= proc_i 164), 19460#(<= proc_i 168), 19461#(<= proc_i 172), 19462#(<= proc_i 176), 19463#(<= proc_i 180), 19464#(<= proc_i 184), 19465#(<= proc_i 188), 19466#(<= proc_i 192), 19467#(<= proc_i 196), 19468#(<= proc_i 200), 19469#(<= proc_i 204), 19470#(<= proc_i 208), 19471#(<= proc_i 212), 19472#(<= proc_i 216), 19473#(<= proc_i 220), 19474#(<= proc_i 224), 19475#(<= proc_i 228), 19476#(<= proc_i 232), 19477#(<= proc_i 236), 19478#(<= proc_i 240), 19479#(<= proc_i 244), 19480#(<= proc_i 248), 19481#(<= proc_i 252), 19416#true, 19417#false, 19418#(<= proc_i 0), 19419#(<= proc_i 4), 19420#(<= proc_i 8), 19421#(<= proc_i 12), 19422#(<= proc_i 16), 19423#(<= proc_i 20), 19424#(<= proc_i 24), 19425#(<= proc_i 28), 19426#(<= proc_i 32), 19427#(<= proc_i 36), 19428#(<= proc_i 40), 19429#(<= proc_i 44), 19430#(<= proc_i 48), 19431#(<= proc_i 52), 19432#(<= proc_i 56), 19433#(<= proc_i 60), 19434#(<= proc_i 64), 19435#(<= proc_i 68), 19436#(<= proc_i 72), 19437#(<= proc_i 76), 19438#(<= proc_i 80), 19439#(<= proc_i 84), 19440#(<= proc_i 88), 19441#(<= proc_i 92), 19442#(<= proc_i 96), 19443#(<= proc_i 100), 19444#(<= proc_i 104), 19445#(<= proc_i 108), 19446#(<= proc_i 112), 19447#(<= proc_i 116), 19448#(<= proc_i 120), 19449#(<= proc_i 124), 19450#(<= proc_i 128), 19451#(<= proc_i 132), 19452#(<= proc_i 136), 19453#(<= proc_i 140), 19454#(<= proc_i 144), 19455#(<= proc_i 148)] [2018-07-23 13:51:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:49,970 INFO L450 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-23 13:51:49,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-23 13:51:49,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 13:51:49,971 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 66 states. [2018-07-23 13:51:50,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:50,025 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-23 13:51:50,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-23 13:51:50,025 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 129 [2018-07-23 13:51:50,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:50,026 INFO L225 Difference]: With dead ends: 133 [2018-07-23 13:51:50,027 INFO L226 Difference]: Without dead ends: 132 [2018-07-23 13:51:50,028 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 13:51:50,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-07-23 13:51:50,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-07-23 13:51:50,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-07-23 13:51:50,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-07-23 13:51:50,034 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2018-07-23 13:51:50,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:50,035 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-07-23 13:51:50,035 INFO L472 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-23 13:51:50,035 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-07-23 13:51:50,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-07-23 13:51:50,036 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:50,036 INFO L357 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2018-07-23 13:51:50,037 INFO L414 AbstractCegarLoop]: === Iteration 65 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:50,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2018-07-23 13:51:50,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:50,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:50,278 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:50,278 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-23 13:51:50,278 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:50,279 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:51:50,279 INFO L185 omatonBuilderFactory]: Interpolants [20012#true, 20013#false, 20014#(<= proc_i 0), 20015#(<= proc_i 4), 20016#(<= proc_i 8), 20017#(<= proc_i 12), 20018#(<= proc_i 16), 20019#(<= proc_i 20), 20020#(<= proc_i 24), 20021#(<= proc_i 28), 20022#(<= proc_i 32), 20023#(<= proc_i 36), 20024#(<= proc_i 40), 20025#(<= proc_i 44), 20026#(<= proc_i 48), 20027#(<= proc_i 52), 20028#(<= proc_i 56), 20029#(<= proc_i 60), 20030#(<= proc_i 64), 20031#(<= proc_i 68), 20032#(<= proc_i 72), 20033#(<= proc_i 76), 20034#(<= proc_i 80), 20035#(<= proc_i 84), 20036#(<= proc_i 88), 20037#(<= proc_i 92), 20038#(<= proc_i 96), 20039#(<= proc_i 100), 20040#(<= proc_i 104), 20041#(<= proc_i 108), 20042#(<= proc_i 112), 20043#(<= proc_i 116), 20044#(<= proc_i 120), 20045#(<= proc_i 124), 20046#(<= proc_i 128), 20047#(<= proc_i 132), 20048#(<= proc_i 136), 20049#(<= proc_i 140), 20050#(<= proc_i 144), 20051#(<= proc_i 148), 20052#(<= proc_i 152), 20053#(<= proc_i 156), 20054#(<= proc_i 160), 20055#(<= proc_i 164), 20056#(<= proc_i 168), 20057#(<= proc_i 172), 20058#(<= proc_i 176), 20059#(<= proc_i 180), 20060#(<= proc_i 184), 20061#(<= proc_i 188), 20062#(<= proc_i 192), 20063#(<= proc_i 196), 20064#(<= proc_i 200), 20065#(<= proc_i 204), 20066#(<= proc_i 208), 20067#(<= proc_i 212), 20068#(<= proc_i 216), 20069#(<= proc_i 220), 20070#(<= proc_i 224), 20071#(<= proc_i 228), 20072#(<= proc_i 232), 20073#(<= proc_i 236), 20074#(<= proc_i 240), 20075#(<= proc_i 244), 20076#(<= proc_i 248), 20077#(<= proc_i 252), 20078#(<= proc_i 256)] [2018-07-23 13:51:50,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:50,280 INFO L450 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-23 13:51:50,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-23 13:51:50,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 13:51:50,281 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 67 states. [2018-07-23 13:51:50,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:50,352 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-23 13:51:50,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-23 13:51:50,352 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 131 [2018-07-23 13:51:50,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:50,354 INFO L225 Difference]: With dead ends: 135 [2018-07-23 13:51:50,354 INFO L226 Difference]: Without dead ends: 134 [2018-07-23 13:51:50,355 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 13:51:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-23 13:51:50,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-07-23 13:51:50,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-07-23 13:51:50,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-07-23 13:51:50,364 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2018-07-23 13:51:50,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:50,364 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-07-23 13:51:50,364 INFO L472 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-23 13:51:50,364 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-07-23 13:51:50,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-07-23 13:51:50,366 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:50,366 INFO L357 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2018-07-23 13:51:50,366 INFO L414 AbstractCegarLoop]: === Iteration 66 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:50,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2018-07-23 13:51:50,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:50,610 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:50,610 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-23 13:51:50,610 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:50,611 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:51:50,611 INFO L185 omatonBuilderFactory]: Interpolants [20617#true, 20618#false, 20619#(<= proc_i 0), 20620#(<= proc_i 4), 20621#(<= proc_i 8), 20622#(<= proc_i 12), 20623#(<= proc_i 16), 20624#(<= proc_i 20), 20625#(<= proc_i 24), 20626#(<= proc_i 28), 20627#(<= proc_i 32), 20628#(<= proc_i 36), 20629#(<= proc_i 40), 20630#(<= proc_i 44), 20631#(<= proc_i 48), 20632#(<= proc_i 52), 20633#(<= proc_i 56), 20634#(<= proc_i 60), 20635#(<= proc_i 64), 20636#(<= proc_i 68), 20637#(<= proc_i 72), 20638#(<= proc_i 76), 20639#(<= proc_i 80), 20640#(<= proc_i 84), 20641#(<= proc_i 88), 20642#(<= proc_i 92), 20643#(<= proc_i 96), 20644#(<= proc_i 100), 20645#(<= proc_i 104), 20646#(<= proc_i 108), 20647#(<= proc_i 112), 20648#(<= proc_i 116), 20649#(<= proc_i 120), 20650#(<= proc_i 124), 20651#(<= proc_i 128), 20652#(<= proc_i 132), 20653#(<= proc_i 136), 20654#(<= proc_i 140), 20655#(<= proc_i 144), 20656#(<= proc_i 148), 20657#(<= proc_i 152), 20658#(<= proc_i 156), 20659#(<= proc_i 160), 20660#(<= proc_i 164), 20661#(<= proc_i 168), 20662#(<= proc_i 172), 20663#(<= proc_i 176), 20664#(<= proc_i 180), 20665#(<= proc_i 184), 20666#(<= proc_i 188), 20667#(<= proc_i 192), 20668#(<= proc_i 196), 20669#(<= proc_i 200), 20670#(<= proc_i 204), 20671#(<= proc_i 208), 20672#(<= proc_i 212), 20673#(<= proc_i 216), 20674#(<= proc_i 220), 20675#(<= proc_i 224), 20676#(<= proc_i 228), 20677#(<= proc_i 232), 20678#(<= proc_i 236), 20679#(<= proc_i 240), 20680#(<= proc_i 244), 20681#(<= proc_i 248), 20682#(<= proc_i 252), 20683#(<= proc_i 256), 20684#(<= proc_i 260)] [2018-07-23 13:51:50,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:50,612 INFO L450 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-23 13:51:50,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-23 13:51:50,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 13:51:50,615 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 68 states. [2018-07-23 13:51:50,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:50,698 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-23 13:51:50,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-23 13:51:50,698 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 133 [2018-07-23 13:51:50,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:50,699 INFO L225 Difference]: With dead ends: 137 [2018-07-23 13:51:50,699 INFO L226 Difference]: Without dead ends: 136 [2018-07-23 13:51:50,700 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 13:51:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-07-23 13:51:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-07-23 13:51:50,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-23 13:51:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-07-23 13:51:50,705 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2018-07-23 13:51:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:50,705 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-07-23 13:51:50,706 INFO L472 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-23 13:51:50,706 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-07-23 13:51:50,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-07-23 13:51:50,707 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:50,707 INFO L357 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2018-07-23 13:51:50,707 INFO L414 AbstractCegarLoop]: === Iteration 67 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:50,707 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2018-07-23 13:51:50,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:50,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:50,992 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:50,992 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-23 13:51:50,992 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:50,992 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:51:50,993 INFO L185 omatonBuilderFactory]: Interpolants [21248#(<= proc_i 60), 21249#(<= proc_i 64), 21250#(<= proc_i 68), 21251#(<= proc_i 72), 21252#(<= proc_i 76), 21253#(<= proc_i 80), 21254#(<= proc_i 84), 21255#(<= proc_i 88), 21256#(<= proc_i 92), 21257#(<= proc_i 96), 21258#(<= proc_i 100), 21259#(<= proc_i 104), 21260#(<= proc_i 108), 21261#(<= proc_i 112), 21262#(<= proc_i 116), 21263#(<= proc_i 120), 21264#(<= proc_i 124), 21265#(<= proc_i 128), 21266#(<= proc_i 132), 21267#(<= proc_i 136), 21268#(<= proc_i 140), 21269#(<= proc_i 144), 21270#(<= proc_i 148), 21271#(<= proc_i 152), 21272#(<= proc_i 156), 21273#(<= proc_i 160), 21274#(<= proc_i 164), 21275#(<= proc_i 168), 21276#(<= proc_i 172), 21277#(<= proc_i 176), 21278#(<= proc_i 180), 21279#(<= proc_i 184), 21280#(<= proc_i 188), 21281#(<= proc_i 192), 21282#(<= proc_i 196), 21283#(<= proc_i 200), 21284#(<= proc_i 204), 21285#(<= proc_i 208), 21286#(<= proc_i 212), 21287#(<= proc_i 216), 21288#(<= proc_i 220), 21289#(<= proc_i 224), 21290#(<= proc_i 228), 21291#(<= proc_i 232), 21292#(<= proc_i 236), 21293#(<= proc_i 240), 21294#(<= proc_i 244), 21295#(<= proc_i 248), 21296#(<= proc_i 252), 21297#(<= proc_i 256), 21298#(<= proc_i 260), 21299#(<= proc_i 264), 21231#true, 21232#false, 21233#(<= proc_i 0), 21234#(<= proc_i 4), 21235#(<= proc_i 8), 21236#(<= proc_i 12), 21237#(<= proc_i 16), 21238#(<= proc_i 20), 21239#(<= proc_i 24), 21240#(<= proc_i 28), 21241#(<= proc_i 32), 21242#(<= proc_i 36), 21243#(<= proc_i 40), 21244#(<= proc_i 44), 21245#(<= proc_i 48), 21246#(<= proc_i 52), 21247#(<= proc_i 56)] [2018-07-23 13:51:50,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:50,994 INFO L450 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-23 13:51:50,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-23 13:51:50,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 13:51:50,995 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 69 states. [2018-07-23 13:51:51,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:51,073 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-23 13:51:51,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-23 13:51:51,074 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 135 [2018-07-23 13:51:51,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:51,075 INFO L225 Difference]: With dead ends: 139 [2018-07-23 13:51:51,075 INFO L226 Difference]: Without dead ends: 138 [2018-07-23 13:51:51,076 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 13:51:51,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-07-23 13:51:51,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-07-23 13:51:51,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-07-23 13:51:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-07-23 13:51:51,081 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2018-07-23 13:51:51,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:51,081 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-07-23 13:51:51,081 INFO L472 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-23 13:51:51,081 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-07-23 13:51:51,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-07-23 13:51:51,083 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:51,083 INFO L357 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2018-07-23 13:51:51,083 INFO L414 AbstractCegarLoop]: === Iteration 68 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:51,083 INFO L82 PathProgramCache]: Analyzing trace with hash 323690662, now seen corresponding path program 67 times [2018-07-23 13:51:51,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:51,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:51,325 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:51,325 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-23 13:51:51,326 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:51,326 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:51:51,326 INFO L185 omatonBuilderFactory]: Interpolants [21888#(<= proc_i 128), 21889#(<= proc_i 132), 21890#(<= proc_i 136), 21891#(<= proc_i 140), 21892#(<= proc_i 144), 21893#(<= proc_i 148), 21894#(<= proc_i 152), 21895#(<= proc_i 156), 21896#(<= proc_i 160), 21897#(<= proc_i 164), 21898#(<= proc_i 168), 21899#(<= proc_i 172), 21900#(<= proc_i 176), 21901#(<= proc_i 180), 21902#(<= proc_i 184), 21903#(<= proc_i 188), 21904#(<= proc_i 192), 21905#(<= proc_i 196), 21906#(<= proc_i 200), 21907#(<= proc_i 204), 21908#(<= proc_i 208), 21909#(<= proc_i 212), 21910#(<= proc_i 216), 21911#(<= proc_i 220), 21912#(<= proc_i 224), 21913#(<= proc_i 228), 21914#(<= proc_i 232), 21915#(<= proc_i 236), 21916#(<= proc_i 240), 21917#(<= proc_i 244), 21918#(<= proc_i 248), 21919#(<= proc_i 252), 21920#(<= proc_i 256), 21921#(<= proc_i 260), 21922#(<= proc_i 264), 21923#(<= proc_i 268), 21854#true, 21855#false, 21856#(<= proc_i 0), 21857#(<= proc_i 4), 21858#(<= proc_i 8), 21859#(<= proc_i 12), 21860#(<= proc_i 16), 21861#(<= proc_i 20), 21862#(<= proc_i 24), 21863#(<= proc_i 28), 21864#(<= proc_i 32), 21865#(<= proc_i 36), 21866#(<= proc_i 40), 21867#(<= proc_i 44), 21868#(<= proc_i 48), 21869#(<= proc_i 52), 21870#(<= proc_i 56), 21871#(<= proc_i 60), 21872#(<= proc_i 64), 21873#(<= proc_i 68), 21874#(<= proc_i 72), 21875#(<= proc_i 76), 21876#(<= proc_i 80), 21877#(<= proc_i 84), 21878#(<= proc_i 88), 21879#(<= proc_i 92), 21880#(<= proc_i 96), 21881#(<= proc_i 100), 21882#(<= proc_i 104), 21883#(<= proc_i 108), 21884#(<= proc_i 112), 21885#(<= proc_i 116), 21886#(<= proc_i 120), 21887#(<= proc_i 124)] [2018-07-23 13:51:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:51,327 INFO L450 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-23 13:51:51,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-23 13:51:51,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 13:51:51,329 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 70 states. [2018-07-23 13:51:51,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:51,380 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-23 13:51:51,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-23 13:51:51,380 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 137 [2018-07-23 13:51:51,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:51,382 INFO L225 Difference]: With dead ends: 141 [2018-07-23 13:51:51,382 INFO L226 Difference]: Without dead ends: 140 [2018-07-23 13:51:51,383 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 13:51:51,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-07-23 13:51:51,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-07-23 13:51:51,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-07-23 13:51:51,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-07-23 13:51:51,388 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 137 [2018-07-23 13:51:51,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:51,388 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-07-23 13:51:51,388 INFO L472 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-23 13:51:51,388 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-07-23 13:51:51,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-07-23 13:51:51,389 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:51,389 INFO L357 BasicCegarLoop]: trace histogram [69, 68, 1, 1] [2018-07-23 13:51:51,390 INFO L414 AbstractCegarLoop]: === Iteration 69 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:51,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1829081960, now seen corresponding path program 68 times [2018-07-23 13:51:51,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:51,636 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:51,637 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-23 13:51:51,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:51,637 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:51:51,637 INFO L185 omatonBuilderFactory]: Interpolants [22528#(<= proc_i 160), 22529#(<= proc_i 164), 22530#(<= proc_i 168), 22531#(<= proc_i 172), 22532#(<= proc_i 176), 22533#(<= proc_i 180), 22534#(<= proc_i 184), 22535#(<= proc_i 188), 22536#(<= proc_i 192), 22537#(<= proc_i 196), 22538#(<= proc_i 200), 22539#(<= proc_i 204), 22540#(<= proc_i 208), 22541#(<= proc_i 212), 22542#(<= proc_i 216), 22543#(<= proc_i 220), 22544#(<= proc_i 224), 22545#(<= proc_i 228), 22546#(<= proc_i 232), 22547#(<= proc_i 236), 22548#(<= proc_i 240), 22549#(<= proc_i 244), 22550#(<= proc_i 248), 22551#(<= proc_i 252), 22552#(<= proc_i 256), 22553#(<= proc_i 260), 22554#(<= proc_i 264), 22555#(<= proc_i 268), 22556#(<= proc_i 272), 22486#true, 22487#false, 22488#(<= proc_i 0), 22489#(<= proc_i 4), 22490#(<= proc_i 8), 22491#(<= proc_i 12), 22492#(<= proc_i 16), 22493#(<= proc_i 20), 22494#(<= proc_i 24), 22495#(<= proc_i 28), 22496#(<= proc_i 32), 22497#(<= proc_i 36), 22498#(<= proc_i 40), 22499#(<= proc_i 44), 22500#(<= proc_i 48), 22501#(<= proc_i 52), 22502#(<= proc_i 56), 22503#(<= proc_i 60), 22504#(<= proc_i 64), 22505#(<= proc_i 68), 22506#(<= proc_i 72), 22507#(<= proc_i 76), 22508#(<= proc_i 80), 22509#(<= proc_i 84), 22510#(<= proc_i 88), 22511#(<= proc_i 92), 22512#(<= proc_i 96), 22513#(<= proc_i 100), 22514#(<= proc_i 104), 22515#(<= proc_i 108), 22516#(<= proc_i 112), 22517#(<= proc_i 116), 22518#(<= proc_i 120), 22519#(<= proc_i 124), 22520#(<= proc_i 128), 22521#(<= proc_i 132), 22522#(<= proc_i 136), 22523#(<= proc_i 140), 22524#(<= proc_i 144), 22525#(<= proc_i 148), 22526#(<= proc_i 152), 22527#(<= proc_i 156)] [2018-07-23 13:51:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:51,639 INFO L450 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-23 13:51:51,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-23 13:51:51,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 13:51:51,640 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 71 states. [2018-07-23 13:51:51,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:51,693 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-23 13:51:51,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-23 13:51:51,693 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 139 [2018-07-23 13:51:51,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:51,695 INFO L225 Difference]: With dead ends: 143 [2018-07-23 13:51:51,695 INFO L226 Difference]: Without dead ends: 142 [2018-07-23 13:51:51,696 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 13:51:51,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-07-23 13:51:51,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-07-23 13:51:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-07-23 13:51:51,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-07-23 13:51:51,701 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2018-07-23 13:51:51,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:51,703 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-07-23 13:51:51,703 INFO L472 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-23 13:51:51,703 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-07-23 13:51:51,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-07-23 13:51:51,704 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:51,704 INFO L357 BasicCegarLoop]: trace histogram [70, 69, 1, 1] [2018-07-23 13:51:51,705 INFO L414 AbstractCegarLoop]: === Iteration 70 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:51,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1106140586, now seen corresponding path program 69 times [2018-07-23 13:51:51,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:51,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:51,954 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:51,954 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-23 13:51:51,955 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:51,955 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:51:51,955 INFO L185 omatonBuilderFactory]: Interpolants [23168#(<= proc_i 156), 23169#(<= proc_i 160), 23170#(<= proc_i 164), 23171#(<= proc_i 168), 23172#(<= proc_i 172), 23173#(<= proc_i 176), 23174#(<= proc_i 180), 23175#(<= proc_i 184), 23176#(<= proc_i 188), 23177#(<= proc_i 192), 23178#(<= proc_i 196), 23179#(<= proc_i 200), 23180#(<= proc_i 204), 23181#(<= proc_i 208), 23182#(<= proc_i 212), 23183#(<= proc_i 216), 23184#(<= proc_i 220), 23185#(<= proc_i 224), 23186#(<= proc_i 228), 23187#(<= proc_i 232), 23188#(<= proc_i 236), 23189#(<= proc_i 240), 23190#(<= proc_i 244), 23191#(<= proc_i 248), 23192#(<= proc_i 252), 23193#(<= proc_i 256), 23194#(<= proc_i 260), 23195#(<= proc_i 264), 23196#(<= proc_i 268), 23197#(<= proc_i 272), 23198#(<= proc_i 276), 23127#true, 23128#false, 23129#(<= proc_i 0), 23130#(<= proc_i 4), 23131#(<= proc_i 8), 23132#(<= proc_i 12), 23133#(<= proc_i 16), 23134#(<= proc_i 20), 23135#(<= proc_i 24), 23136#(<= proc_i 28), 23137#(<= proc_i 32), 23138#(<= proc_i 36), 23139#(<= proc_i 40), 23140#(<= proc_i 44), 23141#(<= proc_i 48), 23142#(<= proc_i 52), 23143#(<= proc_i 56), 23144#(<= proc_i 60), 23145#(<= proc_i 64), 23146#(<= proc_i 68), 23147#(<= proc_i 72), 23148#(<= proc_i 76), 23149#(<= proc_i 80), 23150#(<= proc_i 84), 23151#(<= proc_i 88), 23152#(<= proc_i 92), 23153#(<= proc_i 96), 23154#(<= proc_i 100), 23155#(<= proc_i 104), 23156#(<= proc_i 108), 23157#(<= proc_i 112), 23158#(<= proc_i 116), 23159#(<= proc_i 120), 23160#(<= proc_i 124), 23161#(<= proc_i 128), 23162#(<= proc_i 132), 23163#(<= proc_i 136), 23164#(<= proc_i 140), 23165#(<= proc_i 144), 23166#(<= proc_i 148), 23167#(<= proc_i 152)] [2018-07-23 13:51:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:51,956 INFO L450 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-23 13:51:51,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-23 13:51:51,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 13:51:51,958 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 72 states. [2018-07-23 13:51:52,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:52,009 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-23 13:51:52,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-23 13:51:52,009 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 141 [2018-07-23 13:51:52,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:52,010 INFO L225 Difference]: With dead ends: 145 [2018-07-23 13:51:52,010 INFO L226 Difference]: Without dead ends: 144 [2018-07-23 13:51:52,011 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 13:51:52,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-23 13:51:52,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-07-23 13:51:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-07-23 13:51:52,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-07-23 13:51:52,016 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 141 [2018-07-23 13:51:52,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:52,017 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-07-23 13:51:52,017 INFO L472 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-23 13:51:52,017 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-07-23 13:51:52,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-07-23 13:51:52,018 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:52,018 INFO L357 BasicCegarLoop]: trace histogram [71, 70, 1, 1] [2018-07-23 13:51:52,019 INFO L414 AbstractCegarLoop]: === Iteration 71 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:52,019 INFO L82 PathProgramCache]: Analyzing trace with hash 2144182124, now seen corresponding path program 70 times [2018-07-23 13:51:52,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:52,273 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:52,273 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-23 13:51:52,273 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:52,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:51:52,274 INFO L185 omatonBuilderFactory]: Interpolants [23808#(<= proc_i 116), 23809#(<= proc_i 120), 23810#(<= proc_i 124), 23811#(<= proc_i 128), 23812#(<= proc_i 132), 23813#(<= proc_i 136), 23814#(<= proc_i 140), 23815#(<= proc_i 144), 23816#(<= proc_i 148), 23817#(<= proc_i 152), 23818#(<= proc_i 156), 23819#(<= proc_i 160), 23820#(<= proc_i 164), 23821#(<= proc_i 168), 23822#(<= proc_i 172), 23823#(<= proc_i 176), 23824#(<= proc_i 180), 23825#(<= proc_i 184), 23826#(<= proc_i 188), 23827#(<= proc_i 192), 23828#(<= proc_i 196), 23829#(<= proc_i 200), 23830#(<= proc_i 204), 23831#(<= proc_i 208), 23832#(<= proc_i 212), 23833#(<= proc_i 216), 23834#(<= proc_i 220), 23835#(<= proc_i 224), 23836#(<= proc_i 228), 23837#(<= proc_i 232), 23838#(<= proc_i 236), 23839#(<= proc_i 240), 23840#(<= proc_i 244), 23841#(<= proc_i 248), 23842#(<= proc_i 252), 23843#(<= proc_i 256), 23844#(<= proc_i 260), 23845#(<= proc_i 264), 23846#(<= proc_i 268), 23847#(<= proc_i 272), 23848#(<= proc_i 276), 23849#(<= proc_i 280), 23777#true, 23778#false, 23779#(<= proc_i 0), 23780#(<= proc_i 4), 23781#(<= proc_i 8), 23782#(<= proc_i 12), 23783#(<= proc_i 16), 23784#(<= proc_i 20), 23785#(<= proc_i 24), 23786#(<= proc_i 28), 23787#(<= proc_i 32), 23788#(<= proc_i 36), 23789#(<= proc_i 40), 23790#(<= proc_i 44), 23791#(<= proc_i 48), 23792#(<= proc_i 52), 23793#(<= proc_i 56), 23794#(<= proc_i 60), 23795#(<= proc_i 64), 23796#(<= proc_i 68), 23797#(<= proc_i 72), 23798#(<= proc_i 76), 23799#(<= proc_i 80), 23800#(<= proc_i 84), 23801#(<= proc_i 88), 23802#(<= proc_i 92), 23803#(<= proc_i 96), 23804#(<= proc_i 100), 23805#(<= proc_i 104), 23806#(<= proc_i 108), 23807#(<= proc_i 112)] [2018-07-23 13:51:52,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:52,275 INFO L450 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-23 13:51:52,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-23 13:51:52,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 13:51:52,277 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 73 states. [2018-07-23 13:51:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:52,340 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-23 13:51:52,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-23 13:51:52,340 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 143 [2018-07-23 13:51:52,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:52,341 INFO L225 Difference]: With dead ends: 147 [2018-07-23 13:51:52,341 INFO L226 Difference]: Without dead ends: 146 [2018-07-23 13:51:52,342 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 13:51:52,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-07-23 13:51:52,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-07-23 13:51:52,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-07-23 13:51:52,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-07-23 13:51:52,347 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2018-07-23 13:51:52,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:52,347 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-07-23 13:51:52,347 INFO L472 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-23 13:51:52,347 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-07-23 13:51:52,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-23 13:51:52,349 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:52,349 INFO L357 BasicCegarLoop]: trace histogram [72, 71, 1, 1] [2018-07-23 13:51:52,349 INFO L414 AbstractCegarLoop]: === Iteration 72 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:52,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1025279826, now seen corresponding path program 71 times [2018-07-23 13:51:52,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:52,615 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:52,615 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-23 13:51:52,615 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:52,615 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:51:52,616 INFO L185 omatonBuilderFactory]: Interpolants [24448#(<= proc_i 40), 24449#(<= proc_i 44), 24450#(<= proc_i 48), 24451#(<= proc_i 52), 24452#(<= proc_i 56), 24453#(<= proc_i 60), 24454#(<= proc_i 64), 24455#(<= proc_i 68), 24456#(<= proc_i 72), 24457#(<= proc_i 76), 24458#(<= proc_i 80), 24459#(<= proc_i 84), 24460#(<= proc_i 88), 24461#(<= proc_i 92), 24462#(<= proc_i 96), 24463#(<= proc_i 100), 24464#(<= proc_i 104), 24465#(<= proc_i 108), 24466#(<= proc_i 112), 24467#(<= proc_i 116), 24468#(<= proc_i 120), 24469#(<= proc_i 124), 24470#(<= proc_i 128), 24471#(<= proc_i 132), 24472#(<= proc_i 136), 24473#(<= proc_i 140), 24474#(<= proc_i 144), 24475#(<= proc_i 148), 24476#(<= proc_i 152), 24477#(<= proc_i 156), 24478#(<= proc_i 160), 24479#(<= proc_i 164), 24480#(<= proc_i 168), 24481#(<= proc_i 172), 24482#(<= proc_i 176), 24483#(<= proc_i 180), 24484#(<= proc_i 184), 24485#(<= proc_i 188), 24486#(<= proc_i 192), 24487#(<= proc_i 196), 24488#(<= proc_i 200), 24489#(<= proc_i 204), 24490#(<= proc_i 208), 24491#(<= proc_i 212), 24492#(<= proc_i 216), 24493#(<= proc_i 220), 24494#(<= proc_i 224), 24495#(<= proc_i 228), 24496#(<= proc_i 232), 24497#(<= proc_i 236), 24498#(<= proc_i 240), 24499#(<= proc_i 244), 24500#(<= proc_i 248), 24501#(<= proc_i 252), 24502#(<= proc_i 256), 24503#(<= proc_i 260), 24504#(<= proc_i 264), 24505#(<= proc_i 268), 24506#(<= proc_i 272), 24507#(<= proc_i 276), 24508#(<= proc_i 280), 24509#(<= proc_i 284), 24436#true, 24437#false, 24438#(<= proc_i 0), 24439#(<= proc_i 4), 24440#(<= proc_i 8), 24441#(<= proc_i 12), 24442#(<= proc_i 16), 24443#(<= proc_i 20), 24444#(<= proc_i 24), 24445#(<= proc_i 28), 24446#(<= proc_i 32), 24447#(<= proc_i 36)] [2018-07-23 13:51:52,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:52,617 INFO L450 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-23 13:51:52,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-23 13:51:52,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 13:51:52,618 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 74 states. [2018-07-23 13:51:52,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:52,711 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-23 13:51:52,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-23 13:51:52,712 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 145 [2018-07-23 13:51:52,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:52,713 INFO L225 Difference]: With dead ends: 149 [2018-07-23 13:51:52,713 INFO L226 Difference]: Without dead ends: 148 [2018-07-23 13:51:52,714 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 13:51:52,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-07-23 13:51:52,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-07-23 13:51:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-07-23 13:51:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-07-23 13:51:52,719 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2018-07-23 13:51:52,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:52,719 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-07-23 13:51:52,720 INFO L472 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-23 13:51:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-07-23 13:51:52,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-07-23 13:51:52,721 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:52,721 INFO L357 BasicCegarLoop]: trace histogram [73, 72, 1, 1] [2018-07-23 13:51:52,721 INFO L414 AbstractCegarLoop]: === Iteration 73 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:52,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1746400912, now seen corresponding path program 72 times [2018-07-23 13:51:52,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:53,049 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:53,049 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-23 13:51:53,050 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:53,050 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:51:53,051 INFO L185 omatonBuilderFactory]: Interpolants [25104#true, 25105#false, 25106#(<= proc_i 0), 25107#(<= proc_i 4), 25108#(<= proc_i 8), 25109#(<= proc_i 12), 25110#(<= proc_i 16), 25111#(<= proc_i 20), 25112#(<= proc_i 24), 25113#(<= proc_i 28), 25114#(<= proc_i 32), 25115#(<= proc_i 36), 25116#(<= proc_i 40), 25117#(<= proc_i 44), 25118#(<= proc_i 48), 25119#(<= proc_i 52), 25120#(<= proc_i 56), 25121#(<= proc_i 60), 25122#(<= proc_i 64), 25123#(<= proc_i 68), 25124#(<= proc_i 72), 25125#(<= proc_i 76), 25126#(<= proc_i 80), 25127#(<= proc_i 84), 25128#(<= proc_i 88), 25129#(<= proc_i 92), 25130#(<= proc_i 96), 25131#(<= proc_i 100), 25132#(<= proc_i 104), 25133#(<= proc_i 108), 25134#(<= proc_i 112), 25135#(<= proc_i 116), 25136#(<= proc_i 120), 25137#(<= proc_i 124), 25138#(<= proc_i 128), 25139#(<= proc_i 132), 25140#(<= proc_i 136), 25141#(<= proc_i 140), 25142#(<= proc_i 144), 25143#(<= proc_i 148), 25144#(<= proc_i 152), 25145#(<= proc_i 156), 25146#(<= proc_i 160), 25147#(<= proc_i 164), 25148#(<= proc_i 168), 25149#(<= proc_i 172), 25150#(<= proc_i 176), 25151#(<= proc_i 180), 25152#(<= proc_i 184), 25153#(<= proc_i 188), 25154#(<= proc_i 192), 25155#(<= proc_i 196), 25156#(<= proc_i 200), 25157#(<= proc_i 204), 25158#(<= proc_i 208), 25159#(<= proc_i 212), 25160#(<= proc_i 216), 25161#(<= proc_i 220), 25162#(<= proc_i 224), 25163#(<= proc_i 228), 25164#(<= proc_i 232), 25165#(<= proc_i 236), 25166#(<= proc_i 240), 25167#(<= proc_i 244), 25168#(<= proc_i 248), 25169#(<= proc_i 252), 25170#(<= proc_i 256), 25171#(<= proc_i 260), 25172#(<= proc_i 264), 25173#(<= proc_i 268), 25174#(<= proc_i 272), 25175#(<= proc_i 276), 25176#(<= proc_i 280), 25177#(<= proc_i 284), 25178#(<= proc_i 288)] [2018-07-23 13:51:53,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:53,052 INFO L450 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-23 13:51:53,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-23 13:51:53,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 13:51:53,054 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 75 states. [2018-07-23 13:51:53,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:53,175 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-23 13:51:53,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-23 13:51:53,175 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 147 [2018-07-23 13:51:53,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:53,177 INFO L225 Difference]: With dead ends: 151 [2018-07-23 13:51:53,177 INFO L226 Difference]: Without dead ends: 150 [2018-07-23 13:51:53,178 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 13:51:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-23 13:51:53,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-07-23 13:51:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-07-23 13:51:53,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-07-23 13:51:53,184 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2018-07-23 13:51:53,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:53,184 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-07-23 13:51:53,185 INFO L472 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-23 13:51:53,185 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-07-23 13:51:53,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-07-23 13:51:53,186 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:53,186 INFO L357 BasicCegarLoop]: trace histogram [74, 73, 1, 1] [2018-07-23 13:51:53,187 INFO L414 AbstractCegarLoop]: === Iteration 74 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:53,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1040937394, now seen corresponding path program 73 times [2018-07-23 13:51:53,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:53,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:53,539 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:53,540 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-23 13:51:53,540 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:53,540 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:51:53,540 INFO L185 omatonBuilderFactory]: Interpolants [25856#(<= proc_i 292), 25781#true, 25782#false, 25783#(<= proc_i 0), 25784#(<= proc_i 4), 25785#(<= proc_i 8), 25786#(<= proc_i 12), 25787#(<= proc_i 16), 25788#(<= proc_i 20), 25789#(<= proc_i 24), 25790#(<= proc_i 28), 25791#(<= proc_i 32), 25792#(<= proc_i 36), 25793#(<= proc_i 40), 25794#(<= proc_i 44), 25795#(<= proc_i 48), 25796#(<= proc_i 52), 25797#(<= proc_i 56), 25798#(<= proc_i 60), 25799#(<= proc_i 64), 25800#(<= proc_i 68), 25801#(<= proc_i 72), 25802#(<= proc_i 76), 25803#(<= proc_i 80), 25804#(<= proc_i 84), 25805#(<= proc_i 88), 25806#(<= proc_i 92), 25807#(<= proc_i 96), 25808#(<= proc_i 100), 25809#(<= proc_i 104), 25810#(<= proc_i 108), 25811#(<= proc_i 112), 25812#(<= proc_i 116), 25813#(<= proc_i 120), 25814#(<= proc_i 124), 25815#(<= proc_i 128), 25816#(<= proc_i 132), 25817#(<= proc_i 136), 25818#(<= proc_i 140), 25819#(<= proc_i 144), 25820#(<= proc_i 148), 25821#(<= proc_i 152), 25822#(<= proc_i 156), 25823#(<= proc_i 160), 25824#(<= proc_i 164), 25825#(<= proc_i 168), 25826#(<= proc_i 172), 25827#(<= proc_i 176), 25828#(<= proc_i 180), 25829#(<= proc_i 184), 25830#(<= proc_i 188), 25831#(<= proc_i 192), 25832#(<= proc_i 196), 25833#(<= proc_i 200), 25834#(<= proc_i 204), 25835#(<= proc_i 208), 25836#(<= proc_i 212), 25837#(<= proc_i 216), 25838#(<= proc_i 220), 25839#(<= proc_i 224), 25840#(<= proc_i 228), 25841#(<= proc_i 232), 25842#(<= proc_i 236), 25843#(<= proc_i 240), 25844#(<= proc_i 244), 25845#(<= proc_i 248), 25846#(<= proc_i 252), 25847#(<= proc_i 256), 25848#(<= proc_i 260), 25849#(<= proc_i 264), 25850#(<= proc_i 268), 25851#(<= proc_i 272), 25852#(<= proc_i 276), 25853#(<= proc_i 280), 25854#(<= proc_i 284), 25855#(<= proc_i 288)] [2018-07-23 13:51:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:53,541 INFO L450 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-23 13:51:53,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-23 13:51:53,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 13:51:53,543 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 76 states. [2018-07-23 13:51:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:53,644 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-23 13:51:53,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-23 13:51:53,644 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 149 [2018-07-23 13:51:53,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:53,646 INFO L225 Difference]: With dead ends: 153 [2018-07-23 13:51:53,646 INFO L226 Difference]: Without dead ends: 152 [2018-07-23 13:51:53,646 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 13:51:53,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-07-23 13:51:53,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-07-23 13:51:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-07-23 13:51:53,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-07-23 13:51:53,651 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2018-07-23 13:51:53,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:53,652 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-07-23 13:51:53,652 INFO L472 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-23 13:51:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-07-23 13:51:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-07-23 13:51:53,653 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:53,653 INFO L357 BasicCegarLoop]: trace histogram [75, 74, 1, 1] [2018-07-23 13:51:53,654 INFO L414 AbstractCegarLoop]: === Iteration 75 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:53,654 INFO L82 PathProgramCache]: Analyzing trace with hash -386543244, now seen corresponding path program 74 times [2018-07-23 13:51:53,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:53,913 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:53,914 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-23 13:51:53,914 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:53,914 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:51:53,914 INFO L185 omatonBuilderFactory]: Interpolants [26496#(<= proc_i 108), 26497#(<= proc_i 112), 26498#(<= proc_i 116), 26499#(<= proc_i 120), 26500#(<= proc_i 124), 26501#(<= proc_i 128), 26502#(<= proc_i 132), 26503#(<= proc_i 136), 26504#(<= proc_i 140), 26505#(<= proc_i 144), 26506#(<= proc_i 148), 26507#(<= proc_i 152), 26508#(<= proc_i 156), 26509#(<= proc_i 160), 26510#(<= proc_i 164), 26511#(<= proc_i 168), 26512#(<= proc_i 172), 26513#(<= proc_i 176), 26514#(<= proc_i 180), 26515#(<= proc_i 184), 26516#(<= proc_i 188), 26517#(<= proc_i 192), 26518#(<= proc_i 196), 26519#(<= proc_i 200), 26520#(<= proc_i 204), 26521#(<= proc_i 208), 26522#(<= proc_i 212), 26523#(<= proc_i 216), 26524#(<= proc_i 220), 26525#(<= proc_i 224), 26526#(<= proc_i 228), 26527#(<= proc_i 232), 26528#(<= proc_i 236), 26529#(<= proc_i 240), 26530#(<= proc_i 244), 26531#(<= proc_i 248), 26532#(<= proc_i 252), 26533#(<= proc_i 256), 26534#(<= proc_i 260), 26535#(<= proc_i 264), 26536#(<= proc_i 268), 26537#(<= proc_i 272), 26538#(<= proc_i 276), 26539#(<= proc_i 280), 26540#(<= proc_i 284), 26541#(<= proc_i 288), 26542#(<= proc_i 292), 26543#(<= proc_i 296), 26467#true, 26468#false, 26469#(<= proc_i 0), 26470#(<= proc_i 4), 26471#(<= proc_i 8), 26472#(<= proc_i 12), 26473#(<= proc_i 16), 26474#(<= proc_i 20), 26475#(<= proc_i 24), 26476#(<= proc_i 28), 26477#(<= proc_i 32), 26478#(<= proc_i 36), 26479#(<= proc_i 40), 26480#(<= proc_i 44), 26481#(<= proc_i 48), 26482#(<= proc_i 52), 26483#(<= proc_i 56), 26484#(<= proc_i 60), 26485#(<= proc_i 64), 26486#(<= proc_i 68), 26487#(<= proc_i 72), 26488#(<= proc_i 76), 26489#(<= proc_i 80), 26490#(<= proc_i 84), 26491#(<= proc_i 88), 26492#(<= proc_i 92), 26493#(<= proc_i 96), 26494#(<= proc_i 100), 26495#(<= proc_i 104)] [2018-07-23 13:51:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:53,916 INFO L450 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-23 13:51:53,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-23 13:51:53,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 13:51:53,918 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 77 states. [2018-07-23 13:51:53,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:53,990 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-23 13:51:53,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-23 13:51:53,990 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 151 [2018-07-23 13:51:53,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:53,991 INFO L225 Difference]: With dead ends: 155 [2018-07-23 13:51:53,992 INFO L226 Difference]: Without dead ends: 154 [2018-07-23 13:51:53,992 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 13:51:53,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-07-23 13:51:53,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-07-23 13:51:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-07-23 13:51:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-07-23 13:51:53,999 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2018-07-23 13:51:53,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:53,999 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-07-23 13:51:53,999 INFO L472 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-23 13:51:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-07-23 13:51:54,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-07-23 13:51:54,001 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:54,001 INFO L357 BasicCegarLoop]: trace histogram [76, 75, 1, 1] [2018-07-23 13:51:54,001 INFO L414 AbstractCegarLoop]: === Iteration 76 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:54,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2100868938, now seen corresponding path program 75 times [2018-07-23 13:51:54,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:54,268 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:54,268 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-23 13:51:54,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:54,269 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:51:54,269 INFO L185 omatonBuilderFactory]: Interpolants [27162#true, 27163#false, 27164#(<= proc_i 0), 27165#(<= proc_i 4), 27166#(<= proc_i 8), 27167#(<= proc_i 12), 27168#(<= proc_i 16), 27169#(<= proc_i 20), 27170#(<= proc_i 24), 27171#(<= proc_i 28), 27172#(<= proc_i 32), 27173#(<= proc_i 36), 27174#(<= proc_i 40), 27175#(<= proc_i 44), 27176#(<= proc_i 48), 27177#(<= proc_i 52), 27178#(<= proc_i 56), 27179#(<= proc_i 60), 27180#(<= proc_i 64), 27181#(<= proc_i 68), 27182#(<= proc_i 72), 27183#(<= proc_i 76), 27184#(<= proc_i 80), 27185#(<= proc_i 84), 27186#(<= proc_i 88), 27187#(<= proc_i 92), 27188#(<= proc_i 96), 27189#(<= proc_i 100), 27190#(<= proc_i 104), 27191#(<= proc_i 108), 27192#(<= proc_i 112), 27193#(<= proc_i 116), 27194#(<= proc_i 120), 27195#(<= proc_i 124), 27196#(<= proc_i 128), 27197#(<= proc_i 132), 27198#(<= proc_i 136), 27199#(<= proc_i 140), 27200#(<= proc_i 144), 27201#(<= proc_i 148), 27202#(<= proc_i 152), 27203#(<= proc_i 156), 27204#(<= proc_i 160), 27205#(<= proc_i 164), 27206#(<= proc_i 168), 27207#(<= proc_i 172), 27208#(<= proc_i 176), 27209#(<= proc_i 180), 27210#(<= proc_i 184), 27211#(<= proc_i 188), 27212#(<= proc_i 192), 27213#(<= proc_i 196), 27214#(<= proc_i 200), 27215#(<= proc_i 204), 27216#(<= proc_i 208), 27217#(<= proc_i 212), 27218#(<= proc_i 216), 27219#(<= proc_i 220), 27220#(<= proc_i 224), 27221#(<= proc_i 228), 27222#(<= proc_i 232), 27223#(<= proc_i 236), 27224#(<= proc_i 240), 27225#(<= proc_i 244), 27226#(<= proc_i 248), 27227#(<= proc_i 252), 27228#(<= proc_i 256), 27229#(<= proc_i 260), 27230#(<= proc_i 264), 27231#(<= proc_i 268), 27232#(<= proc_i 272), 27233#(<= proc_i 276), 27234#(<= proc_i 280), 27235#(<= proc_i 284), 27236#(<= proc_i 288), 27237#(<= proc_i 292), 27238#(<= proc_i 296), 27239#(<= proc_i 300)] [2018-07-23 13:51:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:54,271 INFO L450 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-23 13:51:54,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-23 13:51:54,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 13:51:54,273 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 78 states. [2018-07-23 13:51:54,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:54,388 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-23 13:51:54,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-23 13:51:54,389 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 153 [2018-07-23 13:51:54,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:54,390 INFO L225 Difference]: With dead ends: 157 [2018-07-23 13:51:54,391 INFO L226 Difference]: Without dead ends: 156 [2018-07-23 13:51:54,392 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 13:51:54,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-07-23 13:51:54,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-07-23 13:51:54,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-07-23 13:51:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-07-23 13:51:54,396 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2018-07-23 13:51:54,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:54,397 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-07-23 13:51:54,397 INFO L472 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-23 13:51:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-07-23 13:51:54,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-07-23 13:51:54,399 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:54,399 INFO L357 BasicCegarLoop]: trace histogram [77, 76, 1, 1] [2018-07-23 13:51:54,399 INFO L414 AbstractCegarLoop]: === Iteration 77 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:54,399 INFO L82 PathProgramCache]: Analyzing trace with hash -300419208, now seen corresponding path program 76 times [2018-07-23 13:51:54,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:54,645 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:54,645 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-23 13:51:54,645 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:54,645 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:51:54,646 INFO L185 omatonBuilderFactory]: Interpolants [27904#(<= proc_i 144), 27905#(<= proc_i 148), 27906#(<= proc_i 152), 27907#(<= proc_i 156), 27908#(<= proc_i 160), 27909#(<= proc_i 164), 27910#(<= proc_i 168), 27911#(<= proc_i 172), 27912#(<= proc_i 176), 27913#(<= proc_i 180), 27914#(<= proc_i 184), 27915#(<= proc_i 188), 27916#(<= proc_i 192), 27917#(<= proc_i 196), 27918#(<= proc_i 200), 27919#(<= proc_i 204), 27920#(<= proc_i 208), 27921#(<= proc_i 212), 27922#(<= proc_i 216), 27923#(<= proc_i 220), 27924#(<= proc_i 224), 27925#(<= proc_i 228), 27926#(<= proc_i 232), 27927#(<= proc_i 236), 27928#(<= proc_i 240), 27929#(<= proc_i 244), 27930#(<= proc_i 248), 27931#(<= proc_i 252), 27932#(<= proc_i 256), 27933#(<= proc_i 260), 27934#(<= proc_i 264), 27935#(<= proc_i 268), 27936#(<= proc_i 272), 27937#(<= proc_i 276), 27938#(<= proc_i 280), 27939#(<= proc_i 284), 27940#(<= proc_i 288), 27941#(<= proc_i 292), 27942#(<= proc_i 296), 27943#(<= proc_i 300), 27944#(<= proc_i 304), 27866#true, 27867#false, 27868#(<= proc_i 0), 27869#(<= proc_i 4), 27870#(<= proc_i 8), 27871#(<= proc_i 12), 27872#(<= proc_i 16), 27873#(<= proc_i 20), 27874#(<= proc_i 24), 27875#(<= proc_i 28), 27876#(<= proc_i 32), 27877#(<= proc_i 36), 27878#(<= proc_i 40), 27879#(<= proc_i 44), 27880#(<= proc_i 48), 27881#(<= proc_i 52), 27882#(<= proc_i 56), 27883#(<= proc_i 60), 27884#(<= proc_i 64), 27885#(<= proc_i 68), 27886#(<= proc_i 72), 27887#(<= proc_i 76), 27888#(<= proc_i 80), 27889#(<= proc_i 84), 27890#(<= proc_i 88), 27891#(<= proc_i 92), 27892#(<= proc_i 96), 27893#(<= proc_i 100), 27894#(<= proc_i 104), 27895#(<= proc_i 108), 27896#(<= proc_i 112), 27897#(<= proc_i 116), 27898#(<= proc_i 120), 27899#(<= proc_i 124), 27900#(<= proc_i 128), 27901#(<= proc_i 132), 27902#(<= proc_i 136), 27903#(<= proc_i 140)] [2018-07-23 13:51:54,647 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:54,647 INFO L450 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-23 13:51:54,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-23 13:51:54,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 13:51:54,649 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 79 states. [2018-07-23 13:51:54,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:54,712 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-23 13:51:54,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-23 13:51:54,713 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 155 [2018-07-23 13:51:54,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:54,714 INFO L225 Difference]: With dead ends: 159 [2018-07-23 13:51:54,714 INFO L226 Difference]: Without dead ends: 158 [2018-07-23 13:51:54,715 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 13:51:54,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-07-23 13:51:54,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-07-23 13:51:54,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-07-23 13:51:54,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-07-23 13:51:54,720 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2018-07-23 13:51:54,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:54,720 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-07-23 13:51:54,720 INFO L472 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-23 13:51:54,720 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-07-23 13:51:54,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-07-23 13:51:54,721 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:54,721 INFO L357 BasicCegarLoop]: trace histogram [78, 77, 1, 1] [2018-07-23 13:51:54,721 INFO L414 AbstractCegarLoop]: === Iteration 78 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:54,722 INFO L82 PathProgramCache]: Analyzing trace with hash -940048966, now seen corresponding path program 77 times [2018-07-23 13:51:54,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:55,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:55,005 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:55,005 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-23 13:51:55,005 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:55,006 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:51:55,006 INFO L185 omatonBuilderFactory]: Interpolants [28579#true, 28580#false, 28581#(<= proc_i 0), 28582#(<= proc_i 4), 28583#(<= proc_i 8), 28584#(<= proc_i 12), 28585#(<= proc_i 16), 28586#(<= proc_i 20), 28587#(<= proc_i 24), 28588#(<= proc_i 28), 28589#(<= proc_i 32), 28590#(<= proc_i 36), 28591#(<= proc_i 40), 28592#(<= proc_i 44), 28593#(<= proc_i 48), 28594#(<= proc_i 52), 28595#(<= proc_i 56), 28596#(<= proc_i 60), 28597#(<= proc_i 64), 28598#(<= proc_i 68), 28599#(<= proc_i 72), 28600#(<= proc_i 76), 28601#(<= proc_i 80), 28602#(<= proc_i 84), 28603#(<= proc_i 88), 28604#(<= proc_i 92), 28605#(<= proc_i 96), 28606#(<= proc_i 100), 28607#(<= proc_i 104), 28608#(<= proc_i 108), 28609#(<= proc_i 112), 28610#(<= proc_i 116), 28611#(<= proc_i 120), 28612#(<= proc_i 124), 28613#(<= proc_i 128), 28614#(<= proc_i 132), 28615#(<= proc_i 136), 28616#(<= proc_i 140), 28617#(<= proc_i 144), 28618#(<= proc_i 148), 28619#(<= proc_i 152), 28620#(<= proc_i 156), 28621#(<= proc_i 160), 28622#(<= proc_i 164), 28623#(<= proc_i 168), 28624#(<= proc_i 172), 28625#(<= proc_i 176), 28626#(<= proc_i 180), 28627#(<= proc_i 184), 28628#(<= proc_i 188), 28629#(<= proc_i 192), 28630#(<= proc_i 196), 28631#(<= proc_i 200), 28632#(<= proc_i 204), 28633#(<= proc_i 208), 28634#(<= proc_i 212), 28635#(<= proc_i 216), 28636#(<= proc_i 220), 28637#(<= proc_i 224), 28638#(<= proc_i 228), 28639#(<= proc_i 232), 28640#(<= proc_i 236), 28641#(<= proc_i 240), 28642#(<= proc_i 244), 28643#(<= proc_i 248), 28644#(<= proc_i 252), 28645#(<= proc_i 256), 28646#(<= proc_i 260), 28647#(<= proc_i 264), 28648#(<= proc_i 268), 28649#(<= proc_i 272), 28650#(<= proc_i 276), 28651#(<= proc_i 280), 28652#(<= proc_i 284), 28653#(<= proc_i 288), 28654#(<= proc_i 292), 28655#(<= proc_i 296), 28656#(<= proc_i 300), 28657#(<= proc_i 304), 28658#(<= proc_i 308)] [2018-07-23 13:51:55,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:55,008 INFO L450 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-23 13:51:55,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-23 13:51:55,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 13:51:55,010 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 80 states. [2018-07-23 13:51:55,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:55,138 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-23 13:51:55,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-23 13:51:55,138 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 157 [2018-07-23 13:51:55,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:55,139 INFO L225 Difference]: With dead ends: 161 [2018-07-23 13:51:55,139 INFO L226 Difference]: Without dead ends: 160 [2018-07-23 13:51:55,140 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 13:51:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-07-23 13:51:55,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-07-23 13:51:55,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-07-23 13:51:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-07-23 13:51:55,145 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2018-07-23 13:51:55,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:55,145 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-07-23 13:51:55,145 INFO L472 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-23 13:51:55,145 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-07-23 13:51:55,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-07-23 13:51:55,146 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:55,146 INFO L357 BasicCegarLoop]: trace histogram [79, 78, 1, 1] [2018-07-23 13:51:55,146 INFO L414 AbstractCegarLoop]: === Iteration 79 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:55,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1443923076, now seen corresponding path program 78 times [2018-07-23 13:51:55,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:55,444 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:55,444 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-23 13:51:55,445 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:55,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:51:55,445 INFO L185 omatonBuilderFactory]: Interpolants [29312#(<= proc_i 36), 29313#(<= proc_i 40), 29314#(<= proc_i 44), 29315#(<= proc_i 48), 29316#(<= proc_i 52), 29317#(<= proc_i 56), 29318#(<= proc_i 60), 29319#(<= proc_i 64), 29320#(<= proc_i 68), 29321#(<= proc_i 72), 29322#(<= proc_i 76), 29323#(<= proc_i 80), 29324#(<= proc_i 84), 29325#(<= proc_i 88), 29326#(<= proc_i 92), 29327#(<= proc_i 96), 29328#(<= proc_i 100), 29329#(<= proc_i 104), 29330#(<= proc_i 108), 29331#(<= proc_i 112), 29332#(<= proc_i 116), 29333#(<= proc_i 120), 29334#(<= proc_i 124), 29335#(<= proc_i 128), 29336#(<= proc_i 132), 29337#(<= proc_i 136), 29338#(<= proc_i 140), 29339#(<= proc_i 144), 29340#(<= proc_i 148), 29341#(<= proc_i 152), 29342#(<= proc_i 156), 29343#(<= proc_i 160), 29344#(<= proc_i 164), 29345#(<= proc_i 168), 29346#(<= proc_i 172), 29347#(<= proc_i 176), 29348#(<= proc_i 180), 29349#(<= proc_i 184), 29350#(<= proc_i 188), 29351#(<= proc_i 192), 29352#(<= proc_i 196), 29353#(<= proc_i 200), 29354#(<= proc_i 204), 29355#(<= proc_i 208), 29356#(<= proc_i 212), 29357#(<= proc_i 216), 29358#(<= proc_i 220), 29359#(<= proc_i 224), 29360#(<= proc_i 228), 29361#(<= proc_i 232), 29362#(<= proc_i 236), 29363#(<= proc_i 240), 29364#(<= proc_i 244), 29365#(<= proc_i 248), 29366#(<= proc_i 252), 29367#(<= proc_i 256), 29368#(<= proc_i 260), 29369#(<= proc_i 264), 29370#(<= proc_i 268), 29371#(<= proc_i 272), 29372#(<= proc_i 276), 29373#(<= proc_i 280), 29374#(<= proc_i 284), 29375#(<= proc_i 288), 29376#(<= proc_i 292), 29377#(<= proc_i 296), 29378#(<= proc_i 300), 29379#(<= proc_i 304), 29380#(<= proc_i 308), 29381#(<= proc_i 312), 29301#true, 29302#false, 29303#(<= proc_i 0), 29304#(<= proc_i 4), 29305#(<= proc_i 8), 29306#(<= proc_i 12), 29307#(<= proc_i 16), 29308#(<= proc_i 20), 29309#(<= proc_i 24), 29310#(<= proc_i 28), 29311#(<= proc_i 32)] [2018-07-23 13:51:55,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:55,446 INFO L450 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-23 13:51:55,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-23 13:51:55,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 13:51:55,448 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 81 states. [2018-07-23 13:51:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:55,587 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-23 13:51:55,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-23 13:51:55,588 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 159 [2018-07-23 13:51:55,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:55,589 INFO L225 Difference]: With dead ends: 163 [2018-07-23 13:51:55,589 INFO L226 Difference]: Without dead ends: 162 [2018-07-23 13:51:55,591 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 13:51:55,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-07-23 13:51:55,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-07-23 13:51:55,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-07-23 13:51:55,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-07-23 13:51:55,596 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2018-07-23 13:51:55,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:55,596 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-07-23 13:51:55,596 INFO L472 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-23 13:51:55,596 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-07-23 13:51:55,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-07-23 13:51:55,597 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:55,597 INFO L357 BasicCegarLoop]: trace histogram [80, 79, 1, 1] [2018-07-23 13:51:55,598 INFO L414 AbstractCegarLoop]: === Iteration 80 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:55,598 INFO L82 PathProgramCache]: Analyzing trace with hash -335638338, now seen corresponding path program 79 times [2018-07-23 13:51:55,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:55,910 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:55,910 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-23 13:51:55,910 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:55,911 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:51:55,911 INFO L185 omatonBuilderFactory]: Interpolants [30080#(<= proc_i 184), 30081#(<= proc_i 188), 30082#(<= proc_i 192), 30083#(<= proc_i 196), 30084#(<= proc_i 200), 30085#(<= proc_i 204), 30086#(<= proc_i 208), 30087#(<= proc_i 212), 30088#(<= proc_i 216), 30089#(<= proc_i 220), 30090#(<= proc_i 224), 30091#(<= proc_i 228), 30092#(<= proc_i 232), 30093#(<= proc_i 236), 30094#(<= proc_i 240), 30095#(<= proc_i 244), 30096#(<= proc_i 248), 30097#(<= proc_i 252), 30098#(<= proc_i 256), 30099#(<= proc_i 260), 30100#(<= proc_i 264), 30101#(<= proc_i 268), 30102#(<= proc_i 272), 30103#(<= proc_i 276), 30104#(<= proc_i 280), 30105#(<= proc_i 284), 30106#(<= proc_i 288), 30107#(<= proc_i 292), 30108#(<= proc_i 296), 30109#(<= proc_i 300), 30110#(<= proc_i 304), 30111#(<= proc_i 308), 30112#(<= proc_i 312), 30113#(<= proc_i 316), 30032#true, 30033#false, 30034#(<= proc_i 0), 30035#(<= proc_i 4), 30036#(<= proc_i 8), 30037#(<= proc_i 12), 30038#(<= proc_i 16), 30039#(<= proc_i 20), 30040#(<= proc_i 24), 30041#(<= proc_i 28), 30042#(<= proc_i 32), 30043#(<= proc_i 36), 30044#(<= proc_i 40), 30045#(<= proc_i 44), 30046#(<= proc_i 48), 30047#(<= proc_i 52), 30048#(<= proc_i 56), 30049#(<= proc_i 60), 30050#(<= proc_i 64), 30051#(<= proc_i 68), 30052#(<= proc_i 72), 30053#(<= proc_i 76), 30054#(<= proc_i 80), 30055#(<= proc_i 84), 30056#(<= proc_i 88), 30057#(<= proc_i 92), 30058#(<= proc_i 96), 30059#(<= proc_i 100), 30060#(<= proc_i 104), 30061#(<= proc_i 108), 30062#(<= proc_i 112), 30063#(<= proc_i 116), 30064#(<= proc_i 120), 30065#(<= proc_i 124), 30066#(<= proc_i 128), 30067#(<= proc_i 132), 30068#(<= proc_i 136), 30069#(<= proc_i 140), 30070#(<= proc_i 144), 30071#(<= proc_i 148), 30072#(<= proc_i 152), 30073#(<= proc_i 156), 30074#(<= proc_i 160), 30075#(<= proc_i 164), 30076#(<= proc_i 168), 30077#(<= proc_i 172), 30078#(<= proc_i 176), 30079#(<= proc_i 180)] [2018-07-23 13:51:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:55,912 INFO L450 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-23 13:51:55,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-23 13:51:55,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 13:51:55,913 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 82 states. [2018-07-23 13:51:55,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:55,976 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-23 13:51:55,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-23 13:51:55,976 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 161 [2018-07-23 13:51:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:55,977 INFO L225 Difference]: With dead ends: 165 [2018-07-23 13:51:55,978 INFO L226 Difference]: Without dead ends: 164 [2018-07-23 13:51:55,979 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 13:51:55,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-07-23 13:51:55,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-07-23 13:51:55,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-07-23 13:51:55,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-07-23 13:51:55,983 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2018-07-23 13:51:55,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:55,983 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-07-23 13:51:55,983 INFO L472 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-23 13:51:55,984 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-07-23 13:51:55,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-07-23 13:51:55,984 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:55,985 INFO L357 BasicCegarLoop]: trace histogram [81, 80, 1, 1] [2018-07-23 13:51:55,985 INFO L414 AbstractCegarLoop]: === Iteration 81 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:55,985 INFO L82 PathProgramCache]: Analyzing trace with hash -425894528, now seen corresponding path program 80 times [2018-07-23 13:51:55,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:56,268 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:56,268 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-23 13:51:56,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:56,269 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:51:56,269 INFO L185 omatonBuilderFactory]: Interpolants [30848#(<= proc_i 296), 30849#(<= proc_i 300), 30850#(<= proc_i 304), 30851#(<= proc_i 308), 30852#(<= proc_i 312), 30853#(<= proc_i 316), 30854#(<= proc_i 320), 30772#true, 30773#false, 30774#(<= proc_i 0), 30775#(<= proc_i 4), 30776#(<= proc_i 8), 30777#(<= proc_i 12), 30778#(<= proc_i 16), 30779#(<= proc_i 20), 30780#(<= proc_i 24), 30781#(<= proc_i 28), 30782#(<= proc_i 32), 30783#(<= proc_i 36), 30784#(<= proc_i 40), 30785#(<= proc_i 44), 30786#(<= proc_i 48), 30787#(<= proc_i 52), 30788#(<= proc_i 56), 30789#(<= proc_i 60), 30790#(<= proc_i 64), 30791#(<= proc_i 68), 30792#(<= proc_i 72), 30793#(<= proc_i 76), 30794#(<= proc_i 80), 30795#(<= proc_i 84), 30796#(<= proc_i 88), 30797#(<= proc_i 92), 30798#(<= proc_i 96), 30799#(<= proc_i 100), 30800#(<= proc_i 104), 30801#(<= proc_i 108), 30802#(<= proc_i 112), 30803#(<= proc_i 116), 30804#(<= proc_i 120), 30805#(<= proc_i 124), 30806#(<= proc_i 128), 30807#(<= proc_i 132), 30808#(<= proc_i 136), 30809#(<= proc_i 140), 30810#(<= proc_i 144), 30811#(<= proc_i 148), 30812#(<= proc_i 152), 30813#(<= proc_i 156), 30814#(<= proc_i 160), 30815#(<= proc_i 164), 30816#(<= proc_i 168), 30817#(<= proc_i 172), 30818#(<= proc_i 176), 30819#(<= proc_i 180), 30820#(<= proc_i 184), 30821#(<= proc_i 188), 30822#(<= proc_i 192), 30823#(<= proc_i 196), 30824#(<= proc_i 200), 30825#(<= proc_i 204), 30826#(<= proc_i 208), 30827#(<= proc_i 212), 30828#(<= proc_i 216), 30829#(<= proc_i 220), 30830#(<= proc_i 224), 30831#(<= proc_i 228), 30832#(<= proc_i 232), 30833#(<= proc_i 236), 30834#(<= proc_i 240), 30835#(<= proc_i 244), 30836#(<= proc_i 248), 30837#(<= proc_i 252), 30838#(<= proc_i 256), 30839#(<= proc_i 260), 30840#(<= proc_i 264), 30841#(<= proc_i 268), 30842#(<= proc_i 272), 30843#(<= proc_i 276), 30844#(<= proc_i 280), 30845#(<= proc_i 284), 30846#(<= proc_i 288), 30847#(<= proc_i 292)] [2018-07-23 13:51:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:56,270 INFO L450 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-23 13:51:56,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-23 13:51:56,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 13:51:56,271 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 83 states. [2018-07-23 13:51:56,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:56,378 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-23 13:51:56,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-23 13:51:56,378 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 163 [2018-07-23 13:51:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:56,379 INFO L225 Difference]: With dead ends: 167 [2018-07-23 13:51:56,379 INFO L226 Difference]: Without dead ends: 166 [2018-07-23 13:51:56,380 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 13:51:56,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-07-23 13:51:56,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-07-23 13:51:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-07-23 13:51:56,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-07-23 13:51:56,384 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2018-07-23 13:51:56,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:56,385 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-07-23 13:51:56,385 INFO L472 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-23 13:51:56,385 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-07-23 13:51:56,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-07-23 13:51:56,386 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:56,386 INFO L357 BasicCegarLoop]: trace histogram [82, 81, 1, 1] [2018-07-23 13:51:56,386 INFO L414 AbstractCegarLoop]: === Iteration 82 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:56,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1262747198, now seen corresponding path program 81 times [2018-07-23 13:51:56,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:56,675 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:56,675 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-23 13:51:56,675 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:56,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:51:56,676 INFO L185 omatonBuilderFactory]: Interpolants [31521#true, 31522#false, 31523#(<= proc_i 0), 31524#(<= proc_i 4), 31525#(<= proc_i 8), 31526#(<= proc_i 12), 31527#(<= proc_i 16), 31528#(<= proc_i 20), 31529#(<= proc_i 24), 31530#(<= proc_i 28), 31531#(<= proc_i 32), 31532#(<= proc_i 36), 31533#(<= proc_i 40), 31534#(<= proc_i 44), 31535#(<= proc_i 48), 31536#(<= proc_i 52), 31537#(<= proc_i 56), 31538#(<= proc_i 60), 31539#(<= proc_i 64), 31540#(<= proc_i 68), 31541#(<= proc_i 72), 31542#(<= proc_i 76), 31543#(<= proc_i 80), 31544#(<= proc_i 84), 31545#(<= proc_i 88), 31546#(<= proc_i 92), 31547#(<= proc_i 96), 31548#(<= proc_i 100), 31549#(<= proc_i 104), 31550#(<= proc_i 108), 31551#(<= proc_i 112), 31552#(<= proc_i 116), 31553#(<= proc_i 120), 31554#(<= proc_i 124), 31555#(<= proc_i 128), 31556#(<= proc_i 132), 31557#(<= proc_i 136), 31558#(<= proc_i 140), 31559#(<= proc_i 144), 31560#(<= proc_i 148), 31561#(<= proc_i 152), 31562#(<= proc_i 156), 31563#(<= proc_i 160), 31564#(<= proc_i 164), 31565#(<= proc_i 168), 31566#(<= proc_i 172), 31567#(<= proc_i 176), 31568#(<= proc_i 180), 31569#(<= proc_i 184), 31570#(<= proc_i 188), 31571#(<= proc_i 192), 31572#(<= proc_i 196), 31573#(<= proc_i 200), 31574#(<= proc_i 204), 31575#(<= proc_i 208), 31576#(<= proc_i 212), 31577#(<= proc_i 216), 31578#(<= proc_i 220), 31579#(<= proc_i 224), 31580#(<= proc_i 228), 31581#(<= proc_i 232), 31582#(<= proc_i 236), 31583#(<= proc_i 240), 31584#(<= proc_i 244), 31585#(<= proc_i 248), 31586#(<= proc_i 252), 31587#(<= proc_i 256), 31588#(<= proc_i 260), 31589#(<= proc_i 264), 31590#(<= proc_i 268), 31591#(<= proc_i 272), 31592#(<= proc_i 276), 31593#(<= proc_i 280), 31594#(<= proc_i 284), 31595#(<= proc_i 288), 31596#(<= proc_i 292), 31597#(<= proc_i 296), 31598#(<= proc_i 300), 31599#(<= proc_i 304), 31600#(<= proc_i 308), 31601#(<= proc_i 312), 31602#(<= proc_i 316), 31603#(<= proc_i 320), 31604#(<= proc_i 324)] [2018-07-23 13:51:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:56,676 INFO L450 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-23 13:51:56,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-23 13:51:56,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 13:51:56,677 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 84 states. [2018-07-23 13:51:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:56,810 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-23 13:51:56,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-23 13:51:56,811 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 165 [2018-07-23 13:51:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:56,812 INFO L225 Difference]: With dead ends: 169 [2018-07-23 13:51:56,812 INFO L226 Difference]: Without dead ends: 168 [2018-07-23 13:51:56,813 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 13:51:56,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-07-23 13:51:56,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-07-23 13:51:56,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-07-23 13:51:56,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-07-23 13:51:56,817 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2018-07-23 13:51:56,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:56,818 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-07-23 13:51:56,818 INFO L472 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-23 13:51:56,818 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-07-23 13:51:56,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-07-23 13:51:56,819 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:56,819 INFO L357 BasicCegarLoop]: trace histogram [83, 82, 1, 1] [2018-07-23 13:51:56,819 INFO L414 AbstractCegarLoop]: === Iteration 83 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:56,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1975688580, now seen corresponding path program 82 times [2018-07-23 13:51:56,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:57,148 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:57,148 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-23 13:51:57,148 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:57,149 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:51:57,149 INFO L185 omatonBuilderFactory]: Interpolants [32279#true, 32280#false, 32281#(<= proc_i 0), 32282#(<= proc_i 4), 32283#(<= proc_i 8), 32284#(<= proc_i 12), 32285#(<= proc_i 16), 32286#(<= proc_i 20), 32287#(<= proc_i 24), 32288#(<= proc_i 28), 32289#(<= proc_i 32), 32290#(<= proc_i 36), 32291#(<= proc_i 40), 32292#(<= proc_i 44), 32293#(<= proc_i 48), 32294#(<= proc_i 52), 32295#(<= proc_i 56), 32296#(<= proc_i 60), 32297#(<= proc_i 64), 32298#(<= proc_i 68), 32299#(<= proc_i 72), 32300#(<= proc_i 76), 32301#(<= proc_i 80), 32302#(<= proc_i 84), 32303#(<= proc_i 88), 32304#(<= proc_i 92), 32305#(<= proc_i 96), 32306#(<= proc_i 100), 32307#(<= proc_i 104), 32308#(<= proc_i 108), 32309#(<= proc_i 112), 32310#(<= proc_i 116), 32311#(<= proc_i 120), 32312#(<= proc_i 124), 32313#(<= proc_i 128), 32314#(<= proc_i 132), 32315#(<= proc_i 136), 32316#(<= proc_i 140), 32317#(<= proc_i 144), 32318#(<= proc_i 148), 32319#(<= proc_i 152), 32320#(<= proc_i 156), 32321#(<= proc_i 160), 32322#(<= proc_i 164), 32323#(<= proc_i 168), 32324#(<= proc_i 172), 32325#(<= proc_i 176), 32326#(<= proc_i 180), 32327#(<= proc_i 184), 32328#(<= proc_i 188), 32329#(<= proc_i 192), 32330#(<= proc_i 196), 32331#(<= proc_i 200), 32332#(<= proc_i 204), 32333#(<= proc_i 208), 32334#(<= proc_i 212), 32335#(<= proc_i 216), 32336#(<= proc_i 220), 32337#(<= proc_i 224), 32338#(<= proc_i 228), 32339#(<= proc_i 232), 32340#(<= proc_i 236), 32341#(<= proc_i 240), 32342#(<= proc_i 244), 32343#(<= proc_i 248), 32344#(<= proc_i 252), 32345#(<= proc_i 256), 32346#(<= proc_i 260), 32347#(<= proc_i 264), 32348#(<= proc_i 268), 32349#(<= proc_i 272), 32350#(<= proc_i 276), 32351#(<= proc_i 280), 32352#(<= proc_i 284), 32353#(<= proc_i 288), 32354#(<= proc_i 292), 32355#(<= proc_i 296), 32356#(<= proc_i 300), 32357#(<= proc_i 304), 32358#(<= proc_i 308), 32359#(<= proc_i 312), 32360#(<= proc_i 316), 32361#(<= proc_i 320), 32362#(<= proc_i 324), 32363#(<= proc_i 328)] [2018-07-23 13:51:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:57,150 INFO L450 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-23 13:51:57,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-23 13:51:57,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 13:51:57,151 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 85 states. [2018-07-23 13:51:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:57,321 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-23 13:51:57,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-23 13:51:57,322 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 167 [2018-07-23 13:51:57,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:57,323 INFO L225 Difference]: With dead ends: 171 [2018-07-23 13:51:57,323 INFO L226 Difference]: Without dead ends: 170 [2018-07-23 13:51:57,324 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 13:51:57,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-07-23 13:51:57,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-07-23 13:51:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-07-23 13:51:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-07-23 13:51:57,328 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2018-07-23 13:51:57,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:57,329 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-07-23 13:51:57,329 INFO L472 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-23 13:51:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-07-23 13:51:57,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-07-23 13:51:57,330 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:57,330 INFO L357 BasicCegarLoop]: trace histogram [84, 83, 1, 1] [2018-07-23 13:51:57,330 INFO L414 AbstractCegarLoop]: === Iteration 84 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:57,331 INFO L82 PathProgramCache]: Analyzing trace with hash 261181638, now seen corresponding path program 83 times [2018-07-23 13:51:57,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:57,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:57,663 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:57,663 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-23 13:51:57,664 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:57,664 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:51:57,664 INFO L185 omatonBuilderFactory]: Interpolants [33046#true, 33047#false, 33048#(<= proc_i 0), 33049#(<= proc_i 4), 33050#(<= proc_i 8), 33051#(<= proc_i 12), 33052#(<= proc_i 16), 33053#(<= proc_i 20), 33054#(<= proc_i 24), 33055#(<= proc_i 28), 33056#(<= proc_i 32), 33057#(<= proc_i 36), 33058#(<= proc_i 40), 33059#(<= proc_i 44), 33060#(<= proc_i 48), 33061#(<= proc_i 52), 33062#(<= proc_i 56), 33063#(<= proc_i 60), 33064#(<= proc_i 64), 33065#(<= proc_i 68), 33066#(<= proc_i 72), 33067#(<= proc_i 76), 33068#(<= proc_i 80), 33069#(<= proc_i 84), 33070#(<= proc_i 88), 33071#(<= proc_i 92), 33072#(<= proc_i 96), 33073#(<= proc_i 100), 33074#(<= proc_i 104), 33075#(<= proc_i 108), 33076#(<= proc_i 112), 33077#(<= proc_i 116), 33078#(<= proc_i 120), 33079#(<= proc_i 124), 33080#(<= proc_i 128), 33081#(<= proc_i 132), 33082#(<= proc_i 136), 33083#(<= proc_i 140), 33084#(<= proc_i 144), 33085#(<= proc_i 148), 33086#(<= proc_i 152), 33087#(<= proc_i 156), 33088#(<= proc_i 160), 33089#(<= proc_i 164), 33090#(<= proc_i 168), 33091#(<= proc_i 172), 33092#(<= proc_i 176), 33093#(<= proc_i 180), 33094#(<= proc_i 184), 33095#(<= proc_i 188), 33096#(<= proc_i 192), 33097#(<= proc_i 196), 33098#(<= proc_i 200), 33099#(<= proc_i 204), 33100#(<= proc_i 208), 33101#(<= proc_i 212), 33102#(<= proc_i 216), 33103#(<= proc_i 220), 33104#(<= proc_i 224), 33105#(<= proc_i 228), 33106#(<= proc_i 232), 33107#(<= proc_i 236), 33108#(<= proc_i 240), 33109#(<= proc_i 244), 33110#(<= proc_i 248), 33111#(<= proc_i 252), 33112#(<= proc_i 256), 33113#(<= proc_i 260), 33114#(<= proc_i 264), 33115#(<= proc_i 268), 33116#(<= proc_i 272), 33117#(<= proc_i 276), 33118#(<= proc_i 280), 33119#(<= proc_i 284), 33120#(<= proc_i 288), 33121#(<= proc_i 292), 33122#(<= proc_i 296), 33123#(<= proc_i 300), 33124#(<= proc_i 304), 33125#(<= proc_i 308), 33126#(<= proc_i 312), 33127#(<= proc_i 316), 33128#(<= proc_i 320), 33129#(<= proc_i 324), 33130#(<= proc_i 328), 33131#(<= proc_i 332)] [2018-07-23 13:51:57,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:57,665 INFO L450 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-23 13:51:57,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-23 13:51:57,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 13:51:57,667 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 86 states. [2018-07-23 13:51:57,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:57,815 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-23 13:51:57,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-23 13:51:57,815 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 169 [2018-07-23 13:51:57,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:57,816 INFO L225 Difference]: With dead ends: 173 [2018-07-23 13:51:57,816 INFO L226 Difference]: Without dead ends: 172 [2018-07-23 13:51:57,817 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 13:51:57,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-07-23 13:51:57,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-07-23 13:51:57,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-07-23 13:51:57,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-07-23 13:51:57,821 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2018-07-23 13:51:57,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:57,822 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-07-23 13:51:57,822 INFO L472 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-23 13:51:57,822 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-07-23 13:51:57,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-07-23 13:51:57,823 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:57,823 INFO L357 BasicCegarLoop]: trace histogram [85, 84, 1, 1] [2018-07-23 13:51:57,823 INFO L414 AbstractCegarLoop]: === Iteration 85 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:57,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1887452040, now seen corresponding path program 84 times [2018-07-23 13:51:57,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:58,217 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:58,217 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:58,217 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-23 13:51:58,218 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:58,218 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:51:58,220 INFO L185 omatonBuilderFactory]: Interpolants [33822#true, 33823#false, 33824#(<= proc_i 0), 33825#(<= proc_i 4), 33826#(<= proc_i 8), 33827#(<= proc_i 12), 33828#(<= proc_i 16), 33829#(<= proc_i 20), 33830#(<= proc_i 24), 33831#(<= proc_i 28), 33832#(<= proc_i 32), 33833#(<= proc_i 36), 33834#(<= proc_i 40), 33835#(<= proc_i 44), 33836#(<= proc_i 48), 33837#(<= proc_i 52), 33838#(<= proc_i 56), 33839#(<= proc_i 60), 33840#(<= proc_i 64), 33841#(<= proc_i 68), 33842#(<= proc_i 72), 33843#(<= proc_i 76), 33844#(<= proc_i 80), 33845#(<= proc_i 84), 33846#(<= proc_i 88), 33847#(<= proc_i 92), 33848#(<= proc_i 96), 33849#(<= proc_i 100), 33850#(<= proc_i 104), 33851#(<= proc_i 108), 33852#(<= proc_i 112), 33853#(<= proc_i 116), 33854#(<= proc_i 120), 33855#(<= proc_i 124), 33856#(<= proc_i 128), 33857#(<= proc_i 132), 33858#(<= proc_i 136), 33859#(<= proc_i 140), 33860#(<= proc_i 144), 33861#(<= proc_i 148), 33862#(<= proc_i 152), 33863#(<= proc_i 156), 33864#(<= proc_i 160), 33865#(<= proc_i 164), 33866#(<= proc_i 168), 33867#(<= proc_i 172), 33868#(<= proc_i 176), 33869#(<= proc_i 180), 33870#(<= proc_i 184), 33871#(<= proc_i 188), 33872#(<= proc_i 192), 33873#(<= proc_i 196), 33874#(<= proc_i 200), 33875#(<= proc_i 204), 33876#(<= proc_i 208), 33877#(<= proc_i 212), 33878#(<= proc_i 216), 33879#(<= proc_i 220), 33880#(<= proc_i 224), 33881#(<= proc_i 228), 33882#(<= proc_i 232), 33883#(<= proc_i 236), 33884#(<= proc_i 240), 33885#(<= proc_i 244), 33886#(<= proc_i 248), 33887#(<= proc_i 252), 33888#(<= proc_i 256), 33889#(<= proc_i 260), 33890#(<= proc_i 264), 33891#(<= proc_i 268), 33892#(<= proc_i 272), 33893#(<= proc_i 276), 33894#(<= proc_i 280), 33895#(<= proc_i 284), 33896#(<= proc_i 288), 33897#(<= proc_i 292), 33898#(<= proc_i 296), 33899#(<= proc_i 300), 33900#(<= proc_i 304), 33901#(<= proc_i 308), 33902#(<= proc_i 312), 33903#(<= proc_i 316), 33904#(<= proc_i 320), 33905#(<= proc_i 324), 33906#(<= proc_i 328), 33907#(<= proc_i 332), 33908#(<= proc_i 336)] [2018-07-23 13:51:58,220 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:58,221 INFO L450 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-23 13:51:58,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-23 13:51:58,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 13:51:58,223 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 87 states. [2018-07-23 13:51:58,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:58,421 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-23 13:51:58,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-23 13:51:58,421 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 171 [2018-07-23 13:51:58,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:58,422 INFO L225 Difference]: With dead ends: 175 [2018-07-23 13:51:58,423 INFO L226 Difference]: Without dead ends: 174 [2018-07-23 13:51:58,423 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 13:51:58,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-07-23 13:51:58,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-07-23 13:51:58,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-07-23 13:51:58,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-07-23 13:51:58,431 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2018-07-23 13:51:58,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:58,432 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-07-23 13:51:58,432 INFO L472 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-23 13:51:58,432 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-07-23 13:51:58,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-07-23 13:51:58,433 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:58,434 INFO L357 BasicCegarLoop]: trace histogram [86, 85, 1, 1] [2018-07-23 13:51:58,435 INFO L414 AbstractCegarLoop]: === Iteration 86 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:58,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1365212618, now seen corresponding path program 85 times [2018-07-23 13:51:58,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:58,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:58,944 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:58,945 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-23 13:51:58,945 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:58,946 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:51:58,946 INFO L185 omatonBuilderFactory]: Interpolants [34688#(<= proc_i 316), 34689#(<= proc_i 320), 34690#(<= proc_i 324), 34691#(<= proc_i 328), 34692#(<= proc_i 332), 34693#(<= proc_i 336), 34694#(<= proc_i 340), 34607#true, 34608#false, 34609#(<= proc_i 0), 34610#(<= proc_i 4), 34611#(<= proc_i 8), 34612#(<= proc_i 12), 34613#(<= proc_i 16), 34614#(<= proc_i 20), 34615#(<= proc_i 24), 34616#(<= proc_i 28), 34617#(<= proc_i 32), 34618#(<= proc_i 36), 34619#(<= proc_i 40), 34620#(<= proc_i 44), 34621#(<= proc_i 48), 34622#(<= proc_i 52), 34623#(<= proc_i 56), 34624#(<= proc_i 60), 34625#(<= proc_i 64), 34626#(<= proc_i 68), 34627#(<= proc_i 72), 34628#(<= proc_i 76), 34629#(<= proc_i 80), 34630#(<= proc_i 84), 34631#(<= proc_i 88), 34632#(<= proc_i 92), 34633#(<= proc_i 96), 34634#(<= proc_i 100), 34635#(<= proc_i 104), 34636#(<= proc_i 108), 34637#(<= proc_i 112), 34638#(<= proc_i 116), 34639#(<= proc_i 120), 34640#(<= proc_i 124), 34641#(<= proc_i 128), 34642#(<= proc_i 132), 34643#(<= proc_i 136), 34644#(<= proc_i 140), 34645#(<= proc_i 144), 34646#(<= proc_i 148), 34647#(<= proc_i 152), 34648#(<= proc_i 156), 34649#(<= proc_i 160), 34650#(<= proc_i 164), 34651#(<= proc_i 168), 34652#(<= proc_i 172), 34653#(<= proc_i 176), 34654#(<= proc_i 180), 34655#(<= proc_i 184), 34656#(<= proc_i 188), 34657#(<= proc_i 192), 34658#(<= proc_i 196), 34659#(<= proc_i 200), 34660#(<= proc_i 204), 34661#(<= proc_i 208), 34662#(<= proc_i 212), 34663#(<= proc_i 216), 34664#(<= proc_i 220), 34665#(<= proc_i 224), 34666#(<= proc_i 228), 34667#(<= proc_i 232), 34668#(<= proc_i 236), 34669#(<= proc_i 240), 34670#(<= proc_i 244), 34671#(<= proc_i 248), 34672#(<= proc_i 252), 34673#(<= proc_i 256), 34674#(<= proc_i 260), 34675#(<= proc_i 264), 34676#(<= proc_i 268), 34677#(<= proc_i 272), 34678#(<= proc_i 276), 34679#(<= proc_i 280), 34680#(<= proc_i 284), 34681#(<= proc_i 288), 34682#(<= proc_i 292), 34683#(<= proc_i 296), 34684#(<= proc_i 300), 34685#(<= proc_i 304), 34686#(<= proc_i 308), 34687#(<= proc_i 312)] [2018-07-23 13:51:58,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:58,947 INFO L450 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-23 13:51:58,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-23 13:51:58,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 13:51:58,948 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 88 states. [2018-07-23 13:51:59,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:59,098 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-23 13:51:59,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-23 13:51:59,098 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 173 [2018-07-23 13:51:59,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:59,100 INFO L225 Difference]: With dead ends: 177 [2018-07-23 13:51:59,100 INFO L226 Difference]: Without dead ends: 176 [2018-07-23 13:51:59,101 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 13:51:59,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-07-23 13:51:59,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-07-23 13:51:59,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-07-23 13:51:59,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-07-23 13:51:59,107 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2018-07-23 13:51:59,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:59,107 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-07-23 13:51:59,107 INFO L472 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-23 13:51:59,107 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-07-23 13:51:59,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-07-23 13:51:59,109 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:59,109 INFO L357 BasicCegarLoop]: trace histogram [87, 86, 1, 1] [2018-07-23 13:51:59,109 INFO L414 AbstractCegarLoop]: === Iteration 87 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:59,110 INFO L82 PathProgramCache]: Analyzing trace with hash 2004301708, now seen corresponding path program 86 times [2018-07-23 13:51:59,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:59,455 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:59,455 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-23 13:51:59,455 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:59,455 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:51:59,456 INFO L185 omatonBuilderFactory]: Interpolants [35456#(<= proc_i 212), 35457#(<= proc_i 216), 35458#(<= proc_i 220), 35459#(<= proc_i 224), 35460#(<= proc_i 228), 35461#(<= proc_i 232), 35462#(<= proc_i 236), 35463#(<= proc_i 240), 35464#(<= proc_i 244), 35465#(<= proc_i 248), 35466#(<= proc_i 252), 35467#(<= proc_i 256), 35468#(<= proc_i 260), 35469#(<= proc_i 264), 35470#(<= proc_i 268), 35471#(<= proc_i 272), 35472#(<= proc_i 276), 35473#(<= proc_i 280), 35474#(<= proc_i 284), 35475#(<= proc_i 288), 35476#(<= proc_i 292), 35477#(<= proc_i 296), 35478#(<= proc_i 300), 35479#(<= proc_i 304), 35480#(<= proc_i 308), 35481#(<= proc_i 312), 35482#(<= proc_i 316), 35483#(<= proc_i 320), 35484#(<= proc_i 324), 35485#(<= proc_i 328), 35486#(<= proc_i 332), 35487#(<= proc_i 336), 35488#(<= proc_i 340), 35489#(<= proc_i 344), 35401#true, 35402#false, 35403#(<= proc_i 0), 35404#(<= proc_i 4), 35405#(<= proc_i 8), 35406#(<= proc_i 12), 35407#(<= proc_i 16), 35408#(<= proc_i 20), 35409#(<= proc_i 24), 35410#(<= proc_i 28), 35411#(<= proc_i 32), 35412#(<= proc_i 36), 35413#(<= proc_i 40), 35414#(<= proc_i 44), 35415#(<= proc_i 48), 35416#(<= proc_i 52), 35417#(<= proc_i 56), 35418#(<= proc_i 60), 35419#(<= proc_i 64), 35420#(<= proc_i 68), 35421#(<= proc_i 72), 35422#(<= proc_i 76), 35423#(<= proc_i 80), 35424#(<= proc_i 84), 35425#(<= proc_i 88), 35426#(<= proc_i 92), 35427#(<= proc_i 96), 35428#(<= proc_i 100), 35429#(<= proc_i 104), 35430#(<= proc_i 108), 35431#(<= proc_i 112), 35432#(<= proc_i 116), 35433#(<= proc_i 120), 35434#(<= proc_i 124), 35435#(<= proc_i 128), 35436#(<= proc_i 132), 35437#(<= proc_i 136), 35438#(<= proc_i 140), 35439#(<= proc_i 144), 35440#(<= proc_i 148), 35441#(<= proc_i 152), 35442#(<= proc_i 156), 35443#(<= proc_i 160), 35444#(<= proc_i 164), 35445#(<= proc_i 168), 35446#(<= proc_i 172), 35447#(<= proc_i 176), 35448#(<= proc_i 180), 35449#(<= proc_i 184), 35450#(<= proc_i 188), 35451#(<= proc_i 192), 35452#(<= proc_i 196), 35453#(<= proc_i 200), 35454#(<= proc_i 204), 35455#(<= proc_i 208)] [2018-07-23 13:51:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:59,456 INFO L450 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-23 13:51:59,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-23 13:51:59,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 13:51:59,458 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 89 states. [2018-07-23 13:51:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:59,532 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-23 13:51:59,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-23 13:51:59,533 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 175 [2018-07-23 13:51:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:59,534 INFO L225 Difference]: With dead ends: 179 [2018-07-23 13:51:59,534 INFO L226 Difference]: Without dead ends: 178 [2018-07-23 13:51:59,535 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 13:51:59,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-07-23 13:51:59,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-07-23 13:51:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-07-23 13:51:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-07-23 13:51:59,539 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2018-07-23 13:51:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:59,539 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-07-23 13:51:59,539 INFO L472 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-23 13:51:59,539 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-07-23 13:51:59,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-07-23 13:51:59,540 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:59,540 INFO L357 BasicCegarLoop]: trace histogram [88, 87, 1, 1] [2018-07-23 13:51:59,541 INFO L414 AbstractCegarLoop]: === Iteration 88 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:51:59,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1988593870, now seen corresponding path program 87 times [2018-07-23 13:51:59,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:59,901 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:59,902 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-23 13:51:59,902 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:59,902 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:51:59,903 INFO L185 omatonBuilderFactory]: Interpolants [36224#(<= proc_i 72), 36225#(<= proc_i 76), 36226#(<= proc_i 80), 36227#(<= proc_i 84), 36228#(<= proc_i 88), 36229#(<= proc_i 92), 36230#(<= proc_i 96), 36231#(<= proc_i 100), 36232#(<= proc_i 104), 36233#(<= proc_i 108), 36234#(<= proc_i 112), 36235#(<= proc_i 116), 36236#(<= proc_i 120), 36237#(<= proc_i 124), 36238#(<= proc_i 128), 36239#(<= proc_i 132), 36240#(<= proc_i 136), 36241#(<= proc_i 140), 36242#(<= proc_i 144), 36243#(<= proc_i 148), 36244#(<= proc_i 152), 36245#(<= proc_i 156), 36246#(<= proc_i 160), 36247#(<= proc_i 164), 36248#(<= proc_i 168), 36249#(<= proc_i 172), 36250#(<= proc_i 176), 36251#(<= proc_i 180), 36252#(<= proc_i 184), 36253#(<= proc_i 188), 36254#(<= proc_i 192), 36255#(<= proc_i 196), 36256#(<= proc_i 200), 36257#(<= proc_i 204), 36258#(<= proc_i 208), 36259#(<= proc_i 212), 36260#(<= proc_i 216), 36261#(<= proc_i 220), 36262#(<= proc_i 224), 36263#(<= proc_i 228), 36264#(<= proc_i 232), 36265#(<= proc_i 236), 36266#(<= proc_i 240), 36267#(<= proc_i 244), 36268#(<= proc_i 248), 36269#(<= proc_i 252), 36270#(<= proc_i 256), 36271#(<= proc_i 260), 36272#(<= proc_i 264), 36273#(<= proc_i 268), 36274#(<= proc_i 272), 36275#(<= proc_i 276), 36276#(<= proc_i 280), 36277#(<= proc_i 284), 36278#(<= proc_i 288), 36279#(<= proc_i 292), 36280#(<= proc_i 296), 36281#(<= proc_i 300), 36282#(<= proc_i 304), 36283#(<= proc_i 308), 36284#(<= proc_i 312), 36285#(<= proc_i 316), 36286#(<= proc_i 320), 36287#(<= proc_i 324), 36288#(<= proc_i 328), 36289#(<= proc_i 332), 36290#(<= proc_i 336), 36291#(<= proc_i 340), 36292#(<= proc_i 344), 36293#(<= proc_i 348), 36204#true, 36205#false, 36206#(<= proc_i 0), 36207#(<= proc_i 4), 36208#(<= proc_i 8), 36209#(<= proc_i 12), 36210#(<= proc_i 16), 36211#(<= proc_i 20), 36212#(<= proc_i 24), 36213#(<= proc_i 28), 36214#(<= proc_i 32), 36215#(<= proc_i 36), 36216#(<= proc_i 40), 36217#(<= proc_i 44), 36218#(<= proc_i 48), 36219#(<= proc_i 52), 36220#(<= proc_i 56), 36221#(<= proc_i 60), 36222#(<= proc_i 64), 36223#(<= proc_i 68)] [2018-07-23 13:51:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:59,904 INFO L450 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-23 13:51:59,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-23 13:51:59,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 13:51:59,905 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 90 states. [2018-07-23 13:52:00,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:00,049 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-23 13:52:00,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-23 13:52:00,049 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 177 [2018-07-23 13:52:00,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:00,050 INFO L225 Difference]: With dead ends: 181 [2018-07-23 13:52:00,051 INFO L226 Difference]: Without dead ends: 180 [2018-07-23 13:52:00,051 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 13:52:00,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-07-23 13:52:00,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-07-23 13:52:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-07-23 13:52:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-07-23 13:52:00,056 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2018-07-23 13:52:00,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:00,057 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-07-23 13:52:00,057 INFO L472 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-23 13:52:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-07-23 13:52:00,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-07-23 13:52:00,058 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:00,058 INFO L357 BasicCegarLoop]: trace histogram [89, 88, 1, 1] [2018-07-23 13:52:00,058 INFO L414 AbstractCegarLoop]: === Iteration 89 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:00,058 INFO L82 PathProgramCache]: Analyzing trace with hash -221736560, now seen corresponding path program 88 times [2018-07-23 13:52:00,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:00,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:00,395 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:00,395 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-23 13:52:00,395 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:00,395 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:52:00,396 INFO L185 omatonBuilderFactory]: Interpolants [37016#true, 37017#false, 37018#(<= proc_i 0), 37019#(<= proc_i 4), 37020#(<= proc_i 8), 37021#(<= proc_i 12), 37022#(<= proc_i 16), 37023#(<= proc_i 20), 37024#(<= proc_i 24), 37025#(<= proc_i 28), 37026#(<= proc_i 32), 37027#(<= proc_i 36), 37028#(<= proc_i 40), 37029#(<= proc_i 44), 37030#(<= proc_i 48), 37031#(<= proc_i 52), 37032#(<= proc_i 56), 37033#(<= proc_i 60), 37034#(<= proc_i 64), 37035#(<= proc_i 68), 37036#(<= proc_i 72), 37037#(<= proc_i 76), 37038#(<= proc_i 80), 37039#(<= proc_i 84), 37040#(<= proc_i 88), 37041#(<= proc_i 92), 37042#(<= proc_i 96), 37043#(<= proc_i 100), 37044#(<= proc_i 104), 37045#(<= proc_i 108), 37046#(<= proc_i 112), 37047#(<= proc_i 116), 37048#(<= proc_i 120), 37049#(<= proc_i 124), 37050#(<= proc_i 128), 37051#(<= proc_i 132), 37052#(<= proc_i 136), 37053#(<= proc_i 140), 37054#(<= proc_i 144), 37055#(<= proc_i 148), 37056#(<= proc_i 152), 37057#(<= proc_i 156), 37058#(<= proc_i 160), 37059#(<= proc_i 164), 37060#(<= proc_i 168), 37061#(<= proc_i 172), 37062#(<= proc_i 176), 37063#(<= proc_i 180), 37064#(<= proc_i 184), 37065#(<= proc_i 188), 37066#(<= proc_i 192), 37067#(<= proc_i 196), 37068#(<= proc_i 200), 37069#(<= proc_i 204), 37070#(<= proc_i 208), 37071#(<= proc_i 212), 37072#(<= proc_i 216), 37073#(<= proc_i 220), 37074#(<= proc_i 224), 37075#(<= proc_i 228), 37076#(<= proc_i 232), 37077#(<= proc_i 236), 37078#(<= proc_i 240), 37079#(<= proc_i 244), 37080#(<= proc_i 248), 37081#(<= proc_i 252), 37082#(<= proc_i 256), 37083#(<= proc_i 260), 37084#(<= proc_i 264), 37085#(<= proc_i 268), 37086#(<= proc_i 272), 37087#(<= proc_i 276), 37088#(<= proc_i 280), 37089#(<= proc_i 284), 37090#(<= proc_i 288), 37091#(<= proc_i 292), 37092#(<= proc_i 296), 37093#(<= proc_i 300), 37094#(<= proc_i 304), 37095#(<= proc_i 308), 37096#(<= proc_i 312), 37097#(<= proc_i 316), 37098#(<= proc_i 320), 37099#(<= proc_i 324), 37100#(<= proc_i 328), 37101#(<= proc_i 332), 37102#(<= proc_i 336), 37103#(<= proc_i 340), 37104#(<= proc_i 344), 37105#(<= proc_i 348), 37106#(<= proc_i 352)] [2018-07-23 13:52:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:00,397 INFO L450 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-23 13:52:00,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-23 13:52:00,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 13:52:00,398 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 91 states. [2018-07-23 13:52:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:00,557 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-23 13:52:00,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-23 13:52:00,557 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 179 [2018-07-23 13:52:00,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:00,559 INFO L225 Difference]: With dead ends: 183 [2018-07-23 13:52:00,559 INFO L226 Difference]: Without dead ends: 182 [2018-07-23 13:52:00,560 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 13:52:00,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-07-23 13:52:00,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-07-23 13:52:00,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-07-23 13:52:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-07-23 13:52:00,565 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2018-07-23 13:52:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:00,565 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-07-23 13:52:00,565 INFO L472 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-23 13:52:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-07-23 13:52:00,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-07-23 13:52:00,569 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:00,570 INFO L357 BasicCegarLoop]: trace histogram [90, 89, 1, 1] [2018-07-23 13:52:00,570 INFO L414 AbstractCegarLoop]: === Iteration 90 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:00,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1659531730, now seen corresponding path program 89 times [2018-07-23 13:52:00,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:00,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:00,891 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:00,891 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-23 13:52:00,892 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:00,892 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:52:00,892 INFO L185 omatonBuilderFactory]: Interpolants [37888#(<= proc_i 196), 37889#(<= proc_i 200), 37890#(<= proc_i 204), 37891#(<= proc_i 208), 37892#(<= proc_i 212), 37893#(<= proc_i 216), 37894#(<= proc_i 220), 37895#(<= proc_i 224), 37896#(<= proc_i 228), 37897#(<= proc_i 232), 37898#(<= proc_i 236), 37899#(<= proc_i 240), 37900#(<= proc_i 244), 37901#(<= proc_i 248), 37902#(<= proc_i 252), 37903#(<= proc_i 256), 37904#(<= proc_i 260), 37905#(<= proc_i 264), 37906#(<= proc_i 268), 37907#(<= proc_i 272), 37908#(<= proc_i 276), 37909#(<= proc_i 280), 37910#(<= proc_i 284), 37911#(<= proc_i 288), 37912#(<= proc_i 292), 37913#(<= proc_i 296), 37914#(<= proc_i 300), 37915#(<= proc_i 304), 37916#(<= proc_i 308), 37917#(<= proc_i 312), 37918#(<= proc_i 316), 37919#(<= proc_i 320), 37920#(<= proc_i 324), 37921#(<= proc_i 328), 37922#(<= proc_i 332), 37923#(<= proc_i 336), 37924#(<= proc_i 340), 37925#(<= proc_i 344), 37926#(<= proc_i 348), 37927#(<= proc_i 352), 37928#(<= proc_i 356), 37837#true, 37838#false, 37839#(<= proc_i 0), 37840#(<= proc_i 4), 37841#(<= proc_i 8), 37842#(<= proc_i 12), 37843#(<= proc_i 16), 37844#(<= proc_i 20), 37845#(<= proc_i 24), 37846#(<= proc_i 28), 37847#(<= proc_i 32), 37848#(<= proc_i 36), 37849#(<= proc_i 40), 37850#(<= proc_i 44), 37851#(<= proc_i 48), 37852#(<= proc_i 52), 37853#(<= proc_i 56), 37854#(<= proc_i 60), 37855#(<= proc_i 64), 37856#(<= proc_i 68), 37857#(<= proc_i 72), 37858#(<= proc_i 76), 37859#(<= proc_i 80), 37860#(<= proc_i 84), 37861#(<= proc_i 88), 37862#(<= proc_i 92), 37863#(<= proc_i 96), 37864#(<= proc_i 100), 37865#(<= proc_i 104), 37866#(<= proc_i 108), 37867#(<= proc_i 112), 37868#(<= proc_i 116), 37869#(<= proc_i 120), 37870#(<= proc_i 124), 37871#(<= proc_i 128), 37872#(<= proc_i 132), 37873#(<= proc_i 136), 37874#(<= proc_i 140), 37875#(<= proc_i 144), 37876#(<= proc_i 148), 37877#(<= proc_i 152), 37878#(<= proc_i 156), 37879#(<= proc_i 160), 37880#(<= proc_i 164), 37881#(<= proc_i 168), 37882#(<= proc_i 172), 37883#(<= proc_i 176), 37884#(<= proc_i 180), 37885#(<= proc_i 184), 37886#(<= proc_i 188), 37887#(<= proc_i 192)] [2018-07-23 13:52:00,893 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:00,893 INFO L450 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-23 13:52:00,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-23 13:52:00,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 13:52:00,894 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 92 states. [2018-07-23 13:52:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:00,959 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-23 13:52:00,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-23 13:52:00,960 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 181 [2018-07-23 13:52:00,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:00,961 INFO L225 Difference]: With dead ends: 185 [2018-07-23 13:52:00,961 INFO L226 Difference]: Without dead ends: 184 [2018-07-23 13:52:00,962 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 13:52:00,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-07-23 13:52:00,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-07-23 13:52:00,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-07-23 13:52:00,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-07-23 13:52:00,967 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2018-07-23 13:52:00,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:00,968 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-07-23 13:52:00,968 INFO L472 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-23 13:52:00,968 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-07-23 13:52:00,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-07-23 13:52:00,969 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:00,969 INFO L357 BasicCegarLoop]: trace histogram [91, 90, 1, 1] [2018-07-23 13:52:00,969 INFO L414 AbstractCegarLoop]: === Iteration 91 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:00,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1377126804, now seen corresponding path program 90 times [2018-07-23 13:52:00,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:01,317 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:01,317 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:01,317 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-23 13:52:01,318 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:01,318 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:52:01,318 INFO L185 omatonBuilderFactory]: Interpolants [38667#true, 38668#false, 38669#(<= proc_i 0), 38670#(<= proc_i 4), 38671#(<= proc_i 8), 38672#(<= proc_i 12), 38673#(<= proc_i 16), 38674#(<= proc_i 20), 38675#(<= proc_i 24), 38676#(<= proc_i 28), 38677#(<= proc_i 32), 38678#(<= proc_i 36), 38679#(<= proc_i 40), 38680#(<= proc_i 44), 38681#(<= proc_i 48), 38682#(<= proc_i 52), 38683#(<= proc_i 56), 38684#(<= proc_i 60), 38685#(<= proc_i 64), 38686#(<= proc_i 68), 38687#(<= proc_i 72), 38688#(<= proc_i 76), 38689#(<= proc_i 80), 38690#(<= proc_i 84), 38691#(<= proc_i 88), 38692#(<= proc_i 92), 38693#(<= proc_i 96), 38694#(<= proc_i 100), 38695#(<= proc_i 104), 38696#(<= proc_i 108), 38697#(<= proc_i 112), 38698#(<= proc_i 116), 38699#(<= proc_i 120), 38700#(<= proc_i 124), 38701#(<= proc_i 128), 38702#(<= proc_i 132), 38703#(<= proc_i 136), 38704#(<= proc_i 140), 38705#(<= proc_i 144), 38706#(<= proc_i 148), 38707#(<= proc_i 152), 38708#(<= proc_i 156), 38709#(<= proc_i 160), 38710#(<= proc_i 164), 38711#(<= proc_i 168), 38712#(<= proc_i 172), 38713#(<= proc_i 176), 38714#(<= proc_i 180), 38715#(<= proc_i 184), 38716#(<= proc_i 188), 38717#(<= proc_i 192), 38718#(<= proc_i 196), 38719#(<= proc_i 200), 38720#(<= proc_i 204), 38721#(<= proc_i 208), 38722#(<= proc_i 212), 38723#(<= proc_i 216), 38724#(<= proc_i 220), 38725#(<= proc_i 224), 38726#(<= proc_i 228), 38727#(<= proc_i 232), 38728#(<= proc_i 236), 38729#(<= proc_i 240), 38730#(<= proc_i 244), 38731#(<= proc_i 248), 38732#(<= proc_i 252), 38733#(<= proc_i 256), 38734#(<= proc_i 260), 38735#(<= proc_i 264), 38736#(<= proc_i 268), 38737#(<= proc_i 272), 38738#(<= proc_i 276), 38739#(<= proc_i 280), 38740#(<= proc_i 284), 38741#(<= proc_i 288), 38742#(<= proc_i 292), 38743#(<= proc_i 296), 38744#(<= proc_i 300), 38745#(<= proc_i 304), 38746#(<= proc_i 308), 38747#(<= proc_i 312), 38748#(<= proc_i 316), 38749#(<= proc_i 320), 38750#(<= proc_i 324), 38751#(<= proc_i 328), 38752#(<= proc_i 332), 38753#(<= proc_i 336), 38754#(<= proc_i 340), 38755#(<= proc_i 344), 38756#(<= proc_i 348), 38757#(<= proc_i 352), 38758#(<= proc_i 356), 38759#(<= proc_i 360)] [2018-07-23 13:52:01,319 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:01,319 INFO L450 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-23 13:52:01,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-23 13:52:01,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 13:52:01,321 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 93 states. [2018-07-23 13:52:01,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:01,463 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-23 13:52:01,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-23 13:52:01,463 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 183 [2018-07-23 13:52:01,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:01,464 INFO L225 Difference]: With dead ends: 187 [2018-07-23 13:52:01,464 INFO L226 Difference]: Without dead ends: 186 [2018-07-23 13:52:01,465 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 13:52:01,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-07-23 13:52:01,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-07-23 13:52:01,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-07-23 13:52:01,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-07-23 13:52:01,470 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2018-07-23 13:52:01,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:01,470 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-07-23 13:52:01,470 INFO L472 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-23 13:52:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-07-23 13:52:01,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-07-23 13:52:01,471 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:01,471 INFO L357 BasicCegarLoop]: trace histogram [92, 91, 1, 1] [2018-07-23 13:52:01,472 INFO L414 AbstractCegarLoop]: === Iteration 92 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:01,472 INFO L82 PathProgramCache]: Analyzing trace with hash 568932566, now seen corresponding path program 91 times [2018-07-23 13:52:01,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:01,776 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:01,776 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-23 13:52:01,776 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:01,776 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:52:01,777 INFO L185 omatonBuilderFactory]: Interpolants [39552#(<= proc_i 176), 39553#(<= proc_i 180), 39554#(<= proc_i 184), 39555#(<= proc_i 188), 39556#(<= proc_i 192), 39557#(<= proc_i 196), 39558#(<= proc_i 200), 39559#(<= proc_i 204), 39560#(<= proc_i 208), 39561#(<= proc_i 212), 39562#(<= proc_i 216), 39563#(<= proc_i 220), 39564#(<= proc_i 224), 39565#(<= proc_i 228), 39566#(<= proc_i 232), 39567#(<= proc_i 236), 39568#(<= proc_i 240), 39569#(<= proc_i 244), 39570#(<= proc_i 248), 39571#(<= proc_i 252), 39572#(<= proc_i 256), 39573#(<= proc_i 260), 39574#(<= proc_i 264), 39575#(<= proc_i 268), 39576#(<= proc_i 272), 39577#(<= proc_i 276), 39578#(<= proc_i 280), 39579#(<= proc_i 284), 39580#(<= proc_i 288), 39581#(<= proc_i 292), 39582#(<= proc_i 296), 39583#(<= proc_i 300), 39584#(<= proc_i 304), 39585#(<= proc_i 308), 39586#(<= proc_i 312), 39587#(<= proc_i 316), 39588#(<= proc_i 320), 39589#(<= proc_i 324), 39590#(<= proc_i 328), 39591#(<= proc_i 332), 39592#(<= proc_i 336), 39593#(<= proc_i 340), 39594#(<= proc_i 344), 39595#(<= proc_i 348), 39596#(<= proc_i 352), 39597#(<= proc_i 356), 39598#(<= proc_i 360), 39599#(<= proc_i 364), 39506#true, 39507#false, 39508#(<= proc_i 0), 39509#(<= proc_i 4), 39510#(<= proc_i 8), 39511#(<= proc_i 12), 39512#(<= proc_i 16), 39513#(<= proc_i 20), 39514#(<= proc_i 24), 39515#(<= proc_i 28), 39516#(<= proc_i 32), 39517#(<= proc_i 36), 39518#(<= proc_i 40), 39519#(<= proc_i 44), 39520#(<= proc_i 48), 39521#(<= proc_i 52), 39522#(<= proc_i 56), 39523#(<= proc_i 60), 39524#(<= proc_i 64), 39525#(<= proc_i 68), 39526#(<= proc_i 72), 39527#(<= proc_i 76), 39528#(<= proc_i 80), 39529#(<= proc_i 84), 39530#(<= proc_i 88), 39531#(<= proc_i 92), 39532#(<= proc_i 96), 39533#(<= proc_i 100), 39534#(<= proc_i 104), 39535#(<= proc_i 108), 39536#(<= proc_i 112), 39537#(<= proc_i 116), 39538#(<= proc_i 120), 39539#(<= proc_i 124), 39540#(<= proc_i 128), 39541#(<= proc_i 132), 39542#(<= proc_i 136), 39543#(<= proc_i 140), 39544#(<= proc_i 144), 39545#(<= proc_i 148), 39546#(<= proc_i 152), 39547#(<= proc_i 156), 39548#(<= proc_i 160), 39549#(<= proc_i 164), 39550#(<= proc_i 168), 39551#(<= proc_i 172)] [2018-07-23 13:52:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:01,777 INFO L450 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-23 13:52:01,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-23 13:52:01,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 13:52:01,779 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 94 states. [2018-07-23 13:52:01,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:01,838 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-07-23 13:52:01,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-23 13:52:01,838 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 185 [2018-07-23 13:52:01,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:01,839 INFO L225 Difference]: With dead ends: 189 [2018-07-23 13:52:01,839 INFO L226 Difference]: Without dead ends: 188 [2018-07-23 13:52:01,839 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 13:52:01,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-07-23 13:52:01,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-07-23 13:52:01,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-07-23 13:52:01,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-07-23 13:52:01,844 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2018-07-23 13:52:01,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:01,844 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-07-23 13:52:01,844 INFO L472 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-23 13:52:01,844 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-07-23 13:52:01,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-07-23 13:52:01,845 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:01,845 INFO L357 BasicCegarLoop]: trace histogram [93, 92, 1, 1] [2018-07-23 13:52:01,846 INFO L414 AbstractCegarLoop]: === Iteration 93 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:01,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1283350424, now seen corresponding path program 92 times [2018-07-23 13:52:01,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:02,154 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:02,154 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:02,155 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-23 13:52:02,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:02,155 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:52:02,155 INFO L185 omatonBuilderFactory]: Interpolants [40448#(<= proc_i 368), 40354#true, 40355#false, 40356#(<= proc_i 0), 40357#(<= proc_i 4), 40358#(<= proc_i 8), 40359#(<= proc_i 12), 40360#(<= proc_i 16), 40361#(<= proc_i 20), 40362#(<= proc_i 24), 40363#(<= proc_i 28), 40364#(<= proc_i 32), 40365#(<= proc_i 36), 40366#(<= proc_i 40), 40367#(<= proc_i 44), 40368#(<= proc_i 48), 40369#(<= proc_i 52), 40370#(<= proc_i 56), 40371#(<= proc_i 60), 40372#(<= proc_i 64), 40373#(<= proc_i 68), 40374#(<= proc_i 72), 40375#(<= proc_i 76), 40376#(<= proc_i 80), 40377#(<= proc_i 84), 40378#(<= proc_i 88), 40379#(<= proc_i 92), 40380#(<= proc_i 96), 40381#(<= proc_i 100), 40382#(<= proc_i 104), 40383#(<= proc_i 108), 40384#(<= proc_i 112), 40385#(<= proc_i 116), 40386#(<= proc_i 120), 40387#(<= proc_i 124), 40388#(<= proc_i 128), 40389#(<= proc_i 132), 40390#(<= proc_i 136), 40391#(<= proc_i 140), 40392#(<= proc_i 144), 40393#(<= proc_i 148), 40394#(<= proc_i 152), 40395#(<= proc_i 156), 40396#(<= proc_i 160), 40397#(<= proc_i 164), 40398#(<= proc_i 168), 40399#(<= proc_i 172), 40400#(<= proc_i 176), 40401#(<= proc_i 180), 40402#(<= proc_i 184), 40403#(<= proc_i 188), 40404#(<= proc_i 192), 40405#(<= proc_i 196), 40406#(<= proc_i 200), 40407#(<= proc_i 204), 40408#(<= proc_i 208), 40409#(<= proc_i 212), 40410#(<= proc_i 216), 40411#(<= proc_i 220), 40412#(<= proc_i 224), 40413#(<= proc_i 228), 40414#(<= proc_i 232), 40415#(<= proc_i 236), 40416#(<= proc_i 240), 40417#(<= proc_i 244), 40418#(<= proc_i 248), 40419#(<= proc_i 252), 40420#(<= proc_i 256), 40421#(<= proc_i 260), 40422#(<= proc_i 264), 40423#(<= proc_i 268), 40424#(<= proc_i 272), 40425#(<= proc_i 276), 40426#(<= proc_i 280), 40427#(<= proc_i 284), 40428#(<= proc_i 288), 40429#(<= proc_i 292), 40430#(<= proc_i 296), 40431#(<= proc_i 300), 40432#(<= proc_i 304), 40433#(<= proc_i 308), 40434#(<= proc_i 312), 40435#(<= proc_i 316), 40436#(<= proc_i 320), 40437#(<= proc_i 324), 40438#(<= proc_i 328), 40439#(<= proc_i 332), 40440#(<= proc_i 336), 40441#(<= proc_i 340), 40442#(<= proc_i 344), 40443#(<= proc_i 348), 40444#(<= proc_i 352), 40445#(<= proc_i 356), 40446#(<= proc_i 360), 40447#(<= proc_i 364)] [2018-07-23 13:52:02,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:02,156 INFO L450 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-23 13:52:02,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-23 13:52:02,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 13:52:02,158 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 95 states. [2018-07-23 13:52:02,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:02,315 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-07-23 13:52:02,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-23 13:52:02,315 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 187 [2018-07-23 13:52:02,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:02,317 INFO L225 Difference]: With dead ends: 191 [2018-07-23 13:52:02,317 INFO L226 Difference]: Without dead ends: 190 [2018-07-23 13:52:02,317 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 13:52:02,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-07-23 13:52:02,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-07-23 13:52:02,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-07-23 13:52:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-07-23 13:52:02,322 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2018-07-23 13:52:02,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:02,322 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-07-23 13:52:02,322 INFO L472 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-23 13:52:02,322 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-07-23 13:52:02,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-07-23 13:52:02,323 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:02,323 INFO L357 BasicCegarLoop]: trace histogram [94, 93, 1, 1] [2018-07-23 13:52:02,323 INFO L414 AbstractCegarLoop]: === Iteration 94 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:02,323 INFO L82 PathProgramCache]: Analyzing trace with hash 644144602, now seen corresponding path program 93 times [2018-07-23 13:52:02,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:02,606 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:02,606 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-23 13:52:02,606 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:02,607 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:52:02,607 INFO L185 omatonBuilderFactory]: Interpolants [41216#(<= proc_i 12), 41217#(<= proc_i 16), 41218#(<= proc_i 20), 41219#(<= proc_i 24), 41220#(<= proc_i 28), 41221#(<= proc_i 32), 41222#(<= proc_i 36), 41223#(<= proc_i 40), 41224#(<= proc_i 44), 41225#(<= proc_i 48), 41226#(<= proc_i 52), 41227#(<= proc_i 56), 41228#(<= proc_i 60), 41229#(<= proc_i 64), 41230#(<= proc_i 68), 41231#(<= proc_i 72), 41232#(<= proc_i 76), 41233#(<= proc_i 80), 41234#(<= proc_i 84), 41235#(<= proc_i 88), 41236#(<= proc_i 92), 41237#(<= proc_i 96), 41238#(<= proc_i 100), 41239#(<= proc_i 104), 41240#(<= proc_i 108), 41241#(<= proc_i 112), 41242#(<= proc_i 116), 41243#(<= proc_i 120), 41244#(<= proc_i 124), 41245#(<= proc_i 128), 41246#(<= proc_i 132), 41247#(<= proc_i 136), 41248#(<= proc_i 140), 41249#(<= proc_i 144), 41250#(<= proc_i 148), 41251#(<= proc_i 152), 41252#(<= proc_i 156), 41253#(<= proc_i 160), 41254#(<= proc_i 164), 41255#(<= proc_i 168), 41256#(<= proc_i 172), 41257#(<= proc_i 176), 41258#(<= proc_i 180), 41259#(<= proc_i 184), 41260#(<= proc_i 188), 41261#(<= proc_i 192), 41262#(<= proc_i 196), 41263#(<= proc_i 200), 41264#(<= proc_i 204), 41265#(<= proc_i 208), 41266#(<= proc_i 212), 41267#(<= proc_i 216), 41268#(<= proc_i 220), 41269#(<= proc_i 224), 41270#(<= proc_i 228), 41271#(<= proc_i 232), 41272#(<= proc_i 236), 41273#(<= proc_i 240), 41274#(<= proc_i 244), 41275#(<= proc_i 248), 41276#(<= proc_i 252), 41277#(<= proc_i 256), 41278#(<= proc_i 260), 41279#(<= proc_i 264), 41280#(<= proc_i 268), 41281#(<= proc_i 272), 41282#(<= proc_i 276), 41283#(<= proc_i 280), 41284#(<= proc_i 284), 41285#(<= proc_i 288), 41286#(<= proc_i 292), 41287#(<= proc_i 296), 41288#(<= proc_i 300), 41289#(<= proc_i 304), 41290#(<= proc_i 308), 41291#(<= proc_i 312), 41292#(<= proc_i 316), 41293#(<= proc_i 320), 41294#(<= proc_i 324), 41295#(<= proc_i 328), 41296#(<= proc_i 332), 41297#(<= proc_i 336), 41298#(<= proc_i 340), 41299#(<= proc_i 344), 41300#(<= proc_i 348), 41301#(<= proc_i 352), 41302#(<= proc_i 356), 41303#(<= proc_i 360), 41304#(<= proc_i 364), 41305#(<= proc_i 368), 41306#(<= proc_i 372), 41211#true, 41212#false, 41213#(<= proc_i 0), 41214#(<= proc_i 4), 41215#(<= proc_i 8)] [2018-07-23 13:52:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:02,608 INFO L450 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-23 13:52:02,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-23 13:52:02,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 13:52:02,609 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 96 states. [2018-07-23 13:52:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:02,784 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-07-23 13:52:02,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-23 13:52:02,784 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 189 [2018-07-23 13:52:02,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:02,785 INFO L225 Difference]: With dead ends: 193 [2018-07-23 13:52:02,785 INFO L226 Difference]: Without dead ends: 192 [2018-07-23 13:52:02,786 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 13:52:02,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-07-23 13:52:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-07-23 13:52:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-07-23 13:52:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-07-23 13:52:02,789 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2018-07-23 13:52:02,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:02,790 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-07-23 13:52:02,790 INFO L472 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-23 13:52:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-07-23 13:52:02,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-07-23 13:52:02,791 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:02,791 INFO L357 BasicCegarLoop]: trace histogram [95, 94, 1, 1] [2018-07-23 13:52:02,791 INFO L414 AbstractCegarLoop]: === Iteration 95 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:02,791 INFO L82 PathProgramCache]: Analyzing trace with hash 547672988, now seen corresponding path program 94 times [2018-07-23 13:52:02,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:03,143 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:03,143 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:03,143 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-23 13:52:03,143 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:03,144 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:52:03,144 INFO L185 omatonBuilderFactory]: Interpolants [42077#true, 42078#false, 42079#(<= proc_i 0), 42080#(<= proc_i 4), 42081#(<= proc_i 8), 42082#(<= proc_i 12), 42083#(<= proc_i 16), 42084#(<= proc_i 20), 42085#(<= proc_i 24), 42086#(<= proc_i 28), 42087#(<= proc_i 32), 42088#(<= proc_i 36), 42089#(<= proc_i 40), 42090#(<= proc_i 44), 42091#(<= proc_i 48), 42092#(<= proc_i 52), 42093#(<= proc_i 56), 42094#(<= proc_i 60), 42095#(<= proc_i 64), 42096#(<= proc_i 68), 42097#(<= proc_i 72), 42098#(<= proc_i 76), 42099#(<= proc_i 80), 42100#(<= proc_i 84), 42101#(<= proc_i 88), 42102#(<= proc_i 92), 42103#(<= proc_i 96), 42104#(<= proc_i 100), 42105#(<= proc_i 104), 42106#(<= proc_i 108), 42107#(<= proc_i 112), 42108#(<= proc_i 116), 42109#(<= proc_i 120), 42110#(<= proc_i 124), 42111#(<= proc_i 128), 42112#(<= proc_i 132), 42113#(<= proc_i 136), 42114#(<= proc_i 140), 42115#(<= proc_i 144), 42116#(<= proc_i 148), 42117#(<= proc_i 152), 42118#(<= proc_i 156), 42119#(<= proc_i 160), 42120#(<= proc_i 164), 42121#(<= proc_i 168), 42122#(<= proc_i 172), 42123#(<= proc_i 176), 42124#(<= proc_i 180), 42125#(<= proc_i 184), 42126#(<= proc_i 188), 42127#(<= proc_i 192), 42128#(<= proc_i 196), 42129#(<= proc_i 200), 42130#(<= proc_i 204), 42131#(<= proc_i 208), 42132#(<= proc_i 212), 42133#(<= proc_i 216), 42134#(<= proc_i 220), 42135#(<= proc_i 224), 42136#(<= proc_i 228), 42137#(<= proc_i 232), 42138#(<= proc_i 236), 42139#(<= proc_i 240), 42140#(<= proc_i 244), 42141#(<= proc_i 248), 42142#(<= proc_i 252), 42143#(<= proc_i 256), 42144#(<= proc_i 260), 42145#(<= proc_i 264), 42146#(<= proc_i 268), 42147#(<= proc_i 272), 42148#(<= proc_i 276), 42149#(<= proc_i 280), 42150#(<= proc_i 284), 42151#(<= proc_i 288), 42152#(<= proc_i 292), 42153#(<= proc_i 296), 42154#(<= proc_i 300), 42155#(<= proc_i 304), 42156#(<= proc_i 308), 42157#(<= proc_i 312), 42158#(<= proc_i 316), 42159#(<= proc_i 320), 42160#(<= proc_i 324), 42161#(<= proc_i 328), 42162#(<= proc_i 332), 42163#(<= proc_i 336), 42164#(<= proc_i 340), 42165#(<= proc_i 344), 42166#(<= proc_i 348), 42167#(<= proc_i 352), 42168#(<= proc_i 356), 42169#(<= proc_i 360), 42170#(<= proc_i 364), 42171#(<= proc_i 368), 42172#(<= proc_i 372), 42173#(<= proc_i 376)] [2018-07-23 13:52:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:03,145 INFO L450 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-23 13:52:03,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-23 13:52:03,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 13:52:03,146 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 97 states. [2018-07-23 13:52:03,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:03,244 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-07-23 13:52:03,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-23 13:52:03,244 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 191 [2018-07-23 13:52:03,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:03,245 INFO L225 Difference]: With dead ends: 195 [2018-07-23 13:52:03,245 INFO L226 Difference]: Without dead ends: 194 [2018-07-23 13:52:03,246 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 13:52:03,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-07-23 13:52:03,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-07-23 13:52:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-23 13:52:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-07-23 13:52:03,250 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2018-07-23 13:52:03,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:03,250 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-07-23 13:52:03,250 INFO L472 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-23 13:52:03,250 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-07-23 13:52:03,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-07-23 13:52:03,251 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:03,251 INFO L357 BasicCegarLoop]: trace histogram [96, 95, 1, 1] [2018-07-23 13:52:03,251 INFO L414 AbstractCegarLoop]: === Iteration 96 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:03,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1967234850, now seen corresponding path program 95 times [2018-07-23 13:52:03,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:03,546 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:03,547 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-23 13:52:03,547 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:03,547 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:52:03,547 INFO L185 omatonBuilderFactory]: Interpolants [43008#(<= proc_i 216), 43009#(<= proc_i 220), 43010#(<= proc_i 224), 43011#(<= proc_i 228), 43012#(<= proc_i 232), 43013#(<= proc_i 236), 43014#(<= proc_i 240), 43015#(<= proc_i 244), 43016#(<= proc_i 248), 43017#(<= proc_i 252), 43018#(<= proc_i 256), 43019#(<= proc_i 260), 43020#(<= proc_i 264), 43021#(<= proc_i 268), 43022#(<= proc_i 272), 43023#(<= proc_i 276), 43024#(<= proc_i 280), 43025#(<= proc_i 284), 43026#(<= proc_i 288), 43027#(<= proc_i 292), 43028#(<= proc_i 296), 43029#(<= proc_i 300), 43030#(<= proc_i 304), 43031#(<= proc_i 308), 43032#(<= proc_i 312), 43033#(<= proc_i 316), 43034#(<= proc_i 320), 43035#(<= proc_i 324), 43036#(<= proc_i 328), 43037#(<= proc_i 332), 43038#(<= proc_i 336), 43039#(<= proc_i 340), 43040#(<= proc_i 344), 43041#(<= proc_i 348), 43042#(<= proc_i 352), 43043#(<= proc_i 356), 43044#(<= proc_i 360), 43045#(<= proc_i 364), 43046#(<= proc_i 368), 43047#(<= proc_i 372), 43048#(<= proc_i 376), 43049#(<= proc_i 380), 42952#true, 42953#false, 42954#(<= proc_i 0), 42955#(<= proc_i 4), 42956#(<= proc_i 8), 42957#(<= proc_i 12), 42958#(<= proc_i 16), 42959#(<= proc_i 20), 42960#(<= proc_i 24), 42961#(<= proc_i 28), 42962#(<= proc_i 32), 42963#(<= proc_i 36), 42964#(<= proc_i 40), 42965#(<= proc_i 44), 42966#(<= proc_i 48), 42967#(<= proc_i 52), 42968#(<= proc_i 56), 42969#(<= proc_i 60), 42970#(<= proc_i 64), 42971#(<= proc_i 68), 42972#(<= proc_i 72), 42973#(<= proc_i 76), 42974#(<= proc_i 80), 42975#(<= proc_i 84), 42976#(<= proc_i 88), 42977#(<= proc_i 92), 42978#(<= proc_i 96), 42979#(<= proc_i 100), 42980#(<= proc_i 104), 42981#(<= proc_i 108), 42982#(<= proc_i 112), 42983#(<= proc_i 116), 42984#(<= proc_i 120), 42985#(<= proc_i 124), 42986#(<= proc_i 128), 42987#(<= proc_i 132), 42988#(<= proc_i 136), 42989#(<= proc_i 140), 42990#(<= proc_i 144), 42991#(<= proc_i 148), 42992#(<= proc_i 152), 42993#(<= proc_i 156), 42994#(<= proc_i 160), 42995#(<= proc_i 164), 42996#(<= proc_i 168), 42997#(<= proc_i 172), 42998#(<= proc_i 176), 42999#(<= proc_i 180), 43000#(<= proc_i 184), 43001#(<= proc_i 188), 43002#(<= proc_i 192), 43003#(<= proc_i 196), 43004#(<= proc_i 200), 43005#(<= proc_i 204), 43006#(<= proc_i 208), 43007#(<= proc_i 212)] [2018-07-23 13:52:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:03,548 INFO L450 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-23 13:52:03,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-23 13:52:03,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 13:52:03,550 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 98 states. [2018-07-23 13:52:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:03,620 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-07-23 13:52:03,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-23 13:52:03,620 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 193 [2018-07-23 13:52:03,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:03,621 INFO L225 Difference]: With dead ends: 197 [2018-07-23 13:52:03,621 INFO L226 Difference]: Without dead ends: 196 [2018-07-23 13:52:03,622 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 13:52:03,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-07-23 13:52:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-07-23 13:52:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-07-23 13:52:03,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-07-23 13:52:03,627 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2018-07-23 13:52:03,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:03,627 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-07-23 13:52:03,627 INFO L472 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-23 13:52:03,628 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-07-23 13:52:03,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-07-23 13:52:03,629 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:03,629 INFO L357 BasicCegarLoop]: trace histogram [97, 96, 1, 1] [2018-07-23 13:52:03,629 INFO L414 AbstractCegarLoop]: === Iteration 97 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:03,629 INFO L82 PathProgramCache]: Analyzing trace with hash -727079520, now seen corresponding path program 96 times [2018-07-23 13:52:03,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:04,040 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:04,040 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:04,041 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-23 13:52:04,041 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:04,041 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:52:04,041 INFO L185 omatonBuilderFactory]: Interpolants [43836#true, 43837#false, 43838#(<= proc_i 0), 43839#(<= proc_i 4), 43840#(<= proc_i 8), 43841#(<= proc_i 12), 43842#(<= proc_i 16), 43843#(<= proc_i 20), 43844#(<= proc_i 24), 43845#(<= proc_i 28), 43846#(<= proc_i 32), 43847#(<= proc_i 36), 43848#(<= proc_i 40), 43849#(<= proc_i 44), 43850#(<= proc_i 48), 43851#(<= proc_i 52), 43852#(<= proc_i 56), 43853#(<= proc_i 60), 43854#(<= proc_i 64), 43855#(<= proc_i 68), 43856#(<= proc_i 72), 43857#(<= proc_i 76), 43858#(<= proc_i 80), 43859#(<= proc_i 84), 43860#(<= proc_i 88), 43861#(<= proc_i 92), 43862#(<= proc_i 96), 43863#(<= proc_i 100), 43864#(<= proc_i 104), 43865#(<= proc_i 108), 43866#(<= proc_i 112), 43867#(<= proc_i 116), 43868#(<= proc_i 120), 43869#(<= proc_i 124), 43870#(<= proc_i 128), 43871#(<= proc_i 132), 43872#(<= proc_i 136), 43873#(<= proc_i 140), 43874#(<= proc_i 144), 43875#(<= proc_i 148), 43876#(<= proc_i 152), 43877#(<= proc_i 156), 43878#(<= proc_i 160), 43879#(<= proc_i 164), 43880#(<= proc_i 168), 43881#(<= proc_i 172), 43882#(<= proc_i 176), 43883#(<= proc_i 180), 43884#(<= proc_i 184), 43885#(<= proc_i 188), 43886#(<= proc_i 192), 43887#(<= proc_i 196), 43888#(<= proc_i 200), 43889#(<= proc_i 204), 43890#(<= proc_i 208), 43891#(<= proc_i 212), 43892#(<= proc_i 216), 43893#(<= proc_i 220), 43894#(<= proc_i 224), 43895#(<= proc_i 228), 43896#(<= proc_i 232), 43897#(<= proc_i 236), 43898#(<= proc_i 240), 43899#(<= proc_i 244), 43900#(<= proc_i 248), 43901#(<= proc_i 252), 43902#(<= proc_i 256), 43903#(<= proc_i 260), 43904#(<= proc_i 264), 43905#(<= proc_i 268), 43906#(<= proc_i 272), 43907#(<= proc_i 276), 43908#(<= proc_i 280), 43909#(<= proc_i 284), 43910#(<= proc_i 288), 43911#(<= proc_i 292), 43912#(<= proc_i 296), 43913#(<= proc_i 300), 43914#(<= proc_i 304), 43915#(<= proc_i 308), 43916#(<= proc_i 312), 43917#(<= proc_i 316), 43918#(<= proc_i 320), 43919#(<= proc_i 324), 43920#(<= proc_i 328), 43921#(<= proc_i 332), 43922#(<= proc_i 336), 43923#(<= proc_i 340), 43924#(<= proc_i 344), 43925#(<= proc_i 348), 43926#(<= proc_i 352), 43927#(<= proc_i 356), 43928#(<= proc_i 360), 43929#(<= proc_i 364), 43930#(<= proc_i 368), 43931#(<= proc_i 372), 43932#(<= proc_i 376), 43933#(<= proc_i 380), 43934#(<= proc_i 384)] [2018-07-23 13:52:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:04,042 INFO L450 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-23 13:52:04,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-23 13:52:04,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 13:52:04,043 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 99 states. [2018-07-23 13:52:04,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:04,116 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-07-23 13:52:04,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-23 13:52:04,116 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 195 [2018-07-23 13:52:04,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:04,117 INFO L225 Difference]: With dead ends: 199 [2018-07-23 13:52:04,117 INFO L226 Difference]: Without dead ends: 198 [2018-07-23 13:52:04,117 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 13:52:04,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-07-23 13:52:04,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-07-23 13:52:04,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-07-23 13:52:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-07-23 13:52:04,121 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 195 [2018-07-23 13:52:04,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:04,121 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-07-23 13:52:04,121 INFO L472 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-23 13:52:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-07-23 13:52:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-07-23 13:52:04,122 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:04,122 INFO L357 BasicCegarLoop]: trace histogram [98, 97, 1, 1] [2018-07-23 13:52:04,122 INFO L414 AbstractCegarLoop]: === Iteration 98 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:04,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1356251618, now seen corresponding path program 97 times [2018-07-23 13:52:04,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:04,414 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:04,414 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-23 13:52:04,414 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:04,415 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:52:04,415 INFO L185 omatonBuilderFactory]: Interpolants [44800#(<= proc_i 276), 44801#(<= proc_i 280), 44802#(<= proc_i 284), 44803#(<= proc_i 288), 44804#(<= proc_i 292), 44805#(<= proc_i 296), 44806#(<= proc_i 300), 44807#(<= proc_i 304), 44808#(<= proc_i 308), 44809#(<= proc_i 312), 44810#(<= proc_i 316), 44811#(<= proc_i 320), 44812#(<= proc_i 324), 44813#(<= proc_i 328), 44814#(<= proc_i 332), 44815#(<= proc_i 336), 44816#(<= proc_i 340), 44817#(<= proc_i 344), 44818#(<= proc_i 348), 44819#(<= proc_i 352), 44820#(<= proc_i 356), 44821#(<= proc_i 360), 44822#(<= proc_i 364), 44823#(<= proc_i 368), 44824#(<= proc_i 372), 44825#(<= proc_i 376), 44826#(<= proc_i 380), 44827#(<= proc_i 384), 44828#(<= proc_i 388), 44729#true, 44730#false, 44731#(<= proc_i 0), 44732#(<= proc_i 4), 44733#(<= proc_i 8), 44734#(<= proc_i 12), 44735#(<= proc_i 16), 44736#(<= proc_i 20), 44737#(<= proc_i 24), 44738#(<= proc_i 28), 44739#(<= proc_i 32), 44740#(<= proc_i 36), 44741#(<= proc_i 40), 44742#(<= proc_i 44), 44743#(<= proc_i 48), 44744#(<= proc_i 52), 44745#(<= proc_i 56), 44746#(<= proc_i 60), 44747#(<= proc_i 64), 44748#(<= proc_i 68), 44749#(<= proc_i 72), 44750#(<= proc_i 76), 44751#(<= proc_i 80), 44752#(<= proc_i 84), 44753#(<= proc_i 88), 44754#(<= proc_i 92), 44755#(<= proc_i 96), 44756#(<= proc_i 100), 44757#(<= proc_i 104), 44758#(<= proc_i 108), 44759#(<= proc_i 112), 44760#(<= proc_i 116), 44761#(<= proc_i 120), 44762#(<= proc_i 124), 44763#(<= proc_i 128), 44764#(<= proc_i 132), 44765#(<= proc_i 136), 44766#(<= proc_i 140), 44767#(<= proc_i 144), 44768#(<= proc_i 148), 44769#(<= proc_i 152), 44770#(<= proc_i 156), 44771#(<= proc_i 160), 44772#(<= proc_i 164), 44773#(<= proc_i 168), 44774#(<= proc_i 172), 44775#(<= proc_i 176), 44776#(<= proc_i 180), 44777#(<= proc_i 184), 44778#(<= proc_i 188), 44779#(<= proc_i 192), 44780#(<= proc_i 196), 44781#(<= proc_i 200), 44782#(<= proc_i 204), 44783#(<= proc_i 208), 44784#(<= proc_i 212), 44785#(<= proc_i 216), 44786#(<= proc_i 220), 44787#(<= proc_i 224), 44788#(<= proc_i 228), 44789#(<= proc_i 232), 44790#(<= proc_i 236), 44791#(<= proc_i 240), 44792#(<= proc_i 244), 44793#(<= proc_i 248), 44794#(<= proc_i 252), 44795#(<= proc_i 256), 44796#(<= proc_i 260), 44797#(<= proc_i 264), 44798#(<= proc_i 268), 44799#(<= proc_i 272)] [2018-07-23 13:52:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:04,416 INFO L450 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-23 13:52:04,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-23 13:52:04,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 13:52:04,417 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 100 states. [2018-07-23 13:52:04,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:04,505 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-07-23 13:52:04,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-23 13:52:04,506 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 197 [2018-07-23 13:52:04,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:04,506 INFO L225 Difference]: With dead ends: 201 [2018-07-23 13:52:04,507 INFO L226 Difference]: Without dead ends: 200 [2018-07-23 13:52:04,507 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 13:52:04,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-07-23 13:52:04,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-07-23 13:52:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-07-23 13:52:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-07-23 13:52:04,511 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 197 [2018-07-23 13:52:04,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:04,511 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-07-23 13:52:04,511 INFO L472 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-23 13:52:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-07-23 13:52:04,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-07-23 13:52:04,512 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:04,512 INFO L357 BasicCegarLoop]: trace histogram [99, 98, 1, 1] [2018-07-23 13:52:04,512 INFO L414 AbstractCegarLoop]: === Iteration 99 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:04,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1982715300, now seen corresponding path program 98 times [2018-07-23 13:52:04,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:04,813 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:04,813 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-23 13:52:04,813 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:04,813 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:52:04,813 INFO L185 omatonBuilderFactory]: Interpolants [45631#true, 45632#false, 45633#(<= proc_i 0), 45634#(<= proc_i 4), 45635#(<= proc_i 8), 45636#(<= proc_i 12), 45637#(<= proc_i 16), 45638#(<= proc_i 20), 45639#(<= proc_i 24), 45640#(<= proc_i 28), 45641#(<= proc_i 32), 45642#(<= proc_i 36), 45643#(<= proc_i 40), 45644#(<= proc_i 44), 45645#(<= proc_i 48), 45646#(<= proc_i 52), 45647#(<= proc_i 56), 45648#(<= proc_i 60), 45649#(<= proc_i 64), 45650#(<= proc_i 68), 45651#(<= proc_i 72), 45652#(<= proc_i 76), 45653#(<= proc_i 80), 45654#(<= proc_i 84), 45655#(<= proc_i 88), 45656#(<= proc_i 92), 45657#(<= proc_i 96), 45658#(<= proc_i 100), 45659#(<= proc_i 104), 45660#(<= proc_i 108), 45661#(<= proc_i 112), 45662#(<= proc_i 116), 45663#(<= proc_i 120), 45664#(<= proc_i 124), 45665#(<= proc_i 128), 45666#(<= proc_i 132), 45667#(<= proc_i 136), 45668#(<= proc_i 140), 45669#(<= proc_i 144), 45670#(<= proc_i 148), 45671#(<= proc_i 152), 45672#(<= proc_i 156), 45673#(<= proc_i 160), 45674#(<= proc_i 164), 45675#(<= proc_i 168), 45676#(<= proc_i 172), 45677#(<= proc_i 176), 45678#(<= proc_i 180), 45679#(<= proc_i 184), 45680#(<= proc_i 188), 45681#(<= proc_i 192), 45682#(<= proc_i 196), 45683#(<= proc_i 200), 45684#(<= proc_i 204), 45685#(<= proc_i 208), 45686#(<= proc_i 212), 45687#(<= proc_i 216), 45688#(<= proc_i 220), 45689#(<= proc_i 224), 45690#(<= proc_i 228), 45691#(<= proc_i 232), 45692#(<= proc_i 236), 45693#(<= proc_i 240), 45694#(<= proc_i 244), 45695#(<= proc_i 248), 45696#(<= proc_i 252), 45697#(<= proc_i 256), 45698#(<= proc_i 260), 45699#(<= proc_i 264), 45700#(<= proc_i 268), 45701#(<= proc_i 272), 45702#(<= proc_i 276), 45703#(<= proc_i 280), 45704#(<= proc_i 284), 45705#(<= proc_i 288), 45706#(<= proc_i 292), 45707#(<= proc_i 296), 45708#(<= proc_i 300), 45709#(<= proc_i 304), 45710#(<= proc_i 308), 45711#(<= proc_i 312), 45712#(<= proc_i 316), 45713#(<= proc_i 320), 45714#(<= proc_i 324), 45715#(<= proc_i 328), 45716#(<= proc_i 332), 45717#(<= proc_i 336), 45718#(<= proc_i 340), 45719#(<= proc_i 344), 45720#(<= proc_i 348), 45721#(<= proc_i 352), 45722#(<= proc_i 356), 45723#(<= proc_i 360), 45724#(<= proc_i 364), 45725#(<= proc_i 368), 45726#(<= proc_i 372), 45727#(<= proc_i 376), 45728#(<= proc_i 380), 45729#(<= proc_i 384), 45730#(<= proc_i 388), 45731#(<= proc_i 392)] [2018-07-23 13:52:04,814 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:04,814 INFO L450 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-23 13:52:04,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-23 13:52:04,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 13:52:04,815 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 101 states. [2018-07-23 13:52:04,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:04,956 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-07-23 13:52:04,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-23 13:52:04,956 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 199 [2018-07-23 13:52:04,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:04,957 INFO L225 Difference]: With dead ends: 203 [2018-07-23 13:52:04,958 INFO L226 Difference]: Without dead ends: 202 [2018-07-23 13:52:04,959 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 13:52:04,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-07-23 13:52:04,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-07-23 13:52:04,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-07-23 13:52:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-07-23 13:52:04,964 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 199 [2018-07-23 13:52:04,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:04,964 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-07-23 13:52:04,965 INFO L472 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-23 13:52:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-07-23 13:52:04,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-07-23 13:52:04,969 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:04,970 INFO L357 BasicCegarLoop]: trace histogram [100, 99, 1, 1] [2018-07-23 13:52:04,970 INFO L414 AbstractCegarLoop]: === Iteration 100 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:04,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1576075034, now seen corresponding path program 99 times [2018-07-23 13:52:04,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:05,324 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:05,324 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-23 13:52:05,324 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:05,324 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:52:05,325 INFO L185 omatonBuilderFactory]: Interpolants [46592#(<= proc_i 192), 46593#(<= proc_i 196), 46594#(<= proc_i 200), 46595#(<= proc_i 204), 46596#(<= proc_i 208), 46597#(<= proc_i 212), 46598#(<= proc_i 216), 46599#(<= proc_i 220), 46600#(<= proc_i 224), 46601#(<= proc_i 228), 46602#(<= proc_i 232), 46603#(<= proc_i 236), 46604#(<= proc_i 240), 46605#(<= proc_i 244), 46606#(<= proc_i 248), 46607#(<= proc_i 252), 46608#(<= proc_i 256), 46609#(<= proc_i 260), 46610#(<= proc_i 264), 46611#(<= proc_i 268), 46612#(<= proc_i 272), 46613#(<= proc_i 276), 46614#(<= proc_i 280), 46615#(<= proc_i 284), 46616#(<= proc_i 288), 46617#(<= proc_i 292), 46618#(<= proc_i 296), 46619#(<= proc_i 300), 46620#(<= proc_i 304), 46621#(<= proc_i 308), 46622#(<= proc_i 312), 46623#(<= proc_i 316), 46624#(<= proc_i 320), 46625#(<= proc_i 324), 46626#(<= proc_i 328), 46627#(<= proc_i 332), 46628#(<= proc_i 336), 46629#(<= proc_i 340), 46630#(<= proc_i 344), 46631#(<= proc_i 348), 46632#(<= proc_i 352), 46633#(<= proc_i 356), 46634#(<= proc_i 360), 46635#(<= proc_i 364), 46636#(<= proc_i 368), 46637#(<= proc_i 372), 46638#(<= proc_i 376), 46639#(<= proc_i 380), 46640#(<= proc_i 384), 46641#(<= proc_i 388), 46642#(<= proc_i 392), 46643#(<= proc_i 396), 46542#true, 46543#false, 46544#(<= proc_i 0), 46545#(<= proc_i 4), 46546#(<= proc_i 8), 46547#(<= proc_i 12), 46548#(<= proc_i 16), 46549#(<= proc_i 20), 46550#(<= proc_i 24), 46551#(<= proc_i 28), 46552#(<= proc_i 32), 46553#(<= proc_i 36), 46554#(<= proc_i 40), 46555#(<= proc_i 44), 46556#(<= proc_i 48), 46557#(<= proc_i 52), 46558#(<= proc_i 56), 46559#(<= proc_i 60), 46560#(<= proc_i 64), 46561#(<= proc_i 68), 46562#(<= proc_i 72), 46563#(<= proc_i 76), 46564#(<= proc_i 80), 46565#(<= proc_i 84), 46566#(<= proc_i 88), 46567#(<= proc_i 92), 46568#(<= proc_i 96), 46569#(<= proc_i 100), 46570#(<= proc_i 104), 46571#(<= proc_i 108), 46572#(<= proc_i 112), 46573#(<= proc_i 116), 46574#(<= proc_i 120), 46575#(<= proc_i 124), 46576#(<= proc_i 128), 46577#(<= proc_i 132), 46578#(<= proc_i 136), 46579#(<= proc_i 140), 46580#(<= proc_i 144), 46581#(<= proc_i 148), 46582#(<= proc_i 152), 46583#(<= proc_i 156), 46584#(<= proc_i 160), 46585#(<= proc_i 164), 46586#(<= proc_i 168), 46587#(<= proc_i 172), 46588#(<= proc_i 176), 46589#(<= proc_i 180), 46590#(<= proc_i 184), 46591#(<= proc_i 188)] [2018-07-23 13:52:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:05,325 INFO L450 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-23 13:52:05,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-23 13:52:05,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 13:52:05,327 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 102 states. [2018-07-23 13:52:05,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:05,408 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-07-23 13:52:05,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-23 13:52:05,408 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 201 [2018-07-23 13:52:05,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:05,409 INFO L225 Difference]: With dead ends: 205 [2018-07-23 13:52:05,410 INFO L226 Difference]: Without dead ends: 204 [2018-07-23 13:52:05,410 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 13:52:05,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-07-23 13:52:05,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-07-23 13:52:05,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-07-23 13:52:05,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-07-23 13:52:05,414 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 201 [2018-07-23 13:52:05,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:05,414 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-07-23 13:52:05,415 INFO L472 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-23 13:52:05,415 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-07-23 13:52:05,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-07-23 13:52:05,415 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:05,416 INFO L357 BasicCegarLoop]: trace histogram [101, 100, 1, 1] [2018-07-23 13:52:05,416 INFO L414 AbstractCegarLoop]: === Iteration 101 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:05,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1515348904, now seen corresponding path program 100 times [2018-07-23 13:52:05,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:05,757 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:05,757 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-23 13:52:05,757 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:05,758 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:52:05,758 INFO L185 omatonBuilderFactory]: Interpolants [47462#true, 47463#false, 47464#(<= proc_i 0), 47465#(<= proc_i 4), 47466#(<= proc_i 8), 47467#(<= proc_i 12), 47468#(<= proc_i 16), 47469#(<= proc_i 20), 47470#(<= proc_i 24), 47471#(<= proc_i 28), 47472#(<= proc_i 32), 47473#(<= proc_i 36), 47474#(<= proc_i 40), 47475#(<= proc_i 44), 47476#(<= proc_i 48), 47477#(<= proc_i 52), 47478#(<= proc_i 56), 47479#(<= proc_i 60), 47480#(<= proc_i 64), 47481#(<= proc_i 68), 47482#(<= proc_i 72), 47483#(<= proc_i 76), 47484#(<= proc_i 80), 47485#(<= proc_i 84), 47486#(<= proc_i 88), 47487#(<= proc_i 92), 47488#(<= proc_i 96), 47489#(<= proc_i 100), 47490#(<= proc_i 104), 47491#(<= proc_i 108), 47492#(<= proc_i 112), 47493#(<= proc_i 116), 47494#(<= proc_i 120), 47495#(<= proc_i 124), 47496#(<= proc_i 128), 47497#(<= proc_i 132), 47498#(<= proc_i 136), 47499#(<= proc_i 140), 47500#(<= proc_i 144), 47501#(<= proc_i 148), 47502#(<= proc_i 152), 47503#(<= proc_i 156), 47504#(<= proc_i 160), 47505#(<= proc_i 164), 47506#(<= proc_i 168), 47507#(<= proc_i 172), 47508#(<= proc_i 176), 47509#(<= proc_i 180), 47510#(<= proc_i 184), 47511#(<= proc_i 188), 47512#(<= proc_i 192), 47513#(<= proc_i 196), 47514#(<= proc_i 200), 47515#(<= proc_i 204), 47516#(<= proc_i 208), 47517#(<= proc_i 212), 47518#(<= proc_i 216), 47519#(<= proc_i 220), 47520#(<= proc_i 224), 47521#(<= proc_i 228), 47522#(<= proc_i 232), 47523#(<= proc_i 236), 47524#(<= proc_i 240), 47525#(<= proc_i 244), 47526#(<= proc_i 248), 47527#(<= proc_i 252), 47528#(<= proc_i 256), 47529#(<= proc_i 260), 47530#(<= proc_i 264), 47531#(<= proc_i 268), 47532#(<= proc_i 272), 47533#(<= proc_i 276), 47534#(<= proc_i 280), 47535#(<= proc_i 284), 47536#(<= proc_i 288), 47537#(<= proc_i 292), 47538#(<= proc_i 296), 47539#(<= proc_i 300), 47540#(<= proc_i 304), 47541#(<= proc_i 308), 47542#(<= proc_i 312), 47543#(<= proc_i 316), 47544#(<= proc_i 320), 47545#(<= proc_i 324), 47546#(<= proc_i 328), 47547#(<= proc_i 332), 47548#(<= proc_i 336), 47549#(<= proc_i 340), 47550#(<= proc_i 344), 47551#(<= proc_i 348), 47552#(<= proc_i 352), 47553#(<= proc_i 356), 47554#(<= proc_i 360), 47555#(<= proc_i 364), 47556#(<= proc_i 368), 47557#(<= proc_i 372), 47558#(<= proc_i 376), 47559#(<= proc_i 380), 47560#(<= proc_i 384), 47561#(<= proc_i 388), 47562#(<= proc_i 392), 47563#(<= proc_i 396), 47564#(<= proc_i 400)] [2018-07-23 13:52:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:05,759 INFO L450 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-23 13:52:05,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-23 13:52:05,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:52:05,761 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 103 states. [2018-07-23 13:52:05,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:05,917 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-07-23 13:52:05,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-23 13:52:05,917 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 203 [2018-07-23 13:52:05,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:05,918 INFO L225 Difference]: With dead ends: 207 [2018-07-23 13:52:05,918 INFO L226 Difference]: Without dead ends: 206 [2018-07-23 13:52:05,919 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:52:05,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-07-23 13:52:05,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-07-23 13:52:05,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-07-23 13:52:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-07-23 13:52:05,924 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 203 [2018-07-23 13:52:05,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:05,924 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-07-23 13:52:05,924 INFO L472 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-23 13:52:05,925 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-07-23 13:52:05,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-07-23 13:52:05,926 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:05,926 INFO L357 BasicCegarLoop]: trace histogram [102, 101, 1, 1] [2018-07-23 13:52:05,926 INFO L414 AbstractCegarLoop]: === Iteration 102 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:05,926 INFO L82 PathProgramCache]: Analyzing trace with hash 256384490, now seen corresponding path program 101 times [2018-07-23 13:52:05,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:06,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:06,293 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:06,294 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-23 13:52:06,294 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:06,294 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:52:06,295 INFO L185 omatonBuilderFactory]: Interpolants [48391#true, 48392#false, 48393#(<= proc_i 0), 48394#(<= proc_i 4), 48395#(<= proc_i 8), 48396#(<= proc_i 12), 48397#(<= proc_i 16), 48398#(<= proc_i 20), 48399#(<= proc_i 24), 48400#(<= proc_i 28), 48401#(<= proc_i 32), 48402#(<= proc_i 36), 48403#(<= proc_i 40), 48404#(<= proc_i 44), 48405#(<= proc_i 48), 48406#(<= proc_i 52), 48407#(<= proc_i 56), 48408#(<= proc_i 60), 48409#(<= proc_i 64), 48410#(<= proc_i 68), 48411#(<= proc_i 72), 48412#(<= proc_i 76), 48413#(<= proc_i 80), 48414#(<= proc_i 84), 48415#(<= proc_i 88), 48416#(<= proc_i 92), 48417#(<= proc_i 96), 48418#(<= proc_i 100), 48419#(<= proc_i 104), 48420#(<= proc_i 108), 48421#(<= proc_i 112), 48422#(<= proc_i 116), 48423#(<= proc_i 120), 48424#(<= proc_i 124), 48425#(<= proc_i 128), 48426#(<= proc_i 132), 48427#(<= proc_i 136), 48428#(<= proc_i 140), 48429#(<= proc_i 144), 48430#(<= proc_i 148), 48431#(<= proc_i 152), 48432#(<= proc_i 156), 48433#(<= proc_i 160), 48434#(<= proc_i 164), 48435#(<= proc_i 168), 48436#(<= proc_i 172), 48437#(<= proc_i 176), 48438#(<= proc_i 180), 48439#(<= proc_i 184), 48440#(<= proc_i 188), 48441#(<= proc_i 192), 48442#(<= proc_i 196), 48443#(<= proc_i 200), 48444#(<= proc_i 204), 48445#(<= proc_i 208), 48446#(<= proc_i 212), 48447#(<= proc_i 216), 48448#(<= proc_i 220), 48449#(<= proc_i 224), 48450#(<= proc_i 228), 48451#(<= proc_i 232), 48452#(<= proc_i 236), 48453#(<= proc_i 240), 48454#(<= proc_i 244), 48455#(<= proc_i 248), 48456#(<= proc_i 252), 48457#(<= proc_i 256), 48458#(<= proc_i 260), 48459#(<= proc_i 264), 48460#(<= proc_i 268), 48461#(<= proc_i 272), 48462#(<= proc_i 276), 48463#(<= proc_i 280), 48464#(<= proc_i 284), 48465#(<= proc_i 288), 48466#(<= proc_i 292), 48467#(<= proc_i 296), 48468#(<= proc_i 300), 48469#(<= proc_i 304), 48470#(<= proc_i 308), 48471#(<= proc_i 312), 48472#(<= proc_i 316), 48473#(<= proc_i 320), 48474#(<= proc_i 324), 48475#(<= proc_i 328), 48476#(<= proc_i 332), 48477#(<= proc_i 336), 48478#(<= proc_i 340), 48479#(<= proc_i 344), 48480#(<= proc_i 348), 48481#(<= proc_i 352), 48482#(<= proc_i 356), 48483#(<= proc_i 360), 48484#(<= proc_i 364), 48485#(<= proc_i 368), 48486#(<= proc_i 372), 48487#(<= proc_i 376), 48488#(<= proc_i 380), 48489#(<= proc_i 384), 48490#(<= proc_i 388), 48491#(<= proc_i 392), 48492#(<= proc_i 396), 48493#(<= proc_i 400), 48494#(<= proc_i 404)] [2018-07-23 13:52:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:06,296 INFO L450 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-23 13:52:06,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-23 13:52:06,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 13:52:06,297 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 104 states. [2018-07-23 13:52:06,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:06,523 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-07-23 13:52:06,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-23 13:52:06,523 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 205 [2018-07-23 13:52:06,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:06,524 INFO L225 Difference]: With dead ends: 209 [2018-07-23 13:52:06,524 INFO L226 Difference]: Without dead ends: 208 [2018-07-23 13:52:06,525 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 13:52:06,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-07-23 13:52:06,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-07-23 13:52:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-07-23 13:52:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-07-23 13:52:06,529 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 205 [2018-07-23 13:52:06,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:06,529 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-07-23 13:52:06,529 INFO L472 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-23 13:52:06,529 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-07-23 13:52:06,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-07-23 13:52:06,530 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:06,530 INFO L357 BasicCegarLoop]: trace histogram [103, 102, 1, 1] [2018-07-23 13:52:06,530 INFO L414 AbstractCegarLoop]: === Iteration 103 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:06,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1572360108, now seen corresponding path program 102 times [2018-07-23 13:52:06,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:06,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:06,857 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:06,857 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-23 13:52:06,857 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:06,857 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:52:06,857 INFO L185 omatonBuilderFactory]: Interpolants [49408#(<= proc_i 308), 49409#(<= proc_i 312), 49410#(<= proc_i 316), 49411#(<= proc_i 320), 49412#(<= proc_i 324), 49413#(<= proc_i 328), 49414#(<= proc_i 332), 49415#(<= proc_i 336), 49416#(<= proc_i 340), 49417#(<= proc_i 344), 49418#(<= proc_i 348), 49419#(<= proc_i 352), 49420#(<= proc_i 356), 49421#(<= proc_i 360), 49422#(<= proc_i 364), 49423#(<= proc_i 368), 49424#(<= proc_i 372), 49425#(<= proc_i 376), 49426#(<= proc_i 380), 49427#(<= proc_i 384), 49428#(<= proc_i 388), 49429#(<= proc_i 392), 49430#(<= proc_i 396), 49431#(<= proc_i 400), 49432#(<= proc_i 404), 49433#(<= proc_i 408), 49329#true, 49330#false, 49331#(<= proc_i 0), 49332#(<= proc_i 4), 49333#(<= proc_i 8), 49334#(<= proc_i 12), 49335#(<= proc_i 16), 49336#(<= proc_i 20), 49337#(<= proc_i 24), 49338#(<= proc_i 28), 49339#(<= proc_i 32), 49340#(<= proc_i 36), 49341#(<= proc_i 40), 49342#(<= proc_i 44), 49343#(<= proc_i 48), 49344#(<= proc_i 52), 49345#(<= proc_i 56), 49346#(<= proc_i 60), 49347#(<= proc_i 64), 49348#(<= proc_i 68), 49349#(<= proc_i 72), 49350#(<= proc_i 76), 49351#(<= proc_i 80), 49352#(<= proc_i 84), 49353#(<= proc_i 88), 49354#(<= proc_i 92), 49355#(<= proc_i 96), 49356#(<= proc_i 100), 49357#(<= proc_i 104), 49358#(<= proc_i 108), 49359#(<= proc_i 112), 49360#(<= proc_i 116), 49361#(<= proc_i 120), 49362#(<= proc_i 124), 49363#(<= proc_i 128), 49364#(<= proc_i 132), 49365#(<= proc_i 136), 49366#(<= proc_i 140), 49367#(<= proc_i 144), 49368#(<= proc_i 148), 49369#(<= proc_i 152), 49370#(<= proc_i 156), 49371#(<= proc_i 160), 49372#(<= proc_i 164), 49373#(<= proc_i 168), 49374#(<= proc_i 172), 49375#(<= proc_i 176), 49376#(<= proc_i 180), 49377#(<= proc_i 184), 49378#(<= proc_i 188), 49379#(<= proc_i 192), 49380#(<= proc_i 196), 49381#(<= proc_i 200), 49382#(<= proc_i 204), 49383#(<= proc_i 208), 49384#(<= proc_i 212), 49385#(<= proc_i 216), 49386#(<= proc_i 220), 49387#(<= proc_i 224), 49388#(<= proc_i 228), 49389#(<= proc_i 232), 49390#(<= proc_i 236), 49391#(<= proc_i 240), 49392#(<= proc_i 244), 49393#(<= proc_i 248), 49394#(<= proc_i 252), 49395#(<= proc_i 256), 49396#(<= proc_i 260), 49397#(<= proc_i 264), 49398#(<= proc_i 268), 49399#(<= proc_i 272), 49400#(<= proc_i 276), 49401#(<= proc_i 280), 49402#(<= proc_i 284), 49403#(<= proc_i 288), 49404#(<= proc_i 292), 49405#(<= proc_i 296), 49406#(<= proc_i 300), 49407#(<= proc_i 304)] [2018-07-23 13:52:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:06,858 INFO L450 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-23 13:52:06,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-23 13:52:06,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-07-23 13:52:06,860 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 105 states. [2018-07-23 13:52:06,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:06,964 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-07-23 13:52:06,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-23 13:52:06,964 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 207 [2018-07-23 13:52:06,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:06,965 INFO L225 Difference]: With dead ends: 211 [2018-07-23 13:52:06,965 INFO L226 Difference]: Without dead ends: 210 [2018-07-23 13:52:06,966 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-07-23 13:52:06,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-07-23 13:52:06,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-07-23 13:52:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-07-23 13:52:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-07-23 13:52:06,971 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 207 [2018-07-23 13:52:06,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:06,971 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-07-23 13:52:06,971 INFO L472 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-23 13:52:06,971 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-07-23 13:52:06,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-07-23 13:52:06,972 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:06,972 INFO L357 BasicCegarLoop]: trace histogram [104, 103, 1, 1] [2018-07-23 13:52:06,972 INFO L414 AbstractCegarLoop]: === Iteration 104 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:06,973 INFO L82 PathProgramCache]: Analyzing trace with hash -790423314, now seen corresponding path program 103 times [2018-07-23 13:52:06,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:07,323 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:07,323 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-23 13:52:07,324 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:07,324 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:52:07,324 INFO L185 omatonBuilderFactory]: Interpolants [50276#true, 50277#false, 50278#(<= proc_i 0), 50279#(<= proc_i 4), 50280#(<= proc_i 8), 50281#(<= proc_i 12), 50282#(<= proc_i 16), 50283#(<= proc_i 20), 50284#(<= proc_i 24), 50285#(<= proc_i 28), 50286#(<= proc_i 32), 50287#(<= proc_i 36), 50288#(<= proc_i 40), 50289#(<= proc_i 44), 50290#(<= proc_i 48), 50291#(<= proc_i 52), 50292#(<= proc_i 56), 50293#(<= proc_i 60), 50294#(<= proc_i 64), 50295#(<= proc_i 68), 50296#(<= proc_i 72), 50297#(<= proc_i 76), 50298#(<= proc_i 80), 50299#(<= proc_i 84), 50300#(<= proc_i 88), 50301#(<= proc_i 92), 50302#(<= proc_i 96), 50303#(<= proc_i 100), 50304#(<= proc_i 104), 50305#(<= proc_i 108), 50306#(<= proc_i 112), 50307#(<= proc_i 116), 50308#(<= proc_i 120), 50309#(<= proc_i 124), 50310#(<= proc_i 128), 50311#(<= proc_i 132), 50312#(<= proc_i 136), 50313#(<= proc_i 140), 50314#(<= proc_i 144), 50315#(<= proc_i 148), 50316#(<= proc_i 152), 50317#(<= proc_i 156), 50318#(<= proc_i 160), 50319#(<= proc_i 164), 50320#(<= proc_i 168), 50321#(<= proc_i 172), 50322#(<= proc_i 176), 50323#(<= proc_i 180), 50324#(<= proc_i 184), 50325#(<= proc_i 188), 50326#(<= proc_i 192), 50327#(<= proc_i 196), 50328#(<= proc_i 200), 50329#(<= proc_i 204), 50330#(<= proc_i 208), 50331#(<= proc_i 212), 50332#(<= proc_i 216), 50333#(<= proc_i 220), 50334#(<= proc_i 224), 50335#(<= proc_i 228), 50336#(<= proc_i 232), 50337#(<= proc_i 236), 50338#(<= proc_i 240), 50339#(<= proc_i 244), 50340#(<= proc_i 248), 50341#(<= proc_i 252), 50342#(<= proc_i 256), 50343#(<= proc_i 260), 50344#(<= proc_i 264), 50345#(<= proc_i 268), 50346#(<= proc_i 272), 50347#(<= proc_i 276), 50348#(<= proc_i 280), 50349#(<= proc_i 284), 50350#(<= proc_i 288), 50351#(<= proc_i 292), 50352#(<= proc_i 296), 50353#(<= proc_i 300), 50354#(<= proc_i 304), 50355#(<= proc_i 308), 50356#(<= proc_i 312), 50357#(<= proc_i 316), 50358#(<= proc_i 320), 50359#(<= proc_i 324), 50360#(<= proc_i 328), 50361#(<= proc_i 332), 50362#(<= proc_i 336), 50363#(<= proc_i 340), 50364#(<= proc_i 344), 50365#(<= proc_i 348), 50366#(<= proc_i 352), 50367#(<= proc_i 356), 50368#(<= proc_i 360), 50369#(<= proc_i 364), 50370#(<= proc_i 368), 50371#(<= proc_i 372), 50372#(<= proc_i 376), 50373#(<= proc_i 380), 50374#(<= proc_i 384), 50375#(<= proc_i 388), 50376#(<= proc_i 392), 50377#(<= proc_i 396), 50378#(<= proc_i 400), 50379#(<= proc_i 404), 50380#(<= proc_i 408), 50381#(<= proc_i 412)] [2018-07-23 13:52:07,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:07,325 INFO L450 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-23 13:52:07,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-23 13:52:07,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-07-23 13:52:07,327 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 106 states. [2018-07-23 13:52:07,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:07,496 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-07-23 13:52:07,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-23 13:52:07,496 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 209 [2018-07-23 13:52:07,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:07,497 INFO L225 Difference]: With dead ends: 213 [2018-07-23 13:52:07,497 INFO L226 Difference]: Without dead ends: 212 [2018-07-23 13:52:07,498 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-07-23 13:52:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-07-23 13:52:07,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-07-23 13:52:07,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-07-23 13:52:07,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-07-23 13:52:07,503 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 209 [2018-07-23 13:52:07,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:07,503 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-07-23 13:52:07,504 INFO L472 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-23 13:52:07,504 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-07-23 13:52:07,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-07-23 13:52:07,505 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:07,505 INFO L357 BasicCegarLoop]: trace histogram [105, 104, 1, 1] [2018-07-23 13:52:07,505 INFO L414 AbstractCegarLoop]: === Iteration 105 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:07,505 INFO L82 PathProgramCache]: Analyzing trace with hash 612407728, now seen corresponding path program 104 times [2018-07-23 13:52:07,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:07,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:07,936 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:07,936 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-23 13:52:07,936 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:07,936 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:52:07,937 INFO L185 omatonBuilderFactory]: Interpolants [51232#true, 51233#false, 51234#(<= proc_i 0), 51235#(<= proc_i 4), 51236#(<= proc_i 8), 51237#(<= proc_i 12), 51238#(<= proc_i 16), 51239#(<= proc_i 20), 51240#(<= proc_i 24), 51241#(<= proc_i 28), 51242#(<= proc_i 32), 51243#(<= proc_i 36), 51244#(<= proc_i 40), 51245#(<= proc_i 44), 51246#(<= proc_i 48), 51247#(<= proc_i 52), 51248#(<= proc_i 56), 51249#(<= proc_i 60), 51250#(<= proc_i 64), 51251#(<= proc_i 68), 51252#(<= proc_i 72), 51253#(<= proc_i 76), 51254#(<= proc_i 80), 51255#(<= proc_i 84), 51256#(<= proc_i 88), 51257#(<= proc_i 92), 51258#(<= proc_i 96), 51259#(<= proc_i 100), 51260#(<= proc_i 104), 51261#(<= proc_i 108), 51262#(<= proc_i 112), 51263#(<= proc_i 116), 51264#(<= proc_i 120), 51265#(<= proc_i 124), 51266#(<= proc_i 128), 51267#(<= proc_i 132), 51268#(<= proc_i 136), 51269#(<= proc_i 140), 51270#(<= proc_i 144), 51271#(<= proc_i 148), 51272#(<= proc_i 152), 51273#(<= proc_i 156), 51274#(<= proc_i 160), 51275#(<= proc_i 164), 51276#(<= proc_i 168), 51277#(<= proc_i 172), 51278#(<= proc_i 176), 51279#(<= proc_i 180), 51280#(<= proc_i 184), 51281#(<= proc_i 188), 51282#(<= proc_i 192), 51283#(<= proc_i 196), 51284#(<= proc_i 200), 51285#(<= proc_i 204), 51286#(<= proc_i 208), 51287#(<= proc_i 212), 51288#(<= proc_i 216), 51289#(<= proc_i 220), 51290#(<= proc_i 224), 51291#(<= proc_i 228), 51292#(<= proc_i 232), 51293#(<= proc_i 236), 51294#(<= proc_i 240), 51295#(<= proc_i 244), 51296#(<= proc_i 248), 51297#(<= proc_i 252), 51298#(<= proc_i 256), 51299#(<= proc_i 260), 51300#(<= proc_i 264), 51301#(<= proc_i 268), 51302#(<= proc_i 272), 51303#(<= proc_i 276), 51304#(<= proc_i 280), 51305#(<= proc_i 284), 51306#(<= proc_i 288), 51307#(<= proc_i 292), 51308#(<= proc_i 296), 51309#(<= proc_i 300), 51310#(<= proc_i 304), 51311#(<= proc_i 308), 51312#(<= proc_i 312), 51313#(<= proc_i 316), 51314#(<= proc_i 320), 51315#(<= proc_i 324), 51316#(<= proc_i 328), 51317#(<= proc_i 332), 51318#(<= proc_i 336), 51319#(<= proc_i 340), 51320#(<= proc_i 344), 51321#(<= proc_i 348), 51322#(<= proc_i 352), 51323#(<= proc_i 356), 51324#(<= proc_i 360), 51325#(<= proc_i 364), 51326#(<= proc_i 368), 51327#(<= proc_i 372), 51328#(<= proc_i 376), 51329#(<= proc_i 380), 51330#(<= proc_i 384), 51331#(<= proc_i 388), 51332#(<= proc_i 392), 51333#(<= proc_i 396), 51334#(<= proc_i 400), 51335#(<= proc_i 404), 51336#(<= proc_i 408), 51337#(<= proc_i 412), 51338#(<= proc_i 416)] [2018-07-23 13:52:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:07,937 INFO L450 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-23 13:52:07,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-23 13:52:07,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-07-23 13:52:07,939 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 107 states. [2018-07-23 13:52:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:08,149 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-07-23 13:52:08,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-23 13:52:08,150 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 211 [2018-07-23 13:52:08,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:08,150 INFO L225 Difference]: With dead ends: 215 [2018-07-23 13:52:08,150 INFO L226 Difference]: Without dead ends: 214 [2018-07-23 13:52:08,151 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-07-23 13:52:08,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-07-23 13:52:08,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-07-23 13:52:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-07-23 13:52:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2018-07-23 13:52:08,155 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 211 [2018-07-23 13:52:08,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:08,155 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2018-07-23 13:52:08,155 INFO L472 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-23 13:52:08,155 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2018-07-23 13:52:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-07-23 13:52:08,156 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:08,156 INFO L357 BasicCegarLoop]: trace histogram [106, 105, 1, 1] [2018-07-23 13:52:08,156 INFO L414 AbstractCegarLoop]: === Iteration 106 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:08,156 INFO L82 PathProgramCache]: Analyzing trace with hash 113308146, now seen corresponding path program 105 times [2018-07-23 13:52:08,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:08,517 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:08,517 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-23 13:52:08,518 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:08,518 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:52:08,518 INFO L185 omatonBuilderFactory]: Interpolants [52224#(<= proc_i 100), 52225#(<= proc_i 104), 52226#(<= proc_i 108), 52227#(<= proc_i 112), 52228#(<= proc_i 116), 52229#(<= proc_i 120), 52230#(<= proc_i 124), 52231#(<= proc_i 128), 52232#(<= proc_i 132), 52233#(<= proc_i 136), 52234#(<= proc_i 140), 52235#(<= proc_i 144), 52236#(<= proc_i 148), 52237#(<= proc_i 152), 52238#(<= proc_i 156), 52239#(<= proc_i 160), 52240#(<= proc_i 164), 52241#(<= proc_i 168), 52242#(<= proc_i 172), 52243#(<= proc_i 176), 52244#(<= proc_i 180), 52245#(<= proc_i 184), 52246#(<= proc_i 188), 52247#(<= proc_i 192), 52248#(<= proc_i 196), 52249#(<= proc_i 200), 52250#(<= proc_i 204), 52251#(<= proc_i 208), 52252#(<= proc_i 212), 52253#(<= proc_i 216), 52254#(<= proc_i 220), 52255#(<= proc_i 224), 52256#(<= proc_i 228), 52257#(<= proc_i 232), 52258#(<= proc_i 236), 52259#(<= proc_i 240), 52260#(<= proc_i 244), 52261#(<= proc_i 248), 52262#(<= proc_i 252), 52263#(<= proc_i 256), 52264#(<= proc_i 260), 52265#(<= proc_i 264), 52266#(<= proc_i 268), 52267#(<= proc_i 272), 52268#(<= proc_i 276), 52269#(<= proc_i 280), 52270#(<= proc_i 284), 52271#(<= proc_i 288), 52272#(<= proc_i 292), 52273#(<= proc_i 296), 52274#(<= proc_i 300), 52275#(<= proc_i 304), 52276#(<= proc_i 308), 52277#(<= proc_i 312), 52278#(<= proc_i 316), 52279#(<= proc_i 320), 52280#(<= proc_i 324), 52281#(<= proc_i 328), 52282#(<= proc_i 332), 52283#(<= proc_i 336), 52284#(<= proc_i 340), 52285#(<= proc_i 344), 52286#(<= proc_i 348), 52287#(<= proc_i 352), 52288#(<= proc_i 356), 52289#(<= proc_i 360), 52290#(<= proc_i 364), 52291#(<= proc_i 368), 52292#(<= proc_i 372), 52293#(<= proc_i 376), 52294#(<= proc_i 380), 52295#(<= proc_i 384), 52296#(<= proc_i 388), 52297#(<= proc_i 392), 52298#(<= proc_i 396), 52299#(<= proc_i 400), 52300#(<= proc_i 404), 52301#(<= proc_i 408), 52302#(<= proc_i 412), 52303#(<= proc_i 416), 52304#(<= proc_i 420), 52197#true, 52198#false, 52199#(<= proc_i 0), 52200#(<= proc_i 4), 52201#(<= proc_i 8), 52202#(<= proc_i 12), 52203#(<= proc_i 16), 52204#(<= proc_i 20), 52205#(<= proc_i 24), 52206#(<= proc_i 28), 52207#(<= proc_i 32), 52208#(<= proc_i 36), 52209#(<= proc_i 40), 52210#(<= proc_i 44), 52211#(<= proc_i 48), 52212#(<= proc_i 52), 52213#(<= proc_i 56), 52214#(<= proc_i 60), 52215#(<= proc_i 64), 52216#(<= proc_i 68), 52217#(<= proc_i 72), 52218#(<= proc_i 76), 52219#(<= proc_i 80), 52220#(<= proc_i 84), 52221#(<= proc_i 88), 52222#(<= proc_i 92), 52223#(<= proc_i 96)] [2018-07-23 13:52:08,519 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:08,519 INFO L450 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-23 13:52:08,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-23 13:52:08,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-07-23 13:52:08,520 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 108 states. [2018-07-23 13:52:08,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:08,716 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-07-23 13:52:08,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-23 13:52:08,716 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 213 [2018-07-23 13:52:08,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:08,717 INFO L225 Difference]: With dead ends: 217 [2018-07-23 13:52:08,718 INFO L226 Difference]: Without dead ends: 216 [2018-07-23 13:52:08,719 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-07-23 13:52:08,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-07-23 13:52:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-07-23 13:52:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-07-23 13:52:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-07-23 13:52:08,725 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 213 [2018-07-23 13:52:08,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:08,725 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-07-23 13:52:08,725 INFO L472 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-23 13:52:08,725 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-07-23 13:52:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-07-23 13:52:08,727 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:08,727 INFO L357 BasicCegarLoop]: trace histogram [107, 106, 1, 1] [2018-07-23 13:52:08,727 INFO L414 AbstractCegarLoop]: === Iteration 107 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:08,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1514946996, now seen corresponding path program 106 times [2018-07-23 13:52:08,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:09,302 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:09,303 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:09,303 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-23 13:52:09,303 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:09,303 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:52:09,303 INFO L185 omatonBuilderFactory]: Interpolants [53248#(<= proc_i 300), 53249#(<= proc_i 304), 53250#(<= proc_i 308), 53251#(<= proc_i 312), 53252#(<= proc_i 316), 53253#(<= proc_i 320), 53254#(<= proc_i 324), 53255#(<= proc_i 328), 53256#(<= proc_i 332), 53257#(<= proc_i 336), 53258#(<= proc_i 340), 53259#(<= proc_i 344), 53260#(<= proc_i 348), 53261#(<= proc_i 352), 53262#(<= proc_i 356), 53263#(<= proc_i 360), 53264#(<= proc_i 364), 53265#(<= proc_i 368), 53266#(<= proc_i 372), 53267#(<= proc_i 376), 53268#(<= proc_i 380), 53269#(<= proc_i 384), 53270#(<= proc_i 388), 53271#(<= proc_i 392), 53272#(<= proc_i 396), 53273#(<= proc_i 400), 53274#(<= proc_i 404), 53275#(<= proc_i 408), 53276#(<= proc_i 412), 53277#(<= proc_i 416), 53278#(<= proc_i 420), 53279#(<= proc_i 424), 53171#true, 53172#false, 53173#(<= proc_i 0), 53174#(<= proc_i 4), 53175#(<= proc_i 8), 53176#(<= proc_i 12), 53177#(<= proc_i 16), 53178#(<= proc_i 20), 53179#(<= proc_i 24), 53180#(<= proc_i 28), 53181#(<= proc_i 32), 53182#(<= proc_i 36), 53183#(<= proc_i 40), 53184#(<= proc_i 44), 53185#(<= proc_i 48), 53186#(<= proc_i 52), 53187#(<= proc_i 56), 53188#(<= proc_i 60), 53189#(<= proc_i 64), 53190#(<= proc_i 68), 53191#(<= proc_i 72), 53192#(<= proc_i 76), 53193#(<= proc_i 80), 53194#(<= proc_i 84), 53195#(<= proc_i 88), 53196#(<= proc_i 92), 53197#(<= proc_i 96), 53198#(<= proc_i 100), 53199#(<= proc_i 104), 53200#(<= proc_i 108), 53201#(<= proc_i 112), 53202#(<= proc_i 116), 53203#(<= proc_i 120), 53204#(<= proc_i 124), 53205#(<= proc_i 128), 53206#(<= proc_i 132), 53207#(<= proc_i 136), 53208#(<= proc_i 140), 53209#(<= proc_i 144), 53210#(<= proc_i 148), 53211#(<= proc_i 152), 53212#(<= proc_i 156), 53213#(<= proc_i 160), 53214#(<= proc_i 164), 53215#(<= proc_i 168), 53216#(<= proc_i 172), 53217#(<= proc_i 176), 53218#(<= proc_i 180), 53219#(<= proc_i 184), 53220#(<= proc_i 188), 53221#(<= proc_i 192), 53222#(<= proc_i 196), 53223#(<= proc_i 200), 53224#(<= proc_i 204), 53225#(<= proc_i 208), 53226#(<= proc_i 212), 53227#(<= proc_i 216), 53228#(<= proc_i 220), 53229#(<= proc_i 224), 53230#(<= proc_i 228), 53231#(<= proc_i 232), 53232#(<= proc_i 236), 53233#(<= proc_i 240), 53234#(<= proc_i 244), 53235#(<= proc_i 248), 53236#(<= proc_i 252), 53237#(<= proc_i 256), 53238#(<= proc_i 260), 53239#(<= proc_i 264), 53240#(<= proc_i 268), 53241#(<= proc_i 272), 53242#(<= proc_i 276), 53243#(<= proc_i 280), 53244#(<= proc_i 284), 53245#(<= proc_i 288), 53246#(<= proc_i 292), 53247#(<= proc_i 296)] [2018-07-23 13:52:09,304 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:09,304 INFO L450 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-23 13:52:09,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-23 13:52:09,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-07-23 13:52:09,305 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 109 states. [2018-07-23 13:52:09,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:09,405 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-07-23 13:52:09,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-23 13:52:09,405 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 215 [2018-07-23 13:52:09,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:09,405 INFO L225 Difference]: With dead ends: 219 [2018-07-23 13:52:09,406 INFO L226 Difference]: Without dead ends: 218 [2018-07-23 13:52:09,406 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-07-23 13:52:09,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-07-23 13:52:09,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-07-23 13:52:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-07-23 13:52:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-07-23 13:52:09,410 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 215 [2018-07-23 13:52:09,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:09,411 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-07-23 13:52:09,411 INFO L472 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-23 13:52:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-07-23 13:52:09,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-07-23 13:52:09,412 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:09,412 INFO L357 BasicCegarLoop]: trace histogram [108, 107, 1, 1] [2018-07-23 13:52:09,412 INFO L414 AbstractCegarLoop]: === Iteration 108 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:09,412 INFO L82 PathProgramCache]: Analyzing trace with hash -129849098, now seen corresponding path program 107 times [2018-07-23 13:52:09,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:09,771 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:09,772 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:09,772 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-23 13:52:09,772 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:09,772 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:52:09,773 INFO L185 omatonBuilderFactory]: Interpolants [54154#true, 54155#false, 54156#(<= proc_i 0), 54157#(<= proc_i 4), 54158#(<= proc_i 8), 54159#(<= proc_i 12), 54160#(<= proc_i 16), 54161#(<= proc_i 20), 54162#(<= proc_i 24), 54163#(<= proc_i 28), 54164#(<= proc_i 32), 54165#(<= proc_i 36), 54166#(<= proc_i 40), 54167#(<= proc_i 44), 54168#(<= proc_i 48), 54169#(<= proc_i 52), 54170#(<= proc_i 56), 54171#(<= proc_i 60), 54172#(<= proc_i 64), 54173#(<= proc_i 68), 54174#(<= proc_i 72), 54175#(<= proc_i 76), 54176#(<= proc_i 80), 54177#(<= proc_i 84), 54178#(<= proc_i 88), 54179#(<= proc_i 92), 54180#(<= proc_i 96), 54181#(<= proc_i 100), 54182#(<= proc_i 104), 54183#(<= proc_i 108), 54184#(<= proc_i 112), 54185#(<= proc_i 116), 54186#(<= proc_i 120), 54187#(<= proc_i 124), 54188#(<= proc_i 128), 54189#(<= proc_i 132), 54190#(<= proc_i 136), 54191#(<= proc_i 140), 54192#(<= proc_i 144), 54193#(<= proc_i 148), 54194#(<= proc_i 152), 54195#(<= proc_i 156), 54196#(<= proc_i 160), 54197#(<= proc_i 164), 54198#(<= proc_i 168), 54199#(<= proc_i 172), 54200#(<= proc_i 176), 54201#(<= proc_i 180), 54202#(<= proc_i 184), 54203#(<= proc_i 188), 54204#(<= proc_i 192), 54205#(<= proc_i 196), 54206#(<= proc_i 200), 54207#(<= proc_i 204), 54208#(<= proc_i 208), 54209#(<= proc_i 212), 54210#(<= proc_i 216), 54211#(<= proc_i 220), 54212#(<= proc_i 224), 54213#(<= proc_i 228), 54214#(<= proc_i 232), 54215#(<= proc_i 236), 54216#(<= proc_i 240), 54217#(<= proc_i 244), 54218#(<= proc_i 248), 54219#(<= proc_i 252), 54220#(<= proc_i 256), 54221#(<= proc_i 260), 54222#(<= proc_i 264), 54223#(<= proc_i 268), 54224#(<= proc_i 272), 54225#(<= proc_i 276), 54226#(<= proc_i 280), 54227#(<= proc_i 284), 54228#(<= proc_i 288), 54229#(<= proc_i 292), 54230#(<= proc_i 296), 54231#(<= proc_i 300), 54232#(<= proc_i 304), 54233#(<= proc_i 308), 54234#(<= proc_i 312), 54235#(<= proc_i 316), 54236#(<= proc_i 320), 54237#(<= proc_i 324), 54238#(<= proc_i 328), 54239#(<= proc_i 332), 54240#(<= proc_i 336), 54241#(<= proc_i 340), 54242#(<= proc_i 344), 54243#(<= proc_i 348), 54244#(<= proc_i 352), 54245#(<= proc_i 356), 54246#(<= proc_i 360), 54247#(<= proc_i 364), 54248#(<= proc_i 368), 54249#(<= proc_i 372), 54250#(<= proc_i 376), 54251#(<= proc_i 380), 54252#(<= proc_i 384), 54253#(<= proc_i 388), 54254#(<= proc_i 392), 54255#(<= proc_i 396), 54256#(<= proc_i 400), 54257#(<= proc_i 404), 54258#(<= proc_i 408), 54259#(<= proc_i 412), 54260#(<= proc_i 416), 54261#(<= proc_i 420), 54262#(<= proc_i 424), 54263#(<= proc_i 428)] [2018-07-23 13:52:09,773 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:09,773 INFO L450 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-23 13:52:09,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-23 13:52:09,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-07-23 13:52:09,775 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 110 states. [2018-07-23 13:52:10,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:10,014 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-07-23 13:52:10,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-23 13:52:10,014 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 217 [2018-07-23 13:52:10,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:10,014 INFO L225 Difference]: With dead ends: 221 [2018-07-23 13:52:10,015 INFO L226 Difference]: Without dead ends: 220 [2018-07-23 13:52:10,015 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-07-23 13:52:10,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-07-23 13:52:10,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-07-23 13:52:10,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-07-23 13:52:10,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-07-23 13:52:10,020 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 217 [2018-07-23 13:52:10,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:10,020 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-07-23 13:52:10,020 INFO L472 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-23 13:52:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-07-23 13:52:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-07-23 13:52:10,021 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:10,021 INFO L357 BasicCegarLoop]: trace histogram [109, 108, 1, 1] [2018-07-23 13:52:10,022 INFO L414 AbstractCegarLoop]: === Iteration 109 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:10,022 INFO L82 PathProgramCache]: Analyzing trace with hash -230930504, now seen corresponding path program 108 times [2018-07-23 13:52:10,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:10,380 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:10,380 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-23 13:52:10,380 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:10,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:52:10,381 INFO L185 omatonBuilderFactory]: Interpolants [55146#true, 55147#false, 55148#(<= proc_i 0), 55149#(<= proc_i 4), 55150#(<= proc_i 8), 55151#(<= proc_i 12), 55152#(<= proc_i 16), 55153#(<= proc_i 20), 55154#(<= proc_i 24), 55155#(<= proc_i 28), 55156#(<= proc_i 32), 55157#(<= proc_i 36), 55158#(<= proc_i 40), 55159#(<= proc_i 44), 55160#(<= proc_i 48), 55161#(<= proc_i 52), 55162#(<= proc_i 56), 55163#(<= proc_i 60), 55164#(<= proc_i 64), 55165#(<= proc_i 68), 55166#(<= proc_i 72), 55167#(<= proc_i 76), 55168#(<= proc_i 80), 55169#(<= proc_i 84), 55170#(<= proc_i 88), 55171#(<= proc_i 92), 55172#(<= proc_i 96), 55173#(<= proc_i 100), 55174#(<= proc_i 104), 55175#(<= proc_i 108), 55176#(<= proc_i 112), 55177#(<= proc_i 116), 55178#(<= proc_i 120), 55179#(<= proc_i 124), 55180#(<= proc_i 128), 55181#(<= proc_i 132), 55182#(<= proc_i 136), 55183#(<= proc_i 140), 55184#(<= proc_i 144), 55185#(<= proc_i 148), 55186#(<= proc_i 152), 55187#(<= proc_i 156), 55188#(<= proc_i 160), 55189#(<= proc_i 164), 55190#(<= proc_i 168), 55191#(<= proc_i 172), 55192#(<= proc_i 176), 55193#(<= proc_i 180), 55194#(<= proc_i 184), 55195#(<= proc_i 188), 55196#(<= proc_i 192), 55197#(<= proc_i 196), 55198#(<= proc_i 200), 55199#(<= proc_i 204), 55200#(<= proc_i 208), 55201#(<= proc_i 212), 55202#(<= proc_i 216), 55203#(<= proc_i 220), 55204#(<= proc_i 224), 55205#(<= proc_i 228), 55206#(<= proc_i 232), 55207#(<= proc_i 236), 55208#(<= proc_i 240), 55209#(<= proc_i 244), 55210#(<= proc_i 248), 55211#(<= proc_i 252), 55212#(<= proc_i 256), 55213#(<= proc_i 260), 55214#(<= proc_i 264), 55215#(<= proc_i 268), 55216#(<= proc_i 272), 55217#(<= proc_i 276), 55218#(<= proc_i 280), 55219#(<= proc_i 284), 55220#(<= proc_i 288), 55221#(<= proc_i 292), 55222#(<= proc_i 296), 55223#(<= proc_i 300), 55224#(<= proc_i 304), 55225#(<= proc_i 308), 55226#(<= proc_i 312), 55227#(<= proc_i 316), 55228#(<= proc_i 320), 55229#(<= proc_i 324), 55230#(<= proc_i 328), 55231#(<= proc_i 332), 55232#(<= proc_i 336), 55233#(<= proc_i 340), 55234#(<= proc_i 344), 55235#(<= proc_i 348), 55236#(<= proc_i 352), 55237#(<= proc_i 356), 55238#(<= proc_i 360), 55239#(<= proc_i 364), 55240#(<= proc_i 368), 55241#(<= proc_i 372), 55242#(<= proc_i 376), 55243#(<= proc_i 380), 55244#(<= proc_i 384), 55245#(<= proc_i 388), 55246#(<= proc_i 392), 55247#(<= proc_i 396), 55248#(<= proc_i 400), 55249#(<= proc_i 404), 55250#(<= proc_i 408), 55251#(<= proc_i 412), 55252#(<= proc_i 416), 55253#(<= proc_i 420), 55254#(<= proc_i 424), 55255#(<= proc_i 428), 55256#(<= proc_i 432)] [2018-07-23 13:52:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:10,381 INFO L450 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-23 13:52:10,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-23 13:52:10,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-07-23 13:52:10,383 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 111 states. [2018-07-23 13:52:10,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:10,575 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-07-23 13:52:10,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-23 13:52:10,575 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 219 [2018-07-23 13:52:10,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:10,576 INFO L225 Difference]: With dead ends: 223 [2018-07-23 13:52:10,576 INFO L226 Difference]: Without dead ends: 222 [2018-07-23 13:52:10,577 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-07-23 13:52:10,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-07-23 13:52:10,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-07-23 13:52:10,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-07-23 13:52:10,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-07-23 13:52:10,581 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 219 [2018-07-23 13:52:10,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:10,581 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-07-23 13:52:10,581 INFO L472 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-23 13:52:10,581 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-07-23 13:52:10,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-07-23 13:52:10,582 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:10,582 INFO L357 BasicCegarLoop]: trace histogram [110, 109, 1, 1] [2018-07-23 13:52:10,582 INFO L414 AbstractCegarLoop]: === Iteration 110 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:10,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1414086138, now seen corresponding path program 109 times [2018-07-23 13:52:10,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:10,955 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:10,956 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:10,956 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-23 13:52:10,956 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:10,956 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:52:10,956 INFO L185 omatonBuilderFactory]: Interpolants [56147#true, 56148#false, 56149#(<= proc_i 0), 56150#(<= proc_i 4), 56151#(<= proc_i 8), 56152#(<= proc_i 12), 56153#(<= proc_i 16), 56154#(<= proc_i 20), 56155#(<= proc_i 24), 56156#(<= proc_i 28), 56157#(<= proc_i 32), 56158#(<= proc_i 36), 56159#(<= proc_i 40), 56160#(<= proc_i 44), 56161#(<= proc_i 48), 56162#(<= proc_i 52), 56163#(<= proc_i 56), 56164#(<= proc_i 60), 56165#(<= proc_i 64), 56166#(<= proc_i 68), 56167#(<= proc_i 72), 56168#(<= proc_i 76), 56169#(<= proc_i 80), 56170#(<= proc_i 84), 56171#(<= proc_i 88), 56172#(<= proc_i 92), 56173#(<= proc_i 96), 56174#(<= proc_i 100), 56175#(<= proc_i 104), 56176#(<= proc_i 108), 56177#(<= proc_i 112), 56178#(<= proc_i 116), 56179#(<= proc_i 120), 56180#(<= proc_i 124), 56181#(<= proc_i 128), 56182#(<= proc_i 132), 56183#(<= proc_i 136), 56184#(<= proc_i 140), 56185#(<= proc_i 144), 56186#(<= proc_i 148), 56187#(<= proc_i 152), 56188#(<= proc_i 156), 56189#(<= proc_i 160), 56190#(<= proc_i 164), 56191#(<= proc_i 168), 56192#(<= proc_i 172), 56193#(<= proc_i 176), 56194#(<= proc_i 180), 56195#(<= proc_i 184), 56196#(<= proc_i 188), 56197#(<= proc_i 192), 56198#(<= proc_i 196), 56199#(<= proc_i 200), 56200#(<= proc_i 204), 56201#(<= proc_i 208), 56202#(<= proc_i 212), 56203#(<= proc_i 216), 56204#(<= proc_i 220), 56205#(<= proc_i 224), 56206#(<= proc_i 228), 56207#(<= proc_i 232), 56208#(<= proc_i 236), 56209#(<= proc_i 240), 56210#(<= proc_i 244), 56211#(<= proc_i 248), 56212#(<= proc_i 252), 56213#(<= proc_i 256), 56214#(<= proc_i 260), 56215#(<= proc_i 264), 56216#(<= proc_i 268), 56217#(<= proc_i 272), 56218#(<= proc_i 276), 56219#(<= proc_i 280), 56220#(<= proc_i 284), 56221#(<= proc_i 288), 56222#(<= proc_i 292), 56223#(<= proc_i 296), 56224#(<= proc_i 300), 56225#(<= proc_i 304), 56226#(<= proc_i 308), 56227#(<= proc_i 312), 56228#(<= proc_i 316), 56229#(<= proc_i 320), 56230#(<= proc_i 324), 56231#(<= proc_i 328), 56232#(<= proc_i 332), 56233#(<= proc_i 336), 56234#(<= proc_i 340), 56235#(<= proc_i 344), 56236#(<= proc_i 348), 56237#(<= proc_i 352), 56238#(<= proc_i 356), 56239#(<= proc_i 360), 56240#(<= proc_i 364), 56241#(<= proc_i 368), 56242#(<= proc_i 372), 56243#(<= proc_i 376), 56244#(<= proc_i 380), 56245#(<= proc_i 384), 56246#(<= proc_i 388), 56247#(<= proc_i 392), 56248#(<= proc_i 396), 56249#(<= proc_i 400), 56250#(<= proc_i 404), 56251#(<= proc_i 408), 56252#(<= proc_i 412), 56253#(<= proc_i 416), 56254#(<= proc_i 420), 56255#(<= proc_i 424), 56256#(<= proc_i 428), 56257#(<= proc_i 432), 56258#(<= proc_i 436)] [2018-07-23 13:52:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:10,957 INFO L450 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-23 13:52:10,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-23 13:52:10,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-07-23 13:52:10,958 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 112 states. [2018-07-23 13:52:11,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:11,106 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-07-23 13:52:11,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-23 13:52:11,106 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 221 [2018-07-23 13:52:11,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:11,107 INFO L225 Difference]: With dead ends: 225 [2018-07-23 13:52:11,107 INFO L226 Difference]: Without dead ends: 224 [2018-07-23 13:52:11,108 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-07-23 13:52:11,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-07-23 13:52:11,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-07-23 13:52:11,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-07-23 13:52:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2018-07-23 13:52:11,112 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 221 [2018-07-23 13:52:11,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:11,113 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2018-07-23 13:52:11,113 INFO L472 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-23 13:52:11,113 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2018-07-23 13:52:11,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-07-23 13:52:11,114 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:11,114 INFO L357 BasicCegarLoop]: trace histogram [111, 110, 1, 1] [2018-07-23 13:52:11,114 INFO L414 AbstractCegarLoop]: === Iteration 111 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:11,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1727114172, now seen corresponding path program 110 times [2018-07-23 13:52:11,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:11,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:11,470 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:11,470 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-23 13:52:11,470 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:11,470 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:52:11,470 INFO L185 omatonBuilderFactory]: Interpolants [57157#true, 57158#false, 57159#(<= proc_i 0), 57160#(<= proc_i 4), 57161#(<= proc_i 8), 57162#(<= proc_i 12), 57163#(<= proc_i 16), 57164#(<= proc_i 20), 57165#(<= proc_i 24), 57166#(<= proc_i 28), 57167#(<= proc_i 32), 57168#(<= proc_i 36), 57169#(<= proc_i 40), 57170#(<= proc_i 44), 57171#(<= proc_i 48), 57172#(<= proc_i 52), 57173#(<= proc_i 56), 57174#(<= proc_i 60), 57175#(<= proc_i 64), 57176#(<= proc_i 68), 57177#(<= proc_i 72), 57178#(<= proc_i 76), 57179#(<= proc_i 80), 57180#(<= proc_i 84), 57181#(<= proc_i 88), 57182#(<= proc_i 92), 57183#(<= proc_i 96), 57184#(<= proc_i 100), 57185#(<= proc_i 104), 57186#(<= proc_i 108), 57187#(<= proc_i 112), 57188#(<= proc_i 116), 57189#(<= proc_i 120), 57190#(<= proc_i 124), 57191#(<= proc_i 128), 57192#(<= proc_i 132), 57193#(<= proc_i 136), 57194#(<= proc_i 140), 57195#(<= proc_i 144), 57196#(<= proc_i 148), 57197#(<= proc_i 152), 57198#(<= proc_i 156), 57199#(<= proc_i 160), 57200#(<= proc_i 164), 57201#(<= proc_i 168), 57202#(<= proc_i 172), 57203#(<= proc_i 176), 57204#(<= proc_i 180), 57205#(<= proc_i 184), 57206#(<= proc_i 188), 57207#(<= proc_i 192), 57208#(<= proc_i 196), 57209#(<= proc_i 200), 57210#(<= proc_i 204), 57211#(<= proc_i 208), 57212#(<= proc_i 212), 57213#(<= proc_i 216), 57214#(<= proc_i 220), 57215#(<= proc_i 224), 57216#(<= proc_i 228), 57217#(<= proc_i 232), 57218#(<= proc_i 236), 57219#(<= proc_i 240), 57220#(<= proc_i 244), 57221#(<= proc_i 248), 57222#(<= proc_i 252), 57223#(<= proc_i 256), 57224#(<= proc_i 260), 57225#(<= proc_i 264), 57226#(<= proc_i 268), 57227#(<= proc_i 272), 57228#(<= proc_i 276), 57229#(<= proc_i 280), 57230#(<= proc_i 284), 57231#(<= proc_i 288), 57232#(<= proc_i 292), 57233#(<= proc_i 296), 57234#(<= proc_i 300), 57235#(<= proc_i 304), 57236#(<= proc_i 308), 57237#(<= proc_i 312), 57238#(<= proc_i 316), 57239#(<= proc_i 320), 57240#(<= proc_i 324), 57241#(<= proc_i 328), 57242#(<= proc_i 332), 57243#(<= proc_i 336), 57244#(<= proc_i 340), 57245#(<= proc_i 344), 57246#(<= proc_i 348), 57247#(<= proc_i 352), 57248#(<= proc_i 356), 57249#(<= proc_i 360), 57250#(<= proc_i 364), 57251#(<= proc_i 368), 57252#(<= proc_i 372), 57253#(<= proc_i 376), 57254#(<= proc_i 380), 57255#(<= proc_i 384), 57256#(<= proc_i 388), 57257#(<= proc_i 392), 57258#(<= proc_i 396), 57259#(<= proc_i 400), 57260#(<= proc_i 404), 57261#(<= proc_i 408), 57262#(<= proc_i 412), 57263#(<= proc_i 416), 57264#(<= proc_i 420), 57265#(<= proc_i 424), 57266#(<= proc_i 428), 57267#(<= proc_i 432), 57268#(<= proc_i 436), 57269#(<= proc_i 440)] [2018-07-23 13:52:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:11,471 INFO L450 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-23 13:52:11,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-23 13:52:11,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-07-23 13:52:11,473 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 113 states. [2018-07-23 13:52:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:11,612 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-07-23 13:52:11,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-23 13:52:11,612 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 223 [2018-07-23 13:52:11,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:11,613 INFO L225 Difference]: With dead ends: 227 [2018-07-23 13:52:11,613 INFO L226 Difference]: Without dead ends: 226 [2018-07-23 13:52:11,614 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-07-23 13:52:11,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-07-23 13:52:11,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-07-23 13:52:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-07-23 13:52:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-07-23 13:52:11,618 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 223 [2018-07-23 13:52:11,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:11,618 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-07-23 13:52:11,618 INFO L472 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-23 13:52:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-07-23 13:52:11,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-07-23 13:52:11,619 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:11,620 INFO L357 BasicCegarLoop]: trace histogram [112, 111, 1, 1] [2018-07-23 13:52:11,620 INFO L414 AbstractCegarLoop]: === Iteration 112 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:11,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1899344126, now seen corresponding path program 111 times [2018-07-23 13:52:11,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:11,990 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:11,991 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-23 13:52:11,991 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:11,991 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:52:11,991 INFO L185 omatonBuilderFactory]: Interpolants [58176#true, 58177#false, 58178#(<= proc_i 0), 58179#(<= proc_i 4), 58180#(<= proc_i 8), 58181#(<= proc_i 12), 58182#(<= proc_i 16), 58183#(<= proc_i 20), 58184#(<= proc_i 24), 58185#(<= proc_i 28), 58186#(<= proc_i 32), 58187#(<= proc_i 36), 58188#(<= proc_i 40), 58189#(<= proc_i 44), 58190#(<= proc_i 48), 58191#(<= proc_i 52), 58192#(<= proc_i 56), 58193#(<= proc_i 60), 58194#(<= proc_i 64), 58195#(<= proc_i 68), 58196#(<= proc_i 72), 58197#(<= proc_i 76), 58198#(<= proc_i 80), 58199#(<= proc_i 84), 58200#(<= proc_i 88), 58201#(<= proc_i 92), 58202#(<= proc_i 96), 58203#(<= proc_i 100), 58204#(<= proc_i 104), 58205#(<= proc_i 108), 58206#(<= proc_i 112), 58207#(<= proc_i 116), 58208#(<= proc_i 120), 58209#(<= proc_i 124), 58210#(<= proc_i 128), 58211#(<= proc_i 132), 58212#(<= proc_i 136), 58213#(<= proc_i 140), 58214#(<= proc_i 144), 58215#(<= proc_i 148), 58216#(<= proc_i 152), 58217#(<= proc_i 156), 58218#(<= proc_i 160), 58219#(<= proc_i 164), 58220#(<= proc_i 168), 58221#(<= proc_i 172), 58222#(<= proc_i 176), 58223#(<= proc_i 180), 58224#(<= proc_i 184), 58225#(<= proc_i 188), 58226#(<= proc_i 192), 58227#(<= proc_i 196), 58228#(<= proc_i 200), 58229#(<= proc_i 204), 58230#(<= proc_i 208), 58231#(<= proc_i 212), 58232#(<= proc_i 216), 58233#(<= proc_i 220), 58234#(<= proc_i 224), 58235#(<= proc_i 228), 58236#(<= proc_i 232), 58237#(<= proc_i 236), 58238#(<= proc_i 240), 58239#(<= proc_i 244), 58240#(<= proc_i 248), 58241#(<= proc_i 252), 58242#(<= proc_i 256), 58243#(<= proc_i 260), 58244#(<= proc_i 264), 58245#(<= proc_i 268), 58246#(<= proc_i 272), 58247#(<= proc_i 276), 58248#(<= proc_i 280), 58249#(<= proc_i 284), 58250#(<= proc_i 288), 58251#(<= proc_i 292), 58252#(<= proc_i 296), 58253#(<= proc_i 300), 58254#(<= proc_i 304), 58255#(<= proc_i 308), 58256#(<= proc_i 312), 58257#(<= proc_i 316), 58258#(<= proc_i 320), 58259#(<= proc_i 324), 58260#(<= proc_i 328), 58261#(<= proc_i 332), 58262#(<= proc_i 336), 58263#(<= proc_i 340), 58264#(<= proc_i 344), 58265#(<= proc_i 348), 58266#(<= proc_i 352), 58267#(<= proc_i 356), 58268#(<= proc_i 360), 58269#(<= proc_i 364), 58270#(<= proc_i 368), 58271#(<= proc_i 372), 58272#(<= proc_i 376), 58273#(<= proc_i 380), 58274#(<= proc_i 384), 58275#(<= proc_i 388), 58276#(<= proc_i 392), 58277#(<= proc_i 396), 58278#(<= proc_i 400), 58279#(<= proc_i 404), 58280#(<= proc_i 408), 58281#(<= proc_i 412), 58282#(<= proc_i 416), 58283#(<= proc_i 420), 58284#(<= proc_i 424), 58285#(<= proc_i 428), 58286#(<= proc_i 432), 58287#(<= proc_i 436), 58288#(<= proc_i 440), 58289#(<= proc_i 444)] [2018-07-23 13:52:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:11,992 INFO L450 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-23 13:52:11,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-23 13:52:11,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-07-23 13:52:11,994 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 114 states. [2018-07-23 13:52:12,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:12,146 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-07-23 13:52:12,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-23 13:52:12,146 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 225 [2018-07-23 13:52:12,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:12,147 INFO L225 Difference]: With dead ends: 229 [2018-07-23 13:52:12,147 INFO L226 Difference]: Without dead ends: 228 [2018-07-23 13:52:12,148 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-07-23 13:52:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-07-23 13:52:12,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-07-23 13:52:12,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-07-23 13:52:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-07-23 13:52:12,153 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 225 [2018-07-23 13:52:12,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:12,153 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-07-23 13:52:12,153 INFO L472 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-23 13:52:12,154 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-07-23 13:52:12,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-07-23 13:52:12,155 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:12,155 INFO L357 BasicCegarLoop]: trace histogram [113, 112, 1, 1] [2018-07-23 13:52:12,155 INFO L414 AbstractCegarLoop]: === Iteration 113 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:12,155 INFO L82 PathProgramCache]: Analyzing trace with hash -91394624, now seen corresponding path program 112 times [2018-07-23 13:52:12,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:12,782 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:12,782 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:12,782 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-23 13:52:12,782 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:12,783 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:52:12,783 INFO L185 omatonBuilderFactory]: Interpolants [59204#true, 59205#false, 59206#(<= proc_i 0), 59207#(<= proc_i 4), 59208#(<= proc_i 8), 59209#(<= proc_i 12), 59210#(<= proc_i 16), 59211#(<= proc_i 20), 59212#(<= proc_i 24), 59213#(<= proc_i 28), 59214#(<= proc_i 32), 59215#(<= proc_i 36), 59216#(<= proc_i 40), 59217#(<= proc_i 44), 59218#(<= proc_i 48), 59219#(<= proc_i 52), 59220#(<= proc_i 56), 59221#(<= proc_i 60), 59222#(<= proc_i 64), 59223#(<= proc_i 68), 59224#(<= proc_i 72), 59225#(<= proc_i 76), 59226#(<= proc_i 80), 59227#(<= proc_i 84), 59228#(<= proc_i 88), 59229#(<= proc_i 92), 59230#(<= proc_i 96), 59231#(<= proc_i 100), 59232#(<= proc_i 104), 59233#(<= proc_i 108), 59234#(<= proc_i 112), 59235#(<= proc_i 116), 59236#(<= proc_i 120), 59237#(<= proc_i 124), 59238#(<= proc_i 128), 59239#(<= proc_i 132), 59240#(<= proc_i 136), 59241#(<= proc_i 140), 59242#(<= proc_i 144), 59243#(<= proc_i 148), 59244#(<= proc_i 152), 59245#(<= proc_i 156), 59246#(<= proc_i 160), 59247#(<= proc_i 164), 59248#(<= proc_i 168), 59249#(<= proc_i 172), 59250#(<= proc_i 176), 59251#(<= proc_i 180), 59252#(<= proc_i 184), 59253#(<= proc_i 188), 59254#(<= proc_i 192), 59255#(<= proc_i 196), 59256#(<= proc_i 200), 59257#(<= proc_i 204), 59258#(<= proc_i 208), 59259#(<= proc_i 212), 59260#(<= proc_i 216), 59261#(<= proc_i 220), 59262#(<= proc_i 224), 59263#(<= proc_i 228), 59264#(<= proc_i 232), 59265#(<= proc_i 236), 59266#(<= proc_i 240), 59267#(<= proc_i 244), 59268#(<= proc_i 248), 59269#(<= proc_i 252), 59270#(<= proc_i 256), 59271#(<= proc_i 260), 59272#(<= proc_i 264), 59273#(<= proc_i 268), 59274#(<= proc_i 272), 59275#(<= proc_i 276), 59276#(<= proc_i 280), 59277#(<= proc_i 284), 59278#(<= proc_i 288), 59279#(<= proc_i 292), 59280#(<= proc_i 296), 59281#(<= proc_i 300), 59282#(<= proc_i 304), 59283#(<= proc_i 308), 59284#(<= proc_i 312), 59285#(<= proc_i 316), 59286#(<= proc_i 320), 59287#(<= proc_i 324), 59288#(<= proc_i 328), 59289#(<= proc_i 332), 59290#(<= proc_i 336), 59291#(<= proc_i 340), 59292#(<= proc_i 344), 59293#(<= proc_i 348), 59294#(<= proc_i 352), 59295#(<= proc_i 356), 59296#(<= proc_i 360), 59297#(<= proc_i 364), 59298#(<= proc_i 368), 59299#(<= proc_i 372), 59300#(<= proc_i 376), 59301#(<= proc_i 380), 59302#(<= proc_i 384), 59303#(<= proc_i 388), 59304#(<= proc_i 392), 59305#(<= proc_i 396), 59306#(<= proc_i 400), 59307#(<= proc_i 404), 59308#(<= proc_i 408), 59309#(<= proc_i 412), 59310#(<= proc_i 416), 59311#(<= proc_i 420), 59312#(<= proc_i 424), 59313#(<= proc_i 428), 59314#(<= proc_i 432), 59315#(<= proc_i 436), 59316#(<= proc_i 440), 59317#(<= proc_i 444), 59318#(<= proc_i 448)] [2018-07-23 13:52:12,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:12,785 INFO L450 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-23 13:52:12,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-23 13:52:12,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-07-23 13:52:12,787 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 115 states. [2018-07-23 13:52:13,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:13,107 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-07-23 13:52:13,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-23 13:52:13,107 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 227 [2018-07-23 13:52:13,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:13,108 INFO L225 Difference]: With dead ends: 231 [2018-07-23 13:52:13,108 INFO L226 Difference]: Without dead ends: 230 [2018-07-23 13:52:13,109 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-07-23 13:52:13,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-07-23 13:52:13,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2018-07-23 13:52:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-07-23 13:52:13,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-07-23 13:52:13,114 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 227 [2018-07-23 13:52:13,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:13,115 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-07-23 13:52:13,115 INFO L472 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-23 13:52:13,115 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-07-23 13:52:13,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-07-23 13:52:13,116 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:13,116 INFO L357 BasicCegarLoop]: trace histogram [114, 113, 1, 1] [2018-07-23 13:52:13,116 INFO L414 AbstractCegarLoop]: === Iteration 114 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:13,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1930886654, now seen corresponding path program 113 times [2018-07-23 13:52:13,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:13,579 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:13,579 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-23 13:52:13,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:13,580 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:52:13,580 INFO L185 omatonBuilderFactory]: Interpolants [60241#true, 60242#false, 60243#(<= proc_i 0), 60244#(<= proc_i 4), 60245#(<= proc_i 8), 60246#(<= proc_i 12), 60247#(<= proc_i 16), 60248#(<= proc_i 20), 60249#(<= proc_i 24), 60250#(<= proc_i 28), 60251#(<= proc_i 32), 60252#(<= proc_i 36), 60253#(<= proc_i 40), 60254#(<= proc_i 44), 60255#(<= proc_i 48), 60256#(<= proc_i 52), 60257#(<= proc_i 56), 60258#(<= proc_i 60), 60259#(<= proc_i 64), 60260#(<= proc_i 68), 60261#(<= proc_i 72), 60262#(<= proc_i 76), 60263#(<= proc_i 80), 60264#(<= proc_i 84), 60265#(<= proc_i 88), 60266#(<= proc_i 92), 60267#(<= proc_i 96), 60268#(<= proc_i 100), 60269#(<= proc_i 104), 60270#(<= proc_i 108), 60271#(<= proc_i 112), 60272#(<= proc_i 116), 60273#(<= proc_i 120), 60274#(<= proc_i 124), 60275#(<= proc_i 128), 60276#(<= proc_i 132), 60277#(<= proc_i 136), 60278#(<= proc_i 140), 60279#(<= proc_i 144), 60280#(<= proc_i 148), 60281#(<= proc_i 152), 60282#(<= proc_i 156), 60283#(<= proc_i 160), 60284#(<= proc_i 164), 60285#(<= proc_i 168), 60286#(<= proc_i 172), 60287#(<= proc_i 176), 60288#(<= proc_i 180), 60289#(<= proc_i 184), 60290#(<= proc_i 188), 60291#(<= proc_i 192), 60292#(<= proc_i 196), 60293#(<= proc_i 200), 60294#(<= proc_i 204), 60295#(<= proc_i 208), 60296#(<= proc_i 212), 60297#(<= proc_i 216), 60298#(<= proc_i 220), 60299#(<= proc_i 224), 60300#(<= proc_i 228), 60301#(<= proc_i 232), 60302#(<= proc_i 236), 60303#(<= proc_i 240), 60304#(<= proc_i 244), 60305#(<= proc_i 248), 60306#(<= proc_i 252), 60307#(<= proc_i 256), 60308#(<= proc_i 260), 60309#(<= proc_i 264), 60310#(<= proc_i 268), 60311#(<= proc_i 272), 60312#(<= proc_i 276), 60313#(<= proc_i 280), 60314#(<= proc_i 284), 60315#(<= proc_i 288), 60316#(<= proc_i 292), 60317#(<= proc_i 296), 60318#(<= proc_i 300), 60319#(<= proc_i 304), 60320#(<= proc_i 308), 60321#(<= proc_i 312), 60322#(<= proc_i 316), 60323#(<= proc_i 320), 60324#(<= proc_i 324), 60325#(<= proc_i 328), 60326#(<= proc_i 332), 60327#(<= proc_i 336), 60328#(<= proc_i 340), 60329#(<= proc_i 344), 60330#(<= proc_i 348), 60331#(<= proc_i 352), 60332#(<= proc_i 356), 60333#(<= proc_i 360), 60334#(<= proc_i 364), 60335#(<= proc_i 368), 60336#(<= proc_i 372), 60337#(<= proc_i 376), 60338#(<= proc_i 380), 60339#(<= proc_i 384), 60340#(<= proc_i 388), 60341#(<= proc_i 392), 60342#(<= proc_i 396), 60343#(<= proc_i 400), 60344#(<= proc_i 404), 60345#(<= proc_i 408), 60346#(<= proc_i 412), 60347#(<= proc_i 416), 60348#(<= proc_i 420), 60349#(<= proc_i 424), 60350#(<= proc_i 428), 60351#(<= proc_i 432), 60352#(<= proc_i 436), 60353#(<= proc_i 440), 60354#(<= proc_i 444), 60355#(<= proc_i 448), 60356#(<= proc_i 452)] [2018-07-23 13:52:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:13,581 INFO L450 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-23 13:52:13,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-23 13:52:13,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-07-23 13:52:13,582 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 116 states. [2018-07-23 13:52:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:13,749 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-07-23 13:52:13,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-23 13:52:13,749 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 229 [2018-07-23 13:52:13,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:13,750 INFO L225 Difference]: With dead ends: 233 [2018-07-23 13:52:13,750 INFO L226 Difference]: Without dead ends: 232 [2018-07-23 13:52:13,751 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-07-23 13:52:13,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-07-23 13:52:13,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-07-23 13:52:13,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-07-23 13:52:13,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-07-23 13:52:13,756 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 229 [2018-07-23 13:52:13,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:13,756 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-07-23 13:52:13,756 INFO L472 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-23 13:52:13,756 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-07-23 13:52:13,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-07-23 13:52:13,757 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:13,757 INFO L357 BasicCegarLoop]: trace histogram [115, 114, 1, 1] [2018-07-23 13:52:13,757 INFO L414 AbstractCegarLoop]: === Iteration 115 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:13,758 INFO L82 PathProgramCache]: Analyzing trace with hash -156201532, now seen corresponding path program 114 times [2018-07-23 13:52:13,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:14,189 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:14,189 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:14,189 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-23 13:52:14,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:14,190 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:52:14,190 INFO L185 omatonBuilderFactory]: Interpolants [61287#true, 61288#false, 61289#(<= proc_i 0), 61290#(<= proc_i 4), 61291#(<= proc_i 8), 61292#(<= proc_i 12), 61293#(<= proc_i 16), 61294#(<= proc_i 20), 61295#(<= proc_i 24), 61296#(<= proc_i 28), 61297#(<= proc_i 32), 61298#(<= proc_i 36), 61299#(<= proc_i 40), 61300#(<= proc_i 44), 61301#(<= proc_i 48), 61302#(<= proc_i 52), 61303#(<= proc_i 56), 61304#(<= proc_i 60), 61305#(<= proc_i 64), 61306#(<= proc_i 68), 61307#(<= proc_i 72), 61308#(<= proc_i 76), 61309#(<= proc_i 80), 61310#(<= proc_i 84), 61311#(<= proc_i 88), 61312#(<= proc_i 92), 61313#(<= proc_i 96), 61314#(<= proc_i 100), 61315#(<= proc_i 104), 61316#(<= proc_i 108), 61317#(<= proc_i 112), 61318#(<= proc_i 116), 61319#(<= proc_i 120), 61320#(<= proc_i 124), 61321#(<= proc_i 128), 61322#(<= proc_i 132), 61323#(<= proc_i 136), 61324#(<= proc_i 140), 61325#(<= proc_i 144), 61326#(<= proc_i 148), 61327#(<= proc_i 152), 61328#(<= proc_i 156), 61329#(<= proc_i 160), 61330#(<= proc_i 164), 61331#(<= proc_i 168), 61332#(<= proc_i 172), 61333#(<= proc_i 176), 61334#(<= proc_i 180), 61335#(<= proc_i 184), 61336#(<= proc_i 188), 61337#(<= proc_i 192), 61338#(<= proc_i 196), 61339#(<= proc_i 200), 61340#(<= proc_i 204), 61341#(<= proc_i 208), 61342#(<= proc_i 212), 61343#(<= proc_i 216), 61344#(<= proc_i 220), 61345#(<= proc_i 224), 61346#(<= proc_i 228), 61347#(<= proc_i 232), 61348#(<= proc_i 236), 61349#(<= proc_i 240), 61350#(<= proc_i 244), 61351#(<= proc_i 248), 61352#(<= proc_i 252), 61353#(<= proc_i 256), 61354#(<= proc_i 260), 61355#(<= proc_i 264), 61356#(<= proc_i 268), 61357#(<= proc_i 272), 61358#(<= proc_i 276), 61359#(<= proc_i 280), 61360#(<= proc_i 284), 61361#(<= proc_i 288), 61362#(<= proc_i 292), 61363#(<= proc_i 296), 61364#(<= proc_i 300), 61365#(<= proc_i 304), 61366#(<= proc_i 308), 61367#(<= proc_i 312), 61368#(<= proc_i 316), 61369#(<= proc_i 320), 61370#(<= proc_i 324), 61371#(<= proc_i 328), 61372#(<= proc_i 332), 61373#(<= proc_i 336), 61374#(<= proc_i 340), 61375#(<= proc_i 344), 61376#(<= proc_i 348), 61377#(<= proc_i 352), 61378#(<= proc_i 356), 61379#(<= proc_i 360), 61380#(<= proc_i 364), 61381#(<= proc_i 368), 61382#(<= proc_i 372), 61383#(<= proc_i 376), 61384#(<= proc_i 380), 61385#(<= proc_i 384), 61386#(<= proc_i 388), 61387#(<= proc_i 392), 61388#(<= proc_i 396), 61389#(<= proc_i 400), 61390#(<= proc_i 404), 61391#(<= proc_i 408), 61392#(<= proc_i 412), 61393#(<= proc_i 416), 61394#(<= proc_i 420), 61395#(<= proc_i 424), 61396#(<= proc_i 428), 61397#(<= proc_i 432), 61398#(<= proc_i 436), 61399#(<= proc_i 440), 61400#(<= proc_i 444), 61401#(<= proc_i 448), 61402#(<= proc_i 452), 61403#(<= proc_i 456)] [2018-07-23 13:52:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:14,191 INFO L450 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-23 13:52:14,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-23 13:52:14,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-07-23 13:52:14,193 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 117 states. [2018-07-23 13:52:14,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:14,402 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-07-23 13:52:14,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-23 13:52:14,403 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 231 [2018-07-23 13:52:14,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:14,403 INFO L225 Difference]: With dead ends: 235 [2018-07-23 13:52:14,404 INFO L226 Difference]: Without dead ends: 234 [2018-07-23 13:52:14,405 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-07-23 13:52:14,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-07-23 13:52:14,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-07-23 13:52:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-07-23 13:52:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2018-07-23 13:52:14,409 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 231 [2018-07-23 13:52:14,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:14,410 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2018-07-23 13:52:14,410 INFO L472 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-23 13:52:14,410 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2018-07-23 13:52:14,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-07-23 13:52:14,411 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:14,411 INFO L357 BasicCegarLoop]: trace histogram [116, 115, 1, 1] [2018-07-23 13:52:14,411 INFO L414 AbstractCegarLoop]: === Iteration 116 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:14,411 INFO L82 PathProgramCache]: Analyzing trace with hash 214184198, now seen corresponding path program 115 times [2018-07-23 13:52:14,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:14,953 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:14,953 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-23 13:52:14,954 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:14,954 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:52:14,954 INFO L185 omatonBuilderFactory]: Interpolants [62342#true, 62343#false, 62344#(<= proc_i 0), 62345#(<= proc_i 4), 62346#(<= proc_i 8), 62347#(<= proc_i 12), 62348#(<= proc_i 16), 62349#(<= proc_i 20), 62350#(<= proc_i 24), 62351#(<= proc_i 28), 62352#(<= proc_i 32), 62353#(<= proc_i 36), 62354#(<= proc_i 40), 62355#(<= proc_i 44), 62356#(<= proc_i 48), 62357#(<= proc_i 52), 62358#(<= proc_i 56), 62359#(<= proc_i 60), 62360#(<= proc_i 64), 62361#(<= proc_i 68), 62362#(<= proc_i 72), 62363#(<= proc_i 76), 62364#(<= proc_i 80), 62365#(<= proc_i 84), 62366#(<= proc_i 88), 62367#(<= proc_i 92), 62368#(<= proc_i 96), 62369#(<= proc_i 100), 62370#(<= proc_i 104), 62371#(<= proc_i 108), 62372#(<= proc_i 112), 62373#(<= proc_i 116), 62374#(<= proc_i 120), 62375#(<= proc_i 124), 62376#(<= proc_i 128), 62377#(<= proc_i 132), 62378#(<= proc_i 136), 62379#(<= proc_i 140), 62380#(<= proc_i 144), 62381#(<= proc_i 148), 62382#(<= proc_i 152), 62383#(<= proc_i 156), 62384#(<= proc_i 160), 62385#(<= proc_i 164), 62386#(<= proc_i 168), 62387#(<= proc_i 172), 62388#(<= proc_i 176), 62389#(<= proc_i 180), 62390#(<= proc_i 184), 62391#(<= proc_i 188), 62392#(<= proc_i 192), 62393#(<= proc_i 196), 62394#(<= proc_i 200), 62395#(<= proc_i 204), 62396#(<= proc_i 208), 62397#(<= proc_i 212), 62398#(<= proc_i 216), 62399#(<= proc_i 220), 62400#(<= proc_i 224), 62401#(<= proc_i 228), 62402#(<= proc_i 232), 62403#(<= proc_i 236), 62404#(<= proc_i 240), 62405#(<= proc_i 244), 62406#(<= proc_i 248), 62407#(<= proc_i 252), 62408#(<= proc_i 256), 62409#(<= proc_i 260), 62410#(<= proc_i 264), 62411#(<= proc_i 268), 62412#(<= proc_i 272), 62413#(<= proc_i 276), 62414#(<= proc_i 280), 62415#(<= proc_i 284), 62416#(<= proc_i 288), 62417#(<= proc_i 292), 62418#(<= proc_i 296), 62419#(<= proc_i 300), 62420#(<= proc_i 304), 62421#(<= proc_i 308), 62422#(<= proc_i 312), 62423#(<= proc_i 316), 62424#(<= proc_i 320), 62425#(<= proc_i 324), 62426#(<= proc_i 328), 62427#(<= proc_i 332), 62428#(<= proc_i 336), 62429#(<= proc_i 340), 62430#(<= proc_i 344), 62431#(<= proc_i 348), 62432#(<= proc_i 352), 62433#(<= proc_i 356), 62434#(<= proc_i 360), 62435#(<= proc_i 364), 62436#(<= proc_i 368), 62437#(<= proc_i 372), 62438#(<= proc_i 376), 62439#(<= proc_i 380), 62440#(<= proc_i 384), 62441#(<= proc_i 388), 62442#(<= proc_i 392), 62443#(<= proc_i 396), 62444#(<= proc_i 400), 62445#(<= proc_i 404), 62446#(<= proc_i 408), 62447#(<= proc_i 412), 62448#(<= proc_i 416), 62449#(<= proc_i 420), 62450#(<= proc_i 424), 62451#(<= proc_i 428), 62452#(<= proc_i 432), 62453#(<= proc_i 436), 62454#(<= proc_i 440), 62455#(<= proc_i 444), 62456#(<= proc_i 448), 62457#(<= proc_i 452), 62458#(<= proc_i 456), 62459#(<= proc_i 460)] [2018-07-23 13:52:14,955 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:14,955 INFO L450 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-23 13:52:14,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-23 13:52:14,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-07-23 13:52:14,956 INFO L87 Difference]: Start difference. First operand 234 states and 234 transitions. Second operand 118 states. [2018-07-23 13:52:15,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:15,201 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-07-23 13:52:15,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-23 13:52:15,201 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 233 [2018-07-23 13:52:15,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:15,202 INFO L225 Difference]: With dead ends: 237 [2018-07-23 13:52:15,202 INFO L226 Difference]: Without dead ends: 236 [2018-07-23 13:52:15,202 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-07-23 13:52:15,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-07-23 13:52:15,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2018-07-23 13:52:15,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-07-23 13:52:15,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-07-23 13:52:15,206 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 233 [2018-07-23 13:52:15,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:15,207 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-07-23 13:52:15,207 INFO L472 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-23 13:52:15,207 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-07-23 13:52:15,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-07-23 13:52:15,208 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:15,208 INFO L357 BasicCegarLoop]: trace histogram [117, 116, 1, 1] [2018-07-23 13:52:15,208 INFO L414 AbstractCegarLoop]: === Iteration 117 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:15,208 INFO L82 PathProgramCache]: Analyzing trace with hash -327414840, now seen corresponding path program 116 times [2018-07-23 13:52:15,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:15,659 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:15,660 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-23 13:52:15,660 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:15,660 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:52:15,660 INFO L185 omatonBuilderFactory]: Interpolants [63488#(<= proc_i 320), 63489#(<= proc_i 324), 63490#(<= proc_i 328), 63491#(<= proc_i 332), 63492#(<= proc_i 336), 63493#(<= proc_i 340), 63494#(<= proc_i 344), 63495#(<= proc_i 348), 63496#(<= proc_i 352), 63497#(<= proc_i 356), 63498#(<= proc_i 360), 63499#(<= proc_i 364), 63500#(<= proc_i 368), 63501#(<= proc_i 372), 63502#(<= proc_i 376), 63503#(<= proc_i 380), 63504#(<= proc_i 384), 63505#(<= proc_i 388), 63506#(<= proc_i 392), 63507#(<= proc_i 396), 63508#(<= proc_i 400), 63509#(<= proc_i 404), 63510#(<= proc_i 408), 63511#(<= proc_i 412), 63512#(<= proc_i 416), 63513#(<= proc_i 420), 63514#(<= proc_i 424), 63515#(<= proc_i 428), 63516#(<= proc_i 432), 63517#(<= proc_i 436), 63518#(<= proc_i 440), 63519#(<= proc_i 444), 63520#(<= proc_i 448), 63521#(<= proc_i 452), 63522#(<= proc_i 456), 63523#(<= proc_i 460), 63524#(<= proc_i 464), 63406#true, 63407#false, 63408#(<= proc_i 0), 63409#(<= proc_i 4), 63410#(<= proc_i 8), 63411#(<= proc_i 12), 63412#(<= proc_i 16), 63413#(<= proc_i 20), 63414#(<= proc_i 24), 63415#(<= proc_i 28), 63416#(<= proc_i 32), 63417#(<= proc_i 36), 63418#(<= proc_i 40), 63419#(<= proc_i 44), 63420#(<= proc_i 48), 63421#(<= proc_i 52), 63422#(<= proc_i 56), 63423#(<= proc_i 60), 63424#(<= proc_i 64), 63425#(<= proc_i 68), 63426#(<= proc_i 72), 63427#(<= proc_i 76), 63428#(<= proc_i 80), 63429#(<= proc_i 84), 63430#(<= proc_i 88), 63431#(<= proc_i 92), 63432#(<= proc_i 96), 63433#(<= proc_i 100), 63434#(<= proc_i 104), 63435#(<= proc_i 108), 63436#(<= proc_i 112), 63437#(<= proc_i 116), 63438#(<= proc_i 120), 63439#(<= proc_i 124), 63440#(<= proc_i 128), 63441#(<= proc_i 132), 63442#(<= proc_i 136), 63443#(<= proc_i 140), 63444#(<= proc_i 144), 63445#(<= proc_i 148), 63446#(<= proc_i 152), 63447#(<= proc_i 156), 63448#(<= proc_i 160), 63449#(<= proc_i 164), 63450#(<= proc_i 168), 63451#(<= proc_i 172), 63452#(<= proc_i 176), 63453#(<= proc_i 180), 63454#(<= proc_i 184), 63455#(<= proc_i 188), 63456#(<= proc_i 192), 63457#(<= proc_i 196), 63458#(<= proc_i 200), 63459#(<= proc_i 204), 63460#(<= proc_i 208), 63461#(<= proc_i 212), 63462#(<= proc_i 216), 63463#(<= proc_i 220), 63464#(<= proc_i 224), 63465#(<= proc_i 228), 63466#(<= proc_i 232), 63467#(<= proc_i 236), 63468#(<= proc_i 240), 63469#(<= proc_i 244), 63470#(<= proc_i 248), 63471#(<= proc_i 252), 63472#(<= proc_i 256), 63473#(<= proc_i 260), 63474#(<= proc_i 264), 63475#(<= proc_i 268), 63476#(<= proc_i 272), 63477#(<= proc_i 276), 63478#(<= proc_i 280), 63479#(<= proc_i 284), 63480#(<= proc_i 288), 63481#(<= proc_i 292), 63482#(<= proc_i 296), 63483#(<= proc_i 300), 63484#(<= proc_i 304), 63485#(<= proc_i 308), 63486#(<= proc_i 312), 63487#(<= proc_i 316)] [2018-07-23 13:52:15,661 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:15,661 INFO L450 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-23 13:52:15,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-23 13:52:15,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-07-23 13:52:15,663 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 119 states. [2018-07-23 13:52:15,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:15,771 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-07-23 13:52:15,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-23 13:52:15,771 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 235 [2018-07-23 13:52:15,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:15,772 INFO L225 Difference]: With dead ends: 239 [2018-07-23 13:52:15,772 INFO L226 Difference]: Without dead ends: 238 [2018-07-23 13:52:15,773 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-07-23 13:52:15,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-07-23 13:52:15,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-07-23 13:52:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-07-23 13:52:15,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-07-23 13:52:15,776 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 235 [2018-07-23 13:52:15,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:15,776 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-07-23 13:52:15,776 INFO L472 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-23 13:52:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-07-23 13:52:15,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-07-23 13:52:15,778 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:15,778 INFO L357 BasicCegarLoop]: trace histogram [118, 117, 1, 1] [2018-07-23 13:52:15,778 INFO L414 AbstractCegarLoop]: === Iteration 118 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:15,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1113047542, now seen corresponding path program 117 times [2018-07-23 13:52:15,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:16,177 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:16,177 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-23 13:52:16,178 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:16,178 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:52:16,178 INFO L185 omatonBuilderFactory]: Interpolants [64512#(<= proc_i 124), 64513#(<= proc_i 128), 64514#(<= proc_i 132), 64515#(<= proc_i 136), 64516#(<= proc_i 140), 64517#(<= proc_i 144), 64518#(<= proc_i 148), 64519#(<= proc_i 152), 64520#(<= proc_i 156), 64521#(<= proc_i 160), 64522#(<= proc_i 164), 64523#(<= proc_i 168), 64524#(<= proc_i 172), 64525#(<= proc_i 176), 64526#(<= proc_i 180), 64527#(<= proc_i 184), 64528#(<= proc_i 188), 64529#(<= proc_i 192), 64530#(<= proc_i 196), 64531#(<= proc_i 200), 64532#(<= proc_i 204), 64533#(<= proc_i 208), 64534#(<= proc_i 212), 64535#(<= proc_i 216), 64536#(<= proc_i 220), 64537#(<= proc_i 224), 64538#(<= proc_i 228), 64539#(<= proc_i 232), 64540#(<= proc_i 236), 64541#(<= proc_i 240), 64542#(<= proc_i 244), 64543#(<= proc_i 248), 64544#(<= proc_i 252), 64545#(<= proc_i 256), 64546#(<= proc_i 260), 64547#(<= proc_i 264), 64548#(<= proc_i 268), 64549#(<= proc_i 272), 64550#(<= proc_i 276), 64551#(<= proc_i 280), 64552#(<= proc_i 284), 64553#(<= proc_i 288), 64554#(<= proc_i 292), 64555#(<= proc_i 296), 64556#(<= proc_i 300), 64557#(<= proc_i 304), 64558#(<= proc_i 308), 64559#(<= proc_i 312), 64560#(<= proc_i 316), 64561#(<= proc_i 320), 64562#(<= proc_i 324), 64563#(<= proc_i 328), 64564#(<= proc_i 332), 64565#(<= proc_i 336), 64566#(<= proc_i 340), 64567#(<= proc_i 344), 64568#(<= proc_i 348), 64569#(<= proc_i 352), 64570#(<= proc_i 356), 64571#(<= proc_i 360), 64572#(<= proc_i 364), 64573#(<= proc_i 368), 64574#(<= proc_i 372), 64575#(<= proc_i 376), 64576#(<= proc_i 380), 64577#(<= proc_i 384), 64578#(<= proc_i 388), 64579#(<= proc_i 392), 64580#(<= proc_i 396), 64581#(<= proc_i 400), 64582#(<= proc_i 404), 64583#(<= proc_i 408), 64584#(<= proc_i 412), 64585#(<= proc_i 416), 64586#(<= proc_i 420), 64587#(<= proc_i 424), 64588#(<= proc_i 428), 64589#(<= proc_i 432), 64590#(<= proc_i 436), 64591#(<= proc_i 440), 64592#(<= proc_i 444), 64593#(<= proc_i 448), 64594#(<= proc_i 452), 64595#(<= proc_i 456), 64596#(<= proc_i 460), 64597#(<= proc_i 464), 64598#(<= proc_i 468), 64479#true, 64480#false, 64481#(<= proc_i 0), 64482#(<= proc_i 4), 64483#(<= proc_i 8), 64484#(<= proc_i 12), 64485#(<= proc_i 16), 64486#(<= proc_i 20), 64487#(<= proc_i 24), 64488#(<= proc_i 28), 64489#(<= proc_i 32), 64490#(<= proc_i 36), 64491#(<= proc_i 40), 64492#(<= proc_i 44), 64493#(<= proc_i 48), 64494#(<= proc_i 52), 64495#(<= proc_i 56), 64496#(<= proc_i 60), 64497#(<= proc_i 64), 64498#(<= proc_i 68), 64499#(<= proc_i 72), 64500#(<= proc_i 76), 64501#(<= proc_i 80), 64502#(<= proc_i 84), 64503#(<= proc_i 88), 64504#(<= proc_i 92), 64505#(<= proc_i 96), 64506#(<= proc_i 100), 64507#(<= proc_i 104), 64508#(<= proc_i 108), 64509#(<= proc_i 112), 64510#(<= proc_i 116), 64511#(<= proc_i 120)] [2018-07-23 13:52:16,179 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:16,179 INFO L450 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-23 13:52:16,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-23 13:52:16,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-07-23 13:52:16,181 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 120 states. [2018-07-23 13:52:16,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:16,417 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-07-23 13:52:16,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-23 13:52:16,417 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 237 [2018-07-23 13:52:16,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:16,417 INFO L225 Difference]: With dead ends: 241 [2018-07-23 13:52:16,418 INFO L226 Difference]: Without dead ends: 240 [2018-07-23 13:52:16,418 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-07-23 13:52:16,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-07-23 13:52:16,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2018-07-23 13:52:16,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-07-23 13:52:16,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-07-23 13:52:16,423 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 237 [2018-07-23 13:52:16,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:16,423 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-07-23 13:52:16,424 INFO L472 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-23 13:52:16,424 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-07-23 13:52:16,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-07-23 13:52:16,425 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:16,425 INFO L357 BasicCegarLoop]: trace histogram [119, 118, 1, 1] [2018-07-23 13:52:16,425 INFO L414 AbstractCegarLoop]: === Iteration 119 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:16,425 INFO L82 PathProgramCache]: Analyzing trace with hash -191830068, now seen corresponding path program 118 times [2018-07-23 13:52:16,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 14042 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:16,896 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:16,896 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-23 13:52:16,896 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:16,897 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:52:16,897 INFO L185 omatonBuilderFactory]: Interpolants [65561#true, 65563#(<= proc_i 0), 65562#false, 65565#(<= proc_i 8), 65564#(<= proc_i 4), 65567#(<= proc_i 16), 65566#(<= proc_i 12), 65569#(<= proc_i 24), 65568#(<= proc_i 20), 65571#(<= proc_i 32), 65570#(<= proc_i 28), 65573#(<= proc_i 40), 65572#(<= proc_i 36), 65575#(<= proc_i 48), 65574#(<= proc_i 44), 65577#(<= proc_i 56), 65576#(<= proc_i 52), 65579#(<= proc_i 64), 65578#(<= proc_i 60), 65581#(<= proc_i 72), 65580#(<= proc_i 68), 65583#(<= proc_i 80), 65582#(<= proc_i 76), 65585#(<= proc_i 88), 65584#(<= proc_i 84), 65587#(<= proc_i 96), 65586#(<= proc_i 92), 65589#(<= proc_i 104), 65588#(<= proc_i 100), 65591#(<= proc_i 112), 65590#(<= proc_i 108), 65593#(<= proc_i 120), 65592#(<= proc_i 116), 65595#(<= proc_i 128), 65594#(<= proc_i 124), 65597#(<= proc_i 136), 65596#(<= proc_i 132), 65599#(<= proc_i 144), 65598#(<= proc_i 140), 65601#(<= proc_i 152), 65600#(<= proc_i 148), 65603#(<= proc_i 160), 65602#(<= proc_i 156), 65605#(<= proc_i 168), 65604#(<= proc_i 164), 65607#(<= proc_i 176), 65606#(<= proc_i 172), 65609#(<= proc_i 184), 65608#(<= proc_i 180), 65611#(<= proc_i 192), 65610#(<= proc_i 188), 65613#(<= proc_i 200), 65612#(<= proc_i 196), 65615#(<= proc_i 208), 65614#(<= proc_i 204), 65617#(<= proc_i 216), 65616#(<= proc_i 212), 65619#(<= proc_i 224), 65618#(<= proc_i 220), 65621#(<= proc_i 232), 65620#(<= proc_i 228), 65623#(<= proc_i 240), 65622#(<= proc_i 236), 65625#(<= proc_i 248), 65624#(<= proc_i 244), 65627#(<= proc_i 256), 65626#(<= proc_i 252), 65629#(<= proc_i 264), 65628#(<= proc_i 260), 65631#(<= proc_i 272), 65630#(<= proc_i 268), 65633#(<= proc_i 280), 65632#(<= proc_i 276), 65635#(<= proc_i 288), 65634#(<= proc_i 284), 65637#(<= proc_i 296), 65636#(<= proc_i 292), 65639#(<= proc_i 304), 65638#(<= proc_i 300), 65641#(<= proc_i 312), 65640#(<= proc_i 308), 65643#(<= proc_i 320), 65642#(<= proc_i 316), 65645#(<= proc_i 328), 65644#(<= proc_i 324), 65647#(<= proc_i 336), 65646#(<= proc_i 332), 65649#(<= proc_i 344), 65648#(<= proc_i 340), 65651#(<= proc_i 352), 65650#(<= proc_i 348), 65653#(<= proc_i 360), 65652#(<= proc_i 356), 65655#(<= proc_i 368), 65654#(<= proc_i 364), 65657#(<= proc_i 376), 65656#(<= proc_i 372), 65659#(<= proc_i 384), 65658#(<= proc_i 380), 65661#(<= proc_i 392), 65660#(<= proc_i 388), 65663#(<= proc_i 400), 65662#(<= proc_i 396), 65665#(<= proc_i 408), 65664#(<= proc_i 404), 65667#(<= proc_i 416), 65666#(<= proc_i 412), 65669#(<= proc_i 424), 65668#(<= proc_i 420), 65671#(<= proc_i 432), 65670#(<= proc_i 428), 65673#(<= proc_i 440), 65672#(<= proc_i 436), 65675#(<= proc_i 448), 65674#(<= proc_i 444), 65677#(<= proc_i 456), 65676#(<= proc_i 452), 65679#(<= proc_i 464), 65678#(<= proc_i 460), 65681#(<= proc_i 472), 65680#(<= proc_i 468)] [2018-07-23 13:52:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 14042 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:16,898 INFO L450 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-23 13:52:16,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-23 13:52:16,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-07-23 13:52:16,900 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 121 states. [2018-07-23 13:52:17,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:17,223 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-07-23 13:52:17,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-23 13:52:17,223 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 239 [2018-07-23 13:52:17,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:17,224 INFO L225 Difference]: With dead ends: 243 [2018-07-23 13:52:17,224 INFO L226 Difference]: Without dead ends: 242 [2018-07-23 13:52:17,225 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-07-23 13:52:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-07-23 13:52:17,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2018-07-23 13:52:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-07-23 13:52:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-07-23 13:52:17,230 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 239 [2018-07-23 13:52:17,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:17,230 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-07-23 13:52:17,231 INFO L472 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-23 13:52:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-07-23 13:52:17,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-07-23 13:52:17,232 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:17,232 INFO L357 BasicCegarLoop]: trace histogram [120, 119, 1, 1] [2018-07-23 13:52:17,232 INFO L414 AbstractCegarLoop]: === Iteration 120 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:17,232 INFO L82 PathProgramCache]: Analyzing trace with hash 334899470, now seen corresponding path program 119 times [2018-07-23 13:52:17,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:17,746 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:17,746 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-23 13:52:17,746 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:17,747 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:52:17,747 INFO L185 omatonBuilderFactory]: Interpolants [66653#false, 66652#true, 66655#(<= proc_i 4), 66654#(<= proc_i 0), 66657#(<= proc_i 12), 66656#(<= proc_i 8), 66659#(<= proc_i 20), 66658#(<= proc_i 16), 66661#(<= proc_i 28), 66660#(<= proc_i 24), 66663#(<= proc_i 36), 66662#(<= proc_i 32), 66665#(<= proc_i 44), 66664#(<= proc_i 40), 66667#(<= proc_i 52), 66666#(<= proc_i 48), 66669#(<= proc_i 60), 66668#(<= proc_i 56), 66671#(<= proc_i 68), 66670#(<= proc_i 64), 66673#(<= proc_i 76), 66672#(<= proc_i 72), 66675#(<= proc_i 84), 66674#(<= proc_i 80), 66677#(<= proc_i 92), 66676#(<= proc_i 88), 66679#(<= proc_i 100), 66678#(<= proc_i 96), 66681#(<= proc_i 108), 66680#(<= proc_i 104), 66683#(<= proc_i 116), 66682#(<= proc_i 112), 66685#(<= proc_i 124), 66684#(<= proc_i 120), 66687#(<= proc_i 132), 66686#(<= proc_i 128), 66689#(<= proc_i 140), 66688#(<= proc_i 136), 66691#(<= proc_i 148), 66690#(<= proc_i 144), 66693#(<= proc_i 156), 66692#(<= proc_i 152), 66695#(<= proc_i 164), 66694#(<= proc_i 160), 66697#(<= proc_i 172), 66696#(<= proc_i 168), 66699#(<= proc_i 180), 66698#(<= proc_i 176), 66701#(<= proc_i 188), 66700#(<= proc_i 184), 66703#(<= proc_i 196), 66702#(<= proc_i 192), 66705#(<= proc_i 204), 66704#(<= proc_i 200), 66707#(<= proc_i 212), 66706#(<= proc_i 208), 66709#(<= proc_i 220), 66708#(<= proc_i 216), 66711#(<= proc_i 228), 66710#(<= proc_i 224), 66713#(<= proc_i 236), 66712#(<= proc_i 232), 66715#(<= proc_i 244), 66714#(<= proc_i 240), 66717#(<= proc_i 252), 66716#(<= proc_i 248), 66719#(<= proc_i 260), 66718#(<= proc_i 256), 66721#(<= proc_i 268), 66720#(<= proc_i 264), 66723#(<= proc_i 276), 66722#(<= proc_i 272), 66725#(<= proc_i 284), 66724#(<= proc_i 280), 66727#(<= proc_i 292), 66726#(<= proc_i 288), 66729#(<= proc_i 300), 66728#(<= proc_i 296), 66731#(<= proc_i 308), 66730#(<= proc_i 304), 66733#(<= proc_i 316), 66732#(<= proc_i 312), 66735#(<= proc_i 324), 66734#(<= proc_i 320), 66737#(<= proc_i 332), 66736#(<= proc_i 328), 66739#(<= proc_i 340), 66738#(<= proc_i 336), 66741#(<= proc_i 348), 66740#(<= proc_i 344), 66743#(<= proc_i 356), 66742#(<= proc_i 352), 66745#(<= proc_i 364), 66744#(<= proc_i 360), 66747#(<= proc_i 372), 66746#(<= proc_i 368), 66749#(<= proc_i 380), 66748#(<= proc_i 376), 66751#(<= proc_i 388), 66750#(<= proc_i 384), 66753#(<= proc_i 396), 66752#(<= proc_i 392), 66755#(<= proc_i 404), 66754#(<= proc_i 400), 66757#(<= proc_i 412), 66756#(<= proc_i 408), 66759#(<= proc_i 420), 66758#(<= proc_i 416), 66761#(<= proc_i 428), 66760#(<= proc_i 424), 66763#(<= proc_i 436), 66762#(<= proc_i 432), 66765#(<= proc_i 444), 66764#(<= proc_i 440), 66767#(<= proc_i 452), 66766#(<= proc_i 448), 66769#(<= proc_i 460), 66768#(<= proc_i 456), 66771#(<= proc_i 468), 66770#(<= proc_i 464), 66773#(<= proc_i 476), 66772#(<= proc_i 472)] [2018-07-23 13:52:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:17,748 INFO L450 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-23 13:52:17,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-23 13:52:17,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-07-23 13:52:17,750 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 122 states. [2018-07-23 13:52:18,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:18,016 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-07-23 13:52:18,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-23 13:52:18,016 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 241 [2018-07-23 13:52:18,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:18,016 INFO L225 Difference]: With dead ends: 245 [2018-07-23 13:52:18,017 INFO L226 Difference]: Without dead ends: 244 [2018-07-23 13:52:18,018 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-07-23 13:52:18,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-07-23 13:52:18,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2018-07-23 13:52:18,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-07-23 13:52:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2018-07-23 13:52:18,022 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 241 [2018-07-23 13:52:18,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:18,022 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2018-07-23 13:52:18,022 INFO L472 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-23 13:52:18,022 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2018-07-23 13:52:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-07-23 13:52:18,024 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:18,024 INFO L357 BasicCegarLoop]: trace histogram [121, 120, 1, 1] [2018-07-23 13:52:18,024 INFO L414 AbstractCegarLoop]: === Iteration 121 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:18,024 INFO L82 PathProgramCache]: Analyzing trace with hash -284155440, now seen corresponding path program 120 times [2018-07-23 13:52:18,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 14520 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:18,494 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:18,494 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-23 13:52:18,494 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:18,495 INFO L185 omatonBuilderFactory]: Interpolants [67841#(<= proc_i 348), 67840#(<= proc_i 344), 67843#(<= proc_i 356), 67842#(<= proc_i 352), 67845#(<= proc_i 364), 67844#(<= proc_i 360), 67847#(<= proc_i 372), 67846#(<= proc_i 368), 67849#(<= proc_i 380), 67848#(<= proc_i 376), 67851#(<= proc_i 388), 67850#(<= proc_i 384), 67853#(<= proc_i 396), 67852#(<= proc_i 392), 67855#(<= proc_i 404), 67854#(<= proc_i 400), 67857#(<= proc_i 412), 67856#(<= proc_i 408), 67859#(<= proc_i 420), 67858#(<= proc_i 416), 67861#(<= proc_i 428), 67860#(<= proc_i 424), 67863#(<= proc_i 436), 67862#(<= proc_i 432), 67865#(<= proc_i 444), 67864#(<= proc_i 440), 67867#(<= proc_i 452), 67866#(<= proc_i 448), 67869#(<= proc_i 460), 67868#(<= proc_i 456), 67871#(<= proc_i 468), 67870#(<= proc_i 464), 67873#(<= proc_i 476), 67872#(<= proc_i 472), 67874#(<= proc_i 480), 67753#false, 67752#true, 67755#(<= proc_i 4), 67754#(<= proc_i 0), 67757#(<= proc_i 12), 67756#(<= proc_i 8), 67759#(<= proc_i 20), 67758#(<= proc_i 16), 67761#(<= proc_i 28), 67760#(<= proc_i 24), 67763#(<= proc_i 36), 67762#(<= proc_i 32), 67765#(<= proc_i 44), 67764#(<= proc_i 40), 67767#(<= proc_i 52), 67766#(<= proc_i 48), 67769#(<= proc_i 60), 67768#(<= proc_i 56), 67771#(<= proc_i 68), 67770#(<= proc_i 64), 67773#(<= proc_i 76), 67772#(<= proc_i 72), 67775#(<= proc_i 84), 67774#(<= proc_i 80), 67777#(<= proc_i 92), 67776#(<= proc_i 88), 67779#(<= proc_i 100), 67778#(<= proc_i 96), 67781#(<= proc_i 108), 67780#(<= proc_i 104), 67783#(<= proc_i 116), 67782#(<= proc_i 112), 67785#(<= proc_i 124), 67784#(<= proc_i 120), 67787#(<= proc_i 132), 67786#(<= proc_i 128), 67789#(<= proc_i 140), 67788#(<= proc_i 136), 67791#(<= proc_i 148), 67790#(<= proc_i 144), 67793#(<= proc_i 156), 67792#(<= proc_i 152), 67795#(<= proc_i 164), 67794#(<= proc_i 160), 67797#(<= proc_i 172), 67796#(<= proc_i 168), 67799#(<= proc_i 180), 67798#(<= proc_i 176), 67801#(<= proc_i 188), 67800#(<= proc_i 184), 67803#(<= proc_i 196), 67802#(<= proc_i 192), 67805#(<= proc_i 204), 67804#(<= proc_i 200), 67807#(<= proc_i 212), 67806#(<= proc_i 208), 67809#(<= proc_i 220), 67808#(<= proc_i 216), 67811#(<= proc_i 228), 67810#(<= proc_i 224), 67813#(<= proc_i 236), 67812#(<= proc_i 232), 67815#(<= proc_i 244), 67814#(<= proc_i 240), 67817#(<= proc_i 252), 67816#(<= proc_i 248), 67819#(<= proc_i 260), 67818#(<= proc_i 256), 67821#(<= proc_i 268), 67820#(<= proc_i 264), 67823#(<= proc_i 276), 67822#(<= proc_i 272), 67825#(<= proc_i 284), 67824#(<= proc_i 280), 67827#(<= proc_i 292), 67826#(<= proc_i 288), 67829#(<= proc_i 300), 67828#(<= proc_i 296), 67831#(<= proc_i 308), 67830#(<= proc_i 304), 67833#(<= proc_i 316), 67832#(<= proc_i 312), 67835#(<= proc_i 324), 67834#(<= proc_i 320), 67837#(<= proc_i 332), 67836#(<= proc_i 328), 67839#(<= proc_i 340), 67838#(<= proc_i 336)] [2018-07-23 13:52:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 14520 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:18,496 INFO L450 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-23 13:52:18,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-23 13:52:18,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-07-23 13:52:18,497 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 123 states. [2018-07-23 13:52:18,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:18,626 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-07-23 13:52:18,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-23 13:52:18,627 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 243 [2018-07-23 13:52:18,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:18,627 INFO L225 Difference]: With dead ends: 247 [2018-07-23 13:52:18,628 INFO L226 Difference]: Without dead ends: 246 [2018-07-23 13:52:18,629 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-07-23 13:52:18,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-07-23 13:52:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2018-07-23 13:52:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-07-23 13:52:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-07-23 13:52:18,633 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 243 [2018-07-23 13:52:18,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:18,634 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-07-23 13:52:18,634 INFO L472 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-23 13:52:18,634 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-07-23 13:52:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-07-23 13:52:18,635 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:18,635 INFO L357 BasicCegarLoop]: trace histogram [122, 121, 1, 1] [2018-07-23 13:52:18,635 INFO L414 AbstractCegarLoop]: === Iteration 122 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:18,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1804530194, now seen corresponding path program 121 times [2018-07-23 13:52:18,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 14762 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:19,107 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:19,107 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-23 13:52:19,107 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:19,108 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:52:19,108 INFO L185 omatonBuilderFactory]: Interpolants [68865#(<= proc_i 8), 68864#(<= proc_i 4), 68867#(<= proc_i 16), 68866#(<= proc_i 12), 68869#(<= proc_i 24), 68868#(<= proc_i 20), 68871#(<= proc_i 32), 68870#(<= proc_i 28), 68873#(<= proc_i 40), 68872#(<= proc_i 36), 68875#(<= proc_i 48), 68874#(<= proc_i 44), 68877#(<= proc_i 56), 68876#(<= proc_i 52), 68879#(<= proc_i 64), 68878#(<= proc_i 60), 68881#(<= proc_i 72), 68880#(<= proc_i 68), 68883#(<= proc_i 80), 68882#(<= proc_i 76), 68885#(<= proc_i 88), 68884#(<= proc_i 84), 68887#(<= proc_i 96), 68886#(<= proc_i 92), 68889#(<= proc_i 104), 68888#(<= proc_i 100), 68891#(<= proc_i 112), 68890#(<= proc_i 108), 68893#(<= proc_i 120), 68892#(<= proc_i 116), 68895#(<= proc_i 128), 68894#(<= proc_i 124), 68897#(<= proc_i 136), 68896#(<= proc_i 132), 68899#(<= proc_i 144), 68898#(<= proc_i 140), 68901#(<= proc_i 152), 68900#(<= proc_i 148), 68903#(<= proc_i 160), 68902#(<= proc_i 156), 68905#(<= proc_i 168), 68904#(<= proc_i 164), 68907#(<= proc_i 176), 68906#(<= proc_i 172), 68909#(<= proc_i 184), 68908#(<= proc_i 180), 68911#(<= proc_i 192), 68910#(<= proc_i 188), 68913#(<= proc_i 200), 68912#(<= proc_i 196), 68915#(<= proc_i 208), 68914#(<= proc_i 204), 68917#(<= proc_i 216), 68916#(<= proc_i 212), 68919#(<= proc_i 224), 68918#(<= proc_i 220), 68921#(<= proc_i 232), 68920#(<= proc_i 228), 68923#(<= proc_i 240), 68922#(<= proc_i 236), 68925#(<= proc_i 248), 68924#(<= proc_i 244), 68927#(<= proc_i 256), 68926#(<= proc_i 252), 68929#(<= proc_i 264), 68928#(<= proc_i 260), 68931#(<= proc_i 272), 68930#(<= proc_i 268), 68933#(<= proc_i 280), 68932#(<= proc_i 276), 68935#(<= proc_i 288), 68934#(<= proc_i 284), 68937#(<= proc_i 296), 68936#(<= proc_i 292), 68939#(<= proc_i 304), 68938#(<= proc_i 300), 68941#(<= proc_i 312), 68940#(<= proc_i 308), 68943#(<= proc_i 320), 68942#(<= proc_i 316), 68945#(<= proc_i 328), 68944#(<= proc_i 324), 68947#(<= proc_i 336), 68946#(<= proc_i 332), 68949#(<= proc_i 344), 68948#(<= proc_i 340), 68951#(<= proc_i 352), 68950#(<= proc_i 348), 68953#(<= proc_i 360), 68952#(<= proc_i 356), 68955#(<= proc_i 368), 68954#(<= proc_i 364), 68957#(<= proc_i 376), 68956#(<= proc_i 372), 68959#(<= proc_i 384), 68958#(<= proc_i 380), 68961#(<= proc_i 392), 68960#(<= proc_i 388), 68963#(<= proc_i 400), 68962#(<= proc_i 396), 68965#(<= proc_i 408), 68964#(<= proc_i 404), 68967#(<= proc_i 416), 68966#(<= proc_i 412), 68969#(<= proc_i 424), 68968#(<= proc_i 420), 68971#(<= proc_i 432), 68970#(<= proc_i 428), 68973#(<= proc_i 440), 68972#(<= proc_i 436), 68975#(<= proc_i 448), 68974#(<= proc_i 444), 68977#(<= proc_i 456), 68976#(<= proc_i 452), 68979#(<= proc_i 464), 68978#(<= proc_i 460), 68981#(<= proc_i 472), 68980#(<= proc_i 468), 68983#(<= proc_i 480), 68982#(<= proc_i 476), 68984#(<= proc_i 484), 68861#true, 68863#(<= proc_i 0), 68862#false] [2018-07-23 13:52:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 14762 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:19,109 INFO L450 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-23 13:52:19,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-23 13:52:19,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-07-23 13:52:19,111 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 124 states. [2018-07-23 13:52:19,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:19,470 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-07-23 13:52:19,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-23 13:52:19,470 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 245 [2018-07-23 13:52:19,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:19,470 INFO L225 Difference]: With dead ends: 249 [2018-07-23 13:52:19,471 INFO L226 Difference]: Without dead ends: 248 [2018-07-23 13:52:19,472 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-07-23 13:52:19,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-07-23 13:52:19,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-07-23 13:52:19,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-07-23 13:52:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-07-23 13:52:19,476 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 245 [2018-07-23 13:52:19,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:19,476 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-07-23 13:52:19,476 INFO L472 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-23 13:52:19,477 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-07-23 13:52:19,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-07-23 13:52:19,478 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:19,478 INFO L357 BasicCegarLoop]: trace histogram [123, 122, 1, 1] [2018-07-23 13:52:19,478 INFO L414 AbstractCegarLoop]: === Iteration 123 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:19,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1013270060, now seen corresponding path program 122 times [2018-07-23 13:52:19,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:19,975 INFO L134 CoverageAnalysis]: Checked inductivity of 15006 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:19,975 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:19,975 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-23 13:52:19,976 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:19,976 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:52:19,976 INFO L185 omatonBuilderFactory]: Interpolants [69979#true, 69981#(<= proc_i 0), 69980#false, 69983#(<= proc_i 8), 69982#(<= proc_i 4), 69985#(<= proc_i 16), 69984#(<= proc_i 12), 69987#(<= proc_i 24), 69986#(<= proc_i 20), 69989#(<= proc_i 32), 69988#(<= proc_i 28), 69991#(<= proc_i 40), 69990#(<= proc_i 36), 69993#(<= proc_i 48), 69992#(<= proc_i 44), 69995#(<= proc_i 56), 69994#(<= proc_i 52), 69997#(<= proc_i 64), 69996#(<= proc_i 60), 69999#(<= proc_i 72), 69998#(<= proc_i 68), 70001#(<= proc_i 80), 70000#(<= proc_i 76), 70003#(<= proc_i 88), 70002#(<= proc_i 84), 70005#(<= proc_i 96), 70004#(<= proc_i 92), 70007#(<= proc_i 104), 70006#(<= proc_i 100), 70009#(<= proc_i 112), 70008#(<= proc_i 108), 70011#(<= proc_i 120), 70010#(<= proc_i 116), 70013#(<= proc_i 128), 70012#(<= proc_i 124), 70015#(<= proc_i 136), 70014#(<= proc_i 132), 70017#(<= proc_i 144), 70016#(<= proc_i 140), 70019#(<= proc_i 152), 70018#(<= proc_i 148), 70021#(<= proc_i 160), 70020#(<= proc_i 156), 70023#(<= proc_i 168), 70022#(<= proc_i 164), 70025#(<= proc_i 176), 70024#(<= proc_i 172), 70027#(<= proc_i 184), 70026#(<= proc_i 180), 70029#(<= proc_i 192), 70028#(<= proc_i 188), 70031#(<= proc_i 200), 70030#(<= proc_i 196), 70033#(<= proc_i 208), 70032#(<= proc_i 204), 70035#(<= proc_i 216), 70034#(<= proc_i 212), 70037#(<= proc_i 224), 70036#(<= proc_i 220), 70039#(<= proc_i 232), 70038#(<= proc_i 228), 70041#(<= proc_i 240), 70040#(<= proc_i 236), 70043#(<= proc_i 248), 70042#(<= proc_i 244), 70045#(<= proc_i 256), 70044#(<= proc_i 252), 70047#(<= proc_i 264), 70046#(<= proc_i 260), 70049#(<= proc_i 272), 70048#(<= proc_i 268), 70051#(<= proc_i 280), 70050#(<= proc_i 276), 70053#(<= proc_i 288), 70052#(<= proc_i 284), 70055#(<= proc_i 296), 70054#(<= proc_i 292), 70057#(<= proc_i 304), 70056#(<= proc_i 300), 70059#(<= proc_i 312), 70058#(<= proc_i 308), 70061#(<= proc_i 320), 70060#(<= proc_i 316), 70063#(<= proc_i 328), 70062#(<= proc_i 324), 70065#(<= proc_i 336), 70064#(<= proc_i 332), 70067#(<= proc_i 344), 70066#(<= proc_i 340), 70069#(<= proc_i 352), 70068#(<= proc_i 348), 70071#(<= proc_i 360), 70070#(<= proc_i 356), 70073#(<= proc_i 368), 70072#(<= proc_i 364), 70075#(<= proc_i 376), 70074#(<= proc_i 372), 70077#(<= proc_i 384), 70076#(<= proc_i 380), 70079#(<= proc_i 392), 70078#(<= proc_i 388), 70081#(<= proc_i 400), 70080#(<= proc_i 396), 70083#(<= proc_i 408), 70082#(<= proc_i 404), 70085#(<= proc_i 416), 70084#(<= proc_i 412), 70087#(<= proc_i 424), 70086#(<= proc_i 420), 70089#(<= proc_i 432), 70088#(<= proc_i 428), 70091#(<= proc_i 440), 70090#(<= proc_i 436), 70093#(<= proc_i 448), 70092#(<= proc_i 444), 70095#(<= proc_i 456), 70094#(<= proc_i 452), 70097#(<= proc_i 464), 70096#(<= proc_i 460), 70099#(<= proc_i 472), 70098#(<= proc_i 468), 70101#(<= proc_i 480), 70100#(<= proc_i 476), 70103#(<= proc_i 488), 70102#(<= proc_i 484)] [2018-07-23 13:52:19,977 INFO L134 CoverageAnalysis]: Checked inductivity of 15006 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:19,977 INFO L450 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-23 13:52:19,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-23 13:52:19,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-07-23 13:52:19,979 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 125 states. [2018-07-23 13:52:20,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:20,285 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-07-23 13:52:20,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-23 13:52:20,285 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 247 [2018-07-23 13:52:20,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:20,286 INFO L225 Difference]: With dead ends: 251 [2018-07-23 13:52:20,286 INFO L226 Difference]: Without dead ends: 250 [2018-07-23 13:52:20,287 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-07-23 13:52:20,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-07-23 13:52:20,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2018-07-23 13:52:20,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-07-23 13:52:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2018-07-23 13:52:20,292 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 247 [2018-07-23 13:52:20,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:20,292 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2018-07-23 13:52:20,292 INFO L472 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-23 13:52:20,293 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2018-07-23 13:52:20,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-07-23 13:52:20,294 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:20,294 INFO L357 BasicCegarLoop]: trace histogram [124, 123, 1, 1] [2018-07-23 13:52:20,294 INFO L414 AbstractCegarLoop]: === Iteration 124 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:20,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1205049622, now seen corresponding path program 123 times [2018-07-23 13:52:20,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 15252 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:20,842 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:20,843 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-23 13:52:20,843 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:20,843 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:52:20,843 INFO L185 omatonBuilderFactory]: Interpolants [71169#(<= proc_i 244), 71168#(<= proc_i 240), 71171#(<= proc_i 252), 71170#(<= proc_i 248), 71173#(<= proc_i 260), 71172#(<= proc_i 256), 71175#(<= proc_i 268), 71174#(<= proc_i 264), 71177#(<= proc_i 276), 71176#(<= proc_i 272), 71179#(<= proc_i 284), 71178#(<= proc_i 280), 71181#(<= proc_i 292), 71180#(<= proc_i 288), 71183#(<= proc_i 300), 71182#(<= proc_i 296), 71185#(<= proc_i 308), 71184#(<= proc_i 304), 71187#(<= proc_i 316), 71186#(<= proc_i 312), 71189#(<= proc_i 324), 71188#(<= proc_i 320), 71191#(<= proc_i 332), 71190#(<= proc_i 328), 71193#(<= proc_i 340), 71192#(<= proc_i 336), 71195#(<= proc_i 348), 71194#(<= proc_i 344), 71197#(<= proc_i 356), 71196#(<= proc_i 352), 71199#(<= proc_i 364), 71198#(<= proc_i 360), 71201#(<= proc_i 372), 71200#(<= proc_i 368), 71203#(<= proc_i 380), 71202#(<= proc_i 376), 71205#(<= proc_i 388), 71204#(<= proc_i 384), 71207#(<= proc_i 396), 71206#(<= proc_i 392), 71209#(<= proc_i 404), 71208#(<= proc_i 400), 71211#(<= proc_i 412), 71210#(<= proc_i 408), 71213#(<= proc_i 420), 71212#(<= proc_i 416), 71215#(<= proc_i 428), 71214#(<= proc_i 424), 71217#(<= proc_i 436), 71216#(<= proc_i 432), 71219#(<= proc_i 444), 71218#(<= proc_i 440), 71221#(<= proc_i 452), 71220#(<= proc_i 448), 71223#(<= proc_i 460), 71222#(<= proc_i 456), 71225#(<= proc_i 468), 71224#(<= proc_i 464), 71227#(<= proc_i 476), 71226#(<= proc_i 472), 71229#(<= proc_i 484), 71228#(<= proc_i 480), 71231#(<= proc_i 492), 71230#(<= proc_i 488), 71107#false, 71106#true, 71109#(<= proc_i 4), 71108#(<= proc_i 0), 71111#(<= proc_i 12), 71110#(<= proc_i 8), 71113#(<= proc_i 20), 71112#(<= proc_i 16), 71115#(<= proc_i 28), 71114#(<= proc_i 24), 71117#(<= proc_i 36), 71116#(<= proc_i 32), 71119#(<= proc_i 44), 71118#(<= proc_i 40), 71121#(<= proc_i 52), 71120#(<= proc_i 48), 71123#(<= proc_i 60), 71122#(<= proc_i 56), 71125#(<= proc_i 68), 71124#(<= proc_i 64), 71127#(<= proc_i 76), 71126#(<= proc_i 72), 71129#(<= proc_i 84), 71128#(<= proc_i 80), 71131#(<= proc_i 92), 71130#(<= proc_i 88), 71133#(<= proc_i 100), 71132#(<= proc_i 96), 71135#(<= proc_i 108), 71134#(<= proc_i 104), 71137#(<= proc_i 116), 71136#(<= proc_i 112), 71139#(<= proc_i 124), 71138#(<= proc_i 120), 71141#(<= proc_i 132), 71140#(<= proc_i 128), 71143#(<= proc_i 140), 71142#(<= proc_i 136), 71145#(<= proc_i 148), 71144#(<= proc_i 144), 71147#(<= proc_i 156), 71146#(<= proc_i 152), 71149#(<= proc_i 164), 71148#(<= proc_i 160), 71151#(<= proc_i 172), 71150#(<= proc_i 168), 71153#(<= proc_i 180), 71152#(<= proc_i 176), 71155#(<= proc_i 188), 71154#(<= proc_i 184), 71157#(<= proc_i 196), 71156#(<= proc_i 192), 71159#(<= proc_i 204), 71158#(<= proc_i 200), 71161#(<= proc_i 212), 71160#(<= proc_i 208), 71163#(<= proc_i 220), 71162#(<= proc_i 216), 71165#(<= proc_i 228), 71164#(<= proc_i 224), 71167#(<= proc_i 236), 71166#(<= proc_i 232)] [2018-07-23 13:52:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 15252 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:20,844 INFO L450 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-23 13:52:20,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-23 13:52:20,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-07-23 13:52:20,847 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 126 states. [2018-07-23 13:52:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:20,995 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-07-23 13:52:20,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-23 13:52:20,995 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 249 [2018-07-23 13:52:20,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:20,996 INFO L225 Difference]: With dead ends: 253 [2018-07-23 13:52:20,996 INFO L226 Difference]: Without dead ends: 252 [2018-07-23 13:52:20,997 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-07-23 13:52:20,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-07-23 13:52:21,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2018-07-23 13:52:21,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-07-23 13:52:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-07-23 13:52:21,001 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 249 [2018-07-23 13:52:21,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:21,001 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-07-23 13:52:21,001 INFO L472 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-23 13:52:21,001 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-07-23 13:52:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-07-23 13:52:21,002 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:21,002 INFO L357 BasicCegarLoop]: trace histogram [125, 124, 1, 1] [2018-07-23 13:52:21,002 INFO L414 AbstractCegarLoop]: === Iteration 125 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:21,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1588482088, now seen corresponding path program 124 times [2018-07-23 13:52:21,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:21,669 INFO L134 CoverageAnalysis]: Checked inductivity of 15500 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:21,670 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:21,670 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-23 13:52:21,670 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:21,670 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:52:21,670 INFO L185 omatonBuilderFactory]: Interpolants [72243#false, 72242#true, 72245#(<= proc_i 4), 72244#(<= proc_i 0), 72247#(<= proc_i 12), 72246#(<= proc_i 8), 72249#(<= proc_i 20), 72248#(<= proc_i 16), 72251#(<= proc_i 28), 72250#(<= proc_i 24), 72253#(<= proc_i 36), 72252#(<= proc_i 32), 72255#(<= proc_i 44), 72254#(<= proc_i 40), 72257#(<= proc_i 52), 72256#(<= proc_i 48), 72259#(<= proc_i 60), 72258#(<= proc_i 56), 72261#(<= proc_i 68), 72260#(<= proc_i 64), 72263#(<= proc_i 76), 72262#(<= proc_i 72), 72265#(<= proc_i 84), 72264#(<= proc_i 80), 72267#(<= proc_i 92), 72266#(<= proc_i 88), 72269#(<= proc_i 100), 72268#(<= proc_i 96), 72271#(<= proc_i 108), 72270#(<= proc_i 104), 72273#(<= proc_i 116), 72272#(<= proc_i 112), 72275#(<= proc_i 124), 72274#(<= proc_i 120), 72277#(<= proc_i 132), 72276#(<= proc_i 128), 72279#(<= proc_i 140), 72278#(<= proc_i 136), 72281#(<= proc_i 148), 72280#(<= proc_i 144), 72283#(<= proc_i 156), 72282#(<= proc_i 152), 72285#(<= proc_i 164), 72284#(<= proc_i 160), 72287#(<= proc_i 172), 72286#(<= proc_i 168), 72289#(<= proc_i 180), 72288#(<= proc_i 176), 72291#(<= proc_i 188), 72290#(<= proc_i 184), 72293#(<= proc_i 196), 72292#(<= proc_i 192), 72295#(<= proc_i 204), 72294#(<= proc_i 200), 72297#(<= proc_i 212), 72296#(<= proc_i 208), 72299#(<= proc_i 220), 72298#(<= proc_i 216), 72301#(<= proc_i 228), 72300#(<= proc_i 224), 72303#(<= proc_i 236), 72302#(<= proc_i 232), 72305#(<= proc_i 244), 72304#(<= proc_i 240), 72307#(<= proc_i 252), 72306#(<= proc_i 248), 72309#(<= proc_i 260), 72308#(<= proc_i 256), 72311#(<= proc_i 268), 72310#(<= proc_i 264), 72313#(<= proc_i 276), 72312#(<= proc_i 272), 72315#(<= proc_i 284), 72314#(<= proc_i 280), 72317#(<= proc_i 292), 72316#(<= proc_i 288), 72319#(<= proc_i 300), 72318#(<= proc_i 296), 72321#(<= proc_i 308), 72320#(<= proc_i 304), 72323#(<= proc_i 316), 72322#(<= proc_i 312), 72325#(<= proc_i 324), 72324#(<= proc_i 320), 72327#(<= proc_i 332), 72326#(<= proc_i 328), 72329#(<= proc_i 340), 72328#(<= proc_i 336), 72331#(<= proc_i 348), 72330#(<= proc_i 344), 72333#(<= proc_i 356), 72332#(<= proc_i 352), 72335#(<= proc_i 364), 72334#(<= proc_i 360), 72337#(<= proc_i 372), 72336#(<= proc_i 368), 72339#(<= proc_i 380), 72338#(<= proc_i 376), 72341#(<= proc_i 388), 72340#(<= proc_i 384), 72343#(<= proc_i 396), 72342#(<= proc_i 392), 72345#(<= proc_i 404), 72344#(<= proc_i 400), 72347#(<= proc_i 412), 72346#(<= proc_i 408), 72349#(<= proc_i 420), 72348#(<= proc_i 416), 72351#(<= proc_i 428), 72350#(<= proc_i 424), 72353#(<= proc_i 436), 72352#(<= proc_i 432), 72355#(<= proc_i 444), 72354#(<= proc_i 440), 72357#(<= proc_i 452), 72356#(<= proc_i 448), 72359#(<= proc_i 460), 72358#(<= proc_i 456), 72361#(<= proc_i 468), 72360#(<= proc_i 464), 72363#(<= proc_i 476), 72362#(<= proc_i 472), 72365#(<= proc_i 484), 72364#(<= proc_i 480), 72367#(<= proc_i 492), 72366#(<= proc_i 488), 72368#(<= proc_i 496)] [2018-07-23 13:52:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 15500 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:21,671 INFO L450 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-23 13:52:21,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-23 13:52:21,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-07-23 13:52:21,673 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 127 states. [2018-07-23 13:52:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:21,950 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-07-23 13:52:21,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-23 13:52:21,950 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 251 [2018-07-23 13:52:21,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:21,951 INFO L225 Difference]: With dead ends: 255 [2018-07-23 13:52:21,951 INFO L226 Difference]: Without dead ends: 254 [2018-07-23 13:52:21,951 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-07-23 13:52:21,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-07-23 13:52:21,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2018-07-23 13:52:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-07-23 13:52:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-07-23 13:52:21,955 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 251 [2018-07-23 13:52:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:21,955 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-07-23 13:52:21,955 INFO L472 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-23 13:52:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-07-23 13:52:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-07-23 13:52:21,956 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:21,956 INFO L357 BasicCegarLoop]: trace histogram [126, 125, 1, 1] [2018-07-23 13:52:21,956 INFO L414 AbstractCegarLoop]: === Iteration 126 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:21,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1817895398, now seen corresponding path program 125 times [2018-07-23 13:52:21,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:22,382 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:22,383 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:22,383 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-23 13:52:22,383 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:22,383 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:52:22,383 INFO L185 omatonBuilderFactory]: Interpolants [73473#(<= proc_i 336), 73472#(<= proc_i 332), 73475#(<= proc_i 344), 73474#(<= proc_i 340), 73477#(<= proc_i 352), 73476#(<= proc_i 348), 73479#(<= proc_i 360), 73478#(<= proc_i 356), 73481#(<= proc_i 368), 73480#(<= proc_i 364), 73483#(<= proc_i 376), 73482#(<= proc_i 372), 73485#(<= proc_i 384), 73484#(<= proc_i 380), 73487#(<= proc_i 392), 73486#(<= proc_i 388), 73489#(<= proc_i 400), 73488#(<= proc_i 396), 73491#(<= proc_i 408), 73490#(<= proc_i 404), 73493#(<= proc_i 416), 73492#(<= proc_i 412), 73495#(<= proc_i 424), 73494#(<= proc_i 420), 73497#(<= proc_i 432), 73496#(<= proc_i 428), 73499#(<= proc_i 440), 73498#(<= proc_i 436), 73501#(<= proc_i 448), 73500#(<= proc_i 444), 73503#(<= proc_i 456), 73502#(<= proc_i 452), 73505#(<= proc_i 464), 73504#(<= proc_i 460), 73507#(<= proc_i 472), 73506#(<= proc_i 468), 73509#(<= proc_i 480), 73508#(<= proc_i 476), 73511#(<= proc_i 488), 73510#(<= proc_i 484), 73513#(<= proc_i 496), 73512#(<= proc_i 492), 73514#(<= proc_i 500), 73387#true, 73389#(<= proc_i 0), 73388#false, 73391#(<= proc_i 8), 73390#(<= proc_i 4), 73393#(<= proc_i 16), 73392#(<= proc_i 12), 73395#(<= proc_i 24), 73394#(<= proc_i 20), 73397#(<= proc_i 32), 73396#(<= proc_i 28), 73399#(<= proc_i 40), 73398#(<= proc_i 36), 73401#(<= proc_i 48), 73400#(<= proc_i 44), 73403#(<= proc_i 56), 73402#(<= proc_i 52), 73405#(<= proc_i 64), 73404#(<= proc_i 60), 73407#(<= proc_i 72), 73406#(<= proc_i 68), 73409#(<= proc_i 80), 73408#(<= proc_i 76), 73411#(<= proc_i 88), 73410#(<= proc_i 84), 73413#(<= proc_i 96), 73412#(<= proc_i 92), 73415#(<= proc_i 104), 73414#(<= proc_i 100), 73417#(<= proc_i 112), 73416#(<= proc_i 108), 73419#(<= proc_i 120), 73418#(<= proc_i 116), 73421#(<= proc_i 128), 73420#(<= proc_i 124), 73423#(<= proc_i 136), 73422#(<= proc_i 132), 73425#(<= proc_i 144), 73424#(<= proc_i 140), 73427#(<= proc_i 152), 73426#(<= proc_i 148), 73429#(<= proc_i 160), 73428#(<= proc_i 156), 73431#(<= proc_i 168), 73430#(<= proc_i 164), 73433#(<= proc_i 176), 73432#(<= proc_i 172), 73435#(<= proc_i 184), 73434#(<= proc_i 180), 73437#(<= proc_i 192), 73436#(<= proc_i 188), 73439#(<= proc_i 200), 73438#(<= proc_i 196), 73441#(<= proc_i 208), 73440#(<= proc_i 204), 73443#(<= proc_i 216), 73442#(<= proc_i 212), 73445#(<= proc_i 224), 73444#(<= proc_i 220), 73447#(<= proc_i 232), 73446#(<= proc_i 228), 73449#(<= proc_i 240), 73448#(<= proc_i 236), 73451#(<= proc_i 248), 73450#(<= proc_i 244), 73453#(<= proc_i 256), 73452#(<= proc_i 252), 73455#(<= proc_i 264), 73454#(<= proc_i 260), 73457#(<= proc_i 272), 73456#(<= proc_i 268), 73459#(<= proc_i 280), 73458#(<= proc_i 276), 73461#(<= proc_i 288), 73460#(<= proc_i 284), 73463#(<= proc_i 296), 73462#(<= proc_i 292), 73465#(<= proc_i 304), 73464#(<= proc_i 300), 73467#(<= proc_i 312), 73466#(<= proc_i 308), 73469#(<= proc_i 320), 73468#(<= proc_i 316), 73471#(<= proc_i 328), 73470#(<= proc_i 324)] [2018-07-23 13:52:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:22,384 INFO L450 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-23 13:52:22,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-23 13:52:22,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-07-23 13:52:22,386 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 128 states. [2018-07-23 13:52:22,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:22,508 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-07-23 13:52:22,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-23 13:52:22,508 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 253 [2018-07-23 13:52:22,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:22,509 INFO L225 Difference]: With dead ends: 257 [2018-07-23 13:52:22,509 INFO L226 Difference]: Without dead ends: 256 [2018-07-23 13:52:22,510 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-07-23 13:52:22,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-07-23 13:52:22,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2018-07-23 13:52:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-07-23 13:52:22,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-07-23 13:52:22,514 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 253 [2018-07-23 13:52:22,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:22,514 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-07-23 13:52:22,514 INFO L472 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-23 13:52:22,514 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-07-23 13:52:22,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-07-23 13:52:22,515 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:22,516 INFO L357 BasicCegarLoop]: trace histogram [127, 126, 1, 1] [2018-07-23 13:52:22,516 INFO L414 AbstractCegarLoop]: === Iteration 127 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:22,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1054213084, now seen corresponding path program 126 times [2018-07-23 13:52:22,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 16002 backedges. 0 proven. 16002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:23,062 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:23,062 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-23 13:52:23,062 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:23,062 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:52:23,063 INFO L185 omatonBuilderFactory]: Interpolants [74541#true, 74543#(<= proc_i 0), 74542#false, 74545#(<= proc_i 8), 74544#(<= proc_i 4), 74547#(<= proc_i 16), 74546#(<= proc_i 12), 74549#(<= proc_i 24), 74548#(<= proc_i 20), 74551#(<= proc_i 32), 74550#(<= proc_i 28), 74553#(<= proc_i 40), 74552#(<= proc_i 36), 74555#(<= proc_i 48), 74554#(<= proc_i 44), 74557#(<= proc_i 56), 74556#(<= proc_i 52), 74559#(<= proc_i 64), 74558#(<= proc_i 60), 74561#(<= proc_i 72), 74560#(<= proc_i 68), 74563#(<= proc_i 80), 74562#(<= proc_i 76), 74565#(<= proc_i 88), 74564#(<= proc_i 84), 74567#(<= proc_i 96), 74566#(<= proc_i 92), 74569#(<= proc_i 104), 74568#(<= proc_i 100), 74571#(<= proc_i 112), 74570#(<= proc_i 108), 74573#(<= proc_i 120), 74572#(<= proc_i 116), 74575#(<= proc_i 128), 74574#(<= proc_i 124), 74577#(<= proc_i 136), 74576#(<= proc_i 132), 74579#(<= proc_i 144), 74578#(<= proc_i 140), 74581#(<= proc_i 152), 74580#(<= proc_i 148), 74583#(<= proc_i 160), 74582#(<= proc_i 156), 74585#(<= proc_i 168), 74584#(<= proc_i 164), 74587#(<= proc_i 176), 74586#(<= proc_i 172), 74589#(<= proc_i 184), 74588#(<= proc_i 180), 74591#(<= proc_i 192), 74590#(<= proc_i 188), 74593#(<= proc_i 200), 74592#(<= proc_i 196), 74595#(<= proc_i 208), 74594#(<= proc_i 204), 74597#(<= proc_i 216), 74596#(<= proc_i 212), 74599#(<= proc_i 224), 74598#(<= proc_i 220), 74601#(<= proc_i 232), 74600#(<= proc_i 228), 74603#(<= proc_i 240), 74602#(<= proc_i 236), 74605#(<= proc_i 248), 74604#(<= proc_i 244), 74607#(<= proc_i 256), 74606#(<= proc_i 252), 74609#(<= proc_i 264), 74608#(<= proc_i 260), 74611#(<= proc_i 272), 74610#(<= proc_i 268), 74613#(<= proc_i 280), 74612#(<= proc_i 276), 74615#(<= proc_i 288), 74614#(<= proc_i 284), 74617#(<= proc_i 296), 74616#(<= proc_i 292), 74619#(<= proc_i 304), 74618#(<= proc_i 300), 74621#(<= proc_i 312), 74620#(<= proc_i 308), 74623#(<= proc_i 320), 74622#(<= proc_i 316), 74625#(<= proc_i 328), 74624#(<= proc_i 324), 74627#(<= proc_i 336), 74626#(<= proc_i 332), 74629#(<= proc_i 344), 74628#(<= proc_i 340), 74631#(<= proc_i 352), 74630#(<= proc_i 348), 74633#(<= proc_i 360), 74632#(<= proc_i 356), 74635#(<= proc_i 368), 74634#(<= proc_i 364), 74637#(<= proc_i 376), 74636#(<= proc_i 372), 74639#(<= proc_i 384), 74638#(<= proc_i 380), 74641#(<= proc_i 392), 74640#(<= proc_i 388), 74643#(<= proc_i 400), 74642#(<= proc_i 396), 74645#(<= proc_i 408), 74644#(<= proc_i 404), 74647#(<= proc_i 416), 74646#(<= proc_i 412), 74649#(<= proc_i 424), 74648#(<= proc_i 420), 74651#(<= proc_i 432), 74650#(<= proc_i 428), 74653#(<= proc_i 440), 74652#(<= proc_i 436), 74655#(<= proc_i 448), 74654#(<= proc_i 444), 74657#(<= proc_i 456), 74656#(<= proc_i 452), 74659#(<= proc_i 464), 74658#(<= proc_i 460), 74661#(<= proc_i 472), 74660#(<= proc_i 468), 74663#(<= proc_i 480), 74662#(<= proc_i 476), 74665#(<= proc_i 488), 74664#(<= proc_i 484), 74667#(<= proc_i 496), 74666#(<= proc_i 492), 74669#(<= proc_i 504), 74668#(<= proc_i 500)] [2018-07-23 13:52:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 16002 backedges. 0 proven. 16002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:23,064 INFO L450 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-23 13:52:23,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-23 13:52:23,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-07-23 13:52:23,067 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 129 states. [2018-07-23 13:52:23,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:23,419 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-07-23 13:52:23,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-23 13:52:23,420 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 255 [2018-07-23 13:52:23,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:23,420 INFO L225 Difference]: With dead ends: 259 [2018-07-23 13:52:23,421 INFO L226 Difference]: Without dead ends: 258 [2018-07-23 13:52:23,422 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-07-23 13:52:23,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-07-23 13:52:23,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-07-23 13:52:23,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-07-23 13:52:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2018-07-23 13:52:23,427 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 255 [2018-07-23 13:52:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:23,427 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 258 transitions. [2018-07-23 13:52:23,427 INFO L472 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-23 13:52:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 258 transitions. [2018-07-23 13:52:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-07-23 13:52:23,429 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:23,429 INFO L357 BasicCegarLoop]: trace histogram [128, 127, 1, 1] [2018-07-23 13:52:23,429 INFO L414 AbstractCegarLoop]: === Iteration 128 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:23,429 INFO L82 PathProgramCache]: Analyzing trace with hash -513507042, now seen corresponding path program 127 times [2018-07-23 13:52:23,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 16256 backedges. 0 proven. 16256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:24,169 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:24,170 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-23 13:52:24,170 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:24,170 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:52:24,171 INFO L185 omatonBuilderFactory]: Interpolants [75777#(<= proc_i 284), 75776#(<= proc_i 280), 75779#(<= proc_i 292), 75778#(<= proc_i 288), 75781#(<= proc_i 300), 75780#(<= proc_i 296), 75783#(<= proc_i 308), 75782#(<= proc_i 304), 75785#(<= proc_i 316), 75784#(<= proc_i 312), 75787#(<= proc_i 324), 75786#(<= proc_i 320), 75789#(<= proc_i 332), 75788#(<= proc_i 328), 75791#(<= proc_i 340), 75790#(<= proc_i 336), 75793#(<= proc_i 348), 75792#(<= proc_i 344), 75795#(<= proc_i 356), 75794#(<= proc_i 352), 75797#(<= proc_i 364), 75796#(<= proc_i 360), 75799#(<= proc_i 372), 75798#(<= proc_i 368), 75801#(<= proc_i 380), 75800#(<= proc_i 376), 75803#(<= proc_i 388), 75802#(<= proc_i 384), 75805#(<= proc_i 396), 75804#(<= proc_i 392), 75807#(<= proc_i 404), 75806#(<= proc_i 400), 75809#(<= proc_i 412), 75808#(<= proc_i 408), 75811#(<= proc_i 420), 75810#(<= proc_i 416), 75813#(<= proc_i 428), 75812#(<= proc_i 424), 75815#(<= proc_i 436), 75814#(<= proc_i 432), 75817#(<= proc_i 444), 75816#(<= proc_i 440), 75819#(<= proc_i 452), 75818#(<= proc_i 448), 75821#(<= proc_i 460), 75820#(<= proc_i 456), 75823#(<= proc_i 468), 75822#(<= proc_i 464), 75825#(<= proc_i 476), 75824#(<= proc_i 472), 75827#(<= proc_i 484), 75826#(<= proc_i 480), 75829#(<= proc_i 492), 75828#(<= proc_i 488), 75831#(<= proc_i 500), 75830#(<= proc_i 496), 75833#(<= proc_i 508), 75832#(<= proc_i 504), 75705#false, 75704#true, 75707#(<= proc_i 4), 75706#(<= proc_i 0), 75709#(<= proc_i 12), 75708#(<= proc_i 8), 75711#(<= proc_i 20), 75710#(<= proc_i 16), 75713#(<= proc_i 28), 75712#(<= proc_i 24), 75715#(<= proc_i 36), 75714#(<= proc_i 32), 75717#(<= proc_i 44), 75716#(<= proc_i 40), 75719#(<= proc_i 52), 75718#(<= proc_i 48), 75721#(<= proc_i 60), 75720#(<= proc_i 56), 75723#(<= proc_i 68), 75722#(<= proc_i 64), 75725#(<= proc_i 76), 75724#(<= proc_i 72), 75727#(<= proc_i 84), 75726#(<= proc_i 80), 75729#(<= proc_i 92), 75728#(<= proc_i 88), 75731#(<= proc_i 100), 75730#(<= proc_i 96), 75733#(<= proc_i 108), 75732#(<= proc_i 104), 75735#(<= proc_i 116), 75734#(<= proc_i 112), 75737#(<= proc_i 124), 75736#(<= proc_i 120), 75739#(<= proc_i 132), 75738#(<= proc_i 128), 75741#(<= proc_i 140), 75740#(<= proc_i 136), 75743#(<= proc_i 148), 75742#(<= proc_i 144), 75745#(<= proc_i 156), 75744#(<= proc_i 152), 75747#(<= proc_i 164), 75746#(<= proc_i 160), 75749#(<= proc_i 172), 75748#(<= proc_i 168), 75751#(<= proc_i 180), 75750#(<= proc_i 176), 75753#(<= proc_i 188), 75752#(<= proc_i 184), 75755#(<= proc_i 196), 75754#(<= proc_i 192), 75757#(<= proc_i 204), 75756#(<= proc_i 200), 75759#(<= proc_i 212), 75758#(<= proc_i 208), 75761#(<= proc_i 220), 75760#(<= proc_i 216), 75763#(<= proc_i 228), 75762#(<= proc_i 224), 75765#(<= proc_i 236), 75764#(<= proc_i 232), 75767#(<= proc_i 244), 75766#(<= proc_i 240), 75769#(<= proc_i 252), 75768#(<= proc_i 248), 75771#(<= proc_i 260), 75770#(<= proc_i 256), 75773#(<= proc_i 268), 75772#(<= proc_i 264), 75775#(<= proc_i 276), 75774#(<= proc_i 272)] [2018-07-23 13:52:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 16256 backedges. 0 proven. 16256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:24,172 INFO L450 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-23 13:52:24,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-23 13:52:24,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-07-23 13:52:24,175 INFO L87 Difference]: Start difference. First operand 258 states and 258 transitions. Second operand 130 states. [2018-07-23 13:52:24,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:24,371 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-07-23 13:52:24,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-23 13:52:24,372 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 257 [2018-07-23 13:52:24,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:24,372 INFO L225 Difference]: With dead ends: 261 [2018-07-23 13:52:24,373 INFO L226 Difference]: Without dead ends: 260 [2018-07-23 13:52:24,374 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-07-23 13:52:24,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-07-23 13:52:24,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2018-07-23 13:52:24,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-07-23 13:52:24,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-07-23 13:52:24,378 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 257 [2018-07-23 13:52:24,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:24,379 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-07-23 13:52:24,379 INFO L472 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-23 13:52:24,379 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-07-23 13:52:24,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-07-23 13:52:24,380 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:24,380 INFO L357 BasicCegarLoop]: trace histogram [129, 128, 1, 1] [2018-07-23 13:52:24,380 INFO L414 AbstractCegarLoop]: === Iteration 129 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:24,380 INFO L82 PathProgramCache]: Analyzing trace with hash 440972768, now seen corresponding path program 128 times [2018-07-23 13:52:24,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 16512 backedges. 0 proven. 16512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:24,932 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:24,932 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-23 13:52:24,932 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:24,932 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:52:24,932 INFO L185 omatonBuilderFactory]: Interpolants [76877#false, 76876#true, 76879#(<= proc_i 4), 76878#(<= proc_i 0), 76881#(<= proc_i 12), 76880#(<= proc_i 8), 76883#(<= proc_i 20), 76882#(<= proc_i 16), 76885#(<= proc_i 28), 76884#(<= proc_i 24), 76887#(<= proc_i 36), 76886#(<= proc_i 32), 76889#(<= proc_i 44), 76888#(<= proc_i 40), 76891#(<= proc_i 52), 76890#(<= proc_i 48), 76893#(<= proc_i 60), 76892#(<= proc_i 56), 76895#(<= proc_i 68), 76894#(<= proc_i 64), 76897#(<= proc_i 76), 76896#(<= proc_i 72), 76899#(<= proc_i 84), 76898#(<= proc_i 80), 76901#(<= proc_i 92), 76900#(<= proc_i 88), 76903#(<= proc_i 100), 76902#(<= proc_i 96), 76905#(<= proc_i 108), 76904#(<= proc_i 104), 76907#(<= proc_i 116), 76906#(<= proc_i 112), 76909#(<= proc_i 124), 76908#(<= proc_i 120), 76911#(<= proc_i 132), 76910#(<= proc_i 128), 76913#(<= proc_i 140), 76912#(<= proc_i 136), 76915#(<= proc_i 148), 76914#(<= proc_i 144), 76917#(<= proc_i 156), 76916#(<= proc_i 152), 76919#(<= proc_i 164), 76918#(<= proc_i 160), 76921#(<= proc_i 172), 76920#(<= proc_i 168), 76923#(<= proc_i 180), 76922#(<= proc_i 176), 76925#(<= proc_i 188), 76924#(<= proc_i 184), 76927#(<= proc_i 196), 76926#(<= proc_i 192), 76929#(<= proc_i 204), 76928#(<= proc_i 200), 76931#(<= proc_i 212), 76930#(<= proc_i 208), 76933#(<= proc_i 220), 76932#(<= proc_i 216), 76935#(<= proc_i 228), 76934#(<= proc_i 224), 76937#(<= proc_i 236), 76936#(<= proc_i 232), 76939#(<= proc_i 244), 76938#(<= proc_i 240), 76941#(<= proc_i 252), 76940#(<= proc_i 248), 76943#(<= proc_i 260), 76942#(<= proc_i 256), 76945#(<= proc_i 268), 76944#(<= proc_i 264), 76947#(<= proc_i 276), 76946#(<= proc_i 272), 76949#(<= proc_i 284), 76948#(<= proc_i 280), 76951#(<= proc_i 292), 76950#(<= proc_i 288), 76953#(<= proc_i 300), 76952#(<= proc_i 296), 76955#(<= proc_i 308), 76954#(<= proc_i 304), 76957#(<= proc_i 316), 76956#(<= proc_i 312), 76959#(<= proc_i 324), 76958#(<= proc_i 320), 76961#(<= proc_i 332), 76960#(<= proc_i 328), 76963#(<= proc_i 340), 76962#(<= proc_i 336), 76965#(<= proc_i 348), 76964#(<= proc_i 344), 76967#(<= proc_i 356), 76966#(<= proc_i 352), 76969#(<= proc_i 364), 76968#(<= proc_i 360), 76971#(<= proc_i 372), 76970#(<= proc_i 368), 76973#(<= proc_i 380), 76972#(<= proc_i 376), 76975#(<= proc_i 388), 76974#(<= proc_i 384), 76977#(<= proc_i 396), 76976#(<= proc_i 392), 76979#(<= proc_i 404), 76978#(<= proc_i 400), 76981#(<= proc_i 412), 76980#(<= proc_i 408), 76983#(<= proc_i 420), 76982#(<= proc_i 416), 76985#(<= proc_i 428), 76984#(<= proc_i 424), 76987#(<= proc_i 436), 76986#(<= proc_i 432), 76989#(<= proc_i 444), 76988#(<= proc_i 440), 76991#(<= proc_i 452), 76990#(<= proc_i 448), 76993#(<= proc_i 460), 76992#(<= proc_i 456), 76995#(<= proc_i 468), 76994#(<= proc_i 464), 76997#(<= proc_i 476), 76996#(<= proc_i 472), 76999#(<= proc_i 484), 76998#(<= proc_i 480), 77001#(<= proc_i 492), 77000#(<= proc_i 488), 77003#(<= proc_i 500), 77002#(<= proc_i 496), 77005#(<= proc_i 508), 77004#(<= proc_i 504), 77006#(<= proc_i 512)] [2018-07-23 13:52:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 16512 backedges. 0 proven. 16512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:24,933 INFO L450 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-23 13:52:24,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-23 13:52:24,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-07-23 13:52:24,935 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 131 states. [2018-07-23 13:52:25,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:25,286 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-07-23 13:52:25,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-23 13:52:25,286 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 259 [2018-07-23 13:52:25,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:25,287 INFO L225 Difference]: With dead ends: 263 [2018-07-23 13:52:25,287 INFO L226 Difference]: Without dead ends: 262 [2018-07-23 13:52:25,287 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-07-23 13:52:25,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-07-23 13:52:25,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2018-07-23 13:52:25,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-07-23 13:52:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2018-07-23 13:52:25,290 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 259 [2018-07-23 13:52:25,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:25,291 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2018-07-23 13:52:25,291 INFO L472 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-23 13:52:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2018-07-23 13:52:25,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-07-23 13:52:25,291 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:25,292 INFO L357 BasicCegarLoop]: trace histogram [130, 129, 1, 1] [2018-07-23 13:52:25,292 INFO L414 AbstractCegarLoop]: === Iteration 130 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:25,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1426931166, now seen corresponding path program 129 times [2018-07-23 13:52:25,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:25,778 INFO L134 CoverageAnalysis]: Checked inductivity of 16770 backedges. 0 proven. 16770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:25,778 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:25,778 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-23 13:52:25,779 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:25,779 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:52:25,779 INFO L185 omatonBuilderFactory]: Interpolants [78081#(<= proc_i 88), 78080#(<= proc_i 84), 78083#(<= proc_i 96), 78082#(<= proc_i 92), 78085#(<= proc_i 104), 78084#(<= proc_i 100), 78087#(<= proc_i 112), 78086#(<= proc_i 108), 78089#(<= proc_i 120), 78088#(<= proc_i 116), 78091#(<= proc_i 128), 78090#(<= proc_i 124), 78093#(<= proc_i 136), 78092#(<= proc_i 132), 78095#(<= proc_i 144), 78094#(<= proc_i 140), 78097#(<= proc_i 152), 78096#(<= proc_i 148), 78099#(<= proc_i 160), 78098#(<= proc_i 156), 78101#(<= proc_i 168), 78100#(<= proc_i 164), 78103#(<= proc_i 176), 78102#(<= proc_i 172), 78105#(<= proc_i 184), 78104#(<= proc_i 180), 78107#(<= proc_i 192), 78106#(<= proc_i 188), 78109#(<= proc_i 200), 78108#(<= proc_i 196), 78111#(<= proc_i 208), 78110#(<= proc_i 204), 78113#(<= proc_i 216), 78112#(<= proc_i 212), 78115#(<= proc_i 224), 78114#(<= proc_i 220), 78117#(<= proc_i 232), 78116#(<= proc_i 228), 78119#(<= proc_i 240), 78118#(<= proc_i 236), 78121#(<= proc_i 248), 78120#(<= proc_i 244), 78123#(<= proc_i 256), 78122#(<= proc_i 252), 78125#(<= proc_i 264), 78124#(<= proc_i 260), 78127#(<= proc_i 272), 78126#(<= proc_i 268), 78129#(<= proc_i 280), 78128#(<= proc_i 276), 78131#(<= proc_i 288), 78130#(<= proc_i 284), 78133#(<= proc_i 296), 78132#(<= proc_i 292), 78135#(<= proc_i 304), 78134#(<= proc_i 300), 78137#(<= proc_i 312), 78136#(<= proc_i 308), 78139#(<= proc_i 320), 78138#(<= proc_i 316), 78141#(<= proc_i 328), 78140#(<= proc_i 324), 78143#(<= proc_i 336), 78142#(<= proc_i 332), 78145#(<= proc_i 344), 78144#(<= proc_i 340), 78147#(<= proc_i 352), 78146#(<= proc_i 348), 78149#(<= proc_i 360), 78148#(<= proc_i 356), 78151#(<= proc_i 368), 78150#(<= proc_i 364), 78153#(<= proc_i 376), 78152#(<= proc_i 372), 78155#(<= proc_i 384), 78154#(<= proc_i 380), 78157#(<= proc_i 392), 78156#(<= proc_i 388), 78159#(<= proc_i 400), 78158#(<= proc_i 396), 78161#(<= proc_i 408), 78160#(<= proc_i 404), 78163#(<= proc_i 416), 78162#(<= proc_i 412), 78165#(<= proc_i 424), 78164#(<= proc_i 420), 78167#(<= proc_i 432), 78166#(<= proc_i 428), 78169#(<= proc_i 440), 78168#(<= proc_i 436), 78171#(<= proc_i 448), 78170#(<= proc_i 444), 78173#(<= proc_i 456), 78172#(<= proc_i 452), 78175#(<= proc_i 464), 78174#(<= proc_i 460), 78177#(<= proc_i 472), 78176#(<= proc_i 468), 78179#(<= proc_i 480), 78178#(<= proc_i 476), 78181#(<= proc_i 488), 78180#(<= proc_i 484), 78183#(<= proc_i 496), 78182#(<= proc_i 492), 78185#(<= proc_i 504), 78184#(<= proc_i 500), 78187#(<= proc_i 512), 78186#(<= proc_i 508), 78188#(<= proc_i 516), 78057#true, 78059#(<= proc_i 0), 78058#false, 78061#(<= proc_i 8), 78060#(<= proc_i 4), 78063#(<= proc_i 16), 78062#(<= proc_i 12), 78065#(<= proc_i 24), 78064#(<= proc_i 20), 78067#(<= proc_i 32), 78066#(<= proc_i 28), 78069#(<= proc_i 40), 78068#(<= proc_i 36), 78071#(<= proc_i 48), 78070#(<= proc_i 44), 78073#(<= proc_i 56), 78072#(<= proc_i 52), 78075#(<= proc_i 64), 78074#(<= proc_i 60), 78077#(<= proc_i 72), 78076#(<= proc_i 68), 78079#(<= proc_i 80), 78078#(<= proc_i 76)] [2018-07-23 13:52:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 16770 backedges. 0 proven. 16770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:25,780 INFO L450 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-23 13:52:25,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-23 13:52:25,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-07-23 13:52:25,783 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 132 states. [2018-07-23 13:52:26,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:26,161 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-07-23 13:52:26,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-23 13:52:26,161 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 261 [2018-07-23 13:52:26,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:26,162 INFO L225 Difference]: With dead ends: 265 [2018-07-23 13:52:26,162 INFO L226 Difference]: Without dead ends: 264 [2018-07-23 13:52:26,163 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-07-23 13:52:26,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-07-23 13:52:26,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-07-23 13:52:26,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-07-23 13:52:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 264 transitions. [2018-07-23 13:52:26,167 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 264 transitions. Word has length 261 [2018-07-23 13:52:26,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:26,167 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 264 transitions. [2018-07-23 13:52:26,167 INFO L472 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-23 13:52:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 264 transitions. [2018-07-23 13:52:26,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-07-23 13:52:26,168 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:26,168 INFO L357 BasicCegarLoop]: trace histogram [131, 130, 1, 1] [2018-07-23 13:52:26,169 INFO L414 AbstractCegarLoop]: === Iteration 131 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:26,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1186282012, now seen corresponding path program 130 times [2018-07-23 13:52:26,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 17030 backedges. 0 proven. 17030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:26,725 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:26,725 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-23 13:52:26,726 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:26,726 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:52:26,726 INFO L185 omatonBuilderFactory]: Interpolants [79361#(<= proc_i 448), 79360#(<= proc_i 444), 79363#(<= proc_i 456), 79362#(<= proc_i 452), 79365#(<= proc_i 464), 79364#(<= proc_i 460), 79367#(<= proc_i 472), 79366#(<= proc_i 468), 79369#(<= proc_i 480), 79368#(<= proc_i 476), 79371#(<= proc_i 488), 79370#(<= proc_i 484), 79373#(<= proc_i 496), 79372#(<= proc_i 492), 79375#(<= proc_i 504), 79374#(<= proc_i 500), 79377#(<= proc_i 512), 79376#(<= proc_i 508), 79379#(<= proc_i 520), 79378#(<= proc_i 516), 79247#true, 79249#(<= proc_i 0), 79248#false, 79251#(<= proc_i 8), 79250#(<= proc_i 4), 79253#(<= proc_i 16), 79252#(<= proc_i 12), 79255#(<= proc_i 24), 79254#(<= proc_i 20), 79257#(<= proc_i 32), 79256#(<= proc_i 28), 79259#(<= proc_i 40), 79258#(<= proc_i 36), 79261#(<= proc_i 48), 79260#(<= proc_i 44), 79263#(<= proc_i 56), 79262#(<= proc_i 52), 79265#(<= proc_i 64), 79264#(<= proc_i 60), 79267#(<= proc_i 72), 79266#(<= proc_i 68), 79269#(<= proc_i 80), 79268#(<= proc_i 76), 79271#(<= proc_i 88), 79270#(<= proc_i 84), 79273#(<= proc_i 96), 79272#(<= proc_i 92), 79275#(<= proc_i 104), 79274#(<= proc_i 100), 79277#(<= proc_i 112), 79276#(<= proc_i 108), 79279#(<= proc_i 120), 79278#(<= proc_i 116), 79281#(<= proc_i 128), 79280#(<= proc_i 124), 79283#(<= proc_i 136), 79282#(<= proc_i 132), 79285#(<= proc_i 144), 79284#(<= proc_i 140), 79287#(<= proc_i 152), 79286#(<= proc_i 148), 79289#(<= proc_i 160), 79288#(<= proc_i 156), 79291#(<= proc_i 168), 79290#(<= proc_i 164), 79293#(<= proc_i 176), 79292#(<= proc_i 172), 79295#(<= proc_i 184), 79294#(<= proc_i 180), 79297#(<= proc_i 192), 79296#(<= proc_i 188), 79299#(<= proc_i 200), 79298#(<= proc_i 196), 79301#(<= proc_i 208), 79300#(<= proc_i 204), 79303#(<= proc_i 216), 79302#(<= proc_i 212), 79305#(<= proc_i 224), 79304#(<= proc_i 220), 79307#(<= proc_i 232), 79306#(<= proc_i 228), 79309#(<= proc_i 240), 79308#(<= proc_i 236), 79311#(<= proc_i 248), 79310#(<= proc_i 244), 79313#(<= proc_i 256), 79312#(<= proc_i 252), 79315#(<= proc_i 264), 79314#(<= proc_i 260), 79317#(<= proc_i 272), 79316#(<= proc_i 268), 79319#(<= proc_i 280), 79318#(<= proc_i 276), 79321#(<= proc_i 288), 79320#(<= proc_i 284), 79323#(<= proc_i 296), 79322#(<= proc_i 292), 79325#(<= proc_i 304), 79324#(<= proc_i 300), 79327#(<= proc_i 312), 79326#(<= proc_i 308), 79329#(<= proc_i 320), 79328#(<= proc_i 316), 79331#(<= proc_i 328), 79330#(<= proc_i 324), 79333#(<= proc_i 336), 79332#(<= proc_i 332), 79335#(<= proc_i 344), 79334#(<= proc_i 340), 79337#(<= proc_i 352), 79336#(<= proc_i 348), 79339#(<= proc_i 360), 79338#(<= proc_i 356), 79341#(<= proc_i 368), 79340#(<= proc_i 364), 79343#(<= proc_i 376), 79342#(<= proc_i 372), 79345#(<= proc_i 384), 79344#(<= proc_i 380), 79347#(<= proc_i 392), 79346#(<= proc_i 388), 79349#(<= proc_i 400), 79348#(<= proc_i 396), 79351#(<= proc_i 408), 79350#(<= proc_i 404), 79353#(<= proc_i 416), 79352#(<= proc_i 412), 79355#(<= proc_i 424), 79354#(<= proc_i 420), 79357#(<= proc_i 432), 79356#(<= proc_i 428), 79359#(<= proc_i 440), 79358#(<= proc_i 436)] [2018-07-23 13:52:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 17030 backedges. 0 proven. 17030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:26,727 INFO L450 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-23 13:52:26,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-23 13:52:26,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-07-23 13:52:26,729 INFO L87 Difference]: Start difference. First operand 264 states and 264 transitions. Second operand 133 states. [2018-07-23 13:52:27,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:27,043 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-07-23 13:52:27,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-23 13:52:27,043 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 263 [2018-07-23 13:52:27,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:27,044 INFO L225 Difference]: With dead ends: 267 [2018-07-23 13:52:27,044 INFO L226 Difference]: Without dead ends: 266 [2018-07-23 13:52:27,045 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-07-23 13:52:27,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-07-23 13:52:27,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2018-07-23 13:52:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-07-23 13:52:27,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-07-23 13:52:27,050 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 263 [2018-07-23 13:52:27,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:27,050 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-07-23 13:52:27,050 INFO L472 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-23 13:52:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-07-23 13:52:27,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-07-23 13:52:27,051 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:27,051 INFO L357 BasicCegarLoop]: trace histogram [132, 131, 1, 1] [2018-07-23 13:52:27,052 INFO L414 AbstractCegarLoop]: === Iteration 132 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:27,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1850679002, now seen corresponding path program 131 times [2018-07-23 13:52:27,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:27,619 INFO L134 CoverageAnalysis]: Checked inductivity of 17292 backedges. 0 proven. 17292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:27,620 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:27,620 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-23 13:52:27,620 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:27,620 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:52:27,620 INFO L185 omatonBuilderFactory]: Interpolants [80447#false, 80446#true, 80449#(<= proc_i 4), 80448#(<= proc_i 0), 80451#(<= proc_i 12), 80450#(<= proc_i 8), 80453#(<= proc_i 20), 80452#(<= proc_i 16), 80455#(<= proc_i 28), 80454#(<= proc_i 24), 80457#(<= proc_i 36), 80456#(<= proc_i 32), 80459#(<= proc_i 44), 80458#(<= proc_i 40), 80461#(<= proc_i 52), 80460#(<= proc_i 48), 80463#(<= proc_i 60), 80462#(<= proc_i 56), 80465#(<= proc_i 68), 80464#(<= proc_i 64), 80467#(<= proc_i 76), 80466#(<= proc_i 72), 80469#(<= proc_i 84), 80468#(<= proc_i 80), 80471#(<= proc_i 92), 80470#(<= proc_i 88), 80473#(<= proc_i 100), 80472#(<= proc_i 96), 80475#(<= proc_i 108), 80474#(<= proc_i 104), 80477#(<= proc_i 116), 80476#(<= proc_i 112), 80479#(<= proc_i 124), 80478#(<= proc_i 120), 80481#(<= proc_i 132), 80480#(<= proc_i 128), 80483#(<= proc_i 140), 80482#(<= proc_i 136), 80485#(<= proc_i 148), 80484#(<= proc_i 144), 80487#(<= proc_i 156), 80486#(<= proc_i 152), 80489#(<= proc_i 164), 80488#(<= proc_i 160), 80491#(<= proc_i 172), 80490#(<= proc_i 168), 80493#(<= proc_i 180), 80492#(<= proc_i 176), 80495#(<= proc_i 188), 80494#(<= proc_i 184), 80497#(<= proc_i 196), 80496#(<= proc_i 192), 80499#(<= proc_i 204), 80498#(<= proc_i 200), 80501#(<= proc_i 212), 80500#(<= proc_i 208), 80503#(<= proc_i 220), 80502#(<= proc_i 216), 80505#(<= proc_i 228), 80504#(<= proc_i 224), 80507#(<= proc_i 236), 80506#(<= proc_i 232), 80509#(<= proc_i 244), 80508#(<= proc_i 240), 80511#(<= proc_i 252), 80510#(<= proc_i 248), 80513#(<= proc_i 260), 80512#(<= proc_i 256), 80515#(<= proc_i 268), 80514#(<= proc_i 264), 80517#(<= proc_i 276), 80516#(<= proc_i 272), 80519#(<= proc_i 284), 80518#(<= proc_i 280), 80521#(<= proc_i 292), 80520#(<= proc_i 288), 80523#(<= proc_i 300), 80522#(<= proc_i 296), 80525#(<= proc_i 308), 80524#(<= proc_i 304), 80527#(<= proc_i 316), 80526#(<= proc_i 312), 80529#(<= proc_i 324), 80528#(<= proc_i 320), 80531#(<= proc_i 332), 80530#(<= proc_i 328), 80533#(<= proc_i 340), 80532#(<= proc_i 336), 80535#(<= proc_i 348), 80534#(<= proc_i 344), 80537#(<= proc_i 356), 80536#(<= proc_i 352), 80539#(<= proc_i 364), 80538#(<= proc_i 360), 80541#(<= proc_i 372), 80540#(<= proc_i 368), 80543#(<= proc_i 380), 80542#(<= proc_i 376), 80545#(<= proc_i 388), 80544#(<= proc_i 384), 80547#(<= proc_i 396), 80546#(<= proc_i 392), 80549#(<= proc_i 404), 80548#(<= proc_i 400), 80551#(<= proc_i 412), 80550#(<= proc_i 408), 80553#(<= proc_i 420), 80552#(<= proc_i 416), 80555#(<= proc_i 428), 80554#(<= proc_i 424), 80557#(<= proc_i 436), 80556#(<= proc_i 432), 80559#(<= proc_i 444), 80558#(<= proc_i 440), 80561#(<= proc_i 452), 80560#(<= proc_i 448), 80563#(<= proc_i 460), 80562#(<= proc_i 456), 80565#(<= proc_i 468), 80564#(<= proc_i 464), 80567#(<= proc_i 476), 80566#(<= proc_i 472), 80569#(<= proc_i 484), 80568#(<= proc_i 480), 80571#(<= proc_i 492), 80570#(<= proc_i 488), 80573#(<= proc_i 500), 80572#(<= proc_i 496), 80575#(<= proc_i 508), 80574#(<= proc_i 504), 80577#(<= proc_i 516), 80576#(<= proc_i 512), 80579#(<= proc_i 524), 80578#(<= proc_i 520)] [2018-07-23 13:52:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 17292 backedges. 0 proven. 17292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:27,622 INFO L450 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-23 13:52:27,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-23 13:52:27,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-07-23 13:52:27,624 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 134 states. [2018-07-23 13:52:28,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:28,020 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-07-23 13:52:28,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-23 13:52:28,020 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 265 [2018-07-23 13:52:28,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:28,020 INFO L225 Difference]: With dead ends: 269 [2018-07-23 13:52:28,021 INFO L226 Difference]: Without dead ends: 268 [2018-07-23 13:52:28,022 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-07-23 13:52:28,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-07-23 13:52:28,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-07-23 13:52:28,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-07-23 13:52:28,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2018-07-23 13:52:28,025 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 265 [2018-07-23 13:52:28,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:28,026 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2018-07-23 13:52:28,026 INFO L472 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-23 13:52:28,026 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2018-07-23 13:52:28,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-07-23 13:52:28,027 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:28,027 INFO L357 BasicCegarLoop]: trace histogram [133, 132, 1, 1] [2018-07-23 13:52:28,027 INFO L414 AbstractCegarLoop]: === Iteration 133 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:28,027 INFO L82 PathProgramCache]: Analyzing trace with hash -386059288, now seen corresponding path program 132 times [2018-07-23 13:52:28,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 17556 backedges. 0 proven. 17556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:28,620 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:28,620 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-23 13:52:28,620 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:28,620 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:52:28,621 INFO L185 omatonBuilderFactory]: Interpolants [81665#(<= proc_i 36), 81664#(<= proc_i 32), 81667#(<= proc_i 44), 81666#(<= proc_i 40), 81669#(<= proc_i 52), 81668#(<= proc_i 48), 81671#(<= proc_i 60), 81670#(<= proc_i 56), 81673#(<= proc_i 68), 81672#(<= proc_i 64), 81675#(<= proc_i 76), 81674#(<= proc_i 72), 81677#(<= proc_i 84), 81676#(<= proc_i 80), 81679#(<= proc_i 92), 81678#(<= proc_i 88), 81681#(<= proc_i 100), 81680#(<= proc_i 96), 81683#(<= proc_i 108), 81682#(<= proc_i 104), 81685#(<= proc_i 116), 81684#(<= proc_i 112), 81687#(<= proc_i 124), 81686#(<= proc_i 120), 81689#(<= proc_i 132), 81688#(<= proc_i 128), 81691#(<= proc_i 140), 81690#(<= proc_i 136), 81693#(<= proc_i 148), 81692#(<= proc_i 144), 81695#(<= proc_i 156), 81694#(<= proc_i 152), 81697#(<= proc_i 164), 81696#(<= proc_i 160), 81699#(<= proc_i 172), 81698#(<= proc_i 168), 81701#(<= proc_i 180), 81700#(<= proc_i 176), 81703#(<= proc_i 188), 81702#(<= proc_i 184), 81705#(<= proc_i 196), 81704#(<= proc_i 192), 81707#(<= proc_i 204), 81706#(<= proc_i 200), 81709#(<= proc_i 212), 81708#(<= proc_i 208), 81711#(<= proc_i 220), 81710#(<= proc_i 216), 81713#(<= proc_i 228), 81712#(<= proc_i 224), 81715#(<= proc_i 236), 81714#(<= proc_i 232), 81717#(<= proc_i 244), 81716#(<= proc_i 240), 81719#(<= proc_i 252), 81718#(<= proc_i 248), 81721#(<= proc_i 260), 81720#(<= proc_i 256), 81723#(<= proc_i 268), 81722#(<= proc_i 264), 81725#(<= proc_i 276), 81724#(<= proc_i 272), 81727#(<= proc_i 284), 81726#(<= proc_i 280), 81729#(<= proc_i 292), 81728#(<= proc_i 288), 81731#(<= proc_i 300), 81730#(<= proc_i 296), 81733#(<= proc_i 308), 81732#(<= proc_i 304), 81735#(<= proc_i 316), 81734#(<= proc_i 312), 81737#(<= proc_i 324), 81736#(<= proc_i 320), 81739#(<= proc_i 332), 81738#(<= proc_i 328), 81741#(<= proc_i 340), 81740#(<= proc_i 336), 81743#(<= proc_i 348), 81742#(<= proc_i 344), 81745#(<= proc_i 356), 81744#(<= proc_i 352), 81747#(<= proc_i 364), 81746#(<= proc_i 360), 81749#(<= proc_i 372), 81748#(<= proc_i 368), 81751#(<= proc_i 380), 81750#(<= proc_i 376), 81753#(<= proc_i 388), 81752#(<= proc_i 384), 81755#(<= proc_i 396), 81754#(<= proc_i 392), 81757#(<= proc_i 404), 81756#(<= proc_i 400), 81759#(<= proc_i 412), 81758#(<= proc_i 408), 81761#(<= proc_i 420), 81760#(<= proc_i 416), 81763#(<= proc_i 428), 81762#(<= proc_i 424), 81765#(<= proc_i 436), 81764#(<= proc_i 432), 81767#(<= proc_i 444), 81766#(<= proc_i 440), 81769#(<= proc_i 452), 81768#(<= proc_i 448), 81771#(<= proc_i 460), 81770#(<= proc_i 456), 81773#(<= proc_i 468), 81772#(<= proc_i 464), 81775#(<= proc_i 476), 81774#(<= proc_i 472), 81777#(<= proc_i 484), 81776#(<= proc_i 480), 81779#(<= proc_i 492), 81778#(<= proc_i 488), 81781#(<= proc_i 500), 81780#(<= proc_i 496), 81783#(<= proc_i 508), 81782#(<= proc_i 504), 81785#(<= proc_i 516), 81784#(<= proc_i 512), 81787#(<= proc_i 524), 81786#(<= proc_i 520), 81788#(<= proc_i 528), 81655#false, 81654#true, 81657#(<= proc_i 4), 81656#(<= proc_i 0), 81659#(<= proc_i 12), 81658#(<= proc_i 8), 81661#(<= proc_i 20), 81660#(<= proc_i 16), 81663#(<= proc_i 28), 81662#(<= proc_i 24)] [2018-07-23 13:52:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 17556 backedges. 0 proven. 17556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:28,622 INFO L450 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-07-23 13:52:28,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-07-23 13:52:28,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-07-23 13:52:28,625 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 135 states. [2018-07-23 13:52:29,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:29,136 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-07-23 13:52:29,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-23 13:52:29,137 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 267 [2018-07-23 13:52:29,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:29,138 INFO L225 Difference]: With dead ends: 271 [2018-07-23 13:52:29,138 INFO L226 Difference]: Without dead ends: 270 [2018-07-23 13:52:29,139 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-07-23 13:52:29,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-07-23 13:52:29,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2018-07-23 13:52:29,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-07-23 13:52:29,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 270 transitions. [2018-07-23 13:52:29,144 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 270 transitions. Word has length 267 [2018-07-23 13:52:29,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:29,145 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 270 transitions. [2018-07-23 13:52:29,145 INFO L472 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-07-23 13:52:29,145 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 270 transitions. [2018-07-23 13:52:29,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-07-23 13:52:29,146 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:29,146 INFO L357 BasicCegarLoop]: trace histogram [134, 133, 1, 1] [2018-07-23 13:52:29,146 INFO L414 AbstractCegarLoop]: === Iteration 134 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:29,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1635787222, now seen corresponding path program 133 times [2018-07-23 13:52:29,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:29,793 INFO L134 CoverageAnalysis]: Checked inductivity of 17822 backedges. 0 proven. 17822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:29,793 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:29,793 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-07-23 13:52:29,794 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:29,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:52:29,794 INFO L185 omatonBuilderFactory]: Interpolants [82945#(<= proc_i 288), 82944#(<= proc_i 284), 82947#(<= proc_i 296), 82946#(<= proc_i 292), 82949#(<= proc_i 304), 82948#(<= proc_i 300), 82951#(<= proc_i 312), 82950#(<= proc_i 308), 82953#(<= proc_i 320), 82952#(<= proc_i 316), 82955#(<= proc_i 328), 82954#(<= proc_i 324), 82957#(<= proc_i 336), 82956#(<= proc_i 332), 82959#(<= proc_i 344), 82958#(<= proc_i 340), 82961#(<= proc_i 352), 82960#(<= proc_i 348), 82963#(<= proc_i 360), 82962#(<= proc_i 356), 82965#(<= proc_i 368), 82964#(<= proc_i 364), 82967#(<= proc_i 376), 82966#(<= proc_i 372), 82969#(<= proc_i 384), 82968#(<= proc_i 380), 82971#(<= proc_i 392), 82970#(<= proc_i 388), 82973#(<= proc_i 400), 82972#(<= proc_i 396), 82975#(<= proc_i 408), 82974#(<= proc_i 404), 82977#(<= proc_i 416), 82976#(<= proc_i 412), 82979#(<= proc_i 424), 82978#(<= proc_i 420), 82981#(<= proc_i 432), 82980#(<= proc_i 428), 82983#(<= proc_i 440), 82982#(<= proc_i 436), 82985#(<= proc_i 448), 82984#(<= proc_i 444), 82987#(<= proc_i 456), 82986#(<= proc_i 452), 82989#(<= proc_i 464), 82988#(<= proc_i 460), 82991#(<= proc_i 472), 82990#(<= proc_i 468), 82993#(<= proc_i 480), 82992#(<= proc_i 476), 82995#(<= proc_i 488), 82994#(<= proc_i 484), 82997#(<= proc_i 496), 82996#(<= proc_i 492), 82999#(<= proc_i 504), 82998#(<= proc_i 500), 83001#(<= proc_i 512), 83000#(<= proc_i 508), 83003#(<= proc_i 520), 83002#(<= proc_i 516), 83005#(<= proc_i 528), 83004#(<= proc_i 524), 83006#(<= proc_i 532), 82871#true, 82873#(<= proc_i 0), 82872#false, 82875#(<= proc_i 8), 82874#(<= proc_i 4), 82877#(<= proc_i 16), 82876#(<= proc_i 12), 82879#(<= proc_i 24), 82878#(<= proc_i 20), 82881#(<= proc_i 32), 82880#(<= proc_i 28), 82883#(<= proc_i 40), 82882#(<= proc_i 36), 82885#(<= proc_i 48), 82884#(<= proc_i 44), 82887#(<= proc_i 56), 82886#(<= proc_i 52), 82889#(<= proc_i 64), 82888#(<= proc_i 60), 82891#(<= proc_i 72), 82890#(<= proc_i 68), 82893#(<= proc_i 80), 82892#(<= proc_i 76), 82895#(<= proc_i 88), 82894#(<= proc_i 84), 82897#(<= proc_i 96), 82896#(<= proc_i 92), 82899#(<= proc_i 104), 82898#(<= proc_i 100), 82901#(<= proc_i 112), 82900#(<= proc_i 108), 82903#(<= proc_i 120), 82902#(<= proc_i 116), 82905#(<= proc_i 128), 82904#(<= proc_i 124), 82907#(<= proc_i 136), 82906#(<= proc_i 132), 82909#(<= proc_i 144), 82908#(<= proc_i 140), 82911#(<= proc_i 152), 82910#(<= proc_i 148), 82913#(<= proc_i 160), 82912#(<= proc_i 156), 82915#(<= proc_i 168), 82914#(<= proc_i 164), 82917#(<= proc_i 176), 82916#(<= proc_i 172), 82919#(<= proc_i 184), 82918#(<= proc_i 180), 82921#(<= proc_i 192), 82920#(<= proc_i 188), 82923#(<= proc_i 200), 82922#(<= proc_i 196), 82925#(<= proc_i 208), 82924#(<= proc_i 204), 82927#(<= proc_i 216), 82926#(<= proc_i 212), 82929#(<= proc_i 224), 82928#(<= proc_i 220), 82931#(<= proc_i 232), 82930#(<= proc_i 228), 82933#(<= proc_i 240), 82932#(<= proc_i 236), 82935#(<= proc_i 248), 82934#(<= proc_i 244), 82937#(<= proc_i 256), 82936#(<= proc_i 252), 82939#(<= proc_i 264), 82938#(<= proc_i 260), 82941#(<= proc_i 272), 82940#(<= proc_i 268), 82943#(<= proc_i 280), 82942#(<= proc_i 276)] [2018-07-23 13:52:29,795 INFO L134 CoverageAnalysis]: Checked inductivity of 17822 backedges. 0 proven. 17822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:29,796 INFO L450 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-23 13:52:29,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-23 13:52:29,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-07-23 13:52:29,799 INFO L87 Difference]: Start difference. First operand 270 states and 270 transitions. Second operand 136 states. [2018-07-23 13:52:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:29,988 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-07-23 13:52:29,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-23 13:52:29,988 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 269 [2018-07-23 13:52:29,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:29,989 INFO L225 Difference]: With dead ends: 273 [2018-07-23 13:52:29,989 INFO L226 Difference]: Without dead ends: 272 [2018-07-23 13:52:29,990 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-07-23 13:52:29,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-07-23 13:52:29,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2018-07-23 13:52:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-07-23 13:52:29,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-07-23 13:52:29,994 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 269 [2018-07-23 13:52:29,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:29,995 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-07-23 13:52:29,995 INFO L472 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-23 13:52:29,995 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-07-23 13:52:29,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-07-23 13:52:29,996 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:29,996 INFO L357 BasicCegarLoop]: trace histogram [135, 134, 1, 1] [2018-07-23 13:52:29,996 INFO L414 AbstractCegarLoop]: === Iteration 135 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:29,996 INFO L82 PathProgramCache]: Analyzing trace with hash -33488916, now seen corresponding path program 134 times [2018-07-23 13:52:29,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 18090 backedges. 0 proven. 18090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:30,624 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:30,624 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-23 13:52:30,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:30,625 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:52:30,626 INFO L185 omatonBuilderFactory]: Interpolants [84225#(<= proc_i 504), 84224#(<= proc_i 500), 84227#(<= proc_i 512), 84226#(<= proc_i 508), 84229#(<= proc_i 520), 84228#(<= proc_i 516), 84231#(<= proc_i 528), 84230#(<= proc_i 524), 84233#(<= proc_i 536), 84232#(<= proc_i 532), 84097#true, 84099#(<= proc_i 0), 84098#false, 84101#(<= proc_i 8), 84100#(<= proc_i 4), 84103#(<= proc_i 16), 84102#(<= proc_i 12), 84105#(<= proc_i 24), 84104#(<= proc_i 20), 84107#(<= proc_i 32), 84106#(<= proc_i 28), 84109#(<= proc_i 40), 84108#(<= proc_i 36), 84111#(<= proc_i 48), 84110#(<= proc_i 44), 84113#(<= proc_i 56), 84112#(<= proc_i 52), 84115#(<= proc_i 64), 84114#(<= proc_i 60), 84117#(<= proc_i 72), 84116#(<= proc_i 68), 84119#(<= proc_i 80), 84118#(<= proc_i 76), 84121#(<= proc_i 88), 84120#(<= proc_i 84), 84123#(<= proc_i 96), 84122#(<= proc_i 92), 84125#(<= proc_i 104), 84124#(<= proc_i 100), 84127#(<= proc_i 112), 84126#(<= proc_i 108), 84129#(<= proc_i 120), 84128#(<= proc_i 116), 84131#(<= proc_i 128), 84130#(<= proc_i 124), 84133#(<= proc_i 136), 84132#(<= proc_i 132), 84135#(<= proc_i 144), 84134#(<= proc_i 140), 84137#(<= proc_i 152), 84136#(<= proc_i 148), 84139#(<= proc_i 160), 84138#(<= proc_i 156), 84141#(<= proc_i 168), 84140#(<= proc_i 164), 84143#(<= proc_i 176), 84142#(<= proc_i 172), 84145#(<= proc_i 184), 84144#(<= proc_i 180), 84147#(<= proc_i 192), 84146#(<= proc_i 188), 84149#(<= proc_i 200), 84148#(<= proc_i 196), 84151#(<= proc_i 208), 84150#(<= proc_i 204), 84153#(<= proc_i 216), 84152#(<= proc_i 212), 84155#(<= proc_i 224), 84154#(<= proc_i 220), 84157#(<= proc_i 232), 84156#(<= proc_i 228), 84159#(<= proc_i 240), 84158#(<= proc_i 236), 84161#(<= proc_i 248), 84160#(<= proc_i 244), 84163#(<= proc_i 256), 84162#(<= proc_i 252), 84165#(<= proc_i 264), 84164#(<= proc_i 260), 84167#(<= proc_i 272), 84166#(<= proc_i 268), 84169#(<= proc_i 280), 84168#(<= proc_i 276), 84171#(<= proc_i 288), 84170#(<= proc_i 284), 84173#(<= proc_i 296), 84172#(<= proc_i 292), 84175#(<= proc_i 304), 84174#(<= proc_i 300), 84177#(<= proc_i 312), 84176#(<= proc_i 308), 84179#(<= proc_i 320), 84178#(<= proc_i 316), 84181#(<= proc_i 328), 84180#(<= proc_i 324), 84183#(<= proc_i 336), 84182#(<= proc_i 332), 84185#(<= proc_i 344), 84184#(<= proc_i 340), 84187#(<= proc_i 352), 84186#(<= proc_i 348), 84189#(<= proc_i 360), 84188#(<= proc_i 356), 84191#(<= proc_i 368), 84190#(<= proc_i 364), 84193#(<= proc_i 376), 84192#(<= proc_i 372), 84195#(<= proc_i 384), 84194#(<= proc_i 380), 84197#(<= proc_i 392), 84196#(<= proc_i 388), 84199#(<= proc_i 400), 84198#(<= proc_i 396), 84201#(<= proc_i 408), 84200#(<= proc_i 404), 84203#(<= proc_i 416), 84202#(<= proc_i 412), 84205#(<= proc_i 424), 84204#(<= proc_i 420), 84207#(<= proc_i 432), 84206#(<= proc_i 428), 84209#(<= proc_i 440), 84208#(<= proc_i 436), 84211#(<= proc_i 448), 84210#(<= proc_i 444), 84213#(<= proc_i 456), 84212#(<= proc_i 452), 84215#(<= proc_i 464), 84214#(<= proc_i 460), 84217#(<= proc_i 472), 84216#(<= proc_i 468), 84219#(<= proc_i 480), 84218#(<= proc_i 476), 84221#(<= proc_i 488), 84220#(<= proc_i 484), 84223#(<= proc_i 496), 84222#(<= proc_i 492)] [2018-07-23 13:52:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 18090 backedges. 0 proven. 18090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:30,627 INFO L450 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-07-23 13:52:30,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-07-23 13:52:30,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-07-23 13:52:30,629 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 137 states. [2018-07-23 13:52:31,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:31,089 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-07-23 13:52:31,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-23 13:52:31,089 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 271 [2018-07-23 13:52:31,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:31,090 INFO L225 Difference]: With dead ends: 275 [2018-07-23 13:52:31,090 INFO L226 Difference]: Without dead ends: 274 [2018-07-23 13:52:31,091 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-07-23 13:52:31,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-07-23 13:52:31,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-07-23 13:52:31,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-07-23 13:52:31,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 274 transitions. [2018-07-23 13:52:31,096 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 274 transitions. Word has length 271 [2018-07-23 13:52:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:31,096 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 274 transitions. [2018-07-23 13:52:31,096 INFO L472 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-07-23 13:52:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 274 transitions. [2018-07-23 13:52:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-07-23 13:52:31,098 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:31,098 INFO L357 BasicCegarLoop]: trace histogram [136, 135, 1, 1] [2018-07-23 13:52:31,098 INFO L414 AbstractCegarLoop]: === Iteration 136 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:31,098 INFO L82 PathProgramCache]: Analyzing trace with hash -2118076114, now seen corresponding path program 135 times [2018-07-23 13:52:31,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 18360 backedges. 0 proven. 18360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:31,955 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:31,955 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-07-23 13:52:31,956 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:31,956 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:52:31,956 INFO L185 omatonBuilderFactory]: Interpolants [85333#false, 85332#true, 85335#(<= proc_i 4), 85334#(<= proc_i 0), 85337#(<= proc_i 12), 85336#(<= proc_i 8), 85339#(<= proc_i 20), 85338#(<= proc_i 16), 85341#(<= proc_i 28), 85340#(<= proc_i 24), 85343#(<= proc_i 36), 85342#(<= proc_i 32), 85345#(<= proc_i 44), 85344#(<= proc_i 40), 85347#(<= proc_i 52), 85346#(<= proc_i 48), 85349#(<= proc_i 60), 85348#(<= proc_i 56), 85351#(<= proc_i 68), 85350#(<= proc_i 64), 85353#(<= proc_i 76), 85352#(<= proc_i 72), 85355#(<= proc_i 84), 85354#(<= proc_i 80), 85357#(<= proc_i 92), 85356#(<= proc_i 88), 85359#(<= proc_i 100), 85358#(<= proc_i 96), 85361#(<= proc_i 108), 85360#(<= proc_i 104), 85363#(<= proc_i 116), 85362#(<= proc_i 112), 85365#(<= proc_i 124), 85364#(<= proc_i 120), 85367#(<= proc_i 132), 85366#(<= proc_i 128), 85369#(<= proc_i 140), 85368#(<= proc_i 136), 85371#(<= proc_i 148), 85370#(<= proc_i 144), 85373#(<= proc_i 156), 85372#(<= proc_i 152), 85375#(<= proc_i 164), 85374#(<= proc_i 160), 85377#(<= proc_i 172), 85376#(<= proc_i 168), 85379#(<= proc_i 180), 85378#(<= proc_i 176), 85381#(<= proc_i 188), 85380#(<= proc_i 184), 85383#(<= proc_i 196), 85382#(<= proc_i 192), 85385#(<= proc_i 204), 85384#(<= proc_i 200), 85387#(<= proc_i 212), 85386#(<= proc_i 208), 85389#(<= proc_i 220), 85388#(<= proc_i 216), 85391#(<= proc_i 228), 85390#(<= proc_i 224), 85393#(<= proc_i 236), 85392#(<= proc_i 232), 85395#(<= proc_i 244), 85394#(<= proc_i 240), 85397#(<= proc_i 252), 85396#(<= proc_i 248), 85399#(<= proc_i 260), 85398#(<= proc_i 256), 85401#(<= proc_i 268), 85400#(<= proc_i 264), 85403#(<= proc_i 276), 85402#(<= proc_i 272), 85405#(<= proc_i 284), 85404#(<= proc_i 280), 85407#(<= proc_i 292), 85406#(<= proc_i 288), 85409#(<= proc_i 300), 85408#(<= proc_i 296), 85411#(<= proc_i 308), 85410#(<= proc_i 304), 85413#(<= proc_i 316), 85412#(<= proc_i 312), 85415#(<= proc_i 324), 85414#(<= proc_i 320), 85417#(<= proc_i 332), 85416#(<= proc_i 328), 85419#(<= proc_i 340), 85418#(<= proc_i 336), 85421#(<= proc_i 348), 85420#(<= proc_i 344), 85423#(<= proc_i 356), 85422#(<= proc_i 352), 85425#(<= proc_i 364), 85424#(<= proc_i 360), 85427#(<= proc_i 372), 85426#(<= proc_i 368), 85429#(<= proc_i 380), 85428#(<= proc_i 376), 85431#(<= proc_i 388), 85430#(<= proc_i 384), 85433#(<= proc_i 396), 85432#(<= proc_i 392), 85435#(<= proc_i 404), 85434#(<= proc_i 400), 85437#(<= proc_i 412), 85436#(<= proc_i 408), 85439#(<= proc_i 420), 85438#(<= proc_i 416), 85441#(<= proc_i 428), 85440#(<= proc_i 424), 85443#(<= proc_i 436), 85442#(<= proc_i 432), 85445#(<= proc_i 444), 85444#(<= proc_i 440), 85447#(<= proc_i 452), 85446#(<= proc_i 448), 85449#(<= proc_i 460), 85448#(<= proc_i 456), 85451#(<= proc_i 468), 85450#(<= proc_i 464), 85453#(<= proc_i 476), 85452#(<= proc_i 472), 85455#(<= proc_i 484), 85454#(<= proc_i 480), 85457#(<= proc_i 492), 85456#(<= proc_i 488), 85459#(<= proc_i 500), 85458#(<= proc_i 496), 85461#(<= proc_i 508), 85460#(<= proc_i 504), 85463#(<= proc_i 516), 85462#(<= proc_i 512), 85465#(<= proc_i 524), 85464#(<= proc_i 520), 85467#(<= proc_i 532), 85466#(<= proc_i 528), 85469#(<= proc_i 540), 85468#(<= proc_i 536)] [2018-07-23 13:52:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 18360 backedges. 0 proven. 18360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:31,958 INFO L450 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-23 13:52:31,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-23 13:52:31,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-07-23 13:52:31,961 INFO L87 Difference]: Start difference. First operand 274 states and 274 transitions. Second operand 138 states. [2018-07-23 13:52:32,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:32,448 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-07-23 13:52:32,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-23 13:52:32,448 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 273 [2018-07-23 13:52:32,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:32,449 INFO L225 Difference]: With dead ends: 277 [2018-07-23 13:52:32,449 INFO L226 Difference]: Without dead ends: 276 [2018-07-23 13:52:32,450 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-07-23 13:52:32,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-07-23 13:52:32,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2018-07-23 13:52:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-07-23 13:52:32,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-07-23 13:52:32,453 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 273 [2018-07-23 13:52:32,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:32,453 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-07-23 13:52:32,453 INFO L472 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-23 13:52:32,453 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-07-23 13:52:32,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-07-23 13:52:32,454 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:32,454 INFO L357 BasicCegarLoop]: trace histogram [137, 136, 1, 1] [2018-07-23 13:52:32,454 INFO L414 AbstractCegarLoop]: === Iteration 137 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:32,454 INFO L82 PathProgramCache]: Analyzing trace with hash 343353840, now seen corresponding path program 136 times [2018-07-23 13:52:32,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 18632 backedges. 0 proven. 18632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:33,009 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:33,009 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-23 13:52:33,009 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:33,010 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:52:33,010 INFO L185 omatonBuilderFactory]: Interpolants [86577#false, 86576#true, 86579#(<= proc_i 4), 86578#(<= proc_i 0), 86581#(<= proc_i 12), 86580#(<= proc_i 8), 86583#(<= proc_i 20), 86582#(<= proc_i 16), 86585#(<= proc_i 28), 86584#(<= proc_i 24), 86587#(<= proc_i 36), 86586#(<= proc_i 32), 86589#(<= proc_i 44), 86588#(<= proc_i 40), 86591#(<= proc_i 52), 86590#(<= proc_i 48), 86593#(<= proc_i 60), 86592#(<= proc_i 56), 86595#(<= proc_i 68), 86594#(<= proc_i 64), 86597#(<= proc_i 76), 86596#(<= proc_i 72), 86599#(<= proc_i 84), 86598#(<= proc_i 80), 86601#(<= proc_i 92), 86600#(<= proc_i 88), 86603#(<= proc_i 100), 86602#(<= proc_i 96), 86605#(<= proc_i 108), 86604#(<= proc_i 104), 86607#(<= proc_i 116), 86606#(<= proc_i 112), 86609#(<= proc_i 124), 86608#(<= proc_i 120), 86611#(<= proc_i 132), 86610#(<= proc_i 128), 86613#(<= proc_i 140), 86612#(<= proc_i 136), 86615#(<= proc_i 148), 86614#(<= proc_i 144), 86617#(<= proc_i 156), 86616#(<= proc_i 152), 86619#(<= proc_i 164), 86618#(<= proc_i 160), 86621#(<= proc_i 172), 86620#(<= proc_i 168), 86623#(<= proc_i 180), 86622#(<= proc_i 176), 86625#(<= proc_i 188), 86624#(<= proc_i 184), 86627#(<= proc_i 196), 86626#(<= proc_i 192), 86629#(<= proc_i 204), 86628#(<= proc_i 200), 86631#(<= proc_i 212), 86630#(<= proc_i 208), 86633#(<= proc_i 220), 86632#(<= proc_i 216), 86635#(<= proc_i 228), 86634#(<= proc_i 224), 86637#(<= proc_i 236), 86636#(<= proc_i 232), 86639#(<= proc_i 244), 86638#(<= proc_i 240), 86641#(<= proc_i 252), 86640#(<= proc_i 248), 86643#(<= proc_i 260), 86642#(<= proc_i 256), 86645#(<= proc_i 268), 86644#(<= proc_i 264), 86647#(<= proc_i 276), 86646#(<= proc_i 272), 86649#(<= proc_i 284), 86648#(<= proc_i 280), 86651#(<= proc_i 292), 86650#(<= proc_i 288), 86653#(<= proc_i 300), 86652#(<= proc_i 296), 86655#(<= proc_i 308), 86654#(<= proc_i 304), 86657#(<= proc_i 316), 86656#(<= proc_i 312), 86659#(<= proc_i 324), 86658#(<= proc_i 320), 86661#(<= proc_i 332), 86660#(<= proc_i 328), 86663#(<= proc_i 340), 86662#(<= proc_i 336), 86665#(<= proc_i 348), 86664#(<= proc_i 344), 86667#(<= proc_i 356), 86666#(<= proc_i 352), 86669#(<= proc_i 364), 86668#(<= proc_i 360), 86671#(<= proc_i 372), 86670#(<= proc_i 368), 86673#(<= proc_i 380), 86672#(<= proc_i 376), 86675#(<= proc_i 388), 86674#(<= proc_i 384), 86677#(<= proc_i 396), 86676#(<= proc_i 392), 86679#(<= proc_i 404), 86678#(<= proc_i 400), 86681#(<= proc_i 412), 86680#(<= proc_i 408), 86683#(<= proc_i 420), 86682#(<= proc_i 416), 86685#(<= proc_i 428), 86684#(<= proc_i 424), 86687#(<= proc_i 436), 86686#(<= proc_i 432), 86689#(<= proc_i 444), 86688#(<= proc_i 440), 86691#(<= proc_i 452), 86690#(<= proc_i 448), 86693#(<= proc_i 460), 86692#(<= proc_i 456), 86695#(<= proc_i 468), 86694#(<= proc_i 464), 86697#(<= proc_i 476), 86696#(<= proc_i 472), 86699#(<= proc_i 484), 86698#(<= proc_i 480), 86701#(<= proc_i 492), 86700#(<= proc_i 488), 86703#(<= proc_i 500), 86702#(<= proc_i 496), 86705#(<= proc_i 508), 86704#(<= proc_i 504), 86707#(<= proc_i 516), 86706#(<= proc_i 512), 86709#(<= proc_i 524), 86708#(<= proc_i 520), 86711#(<= proc_i 532), 86710#(<= proc_i 528), 86713#(<= proc_i 540), 86712#(<= proc_i 536), 86714#(<= proc_i 544)] [2018-07-23 13:52:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 18632 backedges. 0 proven. 18632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:33,011 INFO L450 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-07-23 13:52:33,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-07-23 13:52:33,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-07-23 13:52:33,014 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 139 states. [2018-07-23 13:52:33,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:33,430 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-07-23 13:52:33,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-07-23 13:52:33,430 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 275 [2018-07-23 13:52:33,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:33,430 INFO L225 Difference]: With dead ends: 279 [2018-07-23 13:52:33,431 INFO L226 Difference]: Without dead ends: 278 [2018-07-23 13:52:33,432 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-07-23 13:52:33,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-07-23 13:52:33,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-07-23 13:52:33,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-07-23 13:52:33,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-07-23 13:52:33,435 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 275 [2018-07-23 13:52:33,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:33,436 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-07-23 13:52:33,436 INFO L472 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-07-23 13:52:33,436 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-07-23 13:52:33,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-07-23 13:52:33,437 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:33,437 INFO L357 BasicCegarLoop]: trace histogram [138, 137, 1, 1] [2018-07-23 13:52:33,437 INFO L414 AbstractCegarLoop]: === Iteration 138 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:33,437 INFO L82 PathProgramCache]: Analyzing trace with hash -749440462, now seen corresponding path program 137 times [2018-07-23 13:52:33,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:33,995 INFO L134 CoverageAnalysis]: Checked inductivity of 18906 backedges. 0 proven. 18906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:33,996 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:33,996 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-07-23 13:52:33,996 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:33,996 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:52:33,996 INFO L185 omatonBuilderFactory]: Interpolants [87829#true, 87831#(<= proc_i 0), 87830#false, 87833#(<= proc_i 8), 87832#(<= proc_i 4), 87835#(<= proc_i 16), 87834#(<= proc_i 12), 87837#(<= proc_i 24), 87836#(<= proc_i 20), 87839#(<= proc_i 32), 87838#(<= proc_i 28), 87841#(<= proc_i 40), 87840#(<= proc_i 36), 87843#(<= proc_i 48), 87842#(<= proc_i 44), 87845#(<= proc_i 56), 87844#(<= proc_i 52), 87847#(<= proc_i 64), 87846#(<= proc_i 60), 87849#(<= proc_i 72), 87848#(<= proc_i 68), 87851#(<= proc_i 80), 87850#(<= proc_i 76), 87853#(<= proc_i 88), 87852#(<= proc_i 84), 87855#(<= proc_i 96), 87854#(<= proc_i 92), 87857#(<= proc_i 104), 87856#(<= proc_i 100), 87859#(<= proc_i 112), 87858#(<= proc_i 108), 87861#(<= proc_i 120), 87860#(<= proc_i 116), 87863#(<= proc_i 128), 87862#(<= proc_i 124), 87865#(<= proc_i 136), 87864#(<= proc_i 132), 87867#(<= proc_i 144), 87866#(<= proc_i 140), 87869#(<= proc_i 152), 87868#(<= proc_i 148), 87871#(<= proc_i 160), 87870#(<= proc_i 156), 87873#(<= proc_i 168), 87872#(<= proc_i 164), 87875#(<= proc_i 176), 87874#(<= proc_i 172), 87877#(<= proc_i 184), 87876#(<= proc_i 180), 87879#(<= proc_i 192), 87878#(<= proc_i 188), 87881#(<= proc_i 200), 87880#(<= proc_i 196), 87883#(<= proc_i 208), 87882#(<= proc_i 204), 87885#(<= proc_i 216), 87884#(<= proc_i 212), 87887#(<= proc_i 224), 87886#(<= proc_i 220), 87889#(<= proc_i 232), 87888#(<= proc_i 228), 87891#(<= proc_i 240), 87890#(<= proc_i 236), 87893#(<= proc_i 248), 87892#(<= proc_i 244), 87895#(<= proc_i 256), 87894#(<= proc_i 252), 87897#(<= proc_i 264), 87896#(<= proc_i 260), 87899#(<= proc_i 272), 87898#(<= proc_i 268), 87901#(<= proc_i 280), 87900#(<= proc_i 276), 87903#(<= proc_i 288), 87902#(<= proc_i 284), 87905#(<= proc_i 296), 87904#(<= proc_i 292), 87907#(<= proc_i 304), 87906#(<= proc_i 300), 87909#(<= proc_i 312), 87908#(<= proc_i 308), 87911#(<= proc_i 320), 87910#(<= proc_i 316), 87913#(<= proc_i 328), 87912#(<= proc_i 324), 87915#(<= proc_i 336), 87914#(<= proc_i 332), 87917#(<= proc_i 344), 87916#(<= proc_i 340), 87919#(<= proc_i 352), 87918#(<= proc_i 348), 87921#(<= proc_i 360), 87920#(<= proc_i 356), 87923#(<= proc_i 368), 87922#(<= proc_i 364), 87925#(<= proc_i 376), 87924#(<= proc_i 372), 87927#(<= proc_i 384), 87926#(<= proc_i 380), 87929#(<= proc_i 392), 87928#(<= proc_i 388), 87931#(<= proc_i 400), 87930#(<= proc_i 396), 87933#(<= proc_i 408), 87932#(<= proc_i 404), 87935#(<= proc_i 416), 87934#(<= proc_i 412), 87937#(<= proc_i 424), 87936#(<= proc_i 420), 87939#(<= proc_i 432), 87938#(<= proc_i 428), 87941#(<= proc_i 440), 87940#(<= proc_i 436), 87943#(<= proc_i 448), 87942#(<= proc_i 444), 87945#(<= proc_i 456), 87944#(<= proc_i 452), 87947#(<= proc_i 464), 87946#(<= proc_i 460), 87949#(<= proc_i 472), 87948#(<= proc_i 468), 87951#(<= proc_i 480), 87950#(<= proc_i 476), 87953#(<= proc_i 488), 87952#(<= proc_i 484), 87955#(<= proc_i 496), 87954#(<= proc_i 492), 87957#(<= proc_i 504), 87956#(<= proc_i 500), 87959#(<= proc_i 512), 87958#(<= proc_i 508), 87961#(<= proc_i 520), 87960#(<= proc_i 516), 87963#(<= proc_i 528), 87962#(<= proc_i 524), 87965#(<= proc_i 536), 87964#(<= proc_i 532), 87967#(<= proc_i 544), 87966#(<= proc_i 540), 87968#(<= proc_i 548)] [2018-07-23 13:52:33,998 INFO L134 CoverageAnalysis]: Checked inductivity of 18906 backedges. 0 proven. 18906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:33,998 INFO L450 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-07-23 13:52:34,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-07-23 13:52:34,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-07-23 13:52:34,001 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 140 states. [2018-07-23 13:52:34,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:34,539 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-07-23 13:52:34,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-07-23 13:52:34,539 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 277 [2018-07-23 13:52:34,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:34,540 INFO L225 Difference]: With dead ends: 281 [2018-07-23 13:52:34,540 INFO L226 Difference]: Without dead ends: 280 [2018-07-23 13:52:34,541 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-07-23 13:52:34,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-07-23 13:52:34,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2018-07-23 13:52:34,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-07-23 13:52:34,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2018-07-23 13:52:34,544 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 277 [2018-07-23 13:52:34,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:34,545 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 280 transitions. [2018-07-23 13:52:34,545 INFO L472 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-07-23 13:52:34,545 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 280 transitions. [2018-07-23 13:52:34,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-07-23 13:52:34,546 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:34,546 INFO L357 BasicCegarLoop]: trace histogram [139, 138, 1, 1] [2018-07-23 13:52:34,546 INFO L414 AbstractCegarLoop]: === Iteration 139 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:34,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1342222836, now seen corresponding path program 138 times [2018-07-23 13:52:34,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 19182 backedges. 0 proven. 19182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:35,104 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:35,104 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-07-23 13:52:35,104 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:35,104 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:52:35,105 INFO L185 omatonBuilderFactory]: Interpolants [89091#true, 89093#(<= proc_i 0), 89092#false, 89095#(<= proc_i 8), 89094#(<= proc_i 4), 89097#(<= proc_i 16), 89096#(<= proc_i 12), 89099#(<= proc_i 24), 89098#(<= proc_i 20), 89101#(<= proc_i 32), 89100#(<= proc_i 28), 89103#(<= proc_i 40), 89102#(<= proc_i 36), 89105#(<= proc_i 48), 89104#(<= proc_i 44), 89107#(<= proc_i 56), 89106#(<= proc_i 52), 89109#(<= proc_i 64), 89108#(<= proc_i 60), 89111#(<= proc_i 72), 89110#(<= proc_i 68), 89113#(<= proc_i 80), 89112#(<= proc_i 76), 89115#(<= proc_i 88), 89114#(<= proc_i 84), 89117#(<= proc_i 96), 89116#(<= proc_i 92), 89119#(<= proc_i 104), 89118#(<= proc_i 100), 89121#(<= proc_i 112), 89120#(<= proc_i 108), 89123#(<= proc_i 120), 89122#(<= proc_i 116), 89125#(<= proc_i 128), 89124#(<= proc_i 124), 89127#(<= proc_i 136), 89126#(<= proc_i 132), 89129#(<= proc_i 144), 89128#(<= proc_i 140), 89131#(<= proc_i 152), 89130#(<= proc_i 148), 89133#(<= proc_i 160), 89132#(<= proc_i 156), 89135#(<= proc_i 168), 89134#(<= proc_i 164), 89137#(<= proc_i 176), 89136#(<= proc_i 172), 89139#(<= proc_i 184), 89138#(<= proc_i 180), 89141#(<= proc_i 192), 89140#(<= proc_i 188), 89143#(<= proc_i 200), 89142#(<= proc_i 196), 89145#(<= proc_i 208), 89144#(<= proc_i 204), 89147#(<= proc_i 216), 89146#(<= proc_i 212), 89149#(<= proc_i 224), 89148#(<= proc_i 220), 89151#(<= proc_i 232), 89150#(<= proc_i 228), 89153#(<= proc_i 240), 89152#(<= proc_i 236), 89155#(<= proc_i 248), 89154#(<= proc_i 244), 89157#(<= proc_i 256), 89156#(<= proc_i 252), 89159#(<= proc_i 264), 89158#(<= proc_i 260), 89161#(<= proc_i 272), 89160#(<= proc_i 268), 89163#(<= proc_i 280), 89162#(<= proc_i 276), 89165#(<= proc_i 288), 89164#(<= proc_i 284), 89167#(<= proc_i 296), 89166#(<= proc_i 292), 89169#(<= proc_i 304), 89168#(<= proc_i 300), 89171#(<= proc_i 312), 89170#(<= proc_i 308), 89173#(<= proc_i 320), 89172#(<= proc_i 316), 89175#(<= proc_i 328), 89174#(<= proc_i 324), 89177#(<= proc_i 336), 89176#(<= proc_i 332), 89179#(<= proc_i 344), 89178#(<= proc_i 340), 89181#(<= proc_i 352), 89180#(<= proc_i 348), 89183#(<= proc_i 360), 89182#(<= proc_i 356), 89185#(<= proc_i 368), 89184#(<= proc_i 364), 89187#(<= proc_i 376), 89186#(<= proc_i 372), 89189#(<= proc_i 384), 89188#(<= proc_i 380), 89191#(<= proc_i 392), 89190#(<= proc_i 388), 89193#(<= proc_i 400), 89192#(<= proc_i 396), 89195#(<= proc_i 408), 89194#(<= proc_i 404), 89197#(<= proc_i 416), 89196#(<= proc_i 412), 89199#(<= proc_i 424), 89198#(<= proc_i 420), 89201#(<= proc_i 432), 89200#(<= proc_i 428), 89203#(<= proc_i 440), 89202#(<= proc_i 436), 89205#(<= proc_i 448), 89204#(<= proc_i 444), 89207#(<= proc_i 456), 89206#(<= proc_i 452), 89209#(<= proc_i 464), 89208#(<= proc_i 460), 89211#(<= proc_i 472), 89210#(<= proc_i 468), 89213#(<= proc_i 480), 89212#(<= proc_i 476), 89215#(<= proc_i 488), 89214#(<= proc_i 484), 89217#(<= proc_i 496), 89216#(<= proc_i 492), 89219#(<= proc_i 504), 89218#(<= proc_i 500), 89221#(<= proc_i 512), 89220#(<= proc_i 508), 89223#(<= proc_i 520), 89222#(<= proc_i 516), 89225#(<= proc_i 528), 89224#(<= proc_i 524), 89227#(<= proc_i 536), 89226#(<= proc_i 532), 89229#(<= proc_i 544), 89228#(<= proc_i 540), 89231#(<= proc_i 552), 89230#(<= proc_i 548)] [2018-07-23 13:52:35,106 INFO L134 CoverageAnalysis]: Checked inductivity of 19182 backedges. 0 proven. 19182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:35,106 INFO L450 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-07-23 13:52:35,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-07-23 13:52:35,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-07-23 13:52:35,108 INFO L87 Difference]: Start difference. First operand 280 states and 280 transitions. Second operand 141 states. [2018-07-23 13:52:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:35,610 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-07-23 13:52:35,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-07-23 13:52:35,610 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 279 [2018-07-23 13:52:35,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:35,611 INFO L225 Difference]: With dead ends: 283 [2018-07-23 13:52:35,611 INFO L226 Difference]: Without dead ends: 282 [2018-07-23 13:52:35,612 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-07-23 13:52:35,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-07-23 13:52:35,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2018-07-23 13:52:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-07-23 13:52:35,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2018-07-23 13:52:35,615 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 279 [2018-07-23 13:52:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:35,615 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2018-07-23 13:52:35,615 INFO L472 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-07-23 13:52:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2018-07-23 13:52:35,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-07-23 13:52:35,616 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:35,616 INFO L357 BasicCegarLoop]: trace histogram [140, 139, 1, 1] [2018-07-23 13:52:35,616 INFO L414 AbstractCegarLoop]: === Iteration 140 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:35,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1385957686, now seen corresponding path program 139 times [2018-07-23 13:52:35,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 19460 backedges. 0 proven. 19460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:36,166 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:36,167 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-07-23 13:52:36,167 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:36,167 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:52:36,167 INFO L185 omatonBuilderFactory]: Interpolants [90369#(<= proc_i 20), 90368#(<= proc_i 16), 90371#(<= proc_i 28), 90370#(<= proc_i 24), 90373#(<= proc_i 36), 90372#(<= proc_i 32), 90375#(<= proc_i 44), 90374#(<= proc_i 40), 90377#(<= proc_i 52), 90376#(<= proc_i 48), 90379#(<= proc_i 60), 90378#(<= proc_i 56), 90381#(<= proc_i 68), 90380#(<= proc_i 64), 90383#(<= proc_i 76), 90382#(<= proc_i 72), 90385#(<= proc_i 84), 90384#(<= proc_i 80), 90387#(<= proc_i 92), 90386#(<= proc_i 88), 90389#(<= proc_i 100), 90388#(<= proc_i 96), 90391#(<= proc_i 108), 90390#(<= proc_i 104), 90393#(<= proc_i 116), 90392#(<= proc_i 112), 90395#(<= proc_i 124), 90394#(<= proc_i 120), 90397#(<= proc_i 132), 90396#(<= proc_i 128), 90399#(<= proc_i 140), 90398#(<= proc_i 136), 90401#(<= proc_i 148), 90400#(<= proc_i 144), 90403#(<= proc_i 156), 90402#(<= proc_i 152), 90405#(<= proc_i 164), 90404#(<= proc_i 160), 90407#(<= proc_i 172), 90406#(<= proc_i 168), 90409#(<= proc_i 180), 90408#(<= proc_i 176), 90411#(<= proc_i 188), 90410#(<= proc_i 184), 90413#(<= proc_i 196), 90412#(<= proc_i 192), 90415#(<= proc_i 204), 90414#(<= proc_i 200), 90417#(<= proc_i 212), 90416#(<= proc_i 208), 90419#(<= proc_i 220), 90418#(<= proc_i 216), 90421#(<= proc_i 228), 90420#(<= proc_i 224), 90423#(<= proc_i 236), 90422#(<= proc_i 232), 90425#(<= proc_i 244), 90424#(<= proc_i 240), 90427#(<= proc_i 252), 90426#(<= proc_i 248), 90429#(<= proc_i 260), 90428#(<= proc_i 256), 90431#(<= proc_i 268), 90430#(<= proc_i 264), 90433#(<= proc_i 276), 90432#(<= proc_i 272), 90435#(<= proc_i 284), 90434#(<= proc_i 280), 90437#(<= proc_i 292), 90436#(<= proc_i 288), 90439#(<= proc_i 300), 90438#(<= proc_i 296), 90441#(<= proc_i 308), 90440#(<= proc_i 304), 90443#(<= proc_i 316), 90442#(<= proc_i 312), 90445#(<= proc_i 324), 90444#(<= proc_i 320), 90447#(<= proc_i 332), 90446#(<= proc_i 328), 90449#(<= proc_i 340), 90448#(<= proc_i 336), 90451#(<= proc_i 348), 90450#(<= proc_i 344), 90453#(<= proc_i 356), 90452#(<= proc_i 352), 90455#(<= proc_i 364), 90454#(<= proc_i 360), 90457#(<= proc_i 372), 90456#(<= proc_i 368), 90459#(<= proc_i 380), 90458#(<= proc_i 376), 90461#(<= proc_i 388), 90460#(<= proc_i 384), 90463#(<= proc_i 396), 90462#(<= proc_i 392), 90465#(<= proc_i 404), 90464#(<= proc_i 400), 90467#(<= proc_i 412), 90466#(<= proc_i 408), 90469#(<= proc_i 420), 90468#(<= proc_i 416), 90471#(<= proc_i 428), 90470#(<= proc_i 424), 90473#(<= proc_i 436), 90472#(<= proc_i 432), 90475#(<= proc_i 444), 90474#(<= proc_i 440), 90477#(<= proc_i 452), 90476#(<= proc_i 448), 90479#(<= proc_i 460), 90478#(<= proc_i 456), 90481#(<= proc_i 468), 90480#(<= proc_i 464), 90483#(<= proc_i 476), 90482#(<= proc_i 472), 90485#(<= proc_i 484), 90484#(<= proc_i 480), 90487#(<= proc_i 492), 90486#(<= proc_i 488), 90489#(<= proc_i 500), 90488#(<= proc_i 496), 90491#(<= proc_i 508), 90490#(<= proc_i 504), 90493#(<= proc_i 516), 90492#(<= proc_i 512), 90495#(<= proc_i 524), 90494#(<= proc_i 520), 90497#(<= proc_i 532), 90496#(<= proc_i 528), 90499#(<= proc_i 540), 90498#(<= proc_i 536), 90501#(<= proc_i 548), 90500#(<= proc_i 544), 90503#(<= proc_i 556), 90502#(<= proc_i 552), 90363#false, 90362#true, 90365#(<= proc_i 4), 90364#(<= proc_i 0), 90367#(<= proc_i 12), 90366#(<= proc_i 8)] [2018-07-23 13:52:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 19460 backedges. 0 proven. 19460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:36,168 INFO L450 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-07-23 13:52:36,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-07-23 13:52:36,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-07-23 13:52:36,170 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 142 states. [2018-07-23 13:52:36,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:36,669 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-07-23 13:52:36,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-07-23 13:52:36,669 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 281 [2018-07-23 13:52:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:36,670 INFO L225 Difference]: With dead ends: 285 [2018-07-23 13:52:36,670 INFO L226 Difference]: Without dead ends: 284 [2018-07-23 13:52:36,671 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-07-23 13:52:36,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-07-23 13:52:36,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2018-07-23 13:52:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-07-23 13:52:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 284 transitions. [2018-07-23 13:52:36,674 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 284 transitions. Word has length 281 [2018-07-23 13:52:36,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:36,674 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 284 transitions. [2018-07-23 13:52:36,674 INFO L472 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-07-23 13:52:36,674 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 284 transitions. [2018-07-23 13:52:36,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-07-23 13:52:36,675 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:36,675 INFO L357 BasicCegarLoop]: trace histogram [141, 140, 1, 1] [2018-07-23 13:52:36,675 INFO L414 AbstractCegarLoop]: === Iteration 141 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:36,675 INFO L82 PathProgramCache]: Analyzing trace with hash 465475576, now seen corresponding path program 140 times [2018-07-23 13:52:36,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:37,271 INFO L134 CoverageAnalysis]: Checked inductivity of 19740 backedges. 0 proven. 19740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:37,272 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:37,272 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-07-23 13:52:37,272 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:37,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:52:37,273 INFO L185 omatonBuilderFactory]: Interpolants [91649#(<= proc_i 20), 91648#(<= proc_i 16), 91651#(<= proc_i 28), 91650#(<= proc_i 24), 91653#(<= proc_i 36), 91652#(<= proc_i 32), 91655#(<= proc_i 44), 91654#(<= proc_i 40), 91657#(<= proc_i 52), 91656#(<= proc_i 48), 91659#(<= proc_i 60), 91658#(<= proc_i 56), 91661#(<= proc_i 68), 91660#(<= proc_i 64), 91663#(<= proc_i 76), 91662#(<= proc_i 72), 91665#(<= proc_i 84), 91664#(<= proc_i 80), 91667#(<= proc_i 92), 91666#(<= proc_i 88), 91669#(<= proc_i 100), 91668#(<= proc_i 96), 91671#(<= proc_i 108), 91670#(<= proc_i 104), 91673#(<= proc_i 116), 91672#(<= proc_i 112), 91675#(<= proc_i 124), 91674#(<= proc_i 120), 91677#(<= proc_i 132), 91676#(<= proc_i 128), 91679#(<= proc_i 140), 91678#(<= proc_i 136), 91681#(<= proc_i 148), 91680#(<= proc_i 144), 91683#(<= proc_i 156), 91682#(<= proc_i 152), 91685#(<= proc_i 164), 91684#(<= proc_i 160), 91687#(<= proc_i 172), 91686#(<= proc_i 168), 91689#(<= proc_i 180), 91688#(<= proc_i 176), 91691#(<= proc_i 188), 91690#(<= proc_i 184), 91693#(<= proc_i 196), 91692#(<= proc_i 192), 91695#(<= proc_i 204), 91694#(<= proc_i 200), 91697#(<= proc_i 212), 91696#(<= proc_i 208), 91699#(<= proc_i 220), 91698#(<= proc_i 216), 91701#(<= proc_i 228), 91700#(<= proc_i 224), 91703#(<= proc_i 236), 91702#(<= proc_i 232), 91705#(<= proc_i 244), 91704#(<= proc_i 240), 91707#(<= proc_i 252), 91706#(<= proc_i 248), 91709#(<= proc_i 260), 91708#(<= proc_i 256), 91711#(<= proc_i 268), 91710#(<= proc_i 264), 91713#(<= proc_i 276), 91712#(<= proc_i 272), 91715#(<= proc_i 284), 91714#(<= proc_i 280), 91717#(<= proc_i 292), 91716#(<= proc_i 288), 91719#(<= proc_i 300), 91718#(<= proc_i 296), 91721#(<= proc_i 308), 91720#(<= proc_i 304), 91723#(<= proc_i 316), 91722#(<= proc_i 312), 91725#(<= proc_i 324), 91724#(<= proc_i 320), 91727#(<= proc_i 332), 91726#(<= proc_i 328), 91729#(<= proc_i 340), 91728#(<= proc_i 336), 91731#(<= proc_i 348), 91730#(<= proc_i 344), 91733#(<= proc_i 356), 91732#(<= proc_i 352), 91735#(<= proc_i 364), 91734#(<= proc_i 360), 91737#(<= proc_i 372), 91736#(<= proc_i 368), 91739#(<= proc_i 380), 91738#(<= proc_i 376), 91741#(<= proc_i 388), 91740#(<= proc_i 384), 91743#(<= proc_i 396), 91742#(<= proc_i 392), 91745#(<= proc_i 404), 91744#(<= proc_i 400), 91747#(<= proc_i 412), 91746#(<= proc_i 408), 91749#(<= proc_i 420), 91748#(<= proc_i 416), 91751#(<= proc_i 428), 91750#(<= proc_i 424), 91753#(<= proc_i 436), 91752#(<= proc_i 432), 91755#(<= proc_i 444), 91754#(<= proc_i 440), 91757#(<= proc_i 452), 91756#(<= proc_i 448), 91759#(<= proc_i 460), 91758#(<= proc_i 456), 91761#(<= proc_i 468), 91760#(<= proc_i 464), 91763#(<= proc_i 476), 91762#(<= proc_i 472), 91765#(<= proc_i 484), 91764#(<= proc_i 480), 91767#(<= proc_i 492), 91766#(<= proc_i 488), 91769#(<= proc_i 500), 91768#(<= proc_i 496), 91771#(<= proc_i 508), 91770#(<= proc_i 504), 91773#(<= proc_i 516), 91772#(<= proc_i 512), 91775#(<= proc_i 524), 91774#(<= proc_i 520), 91777#(<= proc_i 532), 91776#(<= proc_i 528), 91779#(<= proc_i 540), 91778#(<= proc_i 536), 91781#(<= proc_i 548), 91780#(<= proc_i 544), 91783#(<= proc_i 556), 91782#(<= proc_i 552), 91784#(<= proc_i 560), 91643#false, 91642#true, 91645#(<= proc_i 4), 91644#(<= proc_i 0), 91647#(<= proc_i 12), 91646#(<= proc_i 8)] [2018-07-23 13:52:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 19740 backedges. 0 proven. 19740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:37,274 INFO L450 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-07-23 13:52:37,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-07-23 13:52:37,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-07-23 13:52:37,277 INFO L87 Difference]: Start difference. First operand 284 states and 284 transitions. Second operand 143 states. [2018-07-23 13:52:37,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:37,820 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-07-23 13:52:37,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-07-23 13:52:37,821 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 283 [2018-07-23 13:52:37,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:37,822 INFO L225 Difference]: With dead ends: 287 [2018-07-23 13:52:37,822 INFO L226 Difference]: Without dead ends: 286 [2018-07-23 13:52:37,823 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-07-23 13:52:37,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-07-23 13:52:37,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-07-23 13:52:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-07-23 13:52:37,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2018-07-23 13:52:37,859 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 283 [2018-07-23 13:52:37,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:37,859 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2018-07-23 13:52:37,860 INFO L472 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-07-23 13:52:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2018-07-23 13:52:37,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-07-23 13:52:37,861 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:37,861 INFO L357 BasicCegarLoop]: trace histogram [142, 141, 1, 1] [2018-07-23 13:52:37,861 INFO L414 AbstractCegarLoop]: === Iteration 142 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:37,861 INFO L82 PathProgramCache]: Analyzing trace with hash 645430842, now seen corresponding path program 141 times [2018-07-23 13:52:37,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 20022 backedges. 0 proven. 20022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:38,422 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:38,422 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-07-23 13:52:38,422 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:38,422 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:52:38,423 INFO L185 omatonBuilderFactory]: Interpolants [92931#true, 92933#(<= proc_i 0), 92932#false, 92935#(<= proc_i 8), 92934#(<= proc_i 4), 92937#(<= proc_i 16), 92936#(<= proc_i 12), 92939#(<= proc_i 24), 92938#(<= proc_i 20), 92941#(<= proc_i 32), 92940#(<= proc_i 28), 92943#(<= proc_i 40), 92942#(<= proc_i 36), 92945#(<= proc_i 48), 92944#(<= proc_i 44), 92947#(<= proc_i 56), 92946#(<= proc_i 52), 92949#(<= proc_i 64), 92948#(<= proc_i 60), 92951#(<= proc_i 72), 92950#(<= proc_i 68), 92953#(<= proc_i 80), 92952#(<= proc_i 76), 92955#(<= proc_i 88), 92954#(<= proc_i 84), 92957#(<= proc_i 96), 92956#(<= proc_i 92), 92959#(<= proc_i 104), 92958#(<= proc_i 100), 92961#(<= proc_i 112), 92960#(<= proc_i 108), 92963#(<= proc_i 120), 92962#(<= proc_i 116), 92965#(<= proc_i 128), 92964#(<= proc_i 124), 92967#(<= proc_i 136), 92966#(<= proc_i 132), 92969#(<= proc_i 144), 92968#(<= proc_i 140), 92971#(<= proc_i 152), 92970#(<= proc_i 148), 92973#(<= proc_i 160), 92972#(<= proc_i 156), 92975#(<= proc_i 168), 92974#(<= proc_i 164), 92977#(<= proc_i 176), 92976#(<= proc_i 172), 92979#(<= proc_i 184), 92978#(<= proc_i 180), 92981#(<= proc_i 192), 92980#(<= proc_i 188), 92983#(<= proc_i 200), 92982#(<= proc_i 196), 92985#(<= proc_i 208), 92984#(<= proc_i 204), 92987#(<= proc_i 216), 92986#(<= proc_i 212), 92989#(<= proc_i 224), 92988#(<= proc_i 220), 92991#(<= proc_i 232), 92990#(<= proc_i 228), 92993#(<= proc_i 240), 92992#(<= proc_i 236), 92995#(<= proc_i 248), 92994#(<= proc_i 244), 92997#(<= proc_i 256), 92996#(<= proc_i 252), 92999#(<= proc_i 264), 92998#(<= proc_i 260), 93001#(<= proc_i 272), 93000#(<= proc_i 268), 93003#(<= proc_i 280), 93002#(<= proc_i 276), 93005#(<= proc_i 288), 93004#(<= proc_i 284), 93007#(<= proc_i 296), 93006#(<= proc_i 292), 93009#(<= proc_i 304), 93008#(<= proc_i 300), 93011#(<= proc_i 312), 93010#(<= proc_i 308), 93013#(<= proc_i 320), 93012#(<= proc_i 316), 93015#(<= proc_i 328), 93014#(<= proc_i 324), 93017#(<= proc_i 336), 93016#(<= proc_i 332), 93019#(<= proc_i 344), 93018#(<= proc_i 340), 93021#(<= proc_i 352), 93020#(<= proc_i 348), 93023#(<= proc_i 360), 93022#(<= proc_i 356), 93025#(<= proc_i 368), 93024#(<= proc_i 364), 93027#(<= proc_i 376), 93026#(<= proc_i 372), 93029#(<= proc_i 384), 93028#(<= proc_i 380), 93031#(<= proc_i 392), 93030#(<= proc_i 388), 93033#(<= proc_i 400), 93032#(<= proc_i 396), 93035#(<= proc_i 408), 93034#(<= proc_i 404), 93037#(<= proc_i 416), 93036#(<= proc_i 412), 93039#(<= proc_i 424), 93038#(<= proc_i 420), 93041#(<= proc_i 432), 93040#(<= proc_i 428), 93043#(<= proc_i 440), 93042#(<= proc_i 436), 93045#(<= proc_i 448), 93044#(<= proc_i 444), 93047#(<= proc_i 456), 93046#(<= proc_i 452), 93049#(<= proc_i 464), 93048#(<= proc_i 460), 93051#(<= proc_i 472), 93050#(<= proc_i 468), 93053#(<= proc_i 480), 93052#(<= proc_i 476), 93055#(<= proc_i 488), 93054#(<= proc_i 484), 93057#(<= proc_i 496), 93056#(<= proc_i 492), 93059#(<= proc_i 504), 93058#(<= proc_i 500), 93061#(<= proc_i 512), 93060#(<= proc_i 508), 93063#(<= proc_i 520), 93062#(<= proc_i 516), 93065#(<= proc_i 528), 93064#(<= proc_i 524), 93067#(<= proc_i 536), 93066#(<= proc_i 532), 93069#(<= proc_i 544), 93068#(<= proc_i 540), 93071#(<= proc_i 552), 93070#(<= proc_i 548), 93073#(<= proc_i 560), 93072#(<= proc_i 556), 93074#(<= proc_i 564)] [2018-07-23 13:52:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 20022 backedges. 0 proven. 20022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:38,424 INFO L450 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-07-23 13:52:38,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-07-23 13:52:38,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-07-23 13:52:38,426 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 144 states. [2018-07-23 13:52:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:38,978 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-07-23 13:52:38,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-07-23 13:52:38,978 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 285 [2018-07-23 13:52:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:38,979 INFO L225 Difference]: With dead ends: 289 [2018-07-23 13:52:38,979 INFO L226 Difference]: Without dead ends: 288 [2018-07-23 13:52:38,980 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-07-23 13:52:38,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-07-23 13:52:38,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2018-07-23 13:52:38,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-07-23 13:52:38,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 288 transitions. [2018-07-23 13:52:38,984 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 288 transitions. Word has length 285 [2018-07-23 13:52:38,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:38,984 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 288 transitions. [2018-07-23 13:52:38,984 INFO L472 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-07-23 13:52:38,984 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 288 transitions. [2018-07-23 13:52:38,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-07-23 13:52:38,985 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:38,985 INFO L357 BasicCegarLoop]: trace histogram [143, 142, 1, 1] [2018-07-23 13:52:38,986 INFO L414 AbstractCegarLoop]: === Iteration 143 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:38,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1783749628, now seen corresponding path program 142 times [2018-07-23 13:52:38,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 20306 backedges. 0 proven. 20306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:39,691 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:39,692 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-07-23 13:52:39,692 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:39,692 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:52:39,692 INFO L185 omatonBuilderFactory]: Interpolants [94229#true, 94231#(<= proc_i 0), 94230#false, 94233#(<= proc_i 8), 94232#(<= proc_i 4), 94235#(<= proc_i 16), 94234#(<= proc_i 12), 94237#(<= proc_i 24), 94236#(<= proc_i 20), 94239#(<= proc_i 32), 94238#(<= proc_i 28), 94241#(<= proc_i 40), 94240#(<= proc_i 36), 94243#(<= proc_i 48), 94242#(<= proc_i 44), 94245#(<= proc_i 56), 94244#(<= proc_i 52), 94247#(<= proc_i 64), 94246#(<= proc_i 60), 94249#(<= proc_i 72), 94248#(<= proc_i 68), 94251#(<= proc_i 80), 94250#(<= proc_i 76), 94253#(<= proc_i 88), 94252#(<= proc_i 84), 94255#(<= proc_i 96), 94254#(<= proc_i 92), 94257#(<= proc_i 104), 94256#(<= proc_i 100), 94259#(<= proc_i 112), 94258#(<= proc_i 108), 94261#(<= proc_i 120), 94260#(<= proc_i 116), 94263#(<= proc_i 128), 94262#(<= proc_i 124), 94265#(<= proc_i 136), 94264#(<= proc_i 132), 94267#(<= proc_i 144), 94266#(<= proc_i 140), 94269#(<= proc_i 152), 94268#(<= proc_i 148), 94271#(<= proc_i 160), 94270#(<= proc_i 156), 94273#(<= proc_i 168), 94272#(<= proc_i 164), 94275#(<= proc_i 176), 94274#(<= proc_i 172), 94277#(<= proc_i 184), 94276#(<= proc_i 180), 94279#(<= proc_i 192), 94278#(<= proc_i 188), 94281#(<= proc_i 200), 94280#(<= proc_i 196), 94283#(<= proc_i 208), 94282#(<= proc_i 204), 94285#(<= proc_i 216), 94284#(<= proc_i 212), 94287#(<= proc_i 224), 94286#(<= proc_i 220), 94289#(<= proc_i 232), 94288#(<= proc_i 228), 94291#(<= proc_i 240), 94290#(<= proc_i 236), 94293#(<= proc_i 248), 94292#(<= proc_i 244), 94295#(<= proc_i 256), 94294#(<= proc_i 252), 94297#(<= proc_i 264), 94296#(<= proc_i 260), 94299#(<= proc_i 272), 94298#(<= proc_i 268), 94301#(<= proc_i 280), 94300#(<= proc_i 276), 94303#(<= proc_i 288), 94302#(<= proc_i 284), 94305#(<= proc_i 296), 94304#(<= proc_i 292), 94307#(<= proc_i 304), 94306#(<= proc_i 300), 94309#(<= proc_i 312), 94308#(<= proc_i 308), 94311#(<= proc_i 320), 94310#(<= proc_i 316), 94313#(<= proc_i 328), 94312#(<= proc_i 324), 94315#(<= proc_i 336), 94314#(<= proc_i 332), 94317#(<= proc_i 344), 94316#(<= proc_i 340), 94319#(<= proc_i 352), 94318#(<= proc_i 348), 94321#(<= proc_i 360), 94320#(<= proc_i 356), 94323#(<= proc_i 368), 94322#(<= proc_i 364), 94325#(<= proc_i 376), 94324#(<= proc_i 372), 94327#(<= proc_i 384), 94326#(<= proc_i 380), 94329#(<= proc_i 392), 94328#(<= proc_i 388), 94331#(<= proc_i 400), 94330#(<= proc_i 396), 94333#(<= proc_i 408), 94332#(<= proc_i 404), 94335#(<= proc_i 416), 94334#(<= proc_i 412), 94337#(<= proc_i 424), 94336#(<= proc_i 420), 94339#(<= proc_i 432), 94338#(<= proc_i 428), 94341#(<= proc_i 440), 94340#(<= proc_i 436), 94343#(<= proc_i 448), 94342#(<= proc_i 444), 94345#(<= proc_i 456), 94344#(<= proc_i 452), 94347#(<= proc_i 464), 94346#(<= proc_i 460), 94349#(<= proc_i 472), 94348#(<= proc_i 468), 94351#(<= proc_i 480), 94350#(<= proc_i 476), 94353#(<= proc_i 488), 94352#(<= proc_i 484), 94355#(<= proc_i 496), 94354#(<= proc_i 492), 94357#(<= proc_i 504), 94356#(<= proc_i 500), 94359#(<= proc_i 512), 94358#(<= proc_i 508), 94361#(<= proc_i 520), 94360#(<= proc_i 516), 94363#(<= proc_i 528), 94362#(<= proc_i 524), 94365#(<= proc_i 536), 94364#(<= proc_i 532), 94367#(<= proc_i 544), 94366#(<= proc_i 540), 94369#(<= proc_i 552), 94368#(<= proc_i 548), 94371#(<= proc_i 560), 94370#(<= proc_i 556), 94373#(<= proc_i 568), 94372#(<= proc_i 564)] [2018-07-23 13:52:39,693 INFO L134 CoverageAnalysis]: Checked inductivity of 20306 backedges. 0 proven. 20306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:39,694 INFO L450 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-07-23 13:52:39,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-07-23 13:52:39,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-07-23 13:52:39,696 INFO L87 Difference]: Start difference. First operand 288 states and 288 transitions. Second operand 145 states. [2018-07-23 13:52:40,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:40,376 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-07-23 13:52:40,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-07-23 13:52:40,376 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 287 [2018-07-23 13:52:40,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:40,377 INFO L225 Difference]: With dead ends: 291 [2018-07-23 13:52:40,377 INFO L226 Difference]: Without dead ends: 290 [2018-07-23 13:52:40,378 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-07-23 13:52:40,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-07-23 13:52:40,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2018-07-23 13:52:40,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-07-23 13:52:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-07-23 13:52:40,383 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 287 [2018-07-23 13:52:40,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:40,383 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-07-23 13:52:40,383 INFO L472 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-07-23 13:52:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-07-23 13:52:40,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-07-23 13:52:40,384 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:40,385 INFO L357 BasicCegarLoop]: trace histogram [144, 143, 1, 1] [2018-07-23 13:52:40,385 INFO L414 AbstractCegarLoop]: === Iteration 144 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:40,385 INFO L82 PathProgramCache]: Analyzing trace with hash 491442494, now seen corresponding path program 143 times [2018-07-23 13:52:40,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 20592 backedges. 0 proven. 20592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:40,976 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:40,976 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-07-23 13:52:40,976 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:40,977 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:52:40,977 INFO L185 omatonBuilderFactory]: Interpolants [95537#false, 95536#true, 95539#(<= proc_i 4), 95538#(<= proc_i 0), 95541#(<= proc_i 12), 95540#(<= proc_i 8), 95543#(<= proc_i 20), 95542#(<= proc_i 16), 95545#(<= proc_i 28), 95544#(<= proc_i 24), 95547#(<= proc_i 36), 95546#(<= proc_i 32), 95549#(<= proc_i 44), 95548#(<= proc_i 40), 95551#(<= proc_i 52), 95550#(<= proc_i 48), 95553#(<= proc_i 60), 95552#(<= proc_i 56), 95555#(<= proc_i 68), 95554#(<= proc_i 64), 95557#(<= proc_i 76), 95556#(<= proc_i 72), 95559#(<= proc_i 84), 95558#(<= proc_i 80), 95561#(<= proc_i 92), 95560#(<= proc_i 88), 95563#(<= proc_i 100), 95562#(<= proc_i 96), 95565#(<= proc_i 108), 95564#(<= proc_i 104), 95567#(<= proc_i 116), 95566#(<= proc_i 112), 95569#(<= proc_i 124), 95568#(<= proc_i 120), 95571#(<= proc_i 132), 95570#(<= proc_i 128), 95573#(<= proc_i 140), 95572#(<= proc_i 136), 95575#(<= proc_i 148), 95574#(<= proc_i 144), 95577#(<= proc_i 156), 95576#(<= proc_i 152), 95579#(<= proc_i 164), 95578#(<= proc_i 160), 95581#(<= proc_i 172), 95580#(<= proc_i 168), 95583#(<= proc_i 180), 95582#(<= proc_i 176), 95585#(<= proc_i 188), 95584#(<= proc_i 184), 95587#(<= proc_i 196), 95586#(<= proc_i 192), 95589#(<= proc_i 204), 95588#(<= proc_i 200), 95591#(<= proc_i 212), 95590#(<= proc_i 208), 95593#(<= proc_i 220), 95592#(<= proc_i 216), 95595#(<= proc_i 228), 95594#(<= proc_i 224), 95597#(<= proc_i 236), 95596#(<= proc_i 232), 95599#(<= proc_i 244), 95598#(<= proc_i 240), 95601#(<= proc_i 252), 95600#(<= proc_i 248), 95603#(<= proc_i 260), 95602#(<= proc_i 256), 95605#(<= proc_i 268), 95604#(<= proc_i 264), 95607#(<= proc_i 276), 95606#(<= proc_i 272), 95609#(<= proc_i 284), 95608#(<= proc_i 280), 95611#(<= proc_i 292), 95610#(<= proc_i 288), 95613#(<= proc_i 300), 95612#(<= proc_i 296), 95615#(<= proc_i 308), 95614#(<= proc_i 304), 95617#(<= proc_i 316), 95616#(<= proc_i 312), 95619#(<= proc_i 324), 95618#(<= proc_i 320), 95621#(<= proc_i 332), 95620#(<= proc_i 328), 95623#(<= proc_i 340), 95622#(<= proc_i 336), 95625#(<= proc_i 348), 95624#(<= proc_i 344), 95627#(<= proc_i 356), 95626#(<= proc_i 352), 95629#(<= proc_i 364), 95628#(<= proc_i 360), 95631#(<= proc_i 372), 95630#(<= proc_i 368), 95633#(<= proc_i 380), 95632#(<= proc_i 376), 95635#(<= proc_i 388), 95634#(<= proc_i 384), 95637#(<= proc_i 396), 95636#(<= proc_i 392), 95639#(<= proc_i 404), 95638#(<= proc_i 400), 95641#(<= proc_i 412), 95640#(<= proc_i 408), 95643#(<= proc_i 420), 95642#(<= proc_i 416), 95645#(<= proc_i 428), 95644#(<= proc_i 424), 95647#(<= proc_i 436), 95646#(<= proc_i 432), 95649#(<= proc_i 444), 95648#(<= proc_i 440), 95651#(<= proc_i 452), 95650#(<= proc_i 448), 95653#(<= proc_i 460), 95652#(<= proc_i 456), 95655#(<= proc_i 468), 95654#(<= proc_i 464), 95657#(<= proc_i 476), 95656#(<= proc_i 472), 95659#(<= proc_i 484), 95658#(<= proc_i 480), 95661#(<= proc_i 492), 95660#(<= proc_i 488), 95663#(<= proc_i 500), 95662#(<= proc_i 496), 95665#(<= proc_i 508), 95664#(<= proc_i 504), 95667#(<= proc_i 516), 95666#(<= proc_i 512), 95669#(<= proc_i 524), 95668#(<= proc_i 520), 95671#(<= proc_i 532), 95670#(<= proc_i 528), 95673#(<= proc_i 540), 95672#(<= proc_i 536), 95675#(<= proc_i 548), 95674#(<= proc_i 544), 95677#(<= proc_i 556), 95676#(<= proc_i 552), 95679#(<= proc_i 564), 95678#(<= proc_i 560), 95681#(<= proc_i 572), 95680#(<= proc_i 568)] [2018-07-23 13:52:40,978 INFO L134 CoverageAnalysis]: Checked inductivity of 20592 backedges. 0 proven. 20592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:40,979 INFO L450 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-07-23 13:52:40,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-07-23 13:52:40,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-07-23 13:52:40,982 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 146 states. [2018-07-23 13:52:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:41,497 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-07-23 13:52:41,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-07-23 13:52:41,497 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 289 [2018-07-23 13:52:41,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:41,498 INFO L225 Difference]: With dead ends: 293 [2018-07-23 13:52:41,498 INFO L226 Difference]: Without dead ends: 292 [2018-07-23 13:52:41,499 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-07-23 13:52:41,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-07-23 13:52:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2018-07-23 13:52:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-07-23 13:52:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2018-07-23 13:52:41,502 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 289 [2018-07-23 13:52:41,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:41,502 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2018-07-23 13:52:41,502 INFO L472 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-07-23 13:52:41,502 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2018-07-23 13:52:41,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-07-23 13:52:41,503 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:41,503 INFO L357 BasicCegarLoop]: trace histogram [145, 144, 1, 1] [2018-07-23 13:52:41,503 INFO L414 AbstractCegarLoop]: === Iteration 145 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:41,503 INFO L82 PathProgramCache]: Analyzing trace with hash -170164736, now seen corresponding path program 144 times [2018-07-23 13:52:41,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:42,125 INFO L134 CoverageAnalysis]: Checked inductivity of 20880 backedges. 0 proven. 20880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:42,125 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:42,125 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-07-23 13:52:42,126 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:42,126 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:52:42,126 INFO L185 omatonBuilderFactory]: Interpolants [96853#false, 96852#true, 96855#(<= proc_i 4), 96854#(<= proc_i 0), 96857#(<= proc_i 12), 96856#(<= proc_i 8), 96859#(<= proc_i 20), 96858#(<= proc_i 16), 96861#(<= proc_i 28), 96860#(<= proc_i 24), 96863#(<= proc_i 36), 96862#(<= proc_i 32), 96865#(<= proc_i 44), 96864#(<= proc_i 40), 96867#(<= proc_i 52), 96866#(<= proc_i 48), 96869#(<= proc_i 60), 96868#(<= proc_i 56), 96871#(<= proc_i 68), 96870#(<= proc_i 64), 96873#(<= proc_i 76), 96872#(<= proc_i 72), 96875#(<= proc_i 84), 96874#(<= proc_i 80), 96877#(<= proc_i 92), 96876#(<= proc_i 88), 96879#(<= proc_i 100), 96878#(<= proc_i 96), 96881#(<= proc_i 108), 96880#(<= proc_i 104), 96883#(<= proc_i 116), 96882#(<= proc_i 112), 96885#(<= proc_i 124), 96884#(<= proc_i 120), 96887#(<= proc_i 132), 96886#(<= proc_i 128), 96889#(<= proc_i 140), 96888#(<= proc_i 136), 96891#(<= proc_i 148), 96890#(<= proc_i 144), 96893#(<= proc_i 156), 96892#(<= proc_i 152), 96895#(<= proc_i 164), 96894#(<= proc_i 160), 96897#(<= proc_i 172), 96896#(<= proc_i 168), 96899#(<= proc_i 180), 96898#(<= proc_i 176), 96901#(<= proc_i 188), 96900#(<= proc_i 184), 96903#(<= proc_i 196), 96902#(<= proc_i 192), 96905#(<= proc_i 204), 96904#(<= proc_i 200), 96907#(<= proc_i 212), 96906#(<= proc_i 208), 96909#(<= proc_i 220), 96908#(<= proc_i 216), 96911#(<= proc_i 228), 96910#(<= proc_i 224), 96913#(<= proc_i 236), 96912#(<= proc_i 232), 96915#(<= proc_i 244), 96914#(<= proc_i 240), 96917#(<= proc_i 252), 96916#(<= proc_i 248), 96919#(<= proc_i 260), 96918#(<= proc_i 256), 96921#(<= proc_i 268), 96920#(<= proc_i 264), 96923#(<= proc_i 276), 96922#(<= proc_i 272), 96925#(<= proc_i 284), 96924#(<= proc_i 280), 96927#(<= proc_i 292), 96926#(<= proc_i 288), 96929#(<= proc_i 300), 96928#(<= proc_i 296), 96931#(<= proc_i 308), 96930#(<= proc_i 304), 96933#(<= proc_i 316), 96932#(<= proc_i 312), 96935#(<= proc_i 324), 96934#(<= proc_i 320), 96937#(<= proc_i 332), 96936#(<= proc_i 328), 96939#(<= proc_i 340), 96938#(<= proc_i 336), 96941#(<= proc_i 348), 96940#(<= proc_i 344), 96943#(<= proc_i 356), 96942#(<= proc_i 352), 96945#(<= proc_i 364), 96944#(<= proc_i 360), 96947#(<= proc_i 372), 96946#(<= proc_i 368), 96949#(<= proc_i 380), 96948#(<= proc_i 376), 96951#(<= proc_i 388), 96950#(<= proc_i 384), 96953#(<= proc_i 396), 96952#(<= proc_i 392), 96955#(<= proc_i 404), 96954#(<= proc_i 400), 96957#(<= proc_i 412), 96956#(<= proc_i 408), 96959#(<= proc_i 420), 96958#(<= proc_i 416), 96961#(<= proc_i 428), 96960#(<= proc_i 424), 96963#(<= proc_i 436), 96962#(<= proc_i 432), 96965#(<= proc_i 444), 96964#(<= proc_i 440), 96967#(<= proc_i 452), 96966#(<= proc_i 448), 96969#(<= proc_i 460), 96968#(<= proc_i 456), 96971#(<= proc_i 468), 96970#(<= proc_i 464), 96973#(<= proc_i 476), 96972#(<= proc_i 472), 96975#(<= proc_i 484), 96974#(<= proc_i 480), 96977#(<= proc_i 492), 96976#(<= proc_i 488), 96979#(<= proc_i 500), 96978#(<= proc_i 496), 96981#(<= proc_i 508), 96980#(<= proc_i 504), 96983#(<= proc_i 516), 96982#(<= proc_i 512), 96985#(<= proc_i 524), 96984#(<= proc_i 520), 96987#(<= proc_i 532), 96986#(<= proc_i 528), 96989#(<= proc_i 540), 96988#(<= proc_i 536), 96991#(<= proc_i 548), 96990#(<= proc_i 544), 96993#(<= proc_i 556), 96992#(<= proc_i 552), 96995#(<= proc_i 564), 96994#(<= proc_i 560), 96997#(<= proc_i 572), 96996#(<= proc_i 568), 96998#(<= proc_i 576)] [2018-07-23 13:52:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 20880 backedges. 0 proven. 20880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:42,127 INFO L450 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-07-23 13:52:42,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-07-23 13:52:42,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-07-23 13:52:42,128 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 147 states. [2018-07-23 13:52:42,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:42,616 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-07-23 13:52:42,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-07-23 13:52:42,616 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 291 [2018-07-23 13:52:42,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:42,617 INFO L225 Difference]: With dead ends: 295 [2018-07-23 13:52:42,617 INFO L226 Difference]: Without dead ends: 294 [2018-07-23 13:52:42,617 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-07-23 13:52:42,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-07-23 13:52:42,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2018-07-23 13:52:42,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-07-23 13:52:42,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 294 transitions. [2018-07-23 13:52:42,620 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 294 transitions. Word has length 291 [2018-07-23 13:52:42,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:42,621 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 294 transitions. [2018-07-23 13:52:42,621 INFO L472 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-07-23 13:52:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 294 transitions. [2018-07-23 13:52:42,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-07-23 13:52:42,622 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:42,622 INFO L357 BasicCegarLoop]: trace histogram [146, 145, 1, 1] [2018-07-23 13:52:42,622 INFO L414 AbstractCegarLoop]: === Iteration 146 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:42,622 INFO L82 PathProgramCache]: Analyzing trace with hash -319552958, now seen corresponding path program 145 times [2018-07-23 13:52:42,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 21170 backedges. 0 proven. 21170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:43,304 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:43,304 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-07-23 13:52:43,304 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:43,304 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:52:43,305 INFO L185 omatonBuilderFactory]: Interpolants [98305#(<= proc_i 504), 98304#(<= proc_i 500), 98307#(<= proc_i 512), 98306#(<= proc_i 508), 98309#(<= proc_i 520), 98308#(<= proc_i 516), 98311#(<= proc_i 528), 98310#(<= proc_i 524), 98313#(<= proc_i 536), 98312#(<= proc_i 532), 98315#(<= proc_i 544), 98314#(<= proc_i 540), 98317#(<= proc_i 552), 98316#(<= proc_i 548), 98319#(<= proc_i 560), 98318#(<= proc_i 556), 98321#(<= proc_i 568), 98320#(<= proc_i 564), 98323#(<= proc_i 576), 98322#(<= proc_i 572), 98324#(<= proc_i 580), 98177#true, 98179#(<= proc_i 0), 98178#false, 98181#(<= proc_i 8), 98180#(<= proc_i 4), 98183#(<= proc_i 16), 98182#(<= proc_i 12), 98185#(<= proc_i 24), 98184#(<= proc_i 20), 98187#(<= proc_i 32), 98186#(<= proc_i 28), 98189#(<= proc_i 40), 98188#(<= proc_i 36), 98191#(<= proc_i 48), 98190#(<= proc_i 44), 98193#(<= proc_i 56), 98192#(<= proc_i 52), 98195#(<= proc_i 64), 98194#(<= proc_i 60), 98197#(<= proc_i 72), 98196#(<= proc_i 68), 98199#(<= proc_i 80), 98198#(<= proc_i 76), 98201#(<= proc_i 88), 98200#(<= proc_i 84), 98203#(<= proc_i 96), 98202#(<= proc_i 92), 98205#(<= proc_i 104), 98204#(<= proc_i 100), 98207#(<= proc_i 112), 98206#(<= proc_i 108), 98209#(<= proc_i 120), 98208#(<= proc_i 116), 98211#(<= proc_i 128), 98210#(<= proc_i 124), 98213#(<= proc_i 136), 98212#(<= proc_i 132), 98215#(<= proc_i 144), 98214#(<= proc_i 140), 98217#(<= proc_i 152), 98216#(<= proc_i 148), 98219#(<= proc_i 160), 98218#(<= proc_i 156), 98221#(<= proc_i 168), 98220#(<= proc_i 164), 98223#(<= proc_i 176), 98222#(<= proc_i 172), 98225#(<= proc_i 184), 98224#(<= proc_i 180), 98227#(<= proc_i 192), 98226#(<= proc_i 188), 98229#(<= proc_i 200), 98228#(<= proc_i 196), 98231#(<= proc_i 208), 98230#(<= proc_i 204), 98233#(<= proc_i 216), 98232#(<= proc_i 212), 98235#(<= proc_i 224), 98234#(<= proc_i 220), 98237#(<= proc_i 232), 98236#(<= proc_i 228), 98239#(<= proc_i 240), 98238#(<= proc_i 236), 98241#(<= proc_i 248), 98240#(<= proc_i 244), 98243#(<= proc_i 256), 98242#(<= proc_i 252), 98245#(<= proc_i 264), 98244#(<= proc_i 260), 98247#(<= proc_i 272), 98246#(<= proc_i 268), 98249#(<= proc_i 280), 98248#(<= proc_i 276), 98251#(<= proc_i 288), 98250#(<= proc_i 284), 98253#(<= proc_i 296), 98252#(<= proc_i 292), 98255#(<= proc_i 304), 98254#(<= proc_i 300), 98257#(<= proc_i 312), 98256#(<= proc_i 308), 98259#(<= proc_i 320), 98258#(<= proc_i 316), 98261#(<= proc_i 328), 98260#(<= proc_i 324), 98263#(<= proc_i 336), 98262#(<= proc_i 332), 98265#(<= proc_i 344), 98264#(<= proc_i 340), 98267#(<= proc_i 352), 98266#(<= proc_i 348), 98269#(<= proc_i 360), 98268#(<= proc_i 356), 98271#(<= proc_i 368), 98270#(<= proc_i 364), 98273#(<= proc_i 376), 98272#(<= proc_i 372), 98275#(<= proc_i 384), 98274#(<= proc_i 380), 98277#(<= proc_i 392), 98276#(<= proc_i 388), 98279#(<= proc_i 400), 98278#(<= proc_i 396), 98281#(<= proc_i 408), 98280#(<= proc_i 404), 98283#(<= proc_i 416), 98282#(<= proc_i 412), 98285#(<= proc_i 424), 98284#(<= proc_i 420), 98287#(<= proc_i 432), 98286#(<= proc_i 428), 98289#(<= proc_i 440), 98288#(<= proc_i 436), 98291#(<= proc_i 448), 98290#(<= proc_i 444), 98293#(<= proc_i 456), 98292#(<= proc_i 452), 98295#(<= proc_i 464), 98294#(<= proc_i 460), 98297#(<= proc_i 472), 98296#(<= proc_i 468), 98299#(<= proc_i 480), 98298#(<= proc_i 476), 98301#(<= proc_i 488), 98300#(<= proc_i 484), 98303#(<= proc_i 496), 98302#(<= proc_i 492)] [2018-07-23 13:52:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 21170 backedges. 0 proven. 21170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:43,306 INFO L450 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-07-23 13:52:43,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-07-23 13:52:43,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-07-23 13:52:43,309 INFO L87 Difference]: Start difference. First operand 294 states and 294 transitions. Second operand 148 states. [2018-07-23 13:52:43,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:43,766 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-07-23 13:52:43,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-07-23 13:52:43,766 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 293 [2018-07-23 13:52:43,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:43,767 INFO L225 Difference]: With dead ends: 297 [2018-07-23 13:52:43,767 INFO L226 Difference]: Without dead ends: 296 [2018-07-23 13:52:43,768 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-07-23 13:52:43,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-07-23 13:52:43,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-07-23 13:52:43,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-07-23 13:52:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-07-23 13:52:43,771 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 293 [2018-07-23 13:52:43,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:43,771 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-07-23 13:52:43,772 INFO L472 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-07-23 13:52:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-07-23 13:52:43,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-07-23 13:52:43,772 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:43,772 INFO L357 BasicCegarLoop]: trace histogram [147, 146, 1, 1] [2018-07-23 13:52:43,773 INFO L414 AbstractCegarLoop]: === Iteration 147 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:43,773 INFO L82 PathProgramCache]: Analyzing trace with hash 2147253764, now seen corresponding path program 146 times [2018-07-23 13:52:43,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 21462 backedges. 0 proven. 21462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:44,406 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:44,407 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-07-23 13:52:44,407 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:44,407 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:52:44,407 INFO L185 omatonBuilderFactory]: Interpolants [99585#(<= proc_i 288), 99584#(<= proc_i 284), 99587#(<= proc_i 296), 99586#(<= proc_i 292), 99589#(<= proc_i 304), 99588#(<= proc_i 300), 99591#(<= proc_i 312), 99590#(<= proc_i 308), 99593#(<= proc_i 320), 99592#(<= proc_i 316), 99595#(<= proc_i 328), 99594#(<= proc_i 324), 99597#(<= proc_i 336), 99596#(<= proc_i 332), 99599#(<= proc_i 344), 99598#(<= proc_i 340), 99601#(<= proc_i 352), 99600#(<= proc_i 348), 99603#(<= proc_i 360), 99602#(<= proc_i 356), 99605#(<= proc_i 368), 99604#(<= proc_i 364), 99607#(<= proc_i 376), 99606#(<= proc_i 372), 99609#(<= proc_i 384), 99608#(<= proc_i 380), 99611#(<= proc_i 392), 99610#(<= proc_i 388), 99613#(<= proc_i 400), 99612#(<= proc_i 396), 99615#(<= proc_i 408), 99614#(<= proc_i 404), 99617#(<= proc_i 416), 99616#(<= proc_i 412), 99619#(<= proc_i 424), 99618#(<= proc_i 420), 99621#(<= proc_i 432), 99620#(<= proc_i 428), 99623#(<= proc_i 440), 99622#(<= proc_i 436), 99625#(<= proc_i 448), 99624#(<= proc_i 444), 99627#(<= proc_i 456), 99626#(<= proc_i 452), 99629#(<= proc_i 464), 99628#(<= proc_i 460), 99631#(<= proc_i 472), 99630#(<= proc_i 468), 99633#(<= proc_i 480), 99632#(<= proc_i 476), 99635#(<= proc_i 488), 99634#(<= proc_i 484), 99637#(<= proc_i 496), 99636#(<= proc_i 492), 99639#(<= proc_i 504), 99638#(<= proc_i 500), 99641#(<= proc_i 512), 99640#(<= proc_i 508), 99643#(<= proc_i 520), 99642#(<= proc_i 516), 99645#(<= proc_i 528), 99644#(<= proc_i 524), 99647#(<= proc_i 536), 99646#(<= proc_i 532), 99649#(<= proc_i 544), 99648#(<= proc_i 540), 99651#(<= proc_i 552), 99650#(<= proc_i 548), 99653#(<= proc_i 560), 99652#(<= proc_i 556), 99655#(<= proc_i 568), 99654#(<= proc_i 564), 99657#(<= proc_i 576), 99656#(<= proc_i 572), 99659#(<= proc_i 584), 99658#(<= proc_i 580), 99511#true, 99513#(<= proc_i 0), 99512#false, 99515#(<= proc_i 8), 99514#(<= proc_i 4), 99517#(<= proc_i 16), 99516#(<= proc_i 12), 99519#(<= proc_i 24), 99518#(<= proc_i 20), 99521#(<= proc_i 32), 99520#(<= proc_i 28), 99523#(<= proc_i 40), 99522#(<= proc_i 36), 99525#(<= proc_i 48), 99524#(<= proc_i 44), 99527#(<= proc_i 56), 99526#(<= proc_i 52), 99529#(<= proc_i 64), 99528#(<= proc_i 60), 99531#(<= proc_i 72), 99530#(<= proc_i 68), 99533#(<= proc_i 80), 99532#(<= proc_i 76), 99535#(<= proc_i 88), 99534#(<= proc_i 84), 99537#(<= proc_i 96), 99536#(<= proc_i 92), 99539#(<= proc_i 104), 99538#(<= proc_i 100), 99541#(<= proc_i 112), 99540#(<= proc_i 108), 99543#(<= proc_i 120), 99542#(<= proc_i 116), 99545#(<= proc_i 128), 99544#(<= proc_i 124), 99547#(<= proc_i 136), 99546#(<= proc_i 132), 99549#(<= proc_i 144), 99548#(<= proc_i 140), 99551#(<= proc_i 152), 99550#(<= proc_i 148), 99553#(<= proc_i 160), 99552#(<= proc_i 156), 99555#(<= proc_i 168), 99554#(<= proc_i 164), 99557#(<= proc_i 176), 99556#(<= proc_i 172), 99559#(<= proc_i 184), 99558#(<= proc_i 180), 99561#(<= proc_i 192), 99560#(<= proc_i 188), 99563#(<= proc_i 200), 99562#(<= proc_i 196), 99565#(<= proc_i 208), 99564#(<= proc_i 204), 99567#(<= proc_i 216), 99566#(<= proc_i 212), 99569#(<= proc_i 224), 99568#(<= proc_i 220), 99571#(<= proc_i 232), 99570#(<= proc_i 228), 99573#(<= proc_i 240), 99572#(<= proc_i 236), 99575#(<= proc_i 248), 99574#(<= proc_i 244), 99577#(<= proc_i 256), 99576#(<= proc_i 252), 99579#(<= proc_i 264), 99578#(<= proc_i 260), 99581#(<= proc_i 272), 99580#(<= proc_i 268), 99583#(<= proc_i 280), 99582#(<= proc_i 276)] [2018-07-23 13:52:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 21462 backedges. 0 proven. 21462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:44,409 INFO L450 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-07-23 13:52:44,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-07-23 13:52:44,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-07-23 13:52:44,411 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 149 states. [2018-07-23 13:52:44,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:44,629 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-07-23 13:52:44,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-07-23 13:52:44,630 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 295 [2018-07-23 13:52:44,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:44,631 INFO L225 Difference]: With dead ends: 299 [2018-07-23 13:52:44,631 INFO L226 Difference]: Without dead ends: 298 [2018-07-23 13:52:44,632 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-07-23 13:52:44,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-07-23 13:52:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2018-07-23 13:52:44,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-07-23 13:52:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2018-07-23 13:52:44,637 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 295 [2018-07-23 13:52:44,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:44,637 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2018-07-23 13:52:44,637 INFO L472 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-07-23 13:52:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2018-07-23 13:52:44,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-07-23 13:52:44,639 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:44,639 INFO L357 BasicCegarLoop]: trace histogram [148, 147, 1, 1] [2018-07-23 13:52:44,639 INFO L414 AbstractCegarLoop]: === Iteration 148 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:44,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1926566214, now seen corresponding path program 147 times [2018-07-23 13:52:44,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 21756 backedges. 0 proven. 21756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:45,388 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:45,388 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-07-23 13:52:45,388 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:45,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:52:45,388 INFO L185 omatonBuilderFactory]: Interpolants [100865#(<= proc_i 36), 100864#(<= proc_i 32), 100867#(<= proc_i 44), 100866#(<= proc_i 40), 100869#(<= proc_i 52), 100868#(<= proc_i 48), 100871#(<= proc_i 60), 100870#(<= proc_i 56), 100873#(<= proc_i 68), 100872#(<= proc_i 64), 100875#(<= proc_i 76), 100874#(<= proc_i 72), 100877#(<= proc_i 84), 100876#(<= proc_i 80), 100879#(<= proc_i 92), 100878#(<= proc_i 88), 100881#(<= proc_i 100), 100880#(<= proc_i 96), 100883#(<= proc_i 108), 100882#(<= proc_i 104), 100885#(<= proc_i 116), 100884#(<= proc_i 112), 100887#(<= proc_i 124), 100886#(<= proc_i 120), 100889#(<= proc_i 132), 100888#(<= proc_i 128), 100891#(<= proc_i 140), 100890#(<= proc_i 136), 100893#(<= proc_i 148), 100892#(<= proc_i 144), 100895#(<= proc_i 156), 100894#(<= proc_i 152), 100897#(<= proc_i 164), 100896#(<= proc_i 160), 100899#(<= proc_i 172), 100898#(<= proc_i 168), 100901#(<= proc_i 180), 100900#(<= proc_i 176), 100903#(<= proc_i 188), 100902#(<= proc_i 184), 100905#(<= proc_i 196), 100904#(<= proc_i 192), 100907#(<= proc_i 204), 100906#(<= proc_i 200), 100909#(<= proc_i 212), 100908#(<= proc_i 208), 100911#(<= proc_i 220), 100910#(<= proc_i 216), 100913#(<= proc_i 228), 100912#(<= proc_i 224), 100915#(<= proc_i 236), 100914#(<= proc_i 232), 100917#(<= proc_i 244), 100916#(<= proc_i 240), 100919#(<= proc_i 252), 100918#(<= proc_i 248), 100921#(<= proc_i 260), 100920#(<= proc_i 256), 100923#(<= proc_i 268), 100922#(<= proc_i 264), 100925#(<= proc_i 276), 100924#(<= proc_i 272), 100927#(<= proc_i 284), 100926#(<= proc_i 280), 100929#(<= proc_i 292), 100928#(<= proc_i 288), 100931#(<= proc_i 300), 100930#(<= proc_i 296), 100933#(<= proc_i 308), 100932#(<= proc_i 304), 100935#(<= proc_i 316), 100934#(<= proc_i 312), 100937#(<= proc_i 324), 100936#(<= proc_i 320), 100939#(<= proc_i 332), 100938#(<= proc_i 328), 100941#(<= proc_i 340), 100940#(<= proc_i 336), 100943#(<= proc_i 348), 100942#(<= proc_i 344), 100945#(<= proc_i 356), 100944#(<= proc_i 352), 100947#(<= proc_i 364), 100946#(<= proc_i 360), 100949#(<= proc_i 372), 100948#(<= proc_i 368), 100951#(<= proc_i 380), 100950#(<= proc_i 376), 100953#(<= proc_i 388), 100952#(<= proc_i 384), 100955#(<= proc_i 396), 100954#(<= proc_i 392), 100957#(<= proc_i 404), 100956#(<= proc_i 400), 100959#(<= proc_i 412), 100958#(<= proc_i 408), 100961#(<= proc_i 420), 100960#(<= proc_i 416), 100963#(<= proc_i 428), 100962#(<= proc_i 424), 100965#(<= proc_i 436), 100964#(<= proc_i 432), 100967#(<= proc_i 444), 100966#(<= proc_i 440), 100969#(<= proc_i 452), 100968#(<= proc_i 448), 100971#(<= proc_i 460), 100970#(<= proc_i 456), 100973#(<= proc_i 468), 100972#(<= proc_i 464), 100975#(<= proc_i 476), 100974#(<= proc_i 472), 100977#(<= proc_i 484), 100976#(<= proc_i 480), 100979#(<= proc_i 492), 100978#(<= proc_i 488), 100981#(<= proc_i 500), 100980#(<= proc_i 496), 100983#(<= proc_i 508), 100982#(<= proc_i 504), 100985#(<= proc_i 516), 100984#(<= proc_i 512), 100987#(<= proc_i 524), 100986#(<= proc_i 520), 100989#(<= proc_i 532), 100988#(<= proc_i 528), 100991#(<= proc_i 540), 100990#(<= proc_i 536), 100993#(<= proc_i 548), 100992#(<= proc_i 544), 100995#(<= proc_i 556), 100994#(<= proc_i 552), 100997#(<= proc_i 564), 100996#(<= proc_i 560), 100999#(<= proc_i 572), 100998#(<= proc_i 568), 101001#(<= proc_i 580), 101000#(<= proc_i 576), 101003#(<= proc_i 588), 101002#(<= proc_i 584), 100855#false, 100854#true, 100857#(<= proc_i 4), 100856#(<= proc_i 0), 100859#(<= proc_i 12), 100858#(<= proc_i 8), 100861#(<= proc_i 20), 100860#(<= proc_i 16), 100863#(<= proc_i 28), 100862#(<= proc_i 24)] [2018-07-23 13:52:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 21756 backedges. 0 proven. 21756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:45,389 INFO L450 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-07-23 13:52:45,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-07-23 13:52:45,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-07-23 13:52:45,392 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 150 states. [2018-07-23 13:52:46,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:46,117 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-07-23 13:52:46,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-07-23 13:52:46,117 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 297 [2018-07-23 13:52:46,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:46,118 INFO L225 Difference]: With dead ends: 301 [2018-07-23 13:52:46,118 INFO L226 Difference]: Without dead ends: 300 [2018-07-23 13:52:46,119 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-07-23 13:52:46,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-07-23 13:52:46,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2018-07-23 13:52:46,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-07-23 13:52:46,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 300 transitions. [2018-07-23 13:52:46,124 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 300 transitions. Word has length 297 [2018-07-23 13:52:46,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:46,124 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 300 transitions. [2018-07-23 13:52:46,124 INFO L472 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-07-23 13:52:46,124 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 300 transitions. [2018-07-23 13:52:46,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-07-23 13:52:46,125 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:46,126 INFO L357 BasicCegarLoop]: trace histogram [149, 148, 1, 1] [2018-07-23 13:52:46,126 INFO L414 AbstractCegarLoop]: === Iteration 149 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:46,126 INFO L82 PathProgramCache]: Analyzing trace with hash 299228168, now seen corresponding path program 148 times [2018-07-23 13:52:46,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 22052 backedges. 0 proven. 22052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:46,885 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:46,885 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-07-23 13:52:46,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:46,885 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:52:46,885 INFO L185 omatonBuilderFactory]: Interpolants [102207#false, 102206#true, 102209#(<= proc_i 4), 102208#(<= proc_i 0), 102211#(<= proc_i 12), 102210#(<= proc_i 8), 102213#(<= proc_i 20), 102212#(<= proc_i 16), 102215#(<= proc_i 28), 102214#(<= proc_i 24), 102217#(<= proc_i 36), 102216#(<= proc_i 32), 102219#(<= proc_i 44), 102218#(<= proc_i 40), 102221#(<= proc_i 52), 102220#(<= proc_i 48), 102223#(<= proc_i 60), 102222#(<= proc_i 56), 102225#(<= proc_i 68), 102224#(<= proc_i 64), 102227#(<= proc_i 76), 102226#(<= proc_i 72), 102229#(<= proc_i 84), 102228#(<= proc_i 80), 102231#(<= proc_i 92), 102230#(<= proc_i 88), 102233#(<= proc_i 100), 102232#(<= proc_i 96), 102235#(<= proc_i 108), 102234#(<= proc_i 104), 102237#(<= proc_i 116), 102236#(<= proc_i 112), 102239#(<= proc_i 124), 102238#(<= proc_i 120), 102241#(<= proc_i 132), 102240#(<= proc_i 128), 102243#(<= proc_i 140), 102242#(<= proc_i 136), 102245#(<= proc_i 148), 102244#(<= proc_i 144), 102247#(<= proc_i 156), 102246#(<= proc_i 152), 102249#(<= proc_i 164), 102248#(<= proc_i 160), 102251#(<= proc_i 172), 102250#(<= proc_i 168), 102253#(<= proc_i 180), 102252#(<= proc_i 176), 102255#(<= proc_i 188), 102254#(<= proc_i 184), 102257#(<= proc_i 196), 102256#(<= proc_i 192), 102259#(<= proc_i 204), 102258#(<= proc_i 200), 102261#(<= proc_i 212), 102260#(<= proc_i 208), 102263#(<= proc_i 220), 102262#(<= proc_i 216), 102265#(<= proc_i 228), 102264#(<= proc_i 224), 102267#(<= proc_i 236), 102266#(<= proc_i 232), 102269#(<= proc_i 244), 102268#(<= proc_i 240), 102271#(<= proc_i 252), 102270#(<= proc_i 248), 102273#(<= proc_i 260), 102272#(<= proc_i 256), 102275#(<= proc_i 268), 102274#(<= proc_i 264), 102277#(<= proc_i 276), 102276#(<= proc_i 272), 102279#(<= proc_i 284), 102278#(<= proc_i 280), 102281#(<= proc_i 292), 102280#(<= proc_i 288), 102283#(<= proc_i 300), 102282#(<= proc_i 296), 102285#(<= proc_i 308), 102284#(<= proc_i 304), 102287#(<= proc_i 316), 102286#(<= proc_i 312), 102289#(<= proc_i 324), 102288#(<= proc_i 320), 102291#(<= proc_i 332), 102290#(<= proc_i 328), 102293#(<= proc_i 340), 102292#(<= proc_i 336), 102295#(<= proc_i 348), 102294#(<= proc_i 344), 102297#(<= proc_i 356), 102296#(<= proc_i 352), 102299#(<= proc_i 364), 102298#(<= proc_i 360), 102301#(<= proc_i 372), 102300#(<= proc_i 368), 102303#(<= proc_i 380), 102302#(<= proc_i 376), 102305#(<= proc_i 388), 102304#(<= proc_i 384), 102307#(<= proc_i 396), 102306#(<= proc_i 392), 102309#(<= proc_i 404), 102308#(<= proc_i 400), 102311#(<= proc_i 412), 102310#(<= proc_i 408), 102313#(<= proc_i 420), 102312#(<= proc_i 416), 102315#(<= proc_i 428), 102314#(<= proc_i 424), 102317#(<= proc_i 436), 102316#(<= proc_i 432), 102319#(<= proc_i 444), 102318#(<= proc_i 440), 102321#(<= proc_i 452), 102320#(<= proc_i 448), 102323#(<= proc_i 460), 102322#(<= proc_i 456), 102325#(<= proc_i 468), 102324#(<= proc_i 464), 102327#(<= proc_i 476), 102326#(<= proc_i 472), 102329#(<= proc_i 484), 102328#(<= proc_i 480), 102331#(<= proc_i 492), 102330#(<= proc_i 488), 102333#(<= proc_i 500), 102332#(<= proc_i 496), 102335#(<= proc_i 508), 102334#(<= proc_i 504), 102337#(<= proc_i 516), 102336#(<= proc_i 512), 102339#(<= proc_i 524), 102338#(<= proc_i 520), 102341#(<= proc_i 532), 102340#(<= proc_i 528), 102343#(<= proc_i 540), 102342#(<= proc_i 536), 102345#(<= proc_i 548), 102344#(<= proc_i 544), 102347#(<= proc_i 556), 102346#(<= proc_i 552), 102349#(<= proc_i 564), 102348#(<= proc_i 560), 102351#(<= proc_i 572), 102350#(<= proc_i 568), 102353#(<= proc_i 580), 102352#(<= proc_i 576), 102355#(<= proc_i 588), 102354#(<= proc_i 584), 102356#(<= proc_i 592)] [2018-07-23 13:52:46,887 INFO L134 CoverageAnalysis]: Checked inductivity of 22052 backedges. 0 proven. 22052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:46,887 INFO L450 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-07-23 13:52:46,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-07-23 13:52:46,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-07-23 13:52:46,890 INFO L87 Difference]: Start difference. First operand 300 states and 300 transitions. Second operand 151 states. [2018-07-23 13:52:47,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:47,563 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-07-23 13:52:47,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-07-23 13:52:47,563 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 299 [2018-07-23 13:52:47,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:47,564 INFO L225 Difference]: With dead ends: 303 [2018-07-23 13:52:47,564 INFO L226 Difference]: Without dead ends: 302 [2018-07-23 13:52:47,565 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-07-23 13:52:47,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-07-23 13:52:47,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2018-07-23 13:52:47,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-07-23 13:52:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-07-23 13:52:47,568 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 299 [2018-07-23 13:52:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:47,569 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-07-23 13:52:47,569 INFO L472 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-07-23 13:52:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-07-23 13:52:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-07-23 13:52:47,569 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:47,570 INFO L357 BasicCegarLoop]: trace histogram [150, 149, 1, 1] [2018-07-23 13:52:47,570 INFO L414 AbstractCegarLoop]: === Iteration 150 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:47,570 INFO L82 PathProgramCache]: Analyzing trace with hash -204538294, now seen corresponding path program 149 times [2018-07-23 13:52:47,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:48,340 INFO L134 CoverageAnalysis]: Checked inductivity of 22350 backedges. 0 proven. 22350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:48,341 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:48,341 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-07-23 13:52:48,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:48,341 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:52:48,342 INFO L185 omatonBuilderFactory]: Interpolants [103681#(<= proc_i 448), 103680#(<= proc_i 444), 103683#(<= proc_i 456), 103682#(<= proc_i 452), 103685#(<= proc_i 464), 103684#(<= proc_i 460), 103687#(<= proc_i 472), 103686#(<= proc_i 468), 103689#(<= proc_i 480), 103688#(<= proc_i 476), 103691#(<= proc_i 488), 103690#(<= proc_i 484), 103693#(<= proc_i 496), 103692#(<= proc_i 492), 103695#(<= proc_i 504), 103694#(<= proc_i 500), 103697#(<= proc_i 512), 103696#(<= proc_i 508), 103699#(<= proc_i 520), 103698#(<= proc_i 516), 103701#(<= proc_i 528), 103700#(<= proc_i 524), 103703#(<= proc_i 536), 103702#(<= proc_i 532), 103705#(<= proc_i 544), 103704#(<= proc_i 540), 103707#(<= proc_i 552), 103706#(<= proc_i 548), 103709#(<= proc_i 560), 103708#(<= proc_i 556), 103711#(<= proc_i 568), 103710#(<= proc_i 564), 103713#(<= proc_i 576), 103712#(<= proc_i 572), 103715#(<= proc_i 584), 103714#(<= proc_i 580), 103717#(<= proc_i 592), 103716#(<= proc_i 588), 103718#(<= proc_i 596), 103567#true, 103569#(<= proc_i 0), 103568#false, 103571#(<= proc_i 8), 103570#(<= proc_i 4), 103573#(<= proc_i 16), 103572#(<= proc_i 12), 103575#(<= proc_i 24), 103574#(<= proc_i 20), 103577#(<= proc_i 32), 103576#(<= proc_i 28), 103579#(<= proc_i 40), 103578#(<= proc_i 36), 103581#(<= proc_i 48), 103580#(<= proc_i 44), 103583#(<= proc_i 56), 103582#(<= proc_i 52), 103585#(<= proc_i 64), 103584#(<= proc_i 60), 103587#(<= proc_i 72), 103586#(<= proc_i 68), 103589#(<= proc_i 80), 103588#(<= proc_i 76), 103591#(<= proc_i 88), 103590#(<= proc_i 84), 103593#(<= proc_i 96), 103592#(<= proc_i 92), 103595#(<= proc_i 104), 103594#(<= proc_i 100), 103597#(<= proc_i 112), 103596#(<= proc_i 108), 103599#(<= proc_i 120), 103598#(<= proc_i 116), 103601#(<= proc_i 128), 103600#(<= proc_i 124), 103603#(<= proc_i 136), 103602#(<= proc_i 132), 103605#(<= proc_i 144), 103604#(<= proc_i 140), 103607#(<= proc_i 152), 103606#(<= proc_i 148), 103609#(<= proc_i 160), 103608#(<= proc_i 156), 103611#(<= proc_i 168), 103610#(<= proc_i 164), 103613#(<= proc_i 176), 103612#(<= proc_i 172), 103615#(<= proc_i 184), 103614#(<= proc_i 180), 103617#(<= proc_i 192), 103616#(<= proc_i 188), 103619#(<= proc_i 200), 103618#(<= proc_i 196), 103621#(<= proc_i 208), 103620#(<= proc_i 204), 103623#(<= proc_i 216), 103622#(<= proc_i 212), 103625#(<= proc_i 224), 103624#(<= proc_i 220), 103627#(<= proc_i 232), 103626#(<= proc_i 228), 103629#(<= proc_i 240), 103628#(<= proc_i 236), 103631#(<= proc_i 248), 103630#(<= proc_i 244), 103633#(<= proc_i 256), 103632#(<= proc_i 252), 103635#(<= proc_i 264), 103634#(<= proc_i 260), 103637#(<= proc_i 272), 103636#(<= proc_i 268), 103639#(<= proc_i 280), 103638#(<= proc_i 276), 103641#(<= proc_i 288), 103640#(<= proc_i 284), 103643#(<= proc_i 296), 103642#(<= proc_i 292), 103645#(<= proc_i 304), 103644#(<= proc_i 300), 103647#(<= proc_i 312), 103646#(<= proc_i 308), 103649#(<= proc_i 320), 103648#(<= proc_i 316), 103651#(<= proc_i 328), 103650#(<= proc_i 324), 103653#(<= proc_i 336), 103652#(<= proc_i 332), 103655#(<= proc_i 344), 103654#(<= proc_i 340), 103657#(<= proc_i 352), 103656#(<= proc_i 348), 103659#(<= proc_i 360), 103658#(<= proc_i 356), 103661#(<= proc_i 368), 103660#(<= proc_i 364), 103663#(<= proc_i 376), 103662#(<= proc_i 372), 103665#(<= proc_i 384), 103664#(<= proc_i 380), 103667#(<= proc_i 392), 103666#(<= proc_i 388), 103669#(<= proc_i 400), 103668#(<= proc_i 396), 103671#(<= proc_i 408), 103670#(<= proc_i 404), 103673#(<= proc_i 416), 103672#(<= proc_i 412), 103675#(<= proc_i 424), 103674#(<= proc_i 420), 103677#(<= proc_i 432), 103676#(<= proc_i 428), 103679#(<= proc_i 440), 103678#(<= proc_i 436)] [2018-07-23 13:52:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 22350 backedges. 0 proven. 22350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:48,343 INFO L450 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-07-23 13:52:48,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-07-23 13:52:48,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-07-23 13:52:48,346 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 152 states. [2018-07-23 13:52:48,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:48,735 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-07-23 13:52:48,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-07-23 13:52:48,735 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 301 [2018-07-23 13:52:48,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:48,736 INFO L225 Difference]: With dead ends: 305 [2018-07-23 13:52:48,736 INFO L226 Difference]: Without dead ends: 304 [2018-07-23 13:52:48,737 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-07-23 13:52:48,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-07-23 13:52:48,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2018-07-23 13:52:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-07-23 13:52:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 304 transitions. [2018-07-23 13:52:48,741 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 304 transitions. Word has length 301 [2018-07-23 13:52:48,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:48,741 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 304 transitions. [2018-07-23 13:52:48,741 INFO L472 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-07-23 13:52:48,741 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 304 transitions. [2018-07-23 13:52:48,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-07-23 13:52:48,742 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:48,742 INFO L357 BasicCegarLoop]: trace histogram [151, 150, 1, 1] [2018-07-23 13:52:48,742 INFO L414 AbstractCegarLoop]: === Iteration 151 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:48,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1007196172, now seen corresponding path program 150 times [2018-07-23 13:52:48,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 22650 backedges. 0 proven. 22650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:49,536 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:49,536 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-07-23 13:52:49,536 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:49,537 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:52:49,537 INFO L185 omatonBuilderFactory]: Interpolants [104961#(<= proc_i 88), 104960#(<= proc_i 84), 104963#(<= proc_i 96), 104962#(<= proc_i 92), 104965#(<= proc_i 104), 104964#(<= proc_i 100), 104967#(<= proc_i 112), 104966#(<= proc_i 108), 104969#(<= proc_i 120), 104968#(<= proc_i 116), 104971#(<= proc_i 128), 104970#(<= proc_i 124), 104973#(<= proc_i 136), 104972#(<= proc_i 132), 104975#(<= proc_i 144), 104974#(<= proc_i 140), 104977#(<= proc_i 152), 104976#(<= proc_i 148), 104979#(<= proc_i 160), 104978#(<= proc_i 156), 104981#(<= proc_i 168), 104980#(<= proc_i 164), 104983#(<= proc_i 176), 104982#(<= proc_i 172), 104985#(<= proc_i 184), 104984#(<= proc_i 180), 104987#(<= proc_i 192), 104986#(<= proc_i 188), 104989#(<= proc_i 200), 104988#(<= proc_i 196), 104991#(<= proc_i 208), 104990#(<= proc_i 204), 104993#(<= proc_i 216), 104992#(<= proc_i 212), 104995#(<= proc_i 224), 104994#(<= proc_i 220), 104997#(<= proc_i 232), 104996#(<= proc_i 228), 104999#(<= proc_i 240), 104998#(<= proc_i 236), 105001#(<= proc_i 248), 105000#(<= proc_i 244), 105003#(<= proc_i 256), 105002#(<= proc_i 252), 105005#(<= proc_i 264), 105004#(<= proc_i 260), 105007#(<= proc_i 272), 105006#(<= proc_i 268), 105009#(<= proc_i 280), 105008#(<= proc_i 276), 105011#(<= proc_i 288), 105010#(<= proc_i 284), 105013#(<= proc_i 296), 105012#(<= proc_i 292), 105015#(<= proc_i 304), 105014#(<= proc_i 300), 105017#(<= proc_i 312), 105016#(<= proc_i 308), 105019#(<= proc_i 320), 105018#(<= proc_i 316), 105021#(<= proc_i 328), 105020#(<= proc_i 324), 105023#(<= proc_i 336), 105022#(<= proc_i 332), 105025#(<= proc_i 344), 105024#(<= proc_i 340), 105027#(<= proc_i 352), 105026#(<= proc_i 348), 105029#(<= proc_i 360), 105028#(<= proc_i 356), 105031#(<= proc_i 368), 105030#(<= proc_i 364), 105033#(<= proc_i 376), 105032#(<= proc_i 372), 105035#(<= proc_i 384), 105034#(<= proc_i 380), 105037#(<= proc_i 392), 105036#(<= proc_i 388), 105039#(<= proc_i 400), 105038#(<= proc_i 396), 105041#(<= proc_i 408), 105040#(<= proc_i 404), 105043#(<= proc_i 416), 105042#(<= proc_i 412), 105045#(<= proc_i 424), 105044#(<= proc_i 420), 105047#(<= proc_i 432), 105046#(<= proc_i 428), 105049#(<= proc_i 440), 105048#(<= proc_i 436), 105051#(<= proc_i 448), 105050#(<= proc_i 444), 105053#(<= proc_i 456), 105052#(<= proc_i 452), 105055#(<= proc_i 464), 105054#(<= proc_i 460), 105057#(<= proc_i 472), 105056#(<= proc_i 468), 105059#(<= proc_i 480), 105058#(<= proc_i 476), 105061#(<= proc_i 488), 105060#(<= proc_i 484), 105063#(<= proc_i 496), 105062#(<= proc_i 492), 105065#(<= proc_i 504), 105064#(<= proc_i 500), 105067#(<= proc_i 512), 105066#(<= proc_i 508), 105069#(<= proc_i 520), 105068#(<= proc_i 516), 105071#(<= proc_i 528), 105070#(<= proc_i 524), 105073#(<= proc_i 536), 105072#(<= proc_i 532), 105075#(<= proc_i 544), 105074#(<= proc_i 540), 105077#(<= proc_i 552), 105076#(<= proc_i 548), 105079#(<= proc_i 560), 105078#(<= proc_i 556), 105081#(<= proc_i 568), 105080#(<= proc_i 564), 105083#(<= proc_i 576), 105082#(<= proc_i 572), 105085#(<= proc_i 584), 105084#(<= proc_i 580), 105087#(<= proc_i 592), 105086#(<= proc_i 588), 105089#(<= proc_i 600), 105088#(<= proc_i 596), 104937#true, 104939#(<= proc_i 0), 104938#false, 104941#(<= proc_i 8), 104940#(<= proc_i 4), 104943#(<= proc_i 16), 104942#(<= proc_i 12), 104945#(<= proc_i 24), 104944#(<= proc_i 20), 104947#(<= proc_i 32), 104946#(<= proc_i 28), 104949#(<= proc_i 40), 104948#(<= proc_i 36), 104951#(<= proc_i 48), 104950#(<= proc_i 44), 104953#(<= proc_i 56), 104952#(<= proc_i 52), 104955#(<= proc_i 64), 104954#(<= proc_i 60), 104957#(<= proc_i 72), 104956#(<= proc_i 68), 104959#(<= proc_i 80), 104958#(<= proc_i 76)] [2018-07-23 13:52:49,539 INFO L134 CoverageAnalysis]: Checked inductivity of 22650 backedges. 0 proven. 22650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:49,539 INFO L450 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-07-23 13:52:49,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-07-23 13:52:49,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-07-23 13:52:49,542 INFO L87 Difference]: Start difference. First operand 304 states and 304 transitions. Second operand 153 states. [2018-07-23 13:52:50,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:50,302 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-07-23 13:52:50,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-07-23 13:52:50,302 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 303 [2018-07-23 13:52:50,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:50,303 INFO L225 Difference]: With dead ends: 307 [2018-07-23 13:52:50,303 INFO L226 Difference]: Without dead ends: 306 [2018-07-23 13:52:50,305 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-07-23 13:52:50,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-07-23 13:52:50,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2018-07-23 13:52:50,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-07-23 13:52:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2018-07-23 13:52:50,308 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 303 [2018-07-23 13:52:50,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:50,309 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2018-07-23 13:52:50,309 INFO L472 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-07-23 13:52:50,309 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2018-07-23 13:52:50,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-07-23 13:52:50,309 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:50,310 INFO L357 BasicCegarLoop]: trace histogram [152, 151, 1, 1] [2018-07-23 13:52:50,310 INFO L414 AbstractCegarLoop]: === Iteration 152 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:50,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1547880782, now seen corresponding path program 151 times [2018-07-23 13:52:50,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 22952 backedges. 0 proven. 22952 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:51,159 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:51,159 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-07-23 13:52:51,159 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:51,159 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:52:51,159 INFO L185 omatonBuilderFactory]: Interpolants [106317#false, 106316#true, 106319#(<= proc_i 4), 106318#(<= proc_i 0), 106321#(<= proc_i 12), 106320#(<= proc_i 8), 106323#(<= proc_i 20), 106322#(<= proc_i 16), 106325#(<= proc_i 28), 106324#(<= proc_i 24), 106327#(<= proc_i 36), 106326#(<= proc_i 32), 106329#(<= proc_i 44), 106328#(<= proc_i 40), 106331#(<= proc_i 52), 106330#(<= proc_i 48), 106333#(<= proc_i 60), 106332#(<= proc_i 56), 106335#(<= proc_i 68), 106334#(<= proc_i 64), 106337#(<= proc_i 76), 106336#(<= proc_i 72), 106339#(<= proc_i 84), 106338#(<= proc_i 80), 106341#(<= proc_i 92), 106340#(<= proc_i 88), 106343#(<= proc_i 100), 106342#(<= proc_i 96), 106345#(<= proc_i 108), 106344#(<= proc_i 104), 106347#(<= proc_i 116), 106346#(<= proc_i 112), 106349#(<= proc_i 124), 106348#(<= proc_i 120), 106351#(<= proc_i 132), 106350#(<= proc_i 128), 106353#(<= proc_i 140), 106352#(<= proc_i 136), 106355#(<= proc_i 148), 106354#(<= proc_i 144), 106357#(<= proc_i 156), 106356#(<= proc_i 152), 106359#(<= proc_i 164), 106358#(<= proc_i 160), 106361#(<= proc_i 172), 106360#(<= proc_i 168), 106363#(<= proc_i 180), 106362#(<= proc_i 176), 106365#(<= proc_i 188), 106364#(<= proc_i 184), 106367#(<= proc_i 196), 106366#(<= proc_i 192), 106369#(<= proc_i 204), 106368#(<= proc_i 200), 106371#(<= proc_i 212), 106370#(<= proc_i 208), 106373#(<= proc_i 220), 106372#(<= proc_i 216), 106375#(<= proc_i 228), 106374#(<= proc_i 224), 106377#(<= proc_i 236), 106376#(<= proc_i 232), 106379#(<= proc_i 244), 106378#(<= proc_i 240), 106381#(<= proc_i 252), 106380#(<= proc_i 248), 106383#(<= proc_i 260), 106382#(<= proc_i 256), 106385#(<= proc_i 268), 106384#(<= proc_i 264), 106387#(<= proc_i 276), 106386#(<= proc_i 272), 106389#(<= proc_i 284), 106388#(<= proc_i 280), 106391#(<= proc_i 292), 106390#(<= proc_i 288), 106393#(<= proc_i 300), 106392#(<= proc_i 296), 106395#(<= proc_i 308), 106394#(<= proc_i 304), 106397#(<= proc_i 316), 106396#(<= proc_i 312), 106399#(<= proc_i 324), 106398#(<= proc_i 320), 106401#(<= proc_i 332), 106400#(<= proc_i 328), 106403#(<= proc_i 340), 106402#(<= proc_i 336), 106405#(<= proc_i 348), 106404#(<= proc_i 344), 106407#(<= proc_i 356), 106406#(<= proc_i 352), 106409#(<= proc_i 364), 106408#(<= proc_i 360), 106411#(<= proc_i 372), 106410#(<= proc_i 368), 106413#(<= proc_i 380), 106412#(<= proc_i 376), 106415#(<= proc_i 388), 106414#(<= proc_i 384), 106417#(<= proc_i 396), 106416#(<= proc_i 392), 106419#(<= proc_i 404), 106418#(<= proc_i 400), 106421#(<= proc_i 412), 106420#(<= proc_i 408), 106423#(<= proc_i 420), 106422#(<= proc_i 416), 106425#(<= proc_i 428), 106424#(<= proc_i 424), 106427#(<= proc_i 436), 106426#(<= proc_i 432), 106429#(<= proc_i 444), 106428#(<= proc_i 440), 106431#(<= proc_i 452), 106430#(<= proc_i 448), 106433#(<= proc_i 460), 106432#(<= proc_i 456), 106435#(<= proc_i 468), 106434#(<= proc_i 464), 106437#(<= proc_i 476), 106436#(<= proc_i 472), 106439#(<= proc_i 484), 106438#(<= proc_i 480), 106441#(<= proc_i 492), 106440#(<= proc_i 488), 106443#(<= proc_i 500), 106442#(<= proc_i 496), 106445#(<= proc_i 508), 106444#(<= proc_i 504), 106447#(<= proc_i 516), 106446#(<= proc_i 512), 106449#(<= proc_i 524), 106448#(<= proc_i 520), 106451#(<= proc_i 532), 106450#(<= proc_i 528), 106453#(<= proc_i 540), 106452#(<= proc_i 536), 106455#(<= proc_i 548), 106454#(<= proc_i 544), 106457#(<= proc_i 556), 106456#(<= proc_i 552), 106459#(<= proc_i 564), 106458#(<= proc_i 560), 106461#(<= proc_i 572), 106460#(<= proc_i 568), 106463#(<= proc_i 580), 106462#(<= proc_i 576), 106465#(<= proc_i 588), 106464#(<= proc_i 584), 106467#(<= proc_i 596), 106466#(<= proc_i 592), 106469#(<= proc_i 604), 106468#(<= proc_i 600)] [2018-07-23 13:52:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 22952 backedges. 0 proven. 22952 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:51,161 INFO L450 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-07-23 13:52:51,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-07-23 13:52:51,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-07-23 13:52:51,163 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 154 states. [2018-07-23 13:52:51,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:51,786 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-07-23 13:52:51,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-07-23 13:52:51,787 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 305 [2018-07-23 13:52:51,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:51,788 INFO L225 Difference]: With dead ends: 309 [2018-07-23 13:52:51,788 INFO L226 Difference]: Without dead ends: 308 [2018-07-23 13:52:51,789 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-07-23 13:52:51,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-07-23 13:52:51,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2018-07-23 13:52:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-07-23 13:52:51,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2018-07-23 13:52:51,794 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 305 [2018-07-23 13:52:51,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:51,794 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 308 transitions. [2018-07-23 13:52:51,794 INFO L472 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-07-23 13:52:51,794 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 308 transitions. [2018-07-23 13:52:51,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-07-23 13:52:51,795 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:51,796 INFO L357 BasicCegarLoop]: trace histogram [153, 152, 1, 1] [2018-07-23 13:52:51,796 INFO L414 AbstractCegarLoop]: === Iteration 153 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:51,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1454748176, now seen corresponding path program 152 times [2018-07-23 13:52:51,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:52,720 INFO L134 CoverageAnalysis]: Checked inductivity of 23256 backedges. 0 proven. 23256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:52,720 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:52,721 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-07-23 13:52:52,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:52,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:52:52,721 INFO L185 omatonBuilderFactory]: Interpolants [107777#(<= proc_i 284), 107776#(<= proc_i 280), 107779#(<= proc_i 292), 107778#(<= proc_i 288), 107781#(<= proc_i 300), 107780#(<= proc_i 296), 107783#(<= proc_i 308), 107782#(<= proc_i 304), 107785#(<= proc_i 316), 107784#(<= proc_i 312), 107787#(<= proc_i 324), 107786#(<= proc_i 320), 107789#(<= proc_i 332), 107788#(<= proc_i 328), 107791#(<= proc_i 340), 107790#(<= proc_i 336), 107793#(<= proc_i 348), 107792#(<= proc_i 344), 107795#(<= proc_i 356), 107794#(<= proc_i 352), 107797#(<= proc_i 364), 107796#(<= proc_i 360), 107799#(<= proc_i 372), 107798#(<= proc_i 368), 107801#(<= proc_i 380), 107800#(<= proc_i 376), 107803#(<= proc_i 388), 107802#(<= proc_i 384), 107805#(<= proc_i 396), 107804#(<= proc_i 392), 107807#(<= proc_i 404), 107806#(<= proc_i 400), 107809#(<= proc_i 412), 107808#(<= proc_i 408), 107811#(<= proc_i 420), 107810#(<= proc_i 416), 107813#(<= proc_i 428), 107812#(<= proc_i 424), 107815#(<= proc_i 436), 107814#(<= proc_i 432), 107817#(<= proc_i 444), 107816#(<= proc_i 440), 107819#(<= proc_i 452), 107818#(<= proc_i 448), 107821#(<= proc_i 460), 107820#(<= proc_i 456), 107823#(<= proc_i 468), 107822#(<= proc_i 464), 107825#(<= proc_i 476), 107824#(<= proc_i 472), 107827#(<= proc_i 484), 107826#(<= proc_i 480), 107829#(<= proc_i 492), 107828#(<= proc_i 488), 107831#(<= proc_i 500), 107830#(<= proc_i 496), 107833#(<= proc_i 508), 107832#(<= proc_i 504), 107835#(<= proc_i 516), 107834#(<= proc_i 512), 107837#(<= proc_i 524), 107836#(<= proc_i 520), 107839#(<= proc_i 532), 107838#(<= proc_i 528), 107841#(<= proc_i 540), 107840#(<= proc_i 536), 107843#(<= proc_i 548), 107842#(<= proc_i 544), 107845#(<= proc_i 556), 107844#(<= proc_i 552), 107847#(<= proc_i 564), 107846#(<= proc_i 560), 107849#(<= proc_i 572), 107848#(<= proc_i 568), 107851#(<= proc_i 580), 107850#(<= proc_i 576), 107853#(<= proc_i 588), 107852#(<= proc_i 584), 107855#(<= proc_i 596), 107854#(<= proc_i 592), 107857#(<= proc_i 604), 107856#(<= proc_i 600), 107858#(<= proc_i 608), 107705#false, 107704#true, 107707#(<= proc_i 4), 107706#(<= proc_i 0), 107709#(<= proc_i 12), 107708#(<= proc_i 8), 107711#(<= proc_i 20), 107710#(<= proc_i 16), 107713#(<= proc_i 28), 107712#(<= proc_i 24), 107715#(<= proc_i 36), 107714#(<= proc_i 32), 107717#(<= proc_i 44), 107716#(<= proc_i 40), 107719#(<= proc_i 52), 107718#(<= proc_i 48), 107721#(<= proc_i 60), 107720#(<= proc_i 56), 107723#(<= proc_i 68), 107722#(<= proc_i 64), 107725#(<= proc_i 76), 107724#(<= proc_i 72), 107727#(<= proc_i 84), 107726#(<= proc_i 80), 107729#(<= proc_i 92), 107728#(<= proc_i 88), 107731#(<= proc_i 100), 107730#(<= proc_i 96), 107733#(<= proc_i 108), 107732#(<= proc_i 104), 107735#(<= proc_i 116), 107734#(<= proc_i 112), 107737#(<= proc_i 124), 107736#(<= proc_i 120), 107739#(<= proc_i 132), 107738#(<= proc_i 128), 107741#(<= proc_i 140), 107740#(<= proc_i 136), 107743#(<= proc_i 148), 107742#(<= proc_i 144), 107745#(<= proc_i 156), 107744#(<= proc_i 152), 107747#(<= proc_i 164), 107746#(<= proc_i 160), 107749#(<= proc_i 172), 107748#(<= proc_i 168), 107751#(<= proc_i 180), 107750#(<= proc_i 176), 107753#(<= proc_i 188), 107752#(<= proc_i 184), 107755#(<= proc_i 196), 107754#(<= proc_i 192), 107757#(<= proc_i 204), 107756#(<= proc_i 200), 107759#(<= proc_i 212), 107758#(<= proc_i 208), 107761#(<= proc_i 220), 107760#(<= proc_i 216), 107763#(<= proc_i 228), 107762#(<= proc_i 224), 107765#(<= proc_i 236), 107764#(<= proc_i 232), 107767#(<= proc_i 244), 107766#(<= proc_i 240), 107769#(<= proc_i 252), 107768#(<= proc_i 248), 107771#(<= proc_i 260), 107770#(<= proc_i 256), 107773#(<= proc_i 268), 107772#(<= proc_i 264), 107775#(<= proc_i 276), 107774#(<= proc_i 272)] [2018-07-23 13:52:52,723 INFO L134 CoverageAnalysis]: Checked inductivity of 23256 backedges. 0 proven. 23256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:52,723 INFO L450 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-07-23 13:52:52,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-07-23 13:52:52,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-07-23 13:52:52,726 INFO L87 Difference]: Start difference. First operand 308 states and 308 transitions. Second operand 155 states. [2018-07-23 13:52:53,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:53,042 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-07-23 13:52:53,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-07-23 13:52:53,043 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 307 [2018-07-23 13:52:53,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:53,043 INFO L225 Difference]: With dead ends: 311 [2018-07-23 13:52:53,043 INFO L226 Difference]: Without dead ends: 310 [2018-07-23 13:52:53,045 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-07-23 13:52:53,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-07-23 13:52:53,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2018-07-23 13:52:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-07-23 13:52:53,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 310 transitions. [2018-07-23 13:52:53,048 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 310 transitions. Word has length 307 [2018-07-23 13:52:53,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:53,048 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 310 transitions. [2018-07-23 13:52:53,048 INFO L472 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-07-23 13:52:53,048 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 310 transitions. [2018-07-23 13:52:53,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-07-23 13:52:53,049 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:53,049 INFO L357 BasicCegarLoop]: trace histogram [154, 153, 1, 1] [2018-07-23 13:52:53,049 INFO L414 AbstractCegarLoop]: === Iteration 154 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:53,049 INFO L82 PathProgramCache]: Analyzing trace with hash -2146340270, now seen corresponding path program 153 times [2018-07-23 13:52:53,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 23562 backedges. 0 proven. 23562 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:53,885 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:53,885 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-07-23 13:52:53,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:53,886 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:52:53,886 INFO L185 omatonBuilderFactory]: Interpolants [109101#true, 109103#(<= proc_i 0), 109102#false, 109105#(<= proc_i 8), 109104#(<= proc_i 4), 109107#(<= proc_i 16), 109106#(<= proc_i 12), 109109#(<= proc_i 24), 109108#(<= proc_i 20), 109111#(<= proc_i 32), 109110#(<= proc_i 28), 109113#(<= proc_i 40), 109112#(<= proc_i 36), 109115#(<= proc_i 48), 109114#(<= proc_i 44), 109117#(<= proc_i 56), 109116#(<= proc_i 52), 109119#(<= proc_i 64), 109118#(<= proc_i 60), 109121#(<= proc_i 72), 109120#(<= proc_i 68), 109123#(<= proc_i 80), 109122#(<= proc_i 76), 109125#(<= proc_i 88), 109124#(<= proc_i 84), 109127#(<= proc_i 96), 109126#(<= proc_i 92), 109129#(<= proc_i 104), 109128#(<= proc_i 100), 109131#(<= proc_i 112), 109130#(<= proc_i 108), 109133#(<= proc_i 120), 109132#(<= proc_i 116), 109135#(<= proc_i 128), 109134#(<= proc_i 124), 109137#(<= proc_i 136), 109136#(<= proc_i 132), 109139#(<= proc_i 144), 109138#(<= proc_i 140), 109141#(<= proc_i 152), 109140#(<= proc_i 148), 109143#(<= proc_i 160), 109142#(<= proc_i 156), 109145#(<= proc_i 168), 109144#(<= proc_i 164), 109147#(<= proc_i 176), 109146#(<= proc_i 172), 109149#(<= proc_i 184), 109148#(<= proc_i 180), 109151#(<= proc_i 192), 109150#(<= proc_i 188), 109153#(<= proc_i 200), 109152#(<= proc_i 196), 109155#(<= proc_i 208), 109154#(<= proc_i 204), 109157#(<= proc_i 216), 109156#(<= proc_i 212), 109159#(<= proc_i 224), 109158#(<= proc_i 220), 109161#(<= proc_i 232), 109160#(<= proc_i 228), 109163#(<= proc_i 240), 109162#(<= proc_i 236), 109165#(<= proc_i 248), 109164#(<= proc_i 244), 109167#(<= proc_i 256), 109166#(<= proc_i 252), 109169#(<= proc_i 264), 109168#(<= proc_i 260), 109171#(<= proc_i 272), 109170#(<= proc_i 268), 109173#(<= proc_i 280), 109172#(<= proc_i 276), 109175#(<= proc_i 288), 109174#(<= proc_i 284), 109177#(<= proc_i 296), 109176#(<= proc_i 292), 109179#(<= proc_i 304), 109178#(<= proc_i 300), 109181#(<= proc_i 312), 109180#(<= proc_i 308), 109183#(<= proc_i 320), 109182#(<= proc_i 316), 109185#(<= proc_i 328), 109184#(<= proc_i 324), 109187#(<= proc_i 336), 109186#(<= proc_i 332), 109189#(<= proc_i 344), 109188#(<= proc_i 340), 109191#(<= proc_i 352), 109190#(<= proc_i 348), 109193#(<= proc_i 360), 109192#(<= proc_i 356), 109195#(<= proc_i 368), 109194#(<= proc_i 364), 109197#(<= proc_i 376), 109196#(<= proc_i 372), 109199#(<= proc_i 384), 109198#(<= proc_i 380), 109201#(<= proc_i 392), 109200#(<= proc_i 388), 109203#(<= proc_i 400), 109202#(<= proc_i 396), 109205#(<= proc_i 408), 109204#(<= proc_i 404), 109207#(<= proc_i 416), 109206#(<= proc_i 412), 109209#(<= proc_i 424), 109208#(<= proc_i 420), 109211#(<= proc_i 432), 109210#(<= proc_i 428), 109213#(<= proc_i 440), 109212#(<= proc_i 436), 109215#(<= proc_i 448), 109214#(<= proc_i 444), 109217#(<= proc_i 456), 109216#(<= proc_i 452), 109219#(<= proc_i 464), 109218#(<= proc_i 460), 109221#(<= proc_i 472), 109220#(<= proc_i 468), 109223#(<= proc_i 480), 109222#(<= proc_i 476), 109225#(<= proc_i 488), 109224#(<= proc_i 484), 109227#(<= proc_i 496), 109226#(<= proc_i 492), 109229#(<= proc_i 504), 109228#(<= proc_i 500), 109231#(<= proc_i 512), 109230#(<= proc_i 508), 109233#(<= proc_i 520), 109232#(<= proc_i 516), 109235#(<= proc_i 528), 109234#(<= proc_i 524), 109237#(<= proc_i 536), 109236#(<= proc_i 532), 109239#(<= proc_i 544), 109238#(<= proc_i 540), 109241#(<= proc_i 552), 109240#(<= proc_i 548), 109243#(<= proc_i 560), 109242#(<= proc_i 556), 109245#(<= proc_i 568), 109244#(<= proc_i 564), 109247#(<= proc_i 576), 109246#(<= proc_i 572), 109249#(<= proc_i 584), 109248#(<= proc_i 580), 109251#(<= proc_i 592), 109250#(<= proc_i 588), 109253#(<= proc_i 600), 109252#(<= proc_i 596), 109255#(<= proc_i 608), 109254#(<= proc_i 604), 109256#(<= proc_i 612)] [2018-07-23 13:52:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 23562 backedges. 0 proven. 23562 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:53,887 INFO L450 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-07-23 13:52:53,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-07-23 13:52:53,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-07-23 13:52:53,890 INFO L87 Difference]: Start difference. First operand 310 states and 310 transitions. Second operand 156 states. [2018-07-23 13:52:54,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:54,787 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-07-23 13:52:54,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-07-23 13:52:54,787 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 309 [2018-07-23 13:52:54,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:54,788 INFO L225 Difference]: With dead ends: 313 [2018-07-23 13:52:54,788 INFO L226 Difference]: Without dead ends: 312 [2018-07-23 13:52:54,789 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-07-23 13:52:54,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-07-23 13:52:54,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2018-07-23 13:52:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-07-23 13:52:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 312 transitions. [2018-07-23 13:52:54,793 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 312 transitions. Word has length 309 [2018-07-23 13:52:54,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:54,793 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 312 transitions. [2018-07-23 13:52:54,793 INFO L472 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-07-23 13:52:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 312 transitions. [2018-07-23 13:52:54,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-07-23 13:52:54,795 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:54,795 INFO L357 BasicCegarLoop]: trace histogram [155, 154, 1, 1] [2018-07-23 13:52:54,795 INFO L414 AbstractCegarLoop]: === Iteration 155 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:54,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1048696300, now seen corresponding path program 154 times [2018-07-23 13:52:54,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 23870 backedges. 0 proven. 23870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:55,634 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:55,634 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-07-23 13:52:55,634 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:55,634 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:52:55,635 INFO L185 omatonBuilderFactory]: Interpolants [110593#(<= proc_i 336), 110592#(<= proc_i 332), 110595#(<= proc_i 344), 110594#(<= proc_i 340), 110597#(<= proc_i 352), 110596#(<= proc_i 348), 110599#(<= proc_i 360), 110598#(<= proc_i 356), 110601#(<= proc_i 368), 110600#(<= proc_i 364), 110603#(<= proc_i 376), 110602#(<= proc_i 372), 110605#(<= proc_i 384), 110604#(<= proc_i 380), 110607#(<= proc_i 392), 110606#(<= proc_i 388), 110609#(<= proc_i 400), 110608#(<= proc_i 396), 110611#(<= proc_i 408), 110610#(<= proc_i 404), 110613#(<= proc_i 416), 110612#(<= proc_i 412), 110615#(<= proc_i 424), 110614#(<= proc_i 420), 110617#(<= proc_i 432), 110616#(<= proc_i 428), 110619#(<= proc_i 440), 110618#(<= proc_i 436), 110621#(<= proc_i 448), 110620#(<= proc_i 444), 110623#(<= proc_i 456), 110622#(<= proc_i 452), 110625#(<= proc_i 464), 110624#(<= proc_i 460), 110627#(<= proc_i 472), 110626#(<= proc_i 468), 110629#(<= proc_i 480), 110628#(<= proc_i 476), 110631#(<= proc_i 488), 110630#(<= proc_i 484), 110633#(<= proc_i 496), 110632#(<= proc_i 492), 110635#(<= proc_i 504), 110634#(<= proc_i 500), 110637#(<= proc_i 512), 110636#(<= proc_i 508), 110639#(<= proc_i 520), 110638#(<= proc_i 516), 110641#(<= proc_i 528), 110640#(<= proc_i 524), 110643#(<= proc_i 536), 110642#(<= proc_i 532), 110645#(<= proc_i 544), 110644#(<= proc_i 540), 110647#(<= proc_i 552), 110646#(<= proc_i 548), 110649#(<= proc_i 560), 110648#(<= proc_i 556), 110651#(<= proc_i 568), 110650#(<= proc_i 564), 110653#(<= proc_i 576), 110652#(<= proc_i 572), 110655#(<= proc_i 584), 110654#(<= proc_i 580), 110657#(<= proc_i 592), 110656#(<= proc_i 588), 110659#(<= proc_i 600), 110658#(<= proc_i 596), 110661#(<= proc_i 608), 110660#(<= proc_i 604), 110663#(<= proc_i 616), 110662#(<= proc_i 612), 110507#true, 110509#(<= proc_i 0), 110508#false, 110511#(<= proc_i 8), 110510#(<= proc_i 4), 110513#(<= proc_i 16), 110512#(<= proc_i 12), 110515#(<= proc_i 24), 110514#(<= proc_i 20), 110517#(<= proc_i 32), 110516#(<= proc_i 28), 110519#(<= proc_i 40), 110518#(<= proc_i 36), 110521#(<= proc_i 48), 110520#(<= proc_i 44), 110523#(<= proc_i 56), 110522#(<= proc_i 52), 110525#(<= proc_i 64), 110524#(<= proc_i 60), 110527#(<= proc_i 72), 110526#(<= proc_i 68), 110529#(<= proc_i 80), 110528#(<= proc_i 76), 110531#(<= proc_i 88), 110530#(<= proc_i 84), 110533#(<= proc_i 96), 110532#(<= proc_i 92), 110535#(<= proc_i 104), 110534#(<= proc_i 100), 110537#(<= proc_i 112), 110536#(<= proc_i 108), 110539#(<= proc_i 120), 110538#(<= proc_i 116), 110541#(<= proc_i 128), 110540#(<= proc_i 124), 110543#(<= proc_i 136), 110542#(<= proc_i 132), 110545#(<= proc_i 144), 110544#(<= proc_i 140), 110547#(<= proc_i 152), 110546#(<= proc_i 148), 110549#(<= proc_i 160), 110548#(<= proc_i 156), 110551#(<= proc_i 168), 110550#(<= proc_i 164), 110553#(<= proc_i 176), 110552#(<= proc_i 172), 110555#(<= proc_i 184), 110554#(<= proc_i 180), 110557#(<= proc_i 192), 110556#(<= proc_i 188), 110559#(<= proc_i 200), 110558#(<= proc_i 196), 110561#(<= proc_i 208), 110560#(<= proc_i 204), 110563#(<= proc_i 216), 110562#(<= proc_i 212), 110565#(<= proc_i 224), 110564#(<= proc_i 220), 110567#(<= proc_i 232), 110566#(<= proc_i 228), 110569#(<= proc_i 240), 110568#(<= proc_i 236), 110571#(<= proc_i 248), 110570#(<= proc_i 244), 110573#(<= proc_i 256), 110572#(<= proc_i 252), 110575#(<= proc_i 264), 110574#(<= proc_i 260), 110577#(<= proc_i 272), 110576#(<= proc_i 268), 110579#(<= proc_i 280), 110578#(<= proc_i 276), 110581#(<= proc_i 288), 110580#(<= proc_i 284), 110583#(<= proc_i 296), 110582#(<= proc_i 292), 110585#(<= proc_i 304), 110584#(<= proc_i 300), 110587#(<= proc_i 312), 110586#(<= proc_i 308), 110589#(<= proc_i 320), 110588#(<= proc_i 316), 110591#(<= proc_i 328), 110590#(<= proc_i 324)] [2018-07-23 13:52:55,636 INFO L134 CoverageAnalysis]: Checked inductivity of 23870 backedges. 0 proven. 23870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:55,636 INFO L450 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-07-23 13:52:55,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-07-23 13:52:55,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-07-23 13:52:55,638 INFO L87 Difference]: Start difference. First operand 312 states and 312 transitions. Second operand 157 states. [2018-07-23 13:52:55,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:55,902 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-07-23 13:52:55,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-07-23 13:52:55,902 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 311 [2018-07-23 13:52:55,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:55,903 INFO L225 Difference]: With dead ends: 315 [2018-07-23 13:52:55,903 INFO L226 Difference]: Without dead ends: 314 [2018-07-23 13:52:55,904 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-07-23 13:52:55,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-07-23 13:52:55,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2018-07-23 13:52:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-07-23 13:52:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 314 transitions. [2018-07-23 13:52:55,909 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 314 transitions. Word has length 311 [2018-07-23 13:52:55,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:55,910 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 314 transitions. [2018-07-23 13:52:55,910 INFO L472 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-07-23 13:52:55,910 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 314 transitions. [2018-07-23 13:52:55,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-07-23 13:52:55,911 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:55,911 INFO L357 BasicCegarLoop]: trace histogram [156, 155, 1, 1] [2018-07-23 13:52:55,911 INFO L414 AbstractCegarLoop]: === Iteration 156 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:55,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1520171350, now seen corresponding path program 155 times [2018-07-23 13:52:55,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:56,631 INFO L134 CoverageAnalysis]: Checked inductivity of 24180 backedges. 0 proven. 24180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:56,631 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:56,631 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-07-23 13:52:56,631 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:56,632 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:52:56,632 INFO L185 omatonBuilderFactory]: Interpolants [111923#false, 111922#true, 111925#(<= proc_i 4), 111924#(<= proc_i 0), 111927#(<= proc_i 12), 111926#(<= proc_i 8), 111929#(<= proc_i 20), 111928#(<= proc_i 16), 111931#(<= proc_i 28), 111930#(<= proc_i 24), 111933#(<= proc_i 36), 111932#(<= proc_i 32), 111935#(<= proc_i 44), 111934#(<= proc_i 40), 111937#(<= proc_i 52), 111936#(<= proc_i 48), 111939#(<= proc_i 60), 111938#(<= proc_i 56), 111941#(<= proc_i 68), 111940#(<= proc_i 64), 111943#(<= proc_i 76), 111942#(<= proc_i 72), 111945#(<= proc_i 84), 111944#(<= proc_i 80), 111947#(<= proc_i 92), 111946#(<= proc_i 88), 111949#(<= proc_i 100), 111948#(<= proc_i 96), 111951#(<= proc_i 108), 111950#(<= proc_i 104), 111953#(<= proc_i 116), 111952#(<= proc_i 112), 111955#(<= proc_i 124), 111954#(<= proc_i 120), 111957#(<= proc_i 132), 111956#(<= proc_i 128), 111959#(<= proc_i 140), 111958#(<= proc_i 136), 111961#(<= proc_i 148), 111960#(<= proc_i 144), 111963#(<= proc_i 156), 111962#(<= proc_i 152), 111965#(<= proc_i 164), 111964#(<= proc_i 160), 111967#(<= proc_i 172), 111966#(<= proc_i 168), 111969#(<= proc_i 180), 111968#(<= proc_i 176), 111971#(<= proc_i 188), 111970#(<= proc_i 184), 111973#(<= proc_i 196), 111972#(<= proc_i 192), 111975#(<= proc_i 204), 111974#(<= proc_i 200), 111977#(<= proc_i 212), 111976#(<= proc_i 208), 111979#(<= proc_i 220), 111978#(<= proc_i 216), 111981#(<= proc_i 228), 111980#(<= proc_i 224), 111983#(<= proc_i 236), 111982#(<= proc_i 232), 111985#(<= proc_i 244), 111984#(<= proc_i 240), 111987#(<= proc_i 252), 111986#(<= proc_i 248), 111989#(<= proc_i 260), 111988#(<= proc_i 256), 111991#(<= proc_i 268), 111990#(<= proc_i 264), 111993#(<= proc_i 276), 111992#(<= proc_i 272), 111995#(<= proc_i 284), 111994#(<= proc_i 280), 111997#(<= proc_i 292), 111996#(<= proc_i 288), 111999#(<= proc_i 300), 111998#(<= proc_i 296), 112001#(<= proc_i 308), 112000#(<= proc_i 304), 112003#(<= proc_i 316), 112002#(<= proc_i 312), 112005#(<= proc_i 324), 112004#(<= proc_i 320), 112007#(<= proc_i 332), 112006#(<= proc_i 328), 112009#(<= proc_i 340), 112008#(<= proc_i 336), 112011#(<= proc_i 348), 112010#(<= proc_i 344), 112013#(<= proc_i 356), 112012#(<= proc_i 352), 112015#(<= proc_i 364), 112014#(<= proc_i 360), 112017#(<= proc_i 372), 112016#(<= proc_i 368), 112019#(<= proc_i 380), 112018#(<= proc_i 376), 112021#(<= proc_i 388), 112020#(<= proc_i 384), 112023#(<= proc_i 396), 112022#(<= proc_i 392), 112025#(<= proc_i 404), 112024#(<= proc_i 400), 112027#(<= proc_i 412), 112026#(<= proc_i 408), 112029#(<= proc_i 420), 112028#(<= proc_i 416), 112031#(<= proc_i 428), 112030#(<= proc_i 424), 112033#(<= proc_i 436), 112032#(<= proc_i 432), 112035#(<= proc_i 444), 112034#(<= proc_i 440), 112037#(<= proc_i 452), 112036#(<= proc_i 448), 112039#(<= proc_i 460), 112038#(<= proc_i 456), 112041#(<= proc_i 468), 112040#(<= proc_i 464), 112043#(<= proc_i 476), 112042#(<= proc_i 472), 112045#(<= proc_i 484), 112044#(<= proc_i 480), 112047#(<= proc_i 492), 112046#(<= proc_i 488), 112049#(<= proc_i 500), 112048#(<= proc_i 496), 112051#(<= proc_i 508), 112050#(<= proc_i 504), 112053#(<= proc_i 516), 112052#(<= proc_i 512), 112055#(<= proc_i 524), 112054#(<= proc_i 520), 112057#(<= proc_i 532), 112056#(<= proc_i 528), 112059#(<= proc_i 540), 112058#(<= proc_i 536), 112061#(<= proc_i 548), 112060#(<= proc_i 544), 112063#(<= proc_i 556), 112062#(<= proc_i 552), 112065#(<= proc_i 564), 112064#(<= proc_i 560), 112067#(<= proc_i 572), 112066#(<= proc_i 568), 112069#(<= proc_i 580), 112068#(<= proc_i 576), 112071#(<= proc_i 588), 112070#(<= proc_i 584), 112073#(<= proc_i 596), 112072#(<= proc_i 592), 112075#(<= proc_i 604), 112074#(<= proc_i 600), 112077#(<= proc_i 612), 112076#(<= proc_i 608), 112079#(<= proc_i 620), 112078#(<= proc_i 616)] [2018-07-23 13:52:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 24180 backedges. 0 proven. 24180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:56,633 INFO L450 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-07-23 13:52:56,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-07-23 13:52:56,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-07-23 13:52:56,636 INFO L87 Difference]: Start difference. First operand 314 states and 314 transitions. Second operand 158 states. [2018-07-23 13:52:57,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:57,348 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-07-23 13:52:57,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-07-23 13:52:57,348 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 313 [2018-07-23 13:52:57,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:57,349 INFO L225 Difference]: With dead ends: 317 [2018-07-23 13:52:57,349 INFO L226 Difference]: Without dead ends: 316 [2018-07-23 13:52:57,350 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-07-23 13:52:57,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-07-23 13:52:57,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2018-07-23 13:52:57,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-07-23 13:52:57,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2018-07-23 13:52:57,355 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 313 [2018-07-23 13:52:57,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:57,355 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2018-07-23 13:52:57,355 INFO L472 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-07-23 13:52:57,355 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2018-07-23 13:52:57,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-07-23 13:52:57,356 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:57,357 INFO L357 BasicCegarLoop]: trace histogram [157, 156, 1, 1] [2018-07-23 13:52:57,357 INFO L414 AbstractCegarLoop]: === Iteration 157 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:57,357 INFO L82 PathProgramCache]: Analyzing trace with hash 595787800, now seen corresponding path program 156 times [2018-07-23 13:52:57,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:58,239 INFO L134 CoverageAnalysis]: Checked inductivity of 24492 backedges. 0 proven. 24492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:58,240 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:58,240 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-07-23 13:52:58,240 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:58,240 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:52:58,240 INFO L185 omatonBuilderFactory]: Interpolants [113409#(<= proc_i 244), 113408#(<= proc_i 240), 113411#(<= proc_i 252), 113410#(<= proc_i 248), 113413#(<= proc_i 260), 113412#(<= proc_i 256), 113415#(<= proc_i 268), 113414#(<= proc_i 264), 113417#(<= proc_i 276), 113416#(<= proc_i 272), 113419#(<= proc_i 284), 113418#(<= proc_i 280), 113421#(<= proc_i 292), 113420#(<= proc_i 288), 113423#(<= proc_i 300), 113422#(<= proc_i 296), 113425#(<= proc_i 308), 113424#(<= proc_i 304), 113427#(<= proc_i 316), 113426#(<= proc_i 312), 113429#(<= proc_i 324), 113428#(<= proc_i 320), 113431#(<= proc_i 332), 113430#(<= proc_i 328), 113433#(<= proc_i 340), 113432#(<= proc_i 336), 113435#(<= proc_i 348), 113434#(<= proc_i 344), 113437#(<= proc_i 356), 113436#(<= proc_i 352), 113439#(<= proc_i 364), 113438#(<= proc_i 360), 113441#(<= proc_i 372), 113440#(<= proc_i 368), 113443#(<= proc_i 380), 113442#(<= proc_i 376), 113445#(<= proc_i 388), 113444#(<= proc_i 384), 113447#(<= proc_i 396), 113446#(<= proc_i 392), 113449#(<= proc_i 404), 113448#(<= proc_i 400), 113451#(<= proc_i 412), 113450#(<= proc_i 408), 113453#(<= proc_i 420), 113452#(<= proc_i 416), 113455#(<= proc_i 428), 113454#(<= proc_i 424), 113457#(<= proc_i 436), 113456#(<= proc_i 432), 113459#(<= proc_i 444), 113458#(<= proc_i 440), 113461#(<= proc_i 452), 113460#(<= proc_i 448), 113463#(<= proc_i 460), 113462#(<= proc_i 456), 113465#(<= proc_i 468), 113464#(<= proc_i 464), 113467#(<= proc_i 476), 113466#(<= proc_i 472), 113469#(<= proc_i 484), 113468#(<= proc_i 480), 113471#(<= proc_i 492), 113470#(<= proc_i 488), 113473#(<= proc_i 500), 113472#(<= proc_i 496), 113475#(<= proc_i 508), 113474#(<= proc_i 504), 113477#(<= proc_i 516), 113476#(<= proc_i 512), 113479#(<= proc_i 524), 113478#(<= proc_i 520), 113481#(<= proc_i 532), 113480#(<= proc_i 528), 113483#(<= proc_i 540), 113482#(<= proc_i 536), 113485#(<= proc_i 548), 113484#(<= proc_i 544), 113487#(<= proc_i 556), 113486#(<= proc_i 552), 113489#(<= proc_i 564), 113488#(<= proc_i 560), 113491#(<= proc_i 572), 113490#(<= proc_i 568), 113493#(<= proc_i 580), 113492#(<= proc_i 576), 113495#(<= proc_i 588), 113494#(<= proc_i 584), 113497#(<= proc_i 596), 113496#(<= proc_i 592), 113499#(<= proc_i 604), 113498#(<= proc_i 600), 113501#(<= proc_i 612), 113500#(<= proc_i 608), 113503#(<= proc_i 620), 113502#(<= proc_i 616), 113504#(<= proc_i 624), 113347#false, 113346#true, 113349#(<= proc_i 4), 113348#(<= proc_i 0), 113351#(<= proc_i 12), 113350#(<= proc_i 8), 113353#(<= proc_i 20), 113352#(<= proc_i 16), 113355#(<= proc_i 28), 113354#(<= proc_i 24), 113357#(<= proc_i 36), 113356#(<= proc_i 32), 113359#(<= proc_i 44), 113358#(<= proc_i 40), 113361#(<= proc_i 52), 113360#(<= proc_i 48), 113363#(<= proc_i 60), 113362#(<= proc_i 56), 113365#(<= proc_i 68), 113364#(<= proc_i 64), 113367#(<= proc_i 76), 113366#(<= proc_i 72), 113369#(<= proc_i 84), 113368#(<= proc_i 80), 113371#(<= proc_i 92), 113370#(<= proc_i 88), 113373#(<= proc_i 100), 113372#(<= proc_i 96), 113375#(<= proc_i 108), 113374#(<= proc_i 104), 113377#(<= proc_i 116), 113376#(<= proc_i 112), 113379#(<= proc_i 124), 113378#(<= proc_i 120), 113381#(<= proc_i 132), 113380#(<= proc_i 128), 113383#(<= proc_i 140), 113382#(<= proc_i 136), 113385#(<= proc_i 148), 113384#(<= proc_i 144), 113387#(<= proc_i 156), 113386#(<= proc_i 152), 113389#(<= proc_i 164), 113388#(<= proc_i 160), 113391#(<= proc_i 172), 113390#(<= proc_i 168), 113393#(<= proc_i 180), 113392#(<= proc_i 176), 113395#(<= proc_i 188), 113394#(<= proc_i 184), 113397#(<= proc_i 196), 113396#(<= proc_i 192), 113399#(<= proc_i 204), 113398#(<= proc_i 200), 113401#(<= proc_i 212), 113400#(<= proc_i 208), 113403#(<= proc_i 220), 113402#(<= proc_i 216), 113405#(<= proc_i 228), 113404#(<= proc_i 224), 113407#(<= proc_i 236), 113406#(<= proc_i 232)] [2018-07-23 13:52:58,242 INFO L134 CoverageAnalysis]: Checked inductivity of 24492 backedges. 0 proven. 24492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:58,242 INFO L450 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-07-23 13:52:58,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-07-23 13:52:58,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-07-23 13:52:58,245 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 159 states. [2018-07-23 13:52:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:52:58,685 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2018-07-23 13:52:58,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-07-23 13:52:58,685 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 315 [2018-07-23 13:52:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:52:58,686 INFO L225 Difference]: With dead ends: 319 [2018-07-23 13:52:58,686 INFO L226 Difference]: Without dead ends: 318 [2018-07-23 13:52:58,687 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-07-23 13:52:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-07-23 13:52:58,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-07-23 13:52:58,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-07-23 13:52:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 318 transitions. [2018-07-23 13:52:58,690 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 318 transitions. Word has length 315 [2018-07-23 13:52:58,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:52:58,690 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 318 transitions. [2018-07-23 13:52:58,690 INFO L472 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-07-23 13:52:58,690 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 318 transitions. [2018-07-23 13:52:58,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-07-23 13:52:58,691 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:52:58,691 INFO L357 BasicCegarLoop]: trace histogram [158, 157, 1, 1] [2018-07-23 13:52:58,691 INFO L414 AbstractCegarLoop]: === Iteration 158 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:52:58,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1321426522, now seen corresponding path program 157 times [2018-07-23 13:52:58,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:52:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:52:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 24806 backedges. 0 proven. 24806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:59,490 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:52:59,490 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-07-23 13:52:59,490 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:52:59,490 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:52:59,490 INFO L185 omatonBuilderFactory]: Interpolants [114779#true, 114781#(<= proc_i 0), 114780#false, 114783#(<= proc_i 8), 114782#(<= proc_i 4), 114785#(<= proc_i 16), 114784#(<= proc_i 12), 114787#(<= proc_i 24), 114786#(<= proc_i 20), 114789#(<= proc_i 32), 114788#(<= proc_i 28), 114791#(<= proc_i 40), 114790#(<= proc_i 36), 114793#(<= proc_i 48), 114792#(<= proc_i 44), 114795#(<= proc_i 56), 114794#(<= proc_i 52), 114797#(<= proc_i 64), 114796#(<= proc_i 60), 114799#(<= proc_i 72), 114798#(<= proc_i 68), 114801#(<= proc_i 80), 114800#(<= proc_i 76), 114803#(<= proc_i 88), 114802#(<= proc_i 84), 114805#(<= proc_i 96), 114804#(<= proc_i 92), 114807#(<= proc_i 104), 114806#(<= proc_i 100), 114809#(<= proc_i 112), 114808#(<= proc_i 108), 114811#(<= proc_i 120), 114810#(<= proc_i 116), 114813#(<= proc_i 128), 114812#(<= proc_i 124), 114815#(<= proc_i 136), 114814#(<= proc_i 132), 114817#(<= proc_i 144), 114816#(<= proc_i 140), 114819#(<= proc_i 152), 114818#(<= proc_i 148), 114821#(<= proc_i 160), 114820#(<= proc_i 156), 114823#(<= proc_i 168), 114822#(<= proc_i 164), 114825#(<= proc_i 176), 114824#(<= proc_i 172), 114827#(<= proc_i 184), 114826#(<= proc_i 180), 114829#(<= proc_i 192), 114828#(<= proc_i 188), 114831#(<= proc_i 200), 114830#(<= proc_i 196), 114833#(<= proc_i 208), 114832#(<= proc_i 204), 114835#(<= proc_i 216), 114834#(<= proc_i 212), 114837#(<= proc_i 224), 114836#(<= proc_i 220), 114839#(<= proc_i 232), 114838#(<= proc_i 228), 114841#(<= proc_i 240), 114840#(<= proc_i 236), 114843#(<= proc_i 248), 114842#(<= proc_i 244), 114845#(<= proc_i 256), 114844#(<= proc_i 252), 114847#(<= proc_i 264), 114846#(<= proc_i 260), 114849#(<= proc_i 272), 114848#(<= proc_i 268), 114851#(<= proc_i 280), 114850#(<= proc_i 276), 114853#(<= proc_i 288), 114852#(<= proc_i 284), 114855#(<= proc_i 296), 114854#(<= proc_i 292), 114857#(<= proc_i 304), 114856#(<= proc_i 300), 114859#(<= proc_i 312), 114858#(<= proc_i 308), 114861#(<= proc_i 320), 114860#(<= proc_i 316), 114863#(<= proc_i 328), 114862#(<= proc_i 324), 114865#(<= proc_i 336), 114864#(<= proc_i 332), 114867#(<= proc_i 344), 114866#(<= proc_i 340), 114869#(<= proc_i 352), 114868#(<= proc_i 348), 114871#(<= proc_i 360), 114870#(<= proc_i 356), 114873#(<= proc_i 368), 114872#(<= proc_i 364), 114875#(<= proc_i 376), 114874#(<= proc_i 372), 114877#(<= proc_i 384), 114876#(<= proc_i 380), 114879#(<= proc_i 392), 114878#(<= proc_i 388), 114881#(<= proc_i 400), 114880#(<= proc_i 396), 114883#(<= proc_i 408), 114882#(<= proc_i 404), 114885#(<= proc_i 416), 114884#(<= proc_i 412), 114887#(<= proc_i 424), 114886#(<= proc_i 420), 114889#(<= proc_i 432), 114888#(<= proc_i 428), 114891#(<= proc_i 440), 114890#(<= proc_i 436), 114893#(<= proc_i 448), 114892#(<= proc_i 444), 114895#(<= proc_i 456), 114894#(<= proc_i 452), 114897#(<= proc_i 464), 114896#(<= proc_i 460), 114899#(<= proc_i 472), 114898#(<= proc_i 468), 114901#(<= proc_i 480), 114900#(<= proc_i 476), 114903#(<= proc_i 488), 114902#(<= proc_i 484), 114905#(<= proc_i 496), 114904#(<= proc_i 492), 114907#(<= proc_i 504), 114906#(<= proc_i 500), 114909#(<= proc_i 512), 114908#(<= proc_i 508), 114911#(<= proc_i 520), 114910#(<= proc_i 516), 114913#(<= proc_i 528), 114912#(<= proc_i 524), 114915#(<= proc_i 536), 114914#(<= proc_i 532), 114917#(<= proc_i 544), 114916#(<= proc_i 540), 114919#(<= proc_i 552), 114918#(<= proc_i 548), 114921#(<= proc_i 560), 114920#(<= proc_i 556), 114923#(<= proc_i 568), 114922#(<= proc_i 564), 114925#(<= proc_i 576), 114924#(<= proc_i 572), 114927#(<= proc_i 584), 114926#(<= proc_i 580), 114929#(<= proc_i 592), 114928#(<= proc_i 588), 114931#(<= proc_i 600), 114930#(<= proc_i 596), 114933#(<= proc_i 608), 114932#(<= proc_i 604), 114935#(<= proc_i 616), 114934#(<= proc_i 612), 114937#(<= proc_i 624), 114936#(<= proc_i 620), 114938#(<= proc_i 628)] [2018-07-23 13:52:59,491 INFO L134 CoverageAnalysis]: Checked inductivity of 24806 backedges. 0 proven. 24806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:52:59,491 INFO L450 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-07-23 13:52:59,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-07-23 13:52:59,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-07-23 13:52:59,493 INFO L87 Difference]: Start difference. First operand 318 states and 318 transitions. Second operand 160 states. [2018-07-23 13:53:00,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:00,206 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2018-07-23 13:53:00,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-07-23 13:53:00,207 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 317 [2018-07-23 13:53:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:00,207 INFO L225 Difference]: With dead ends: 321 [2018-07-23 13:53:00,207 INFO L226 Difference]: Without dead ends: 320 [2018-07-23 13:53:00,208 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-07-23 13:53:00,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-07-23 13:53:00,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-07-23 13:53:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-07-23 13:53:00,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 320 transitions. [2018-07-23 13:53:00,211 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 320 transitions. Word has length 317 [2018-07-23 13:53:00,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:00,211 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 320 transitions. [2018-07-23 13:53:00,211 INFO L472 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-07-23 13:53:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 320 transitions. [2018-07-23 13:53:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-07-23 13:53:00,212 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:00,212 INFO L357 BasicCegarLoop]: trace histogram [159, 158, 1, 1] [2018-07-23 13:53:00,212 INFO L414 AbstractCegarLoop]: === Iteration 159 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:00,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1419430884, now seen corresponding path program 158 times [2018-07-23 13:53:00,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 25122 backedges. 0 proven. 25122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:01,058 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:01,058 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-07-23 13:53:01,059 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:01,059 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:53:01,059 INFO L185 omatonBuilderFactory]: Interpolants [116225#(<= proc_i 8), 116224#(<= proc_i 4), 116227#(<= proc_i 16), 116226#(<= proc_i 12), 116229#(<= proc_i 24), 116228#(<= proc_i 20), 116231#(<= proc_i 32), 116230#(<= proc_i 28), 116233#(<= proc_i 40), 116232#(<= proc_i 36), 116235#(<= proc_i 48), 116234#(<= proc_i 44), 116237#(<= proc_i 56), 116236#(<= proc_i 52), 116239#(<= proc_i 64), 116238#(<= proc_i 60), 116241#(<= proc_i 72), 116240#(<= proc_i 68), 116243#(<= proc_i 80), 116242#(<= proc_i 76), 116245#(<= proc_i 88), 116244#(<= proc_i 84), 116247#(<= proc_i 96), 116246#(<= proc_i 92), 116249#(<= proc_i 104), 116248#(<= proc_i 100), 116251#(<= proc_i 112), 116250#(<= proc_i 108), 116253#(<= proc_i 120), 116252#(<= proc_i 116), 116255#(<= proc_i 128), 116254#(<= proc_i 124), 116257#(<= proc_i 136), 116256#(<= proc_i 132), 116259#(<= proc_i 144), 116258#(<= proc_i 140), 116261#(<= proc_i 152), 116260#(<= proc_i 148), 116263#(<= proc_i 160), 116262#(<= proc_i 156), 116265#(<= proc_i 168), 116264#(<= proc_i 164), 116267#(<= proc_i 176), 116266#(<= proc_i 172), 116269#(<= proc_i 184), 116268#(<= proc_i 180), 116271#(<= proc_i 192), 116270#(<= proc_i 188), 116273#(<= proc_i 200), 116272#(<= proc_i 196), 116275#(<= proc_i 208), 116274#(<= proc_i 204), 116277#(<= proc_i 216), 116276#(<= proc_i 212), 116279#(<= proc_i 224), 116278#(<= proc_i 220), 116281#(<= proc_i 232), 116280#(<= proc_i 228), 116283#(<= proc_i 240), 116282#(<= proc_i 236), 116285#(<= proc_i 248), 116284#(<= proc_i 244), 116287#(<= proc_i 256), 116286#(<= proc_i 252), 116289#(<= proc_i 264), 116288#(<= proc_i 260), 116291#(<= proc_i 272), 116290#(<= proc_i 268), 116293#(<= proc_i 280), 116292#(<= proc_i 276), 116295#(<= proc_i 288), 116294#(<= proc_i 284), 116297#(<= proc_i 296), 116296#(<= proc_i 292), 116299#(<= proc_i 304), 116298#(<= proc_i 300), 116301#(<= proc_i 312), 116300#(<= proc_i 308), 116303#(<= proc_i 320), 116302#(<= proc_i 316), 116305#(<= proc_i 328), 116304#(<= proc_i 324), 116307#(<= proc_i 336), 116306#(<= proc_i 332), 116309#(<= proc_i 344), 116308#(<= proc_i 340), 116311#(<= proc_i 352), 116310#(<= proc_i 348), 116313#(<= proc_i 360), 116312#(<= proc_i 356), 116315#(<= proc_i 368), 116314#(<= proc_i 364), 116317#(<= proc_i 376), 116316#(<= proc_i 372), 116319#(<= proc_i 384), 116318#(<= proc_i 380), 116321#(<= proc_i 392), 116320#(<= proc_i 388), 116323#(<= proc_i 400), 116322#(<= proc_i 396), 116325#(<= proc_i 408), 116324#(<= proc_i 404), 116327#(<= proc_i 416), 116326#(<= proc_i 412), 116329#(<= proc_i 424), 116328#(<= proc_i 420), 116331#(<= proc_i 432), 116330#(<= proc_i 428), 116333#(<= proc_i 440), 116332#(<= proc_i 436), 116335#(<= proc_i 448), 116334#(<= proc_i 444), 116337#(<= proc_i 456), 116336#(<= proc_i 452), 116339#(<= proc_i 464), 116338#(<= proc_i 460), 116341#(<= proc_i 472), 116340#(<= proc_i 468), 116343#(<= proc_i 480), 116342#(<= proc_i 476), 116345#(<= proc_i 488), 116344#(<= proc_i 484), 116347#(<= proc_i 496), 116346#(<= proc_i 492), 116349#(<= proc_i 504), 116348#(<= proc_i 500), 116351#(<= proc_i 512), 116350#(<= proc_i 508), 116353#(<= proc_i 520), 116352#(<= proc_i 516), 116355#(<= proc_i 528), 116354#(<= proc_i 524), 116357#(<= proc_i 536), 116356#(<= proc_i 532), 116359#(<= proc_i 544), 116358#(<= proc_i 540), 116361#(<= proc_i 552), 116360#(<= proc_i 548), 116363#(<= proc_i 560), 116362#(<= proc_i 556), 116365#(<= proc_i 568), 116364#(<= proc_i 564), 116367#(<= proc_i 576), 116366#(<= proc_i 572), 116369#(<= proc_i 584), 116368#(<= proc_i 580), 116371#(<= proc_i 592), 116370#(<= proc_i 588), 116373#(<= proc_i 600), 116372#(<= proc_i 596), 116375#(<= proc_i 608), 116374#(<= proc_i 604), 116377#(<= proc_i 616), 116376#(<= proc_i 612), 116379#(<= proc_i 624), 116378#(<= proc_i 620), 116381#(<= proc_i 632), 116380#(<= proc_i 628), 116221#true, 116223#(<= proc_i 0), 116222#false] [2018-07-23 13:53:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 25122 backedges. 0 proven. 25122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:01,061 INFO L450 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-07-23 13:53:01,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-07-23 13:53:01,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-07-23 13:53:01,065 INFO L87 Difference]: Start difference. First operand 320 states and 320 transitions. Second operand 161 states. [2018-07-23 13:53:02,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:02,154 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-07-23 13:53:02,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-07-23 13:53:02,154 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 319 [2018-07-23 13:53:02,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:02,155 INFO L225 Difference]: With dead ends: 323 [2018-07-23 13:53:02,155 INFO L226 Difference]: Without dead ends: 322 [2018-07-23 13:53:02,156 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-07-23 13:53:02,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-07-23 13:53:02,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2018-07-23 13:53:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-07-23 13:53:02,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 322 transitions. [2018-07-23 13:53:02,160 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 322 transitions. Word has length 319 [2018-07-23 13:53:02,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:02,160 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 322 transitions. [2018-07-23 13:53:02,160 INFO L472 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-07-23 13:53:02,160 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 322 transitions. [2018-07-23 13:53:02,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-07-23 13:53:02,161 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:02,161 INFO L357 BasicCegarLoop]: trace histogram [160, 159, 1, 1] [2018-07-23 13:53:02,162 INFO L414 AbstractCegarLoop]: === Iteration 160 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:02,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1726521694, now seen corresponding path program 159 times [2018-07-23 13:53:02,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:03,082 INFO L134 CoverageAnalysis]: Checked inductivity of 25440 backedges. 0 proven. 25440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:03,083 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:03,083 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-07-23 13:53:03,083 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:03,083 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:53:03,084 INFO L185 omatonBuilderFactory]: Interpolants [117761#(<= proc_i 348), 117760#(<= proc_i 344), 117763#(<= proc_i 356), 117762#(<= proc_i 352), 117765#(<= proc_i 364), 117764#(<= proc_i 360), 117767#(<= proc_i 372), 117766#(<= proc_i 368), 117769#(<= proc_i 380), 117768#(<= proc_i 376), 117771#(<= proc_i 388), 117770#(<= proc_i 384), 117773#(<= proc_i 396), 117772#(<= proc_i 392), 117775#(<= proc_i 404), 117774#(<= proc_i 400), 117777#(<= proc_i 412), 117776#(<= proc_i 408), 117779#(<= proc_i 420), 117778#(<= proc_i 416), 117781#(<= proc_i 428), 117780#(<= proc_i 424), 117783#(<= proc_i 436), 117782#(<= proc_i 432), 117785#(<= proc_i 444), 117784#(<= proc_i 440), 117787#(<= proc_i 452), 117786#(<= proc_i 448), 117789#(<= proc_i 460), 117788#(<= proc_i 456), 117791#(<= proc_i 468), 117790#(<= proc_i 464), 117793#(<= proc_i 476), 117792#(<= proc_i 472), 117795#(<= proc_i 484), 117794#(<= proc_i 480), 117797#(<= proc_i 492), 117796#(<= proc_i 488), 117799#(<= proc_i 500), 117798#(<= proc_i 496), 117801#(<= proc_i 508), 117800#(<= proc_i 504), 117803#(<= proc_i 516), 117802#(<= proc_i 512), 117805#(<= proc_i 524), 117804#(<= proc_i 520), 117807#(<= proc_i 532), 117806#(<= proc_i 528), 117809#(<= proc_i 540), 117808#(<= proc_i 536), 117811#(<= proc_i 548), 117810#(<= proc_i 544), 117813#(<= proc_i 556), 117812#(<= proc_i 552), 117815#(<= proc_i 564), 117814#(<= proc_i 560), 117817#(<= proc_i 572), 117816#(<= proc_i 568), 117819#(<= proc_i 580), 117818#(<= proc_i 576), 117821#(<= proc_i 588), 117820#(<= proc_i 584), 117823#(<= proc_i 596), 117822#(<= proc_i 592), 117825#(<= proc_i 604), 117824#(<= proc_i 600), 117827#(<= proc_i 612), 117826#(<= proc_i 608), 117829#(<= proc_i 620), 117828#(<= proc_i 616), 117831#(<= proc_i 628), 117830#(<= proc_i 624), 117833#(<= proc_i 636), 117832#(<= proc_i 632), 117673#false, 117672#true, 117675#(<= proc_i 4), 117674#(<= proc_i 0), 117677#(<= proc_i 12), 117676#(<= proc_i 8), 117679#(<= proc_i 20), 117678#(<= proc_i 16), 117681#(<= proc_i 28), 117680#(<= proc_i 24), 117683#(<= proc_i 36), 117682#(<= proc_i 32), 117685#(<= proc_i 44), 117684#(<= proc_i 40), 117687#(<= proc_i 52), 117686#(<= proc_i 48), 117689#(<= proc_i 60), 117688#(<= proc_i 56), 117691#(<= proc_i 68), 117690#(<= proc_i 64), 117693#(<= proc_i 76), 117692#(<= proc_i 72), 117695#(<= proc_i 84), 117694#(<= proc_i 80), 117697#(<= proc_i 92), 117696#(<= proc_i 88), 117699#(<= proc_i 100), 117698#(<= proc_i 96), 117701#(<= proc_i 108), 117700#(<= proc_i 104), 117703#(<= proc_i 116), 117702#(<= proc_i 112), 117705#(<= proc_i 124), 117704#(<= proc_i 120), 117707#(<= proc_i 132), 117706#(<= proc_i 128), 117709#(<= proc_i 140), 117708#(<= proc_i 136), 117711#(<= proc_i 148), 117710#(<= proc_i 144), 117713#(<= proc_i 156), 117712#(<= proc_i 152), 117715#(<= proc_i 164), 117714#(<= proc_i 160), 117717#(<= proc_i 172), 117716#(<= proc_i 168), 117719#(<= proc_i 180), 117718#(<= proc_i 176), 117721#(<= proc_i 188), 117720#(<= proc_i 184), 117723#(<= proc_i 196), 117722#(<= proc_i 192), 117725#(<= proc_i 204), 117724#(<= proc_i 200), 117727#(<= proc_i 212), 117726#(<= proc_i 208), 117729#(<= proc_i 220), 117728#(<= proc_i 216), 117731#(<= proc_i 228), 117730#(<= proc_i 224), 117733#(<= proc_i 236), 117732#(<= proc_i 232), 117735#(<= proc_i 244), 117734#(<= proc_i 240), 117737#(<= proc_i 252), 117736#(<= proc_i 248), 117739#(<= proc_i 260), 117738#(<= proc_i 256), 117741#(<= proc_i 268), 117740#(<= proc_i 264), 117743#(<= proc_i 276), 117742#(<= proc_i 272), 117745#(<= proc_i 284), 117744#(<= proc_i 280), 117747#(<= proc_i 292), 117746#(<= proc_i 288), 117749#(<= proc_i 300), 117748#(<= proc_i 296), 117751#(<= proc_i 308), 117750#(<= proc_i 304), 117753#(<= proc_i 316), 117752#(<= proc_i 312), 117755#(<= proc_i 324), 117754#(<= proc_i 320), 117757#(<= proc_i 332), 117756#(<= proc_i 328), 117759#(<= proc_i 340), 117758#(<= proc_i 336)] [2018-07-23 13:53:03,085 INFO L134 CoverageAnalysis]: Checked inductivity of 25440 backedges. 0 proven. 25440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:03,085 INFO L450 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-07-23 13:53:03,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-07-23 13:53:03,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-07-23 13:53:03,088 INFO L87 Difference]: Start difference. First operand 322 states and 322 transitions. Second operand 162 states. [2018-07-23 13:53:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:03,411 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-07-23 13:53:03,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-07-23 13:53:03,411 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 321 [2018-07-23 13:53:03,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:03,412 INFO L225 Difference]: With dead ends: 325 [2018-07-23 13:53:03,412 INFO L226 Difference]: Without dead ends: 324 [2018-07-23 13:53:03,413 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-07-23 13:53:03,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-07-23 13:53:03,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2018-07-23 13:53:03,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-07-23 13:53:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 324 transitions. [2018-07-23 13:53:03,417 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 324 transitions. Word has length 321 [2018-07-23 13:53:03,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:03,417 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 324 transitions. [2018-07-23 13:53:03,417 INFO L472 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-07-23 13:53:03,417 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 324 transitions. [2018-07-23 13:53:03,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-07-23 13:53:03,418 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:03,418 INFO L357 BasicCegarLoop]: trace histogram [161, 160, 1, 1] [2018-07-23 13:53:03,418 INFO L414 AbstractCegarLoop]: === Iteration 161 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:03,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1329972768, now seen corresponding path program 160 times [2018-07-23 13:53:03,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 25760 backedges. 0 proven. 25760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:04,385 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:04,386 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-07-23 13:53:04,386 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:04,386 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:53:04,386 INFO L185 omatonBuilderFactory]: Interpolants [119133#false, 119132#true, 119135#(<= proc_i 4), 119134#(<= proc_i 0), 119137#(<= proc_i 12), 119136#(<= proc_i 8), 119139#(<= proc_i 20), 119138#(<= proc_i 16), 119141#(<= proc_i 28), 119140#(<= proc_i 24), 119143#(<= proc_i 36), 119142#(<= proc_i 32), 119145#(<= proc_i 44), 119144#(<= proc_i 40), 119147#(<= proc_i 52), 119146#(<= proc_i 48), 119149#(<= proc_i 60), 119148#(<= proc_i 56), 119151#(<= proc_i 68), 119150#(<= proc_i 64), 119153#(<= proc_i 76), 119152#(<= proc_i 72), 119155#(<= proc_i 84), 119154#(<= proc_i 80), 119157#(<= proc_i 92), 119156#(<= proc_i 88), 119159#(<= proc_i 100), 119158#(<= proc_i 96), 119161#(<= proc_i 108), 119160#(<= proc_i 104), 119163#(<= proc_i 116), 119162#(<= proc_i 112), 119165#(<= proc_i 124), 119164#(<= proc_i 120), 119167#(<= proc_i 132), 119166#(<= proc_i 128), 119169#(<= proc_i 140), 119168#(<= proc_i 136), 119171#(<= proc_i 148), 119170#(<= proc_i 144), 119173#(<= proc_i 156), 119172#(<= proc_i 152), 119175#(<= proc_i 164), 119174#(<= proc_i 160), 119177#(<= proc_i 172), 119176#(<= proc_i 168), 119179#(<= proc_i 180), 119178#(<= proc_i 176), 119181#(<= proc_i 188), 119180#(<= proc_i 184), 119183#(<= proc_i 196), 119182#(<= proc_i 192), 119185#(<= proc_i 204), 119184#(<= proc_i 200), 119187#(<= proc_i 212), 119186#(<= proc_i 208), 119189#(<= proc_i 220), 119188#(<= proc_i 216), 119191#(<= proc_i 228), 119190#(<= proc_i 224), 119193#(<= proc_i 236), 119192#(<= proc_i 232), 119195#(<= proc_i 244), 119194#(<= proc_i 240), 119197#(<= proc_i 252), 119196#(<= proc_i 248), 119199#(<= proc_i 260), 119198#(<= proc_i 256), 119201#(<= proc_i 268), 119200#(<= proc_i 264), 119203#(<= proc_i 276), 119202#(<= proc_i 272), 119205#(<= proc_i 284), 119204#(<= proc_i 280), 119207#(<= proc_i 292), 119206#(<= proc_i 288), 119209#(<= proc_i 300), 119208#(<= proc_i 296), 119211#(<= proc_i 308), 119210#(<= proc_i 304), 119213#(<= proc_i 316), 119212#(<= proc_i 312), 119215#(<= proc_i 324), 119214#(<= proc_i 320), 119217#(<= proc_i 332), 119216#(<= proc_i 328), 119219#(<= proc_i 340), 119218#(<= proc_i 336), 119221#(<= proc_i 348), 119220#(<= proc_i 344), 119223#(<= proc_i 356), 119222#(<= proc_i 352), 119225#(<= proc_i 364), 119224#(<= proc_i 360), 119227#(<= proc_i 372), 119226#(<= proc_i 368), 119229#(<= proc_i 380), 119228#(<= proc_i 376), 119231#(<= proc_i 388), 119230#(<= proc_i 384), 119233#(<= proc_i 396), 119232#(<= proc_i 392), 119235#(<= proc_i 404), 119234#(<= proc_i 400), 119237#(<= proc_i 412), 119236#(<= proc_i 408), 119239#(<= proc_i 420), 119238#(<= proc_i 416), 119241#(<= proc_i 428), 119240#(<= proc_i 424), 119243#(<= proc_i 436), 119242#(<= proc_i 432), 119245#(<= proc_i 444), 119244#(<= proc_i 440), 119247#(<= proc_i 452), 119246#(<= proc_i 448), 119249#(<= proc_i 460), 119248#(<= proc_i 456), 119251#(<= proc_i 468), 119250#(<= proc_i 464), 119253#(<= proc_i 476), 119252#(<= proc_i 472), 119255#(<= proc_i 484), 119254#(<= proc_i 480), 119257#(<= proc_i 492), 119256#(<= proc_i 488), 119259#(<= proc_i 500), 119258#(<= proc_i 496), 119261#(<= proc_i 508), 119260#(<= proc_i 504), 119263#(<= proc_i 516), 119262#(<= proc_i 512), 119265#(<= proc_i 524), 119264#(<= proc_i 520), 119267#(<= proc_i 532), 119266#(<= proc_i 528), 119269#(<= proc_i 540), 119268#(<= proc_i 536), 119271#(<= proc_i 548), 119270#(<= proc_i 544), 119273#(<= proc_i 556), 119272#(<= proc_i 552), 119275#(<= proc_i 564), 119274#(<= proc_i 560), 119277#(<= proc_i 572), 119276#(<= proc_i 568), 119279#(<= proc_i 580), 119278#(<= proc_i 576), 119281#(<= proc_i 588), 119280#(<= proc_i 584), 119283#(<= proc_i 596), 119282#(<= proc_i 592), 119285#(<= proc_i 604), 119284#(<= proc_i 600), 119287#(<= proc_i 612), 119286#(<= proc_i 608), 119289#(<= proc_i 620), 119288#(<= proc_i 616), 119291#(<= proc_i 628), 119290#(<= proc_i 624), 119293#(<= proc_i 636), 119292#(<= proc_i 632), 119294#(<= proc_i 640)] [2018-07-23 13:53:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 25760 backedges. 0 proven. 25760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:04,387 INFO L450 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-07-23 13:53:04,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-07-23 13:53:04,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-07-23 13:53:04,389 INFO L87 Difference]: Start difference. First operand 324 states and 324 transitions. Second operand 163 states. [2018-07-23 13:53:05,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:05,223 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2018-07-23 13:53:05,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-07-23 13:53:05,224 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 323 [2018-07-23 13:53:05,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:05,224 INFO L225 Difference]: With dead ends: 327 [2018-07-23 13:53:05,224 INFO L226 Difference]: Without dead ends: 326 [2018-07-23 13:53:05,225 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-07-23 13:53:05,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-07-23 13:53:05,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2018-07-23 13:53:05,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-07-23 13:53:05,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2018-07-23 13:53:05,229 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 323 [2018-07-23 13:53:05,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:05,229 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2018-07-23 13:53:05,229 INFO L472 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-07-23 13:53:05,230 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2018-07-23 13:53:05,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-07-23 13:53:05,230 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:05,231 INFO L357 BasicCegarLoop]: trace histogram [162, 161, 1, 1] [2018-07-23 13:53:05,231 INFO L414 AbstractCegarLoop]: === Iteration 162 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:05,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1796423070, now seen corresponding path program 161 times [2018-07-23 13:53:05,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:06,147 INFO L134 CoverageAnalysis]: Checked inductivity of 26082 backedges. 0 proven. 26082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:06,147 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:06,147 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-07-23 13:53:06,148 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:06,148 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:53:06,148 INFO L185 omatonBuilderFactory]: Interpolants [120601#true, 120603#(<= proc_i 0), 120602#false, 120605#(<= proc_i 8), 120604#(<= proc_i 4), 120607#(<= proc_i 16), 120606#(<= proc_i 12), 120609#(<= proc_i 24), 120608#(<= proc_i 20), 120611#(<= proc_i 32), 120610#(<= proc_i 28), 120613#(<= proc_i 40), 120612#(<= proc_i 36), 120615#(<= proc_i 48), 120614#(<= proc_i 44), 120617#(<= proc_i 56), 120616#(<= proc_i 52), 120619#(<= proc_i 64), 120618#(<= proc_i 60), 120621#(<= proc_i 72), 120620#(<= proc_i 68), 120623#(<= proc_i 80), 120622#(<= proc_i 76), 120625#(<= proc_i 88), 120624#(<= proc_i 84), 120627#(<= proc_i 96), 120626#(<= proc_i 92), 120629#(<= proc_i 104), 120628#(<= proc_i 100), 120631#(<= proc_i 112), 120630#(<= proc_i 108), 120633#(<= proc_i 120), 120632#(<= proc_i 116), 120635#(<= proc_i 128), 120634#(<= proc_i 124), 120637#(<= proc_i 136), 120636#(<= proc_i 132), 120639#(<= proc_i 144), 120638#(<= proc_i 140), 120641#(<= proc_i 152), 120640#(<= proc_i 148), 120643#(<= proc_i 160), 120642#(<= proc_i 156), 120645#(<= proc_i 168), 120644#(<= proc_i 164), 120647#(<= proc_i 176), 120646#(<= proc_i 172), 120649#(<= proc_i 184), 120648#(<= proc_i 180), 120651#(<= proc_i 192), 120650#(<= proc_i 188), 120653#(<= proc_i 200), 120652#(<= proc_i 196), 120655#(<= proc_i 208), 120654#(<= proc_i 204), 120657#(<= proc_i 216), 120656#(<= proc_i 212), 120659#(<= proc_i 224), 120658#(<= proc_i 220), 120661#(<= proc_i 232), 120660#(<= proc_i 228), 120663#(<= proc_i 240), 120662#(<= proc_i 236), 120665#(<= proc_i 248), 120664#(<= proc_i 244), 120667#(<= proc_i 256), 120666#(<= proc_i 252), 120669#(<= proc_i 264), 120668#(<= proc_i 260), 120671#(<= proc_i 272), 120670#(<= proc_i 268), 120673#(<= proc_i 280), 120672#(<= proc_i 276), 120675#(<= proc_i 288), 120674#(<= proc_i 284), 120677#(<= proc_i 296), 120676#(<= proc_i 292), 120679#(<= proc_i 304), 120678#(<= proc_i 300), 120681#(<= proc_i 312), 120680#(<= proc_i 308), 120683#(<= proc_i 320), 120682#(<= proc_i 316), 120685#(<= proc_i 328), 120684#(<= proc_i 324), 120687#(<= proc_i 336), 120686#(<= proc_i 332), 120689#(<= proc_i 344), 120688#(<= proc_i 340), 120691#(<= proc_i 352), 120690#(<= proc_i 348), 120693#(<= proc_i 360), 120692#(<= proc_i 356), 120695#(<= proc_i 368), 120694#(<= proc_i 364), 120697#(<= proc_i 376), 120696#(<= proc_i 372), 120699#(<= proc_i 384), 120698#(<= proc_i 380), 120701#(<= proc_i 392), 120700#(<= proc_i 388), 120703#(<= proc_i 400), 120702#(<= proc_i 396), 120705#(<= proc_i 408), 120704#(<= proc_i 404), 120707#(<= proc_i 416), 120706#(<= proc_i 412), 120709#(<= proc_i 424), 120708#(<= proc_i 420), 120711#(<= proc_i 432), 120710#(<= proc_i 428), 120713#(<= proc_i 440), 120712#(<= proc_i 436), 120715#(<= proc_i 448), 120714#(<= proc_i 444), 120717#(<= proc_i 456), 120716#(<= proc_i 452), 120719#(<= proc_i 464), 120718#(<= proc_i 460), 120721#(<= proc_i 472), 120720#(<= proc_i 468), 120723#(<= proc_i 480), 120722#(<= proc_i 476), 120725#(<= proc_i 488), 120724#(<= proc_i 484), 120727#(<= proc_i 496), 120726#(<= proc_i 492), 120729#(<= proc_i 504), 120728#(<= proc_i 500), 120731#(<= proc_i 512), 120730#(<= proc_i 508), 120733#(<= proc_i 520), 120732#(<= proc_i 516), 120735#(<= proc_i 528), 120734#(<= proc_i 524), 120737#(<= proc_i 536), 120736#(<= proc_i 532), 120739#(<= proc_i 544), 120738#(<= proc_i 540), 120741#(<= proc_i 552), 120740#(<= proc_i 548), 120743#(<= proc_i 560), 120742#(<= proc_i 556), 120745#(<= proc_i 568), 120744#(<= proc_i 564), 120747#(<= proc_i 576), 120746#(<= proc_i 572), 120749#(<= proc_i 584), 120748#(<= proc_i 580), 120751#(<= proc_i 592), 120750#(<= proc_i 588), 120753#(<= proc_i 600), 120752#(<= proc_i 596), 120755#(<= proc_i 608), 120754#(<= proc_i 604), 120757#(<= proc_i 616), 120756#(<= proc_i 612), 120759#(<= proc_i 624), 120758#(<= proc_i 620), 120761#(<= proc_i 632), 120760#(<= proc_i 628), 120763#(<= proc_i 640), 120762#(<= proc_i 636), 120764#(<= proc_i 644)] [2018-07-23 13:53:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 26082 backedges. 0 proven. 26082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:06,150 INFO L450 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-07-23 13:53:06,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-07-23 13:53:06,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-07-23 13:53:06,153 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 164 states. [2018-07-23 13:53:07,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:07,381 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2018-07-23 13:53:07,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-07-23 13:53:07,381 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 325 [2018-07-23 13:53:07,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:07,382 INFO L225 Difference]: With dead ends: 329 [2018-07-23 13:53:07,382 INFO L226 Difference]: Without dead ends: 328 [2018-07-23 13:53:07,384 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-07-23 13:53:07,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-07-23 13:53:07,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-07-23 13:53:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-07-23 13:53:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 328 transitions. [2018-07-23 13:53:07,387 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 328 transitions. Word has length 325 [2018-07-23 13:53:07,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:07,387 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 328 transitions. [2018-07-23 13:53:07,388 INFO L472 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-07-23 13:53:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 328 transitions. [2018-07-23 13:53:07,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-07-23 13:53:07,389 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:07,389 INFO L357 BasicCegarLoop]: trace histogram [163, 162, 1, 1] [2018-07-23 13:53:07,389 INFO L414 AbstractCegarLoop]: === Iteration 163 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:07,389 INFO L82 PathProgramCache]: Analyzing trace with hash 214283812, now seen corresponding path program 162 times [2018-07-23 13:53:07,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:08,373 INFO L134 CoverageAnalysis]: Checked inductivity of 26406 backedges. 0 proven. 26406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:08,374 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:08,374 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-07-23 13:53:08,374 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:08,374 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:53:08,375 INFO L185 omatonBuilderFactory]: Interpolants [122113#(<= proc_i 128), 122112#(<= proc_i 124), 122115#(<= proc_i 136), 122114#(<= proc_i 132), 122117#(<= proc_i 144), 122116#(<= proc_i 140), 122119#(<= proc_i 152), 122118#(<= proc_i 148), 122121#(<= proc_i 160), 122120#(<= proc_i 156), 122123#(<= proc_i 168), 122122#(<= proc_i 164), 122125#(<= proc_i 176), 122124#(<= proc_i 172), 122127#(<= proc_i 184), 122126#(<= proc_i 180), 122129#(<= proc_i 192), 122128#(<= proc_i 188), 122131#(<= proc_i 200), 122130#(<= proc_i 196), 122133#(<= proc_i 208), 122132#(<= proc_i 204), 122135#(<= proc_i 216), 122134#(<= proc_i 212), 122137#(<= proc_i 224), 122136#(<= proc_i 220), 122139#(<= proc_i 232), 122138#(<= proc_i 228), 122141#(<= proc_i 240), 122140#(<= proc_i 236), 122143#(<= proc_i 248), 122142#(<= proc_i 244), 122145#(<= proc_i 256), 122144#(<= proc_i 252), 122147#(<= proc_i 264), 122146#(<= proc_i 260), 122149#(<= proc_i 272), 122148#(<= proc_i 268), 122151#(<= proc_i 280), 122150#(<= proc_i 276), 122153#(<= proc_i 288), 122152#(<= proc_i 284), 122155#(<= proc_i 296), 122154#(<= proc_i 292), 122157#(<= proc_i 304), 122156#(<= proc_i 300), 122159#(<= proc_i 312), 122158#(<= proc_i 308), 122161#(<= proc_i 320), 122160#(<= proc_i 316), 122163#(<= proc_i 328), 122162#(<= proc_i 324), 122165#(<= proc_i 336), 122164#(<= proc_i 332), 122167#(<= proc_i 344), 122166#(<= proc_i 340), 122169#(<= proc_i 352), 122168#(<= proc_i 348), 122171#(<= proc_i 360), 122170#(<= proc_i 356), 122173#(<= proc_i 368), 122172#(<= proc_i 364), 122175#(<= proc_i 376), 122174#(<= proc_i 372), 122177#(<= proc_i 384), 122176#(<= proc_i 380), 122179#(<= proc_i 392), 122178#(<= proc_i 388), 122181#(<= proc_i 400), 122180#(<= proc_i 396), 122183#(<= proc_i 408), 122182#(<= proc_i 404), 122185#(<= proc_i 416), 122184#(<= proc_i 412), 122187#(<= proc_i 424), 122186#(<= proc_i 420), 122189#(<= proc_i 432), 122188#(<= proc_i 428), 122191#(<= proc_i 440), 122190#(<= proc_i 436), 122193#(<= proc_i 448), 122192#(<= proc_i 444), 122195#(<= proc_i 456), 122194#(<= proc_i 452), 122197#(<= proc_i 464), 122196#(<= proc_i 460), 122199#(<= proc_i 472), 122198#(<= proc_i 468), 122201#(<= proc_i 480), 122200#(<= proc_i 476), 122203#(<= proc_i 488), 122202#(<= proc_i 484), 122205#(<= proc_i 496), 122204#(<= proc_i 492), 122207#(<= proc_i 504), 122206#(<= proc_i 500), 122209#(<= proc_i 512), 122208#(<= proc_i 508), 122211#(<= proc_i 520), 122210#(<= proc_i 516), 122213#(<= proc_i 528), 122212#(<= proc_i 524), 122215#(<= proc_i 536), 122214#(<= proc_i 532), 122217#(<= proc_i 544), 122216#(<= proc_i 540), 122219#(<= proc_i 552), 122218#(<= proc_i 548), 122221#(<= proc_i 560), 122220#(<= proc_i 556), 122223#(<= proc_i 568), 122222#(<= proc_i 564), 122225#(<= proc_i 576), 122224#(<= proc_i 572), 122227#(<= proc_i 584), 122226#(<= proc_i 580), 122229#(<= proc_i 592), 122228#(<= proc_i 588), 122231#(<= proc_i 600), 122230#(<= proc_i 596), 122233#(<= proc_i 608), 122232#(<= proc_i 604), 122235#(<= proc_i 616), 122234#(<= proc_i 612), 122237#(<= proc_i 624), 122236#(<= proc_i 620), 122239#(<= proc_i 632), 122238#(<= proc_i 628), 122241#(<= proc_i 640), 122240#(<= proc_i 636), 122243#(<= proc_i 648), 122242#(<= proc_i 644), 122079#true, 122081#(<= proc_i 0), 122080#false, 122083#(<= proc_i 8), 122082#(<= proc_i 4), 122085#(<= proc_i 16), 122084#(<= proc_i 12), 122087#(<= proc_i 24), 122086#(<= proc_i 20), 122089#(<= proc_i 32), 122088#(<= proc_i 28), 122091#(<= proc_i 40), 122090#(<= proc_i 36), 122093#(<= proc_i 48), 122092#(<= proc_i 44), 122095#(<= proc_i 56), 122094#(<= proc_i 52), 122097#(<= proc_i 64), 122096#(<= proc_i 60), 122099#(<= proc_i 72), 122098#(<= proc_i 68), 122101#(<= proc_i 80), 122100#(<= proc_i 76), 122103#(<= proc_i 88), 122102#(<= proc_i 84), 122105#(<= proc_i 96), 122104#(<= proc_i 92), 122107#(<= proc_i 104), 122106#(<= proc_i 100), 122109#(<= proc_i 112), 122108#(<= proc_i 108), 122111#(<= proc_i 120), 122110#(<= proc_i 116)] [2018-07-23 13:53:08,377 INFO L134 CoverageAnalysis]: Checked inductivity of 26406 backedges. 0 proven. 26406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:08,377 INFO L450 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-07-23 13:53:08,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-07-23 13:53:08,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-07-23 13:53:08,380 INFO L87 Difference]: Start difference. First operand 328 states and 328 transitions. Second operand 165 states. [2018-07-23 13:53:09,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:09,298 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-07-23 13:53:09,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-07-23 13:53:09,298 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 327 [2018-07-23 13:53:09,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:09,298 INFO L225 Difference]: With dead ends: 331 [2018-07-23 13:53:09,298 INFO L226 Difference]: Without dead ends: 330 [2018-07-23 13:53:09,300 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-07-23 13:53:09,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-07-23 13:53:09,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2018-07-23 13:53:09,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-07-23 13:53:09,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 330 transitions. [2018-07-23 13:53:09,303 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 330 transitions. Word has length 327 [2018-07-23 13:53:09,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:09,303 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 330 transitions. [2018-07-23 13:53:09,303 INFO L472 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-07-23 13:53:09,303 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 330 transitions. [2018-07-23 13:53:09,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-07-23 13:53:09,304 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:09,304 INFO L357 BasicCegarLoop]: trace histogram [164, 163, 1, 1] [2018-07-23 13:53:09,304 INFO L414 AbstractCegarLoop]: === Iteration 164 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:09,305 INFO L82 PathProgramCache]: Analyzing trace with hash -231685786, now seen corresponding path program 163 times [2018-07-23 13:53:09,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 26732 backedges. 0 proven. 26732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:10,247 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:10,247 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-07-23 13:53:10,247 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:10,247 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:53:10,247 INFO L185 omatonBuilderFactory]: Interpolants [123649#(<= proc_i 324), 123648#(<= proc_i 320), 123651#(<= proc_i 332), 123650#(<= proc_i 328), 123653#(<= proc_i 340), 123652#(<= proc_i 336), 123655#(<= proc_i 348), 123654#(<= proc_i 344), 123657#(<= proc_i 356), 123656#(<= proc_i 352), 123659#(<= proc_i 364), 123658#(<= proc_i 360), 123661#(<= proc_i 372), 123660#(<= proc_i 368), 123663#(<= proc_i 380), 123662#(<= proc_i 376), 123665#(<= proc_i 388), 123664#(<= proc_i 384), 123667#(<= proc_i 396), 123666#(<= proc_i 392), 123669#(<= proc_i 404), 123668#(<= proc_i 400), 123671#(<= proc_i 412), 123670#(<= proc_i 408), 123673#(<= proc_i 420), 123672#(<= proc_i 416), 123675#(<= proc_i 428), 123674#(<= proc_i 424), 123677#(<= proc_i 436), 123676#(<= proc_i 432), 123679#(<= proc_i 444), 123678#(<= proc_i 440), 123681#(<= proc_i 452), 123680#(<= proc_i 448), 123683#(<= proc_i 460), 123682#(<= proc_i 456), 123685#(<= proc_i 468), 123684#(<= proc_i 464), 123687#(<= proc_i 476), 123686#(<= proc_i 472), 123689#(<= proc_i 484), 123688#(<= proc_i 480), 123691#(<= proc_i 492), 123690#(<= proc_i 488), 123693#(<= proc_i 500), 123692#(<= proc_i 496), 123695#(<= proc_i 508), 123694#(<= proc_i 504), 123697#(<= proc_i 516), 123696#(<= proc_i 512), 123699#(<= proc_i 524), 123698#(<= proc_i 520), 123701#(<= proc_i 532), 123700#(<= proc_i 528), 123703#(<= proc_i 540), 123702#(<= proc_i 536), 123705#(<= proc_i 548), 123704#(<= proc_i 544), 123707#(<= proc_i 556), 123706#(<= proc_i 552), 123709#(<= proc_i 564), 123708#(<= proc_i 560), 123711#(<= proc_i 572), 123710#(<= proc_i 568), 123713#(<= proc_i 580), 123712#(<= proc_i 576), 123715#(<= proc_i 588), 123714#(<= proc_i 584), 123717#(<= proc_i 596), 123716#(<= proc_i 592), 123719#(<= proc_i 604), 123718#(<= proc_i 600), 123721#(<= proc_i 612), 123720#(<= proc_i 608), 123723#(<= proc_i 620), 123722#(<= proc_i 616), 123725#(<= proc_i 628), 123724#(<= proc_i 624), 123727#(<= proc_i 636), 123726#(<= proc_i 632), 123729#(<= proc_i 644), 123728#(<= proc_i 640), 123731#(<= proc_i 652), 123730#(<= proc_i 648), 123567#false, 123566#true, 123569#(<= proc_i 4), 123568#(<= proc_i 0), 123571#(<= proc_i 12), 123570#(<= proc_i 8), 123573#(<= proc_i 20), 123572#(<= proc_i 16), 123575#(<= proc_i 28), 123574#(<= proc_i 24), 123577#(<= proc_i 36), 123576#(<= proc_i 32), 123579#(<= proc_i 44), 123578#(<= proc_i 40), 123581#(<= proc_i 52), 123580#(<= proc_i 48), 123583#(<= proc_i 60), 123582#(<= proc_i 56), 123585#(<= proc_i 68), 123584#(<= proc_i 64), 123587#(<= proc_i 76), 123586#(<= proc_i 72), 123589#(<= proc_i 84), 123588#(<= proc_i 80), 123591#(<= proc_i 92), 123590#(<= proc_i 88), 123593#(<= proc_i 100), 123592#(<= proc_i 96), 123595#(<= proc_i 108), 123594#(<= proc_i 104), 123597#(<= proc_i 116), 123596#(<= proc_i 112), 123599#(<= proc_i 124), 123598#(<= proc_i 120), 123601#(<= proc_i 132), 123600#(<= proc_i 128), 123603#(<= proc_i 140), 123602#(<= proc_i 136), 123605#(<= proc_i 148), 123604#(<= proc_i 144), 123607#(<= proc_i 156), 123606#(<= proc_i 152), 123609#(<= proc_i 164), 123608#(<= proc_i 160), 123611#(<= proc_i 172), 123610#(<= proc_i 168), 123613#(<= proc_i 180), 123612#(<= proc_i 176), 123615#(<= proc_i 188), 123614#(<= proc_i 184), 123617#(<= proc_i 196), 123616#(<= proc_i 192), 123619#(<= proc_i 204), 123618#(<= proc_i 200), 123621#(<= proc_i 212), 123620#(<= proc_i 208), 123623#(<= proc_i 220), 123622#(<= proc_i 216), 123625#(<= proc_i 228), 123624#(<= proc_i 224), 123627#(<= proc_i 236), 123626#(<= proc_i 232), 123629#(<= proc_i 244), 123628#(<= proc_i 240), 123631#(<= proc_i 252), 123630#(<= proc_i 248), 123633#(<= proc_i 260), 123632#(<= proc_i 256), 123635#(<= proc_i 268), 123634#(<= proc_i 264), 123637#(<= proc_i 276), 123636#(<= proc_i 272), 123639#(<= proc_i 284), 123638#(<= proc_i 280), 123641#(<= proc_i 292), 123640#(<= proc_i 288), 123643#(<= proc_i 300), 123642#(<= proc_i 296), 123645#(<= proc_i 308), 123644#(<= proc_i 304), 123647#(<= proc_i 316), 123646#(<= proc_i 312)] [2018-07-23 13:53:10,249 INFO L134 CoverageAnalysis]: Checked inductivity of 26732 backedges. 0 proven. 26732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:10,249 INFO L450 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-07-23 13:53:10,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-07-23 13:53:10,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-07-23 13:53:10,251 INFO L87 Difference]: Start difference. First operand 330 states and 330 transitions. Second operand 166 states. [2018-07-23 13:53:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:10,630 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-07-23 13:53:10,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-07-23 13:53:10,630 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 329 [2018-07-23 13:53:10,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:10,631 INFO L225 Difference]: With dead ends: 333 [2018-07-23 13:53:10,631 INFO L226 Difference]: Without dead ends: 332 [2018-07-23 13:53:10,632 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-07-23 13:53:10,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-07-23 13:53:10,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2018-07-23 13:53:10,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-07-23 13:53:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2018-07-23 13:53:10,637 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 329 [2018-07-23 13:53:10,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:10,637 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2018-07-23 13:53:10,637 INFO L472 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-07-23 13:53:10,637 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2018-07-23 13:53:10,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-07-23 13:53:10,639 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:10,639 INFO L357 BasicCegarLoop]: trace histogram [165, 164, 1, 1] [2018-07-23 13:53:10,639 INFO L414 AbstractCegarLoop]: === Iteration 165 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:10,639 INFO L82 PathProgramCache]: Analyzing trace with hash 688260136, now seen corresponding path program 164 times [2018-07-23 13:53:10,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 27060 backedges. 0 proven. 27060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:11,713 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:11,713 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-07-23 13:53:11,713 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:11,713 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:53:11,713 INFO L185 omatonBuilderFactory]: Interpolants [125185#(<= proc_i 484), 125184#(<= proc_i 480), 125187#(<= proc_i 492), 125186#(<= proc_i 488), 125189#(<= proc_i 500), 125188#(<= proc_i 496), 125191#(<= proc_i 508), 125190#(<= proc_i 504), 125193#(<= proc_i 516), 125192#(<= proc_i 512), 125195#(<= proc_i 524), 125194#(<= proc_i 520), 125197#(<= proc_i 532), 125196#(<= proc_i 528), 125199#(<= proc_i 540), 125198#(<= proc_i 536), 125201#(<= proc_i 548), 125200#(<= proc_i 544), 125203#(<= proc_i 556), 125202#(<= proc_i 552), 125205#(<= proc_i 564), 125204#(<= proc_i 560), 125207#(<= proc_i 572), 125206#(<= proc_i 568), 125209#(<= proc_i 580), 125208#(<= proc_i 576), 125211#(<= proc_i 588), 125210#(<= proc_i 584), 125213#(<= proc_i 596), 125212#(<= proc_i 592), 125215#(<= proc_i 604), 125214#(<= proc_i 600), 125217#(<= proc_i 612), 125216#(<= proc_i 608), 125219#(<= proc_i 620), 125218#(<= proc_i 616), 125221#(<= proc_i 628), 125220#(<= proc_i 624), 125223#(<= proc_i 636), 125222#(<= proc_i 632), 125225#(<= proc_i 644), 125224#(<= proc_i 640), 125227#(<= proc_i 652), 125226#(<= proc_i 648), 125228#(<= proc_i 656), 125063#false, 125062#true, 125065#(<= proc_i 4), 125064#(<= proc_i 0), 125067#(<= proc_i 12), 125066#(<= proc_i 8), 125069#(<= proc_i 20), 125068#(<= proc_i 16), 125071#(<= proc_i 28), 125070#(<= proc_i 24), 125073#(<= proc_i 36), 125072#(<= proc_i 32), 125075#(<= proc_i 44), 125074#(<= proc_i 40), 125077#(<= proc_i 52), 125076#(<= proc_i 48), 125079#(<= proc_i 60), 125078#(<= proc_i 56), 125081#(<= proc_i 68), 125080#(<= proc_i 64), 125083#(<= proc_i 76), 125082#(<= proc_i 72), 125085#(<= proc_i 84), 125084#(<= proc_i 80), 125087#(<= proc_i 92), 125086#(<= proc_i 88), 125089#(<= proc_i 100), 125088#(<= proc_i 96), 125091#(<= proc_i 108), 125090#(<= proc_i 104), 125093#(<= proc_i 116), 125092#(<= proc_i 112), 125095#(<= proc_i 124), 125094#(<= proc_i 120), 125097#(<= proc_i 132), 125096#(<= proc_i 128), 125099#(<= proc_i 140), 125098#(<= proc_i 136), 125101#(<= proc_i 148), 125100#(<= proc_i 144), 125103#(<= proc_i 156), 125102#(<= proc_i 152), 125105#(<= proc_i 164), 125104#(<= proc_i 160), 125107#(<= proc_i 172), 125106#(<= proc_i 168), 125109#(<= proc_i 180), 125108#(<= proc_i 176), 125111#(<= proc_i 188), 125110#(<= proc_i 184), 125113#(<= proc_i 196), 125112#(<= proc_i 192), 125115#(<= proc_i 204), 125114#(<= proc_i 200), 125117#(<= proc_i 212), 125116#(<= proc_i 208), 125119#(<= proc_i 220), 125118#(<= proc_i 216), 125121#(<= proc_i 228), 125120#(<= proc_i 224), 125123#(<= proc_i 236), 125122#(<= proc_i 232), 125125#(<= proc_i 244), 125124#(<= proc_i 240), 125127#(<= proc_i 252), 125126#(<= proc_i 248), 125129#(<= proc_i 260), 125128#(<= proc_i 256), 125131#(<= proc_i 268), 125130#(<= proc_i 264), 125133#(<= proc_i 276), 125132#(<= proc_i 272), 125135#(<= proc_i 284), 125134#(<= proc_i 280), 125137#(<= proc_i 292), 125136#(<= proc_i 288), 125139#(<= proc_i 300), 125138#(<= proc_i 296), 125141#(<= proc_i 308), 125140#(<= proc_i 304), 125143#(<= proc_i 316), 125142#(<= proc_i 312), 125145#(<= proc_i 324), 125144#(<= proc_i 320), 125147#(<= proc_i 332), 125146#(<= proc_i 328), 125149#(<= proc_i 340), 125148#(<= proc_i 336), 125151#(<= proc_i 348), 125150#(<= proc_i 344), 125153#(<= proc_i 356), 125152#(<= proc_i 352), 125155#(<= proc_i 364), 125154#(<= proc_i 360), 125157#(<= proc_i 372), 125156#(<= proc_i 368), 125159#(<= proc_i 380), 125158#(<= proc_i 376), 125161#(<= proc_i 388), 125160#(<= proc_i 384), 125163#(<= proc_i 396), 125162#(<= proc_i 392), 125165#(<= proc_i 404), 125164#(<= proc_i 400), 125167#(<= proc_i 412), 125166#(<= proc_i 408), 125169#(<= proc_i 420), 125168#(<= proc_i 416), 125171#(<= proc_i 428), 125170#(<= proc_i 424), 125173#(<= proc_i 436), 125172#(<= proc_i 432), 125175#(<= proc_i 444), 125174#(<= proc_i 440), 125177#(<= proc_i 452), 125176#(<= proc_i 448), 125179#(<= proc_i 460), 125178#(<= proc_i 456), 125181#(<= proc_i 468), 125180#(<= proc_i 464), 125183#(<= proc_i 476), 125182#(<= proc_i 472)] [2018-07-23 13:53:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 27060 backedges. 0 proven. 27060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:11,715 INFO L450 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-07-23 13:53:11,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-07-23 13:53:11,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-07-23 13:53:11,718 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand 167 states. [2018-07-23 13:53:12,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:12,240 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-07-23 13:53:12,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-07-23 13:53:12,240 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 331 [2018-07-23 13:53:12,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:12,241 INFO L225 Difference]: With dead ends: 335 [2018-07-23 13:53:12,241 INFO L226 Difference]: Without dead ends: 334 [2018-07-23 13:53:12,243 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-07-23 13:53:12,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-07-23 13:53:12,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2018-07-23 13:53:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-07-23 13:53:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 334 transitions. [2018-07-23 13:53:12,247 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 334 transitions. Word has length 331 [2018-07-23 13:53:12,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:12,247 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 334 transitions. [2018-07-23 13:53:12,247 INFO L472 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-07-23 13:53:12,247 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 334 transitions. [2018-07-23 13:53:12,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-07-23 13:53:12,248 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:12,248 INFO L357 BasicCegarLoop]: trace histogram [166, 165, 1, 1] [2018-07-23 13:53:12,249 INFO L414 AbstractCegarLoop]: === Iteration 166 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:12,249 INFO L82 PathProgramCache]: Analyzing trace with hash -6971798, now seen corresponding path program 165 times [2018-07-23 13:53:12,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:13,185 INFO L134 CoverageAnalysis]: Checked inductivity of 27390 backedges. 0 proven. 27390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:13,185 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:13,185 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-07-23 13:53:13,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:13,186 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:53:13,186 INFO L185 omatonBuilderFactory]: Interpolants [126721#(<= proc_i 608), 126720#(<= proc_i 604), 126723#(<= proc_i 616), 126722#(<= proc_i 612), 126725#(<= proc_i 624), 126724#(<= proc_i 620), 126727#(<= proc_i 632), 126726#(<= proc_i 628), 126729#(<= proc_i 640), 126728#(<= proc_i 636), 126731#(<= proc_i 648), 126730#(<= proc_i 644), 126733#(<= proc_i 656), 126732#(<= proc_i 652), 126734#(<= proc_i 660), 126567#true, 126569#(<= proc_i 0), 126568#false, 126571#(<= proc_i 8), 126570#(<= proc_i 4), 126573#(<= proc_i 16), 126572#(<= proc_i 12), 126575#(<= proc_i 24), 126574#(<= proc_i 20), 126577#(<= proc_i 32), 126576#(<= proc_i 28), 126579#(<= proc_i 40), 126578#(<= proc_i 36), 126581#(<= proc_i 48), 126580#(<= proc_i 44), 126583#(<= proc_i 56), 126582#(<= proc_i 52), 126585#(<= proc_i 64), 126584#(<= proc_i 60), 126587#(<= proc_i 72), 126586#(<= proc_i 68), 126589#(<= proc_i 80), 126588#(<= proc_i 76), 126591#(<= proc_i 88), 126590#(<= proc_i 84), 126593#(<= proc_i 96), 126592#(<= proc_i 92), 126595#(<= proc_i 104), 126594#(<= proc_i 100), 126597#(<= proc_i 112), 126596#(<= proc_i 108), 126599#(<= proc_i 120), 126598#(<= proc_i 116), 126601#(<= proc_i 128), 126600#(<= proc_i 124), 126603#(<= proc_i 136), 126602#(<= proc_i 132), 126605#(<= proc_i 144), 126604#(<= proc_i 140), 126607#(<= proc_i 152), 126606#(<= proc_i 148), 126609#(<= proc_i 160), 126608#(<= proc_i 156), 126611#(<= proc_i 168), 126610#(<= proc_i 164), 126613#(<= proc_i 176), 126612#(<= proc_i 172), 126615#(<= proc_i 184), 126614#(<= proc_i 180), 126617#(<= proc_i 192), 126616#(<= proc_i 188), 126619#(<= proc_i 200), 126618#(<= proc_i 196), 126621#(<= proc_i 208), 126620#(<= proc_i 204), 126623#(<= proc_i 216), 126622#(<= proc_i 212), 126625#(<= proc_i 224), 126624#(<= proc_i 220), 126627#(<= proc_i 232), 126626#(<= proc_i 228), 126629#(<= proc_i 240), 126628#(<= proc_i 236), 126631#(<= proc_i 248), 126630#(<= proc_i 244), 126633#(<= proc_i 256), 126632#(<= proc_i 252), 126635#(<= proc_i 264), 126634#(<= proc_i 260), 126637#(<= proc_i 272), 126636#(<= proc_i 268), 126639#(<= proc_i 280), 126638#(<= proc_i 276), 126641#(<= proc_i 288), 126640#(<= proc_i 284), 126643#(<= proc_i 296), 126642#(<= proc_i 292), 126645#(<= proc_i 304), 126644#(<= proc_i 300), 126647#(<= proc_i 312), 126646#(<= proc_i 308), 126649#(<= proc_i 320), 126648#(<= proc_i 316), 126651#(<= proc_i 328), 126650#(<= proc_i 324), 126653#(<= proc_i 336), 126652#(<= proc_i 332), 126655#(<= proc_i 344), 126654#(<= proc_i 340), 126657#(<= proc_i 352), 126656#(<= proc_i 348), 126659#(<= proc_i 360), 126658#(<= proc_i 356), 126661#(<= proc_i 368), 126660#(<= proc_i 364), 126663#(<= proc_i 376), 126662#(<= proc_i 372), 126665#(<= proc_i 384), 126664#(<= proc_i 380), 126667#(<= proc_i 392), 126666#(<= proc_i 388), 126669#(<= proc_i 400), 126668#(<= proc_i 396), 126671#(<= proc_i 408), 126670#(<= proc_i 404), 126673#(<= proc_i 416), 126672#(<= proc_i 412), 126675#(<= proc_i 424), 126674#(<= proc_i 420), 126677#(<= proc_i 432), 126676#(<= proc_i 428), 126679#(<= proc_i 440), 126678#(<= proc_i 436), 126681#(<= proc_i 448), 126680#(<= proc_i 444), 126683#(<= proc_i 456), 126682#(<= proc_i 452), 126685#(<= proc_i 464), 126684#(<= proc_i 460), 126687#(<= proc_i 472), 126686#(<= proc_i 468), 126689#(<= proc_i 480), 126688#(<= proc_i 476), 126691#(<= proc_i 488), 126690#(<= proc_i 484), 126693#(<= proc_i 496), 126692#(<= proc_i 492), 126695#(<= proc_i 504), 126694#(<= proc_i 500), 126697#(<= proc_i 512), 126696#(<= proc_i 508), 126699#(<= proc_i 520), 126698#(<= proc_i 516), 126701#(<= proc_i 528), 126700#(<= proc_i 524), 126703#(<= proc_i 536), 126702#(<= proc_i 532), 126705#(<= proc_i 544), 126704#(<= proc_i 540), 126707#(<= proc_i 552), 126706#(<= proc_i 548), 126709#(<= proc_i 560), 126708#(<= proc_i 556), 126711#(<= proc_i 568), 126710#(<= proc_i 564), 126713#(<= proc_i 576), 126712#(<= proc_i 572), 126715#(<= proc_i 584), 126714#(<= proc_i 580), 126717#(<= proc_i 592), 126716#(<= proc_i 588), 126719#(<= proc_i 600), 126718#(<= proc_i 596)] [2018-07-23 13:53:13,187 INFO L134 CoverageAnalysis]: Checked inductivity of 27390 backedges. 0 proven. 27390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:13,187 INFO L450 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-07-23 13:53:13,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-07-23 13:53:13,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-07-23 13:53:13,191 INFO L87 Difference]: Start difference. First operand 334 states and 334 transitions. Second operand 168 states. [2018-07-23 13:53:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:14,161 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-07-23 13:53:14,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-07-23 13:53:14,161 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 333 [2018-07-23 13:53:14,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:14,162 INFO L225 Difference]: With dead ends: 337 [2018-07-23 13:53:14,162 INFO L226 Difference]: Without dead ends: 336 [2018-07-23 13:53:14,164 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-07-23 13:53:14,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-07-23 13:53:14,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2018-07-23 13:53:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-07-23 13:53:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2018-07-23 13:53:14,168 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 333 [2018-07-23 13:53:14,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:14,169 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2018-07-23 13:53:14,169 INFO L472 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-07-23 13:53:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2018-07-23 13:53:14,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-07-23 13:53:14,170 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:14,171 INFO L357 BasicCegarLoop]: trace histogram [167, 166, 1, 1] [2018-07-23 13:53:14,171 INFO L414 AbstractCegarLoop]: === Iteration 167 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:14,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1890037804, now seen corresponding path program 166 times [2018-07-23 13:53:14,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 27722 backedges. 0 proven. 27722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:15,188 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:15,188 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-07-23 13:53:15,188 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:15,188 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:53:15,189 INFO L185 omatonBuilderFactory]: Interpolants [128081#true, 128083#(<= proc_i 0), 128082#false, 128085#(<= proc_i 8), 128084#(<= proc_i 4), 128087#(<= proc_i 16), 128086#(<= proc_i 12), 128089#(<= proc_i 24), 128088#(<= proc_i 20), 128091#(<= proc_i 32), 128090#(<= proc_i 28), 128093#(<= proc_i 40), 128092#(<= proc_i 36), 128095#(<= proc_i 48), 128094#(<= proc_i 44), 128097#(<= proc_i 56), 128096#(<= proc_i 52), 128099#(<= proc_i 64), 128098#(<= proc_i 60), 128101#(<= proc_i 72), 128100#(<= proc_i 68), 128103#(<= proc_i 80), 128102#(<= proc_i 76), 128105#(<= proc_i 88), 128104#(<= proc_i 84), 128107#(<= proc_i 96), 128106#(<= proc_i 92), 128109#(<= proc_i 104), 128108#(<= proc_i 100), 128111#(<= proc_i 112), 128110#(<= proc_i 108), 128113#(<= proc_i 120), 128112#(<= proc_i 116), 128115#(<= proc_i 128), 128114#(<= proc_i 124), 128117#(<= proc_i 136), 128116#(<= proc_i 132), 128119#(<= proc_i 144), 128118#(<= proc_i 140), 128121#(<= proc_i 152), 128120#(<= proc_i 148), 128123#(<= proc_i 160), 128122#(<= proc_i 156), 128125#(<= proc_i 168), 128124#(<= proc_i 164), 128127#(<= proc_i 176), 128126#(<= proc_i 172), 128129#(<= proc_i 184), 128128#(<= proc_i 180), 128131#(<= proc_i 192), 128130#(<= proc_i 188), 128133#(<= proc_i 200), 128132#(<= proc_i 196), 128135#(<= proc_i 208), 128134#(<= proc_i 204), 128137#(<= proc_i 216), 128136#(<= proc_i 212), 128139#(<= proc_i 224), 128138#(<= proc_i 220), 128141#(<= proc_i 232), 128140#(<= proc_i 228), 128143#(<= proc_i 240), 128142#(<= proc_i 236), 128145#(<= proc_i 248), 128144#(<= proc_i 244), 128147#(<= proc_i 256), 128146#(<= proc_i 252), 128149#(<= proc_i 264), 128148#(<= proc_i 260), 128151#(<= proc_i 272), 128150#(<= proc_i 268), 128153#(<= proc_i 280), 128152#(<= proc_i 276), 128155#(<= proc_i 288), 128154#(<= proc_i 284), 128157#(<= proc_i 296), 128156#(<= proc_i 292), 128159#(<= proc_i 304), 128158#(<= proc_i 300), 128161#(<= proc_i 312), 128160#(<= proc_i 308), 128163#(<= proc_i 320), 128162#(<= proc_i 316), 128165#(<= proc_i 328), 128164#(<= proc_i 324), 128167#(<= proc_i 336), 128166#(<= proc_i 332), 128169#(<= proc_i 344), 128168#(<= proc_i 340), 128171#(<= proc_i 352), 128170#(<= proc_i 348), 128173#(<= proc_i 360), 128172#(<= proc_i 356), 128175#(<= proc_i 368), 128174#(<= proc_i 364), 128177#(<= proc_i 376), 128176#(<= proc_i 372), 128179#(<= proc_i 384), 128178#(<= proc_i 380), 128181#(<= proc_i 392), 128180#(<= proc_i 388), 128183#(<= proc_i 400), 128182#(<= proc_i 396), 128185#(<= proc_i 408), 128184#(<= proc_i 404), 128187#(<= proc_i 416), 128186#(<= proc_i 412), 128189#(<= proc_i 424), 128188#(<= proc_i 420), 128191#(<= proc_i 432), 128190#(<= proc_i 428), 128193#(<= proc_i 440), 128192#(<= proc_i 436), 128195#(<= proc_i 448), 128194#(<= proc_i 444), 128197#(<= proc_i 456), 128196#(<= proc_i 452), 128199#(<= proc_i 464), 128198#(<= proc_i 460), 128201#(<= proc_i 472), 128200#(<= proc_i 468), 128203#(<= proc_i 480), 128202#(<= proc_i 476), 128205#(<= proc_i 488), 128204#(<= proc_i 484), 128207#(<= proc_i 496), 128206#(<= proc_i 492), 128209#(<= proc_i 504), 128208#(<= proc_i 500), 128211#(<= proc_i 512), 128210#(<= proc_i 508), 128213#(<= proc_i 520), 128212#(<= proc_i 516), 128215#(<= proc_i 528), 128214#(<= proc_i 524), 128217#(<= proc_i 536), 128216#(<= proc_i 532), 128219#(<= proc_i 544), 128218#(<= proc_i 540), 128221#(<= proc_i 552), 128220#(<= proc_i 548), 128223#(<= proc_i 560), 128222#(<= proc_i 556), 128225#(<= proc_i 568), 128224#(<= proc_i 564), 128227#(<= proc_i 576), 128226#(<= proc_i 572), 128229#(<= proc_i 584), 128228#(<= proc_i 580), 128231#(<= proc_i 592), 128230#(<= proc_i 588), 128233#(<= proc_i 600), 128232#(<= proc_i 596), 128235#(<= proc_i 608), 128234#(<= proc_i 604), 128237#(<= proc_i 616), 128236#(<= proc_i 612), 128239#(<= proc_i 624), 128238#(<= proc_i 620), 128241#(<= proc_i 632), 128240#(<= proc_i 628), 128243#(<= proc_i 640), 128242#(<= proc_i 636), 128245#(<= proc_i 648), 128244#(<= proc_i 644), 128247#(<= proc_i 656), 128246#(<= proc_i 652), 128249#(<= proc_i 664), 128248#(<= proc_i 660)] [2018-07-23 13:53:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 27722 backedges. 0 proven. 27722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:15,190 INFO L450 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-07-23 13:53:15,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-07-23 13:53:15,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-07-23 13:53:15,193 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 169 states. [2018-07-23 13:53:16,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:16,373 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2018-07-23 13:53:16,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-07-23 13:53:16,373 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 335 [2018-07-23 13:53:16,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:16,374 INFO L225 Difference]: With dead ends: 339 [2018-07-23 13:53:16,374 INFO L226 Difference]: Without dead ends: 338 [2018-07-23 13:53:16,375 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-07-23 13:53:16,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-07-23 13:53:16,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2018-07-23 13:53:16,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-07-23 13:53:16,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 338 transitions. [2018-07-23 13:53:16,379 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 338 transitions. Word has length 335 [2018-07-23 13:53:16,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:16,379 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 338 transitions. [2018-07-23 13:53:16,379 INFO L472 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-07-23 13:53:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 338 transitions. [2018-07-23 13:53:16,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-07-23 13:53:16,380 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:16,380 INFO L357 BasicCegarLoop]: trace histogram [168, 167, 1, 1] [2018-07-23 13:53:16,380 INFO L414 AbstractCegarLoop]: === Iteration 168 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:16,381 INFO L82 PathProgramCache]: Analyzing trace with hash -444835474, now seen corresponding path program 167 times [2018-07-23 13:53:16,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 28056 backedges. 0 proven. 28056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:17,415 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:17,416 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-07-23 13:53:17,416 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:17,416 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:53:17,416 INFO L185 omatonBuilderFactory]: Interpolants [129605#false, 129604#true, 129607#(<= proc_i 4), 129606#(<= proc_i 0), 129609#(<= proc_i 12), 129608#(<= proc_i 8), 129611#(<= proc_i 20), 129610#(<= proc_i 16), 129613#(<= proc_i 28), 129612#(<= proc_i 24), 129615#(<= proc_i 36), 129614#(<= proc_i 32), 129617#(<= proc_i 44), 129616#(<= proc_i 40), 129619#(<= proc_i 52), 129618#(<= proc_i 48), 129621#(<= proc_i 60), 129620#(<= proc_i 56), 129623#(<= proc_i 68), 129622#(<= proc_i 64), 129625#(<= proc_i 76), 129624#(<= proc_i 72), 129627#(<= proc_i 84), 129626#(<= proc_i 80), 129629#(<= proc_i 92), 129628#(<= proc_i 88), 129631#(<= proc_i 100), 129630#(<= proc_i 96), 129633#(<= proc_i 108), 129632#(<= proc_i 104), 129635#(<= proc_i 116), 129634#(<= proc_i 112), 129637#(<= proc_i 124), 129636#(<= proc_i 120), 129639#(<= proc_i 132), 129638#(<= proc_i 128), 129641#(<= proc_i 140), 129640#(<= proc_i 136), 129643#(<= proc_i 148), 129642#(<= proc_i 144), 129645#(<= proc_i 156), 129644#(<= proc_i 152), 129647#(<= proc_i 164), 129646#(<= proc_i 160), 129649#(<= proc_i 172), 129648#(<= proc_i 168), 129651#(<= proc_i 180), 129650#(<= proc_i 176), 129653#(<= proc_i 188), 129652#(<= proc_i 184), 129655#(<= proc_i 196), 129654#(<= proc_i 192), 129657#(<= proc_i 204), 129656#(<= proc_i 200), 129659#(<= proc_i 212), 129658#(<= proc_i 208), 129661#(<= proc_i 220), 129660#(<= proc_i 216), 129663#(<= proc_i 228), 129662#(<= proc_i 224), 129665#(<= proc_i 236), 129664#(<= proc_i 232), 129667#(<= proc_i 244), 129666#(<= proc_i 240), 129669#(<= proc_i 252), 129668#(<= proc_i 248), 129671#(<= proc_i 260), 129670#(<= proc_i 256), 129673#(<= proc_i 268), 129672#(<= proc_i 264), 129675#(<= proc_i 276), 129674#(<= proc_i 272), 129677#(<= proc_i 284), 129676#(<= proc_i 280), 129679#(<= proc_i 292), 129678#(<= proc_i 288), 129681#(<= proc_i 300), 129680#(<= proc_i 296), 129683#(<= proc_i 308), 129682#(<= proc_i 304), 129685#(<= proc_i 316), 129684#(<= proc_i 312), 129687#(<= proc_i 324), 129686#(<= proc_i 320), 129689#(<= proc_i 332), 129688#(<= proc_i 328), 129691#(<= proc_i 340), 129690#(<= proc_i 336), 129693#(<= proc_i 348), 129692#(<= proc_i 344), 129695#(<= proc_i 356), 129694#(<= proc_i 352), 129697#(<= proc_i 364), 129696#(<= proc_i 360), 129699#(<= proc_i 372), 129698#(<= proc_i 368), 129701#(<= proc_i 380), 129700#(<= proc_i 376), 129703#(<= proc_i 388), 129702#(<= proc_i 384), 129705#(<= proc_i 396), 129704#(<= proc_i 392), 129707#(<= proc_i 404), 129706#(<= proc_i 400), 129709#(<= proc_i 412), 129708#(<= proc_i 408), 129711#(<= proc_i 420), 129710#(<= proc_i 416), 129713#(<= proc_i 428), 129712#(<= proc_i 424), 129715#(<= proc_i 436), 129714#(<= proc_i 432), 129717#(<= proc_i 444), 129716#(<= proc_i 440), 129719#(<= proc_i 452), 129718#(<= proc_i 448), 129721#(<= proc_i 460), 129720#(<= proc_i 456), 129723#(<= proc_i 468), 129722#(<= proc_i 464), 129725#(<= proc_i 476), 129724#(<= proc_i 472), 129727#(<= proc_i 484), 129726#(<= proc_i 480), 129729#(<= proc_i 492), 129728#(<= proc_i 488), 129731#(<= proc_i 500), 129730#(<= proc_i 496), 129733#(<= proc_i 508), 129732#(<= proc_i 504), 129735#(<= proc_i 516), 129734#(<= proc_i 512), 129737#(<= proc_i 524), 129736#(<= proc_i 520), 129739#(<= proc_i 532), 129738#(<= proc_i 528), 129741#(<= proc_i 540), 129740#(<= proc_i 536), 129743#(<= proc_i 548), 129742#(<= proc_i 544), 129745#(<= proc_i 556), 129744#(<= proc_i 552), 129747#(<= proc_i 564), 129746#(<= proc_i 560), 129749#(<= proc_i 572), 129748#(<= proc_i 568), 129751#(<= proc_i 580), 129750#(<= proc_i 576), 129753#(<= proc_i 588), 129752#(<= proc_i 584), 129755#(<= proc_i 596), 129754#(<= proc_i 592), 129757#(<= proc_i 604), 129756#(<= proc_i 600), 129759#(<= proc_i 612), 129758#(<= proc_i 608), 129761#(<= proc_i 620), 129760#(<= proc_i 616), 129763#(<= proc_i 628), 129762#(<= proc_i 624), 129765#(<= proc_i 636), 129764#(<= proc_i 632), 129767#(<= proc_i 644), 129766#(<= proc_i 640), 129769#(<= proc_i 652), 129768#(<= proc_i 648), 129771#(<= proc_i 660), 129770#(<= proc_i 656), 129773#(<= proc_i 668), 129772#(<= proc_i 664)] [2018-07-23 13:53:17,418 INFO L134 CoverageAnalysis]: Checked inductivity of 28056 backedges. 0 proven. 28056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:17,418 INFO L450 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-07-23 13:53:17,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-07-23 13:53:17,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-07-23 13:53:17,421 INFO L87 Difference]: Start difference. First operand 338 states and 338 transitions. Second operand 170 states. [2018-07-23 13:53:18,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:18,500 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2018-07-23 13:53:18,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-07-23 13:53:18,500 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 337 [2018-07-23 13:53:18,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:18,501 INFO L225 Difference]: With dead ends: 341 [2018-07-23 13:53:18,501 INFO L226 Difference]: Without dead ends: 340 [2018-07-23 13:53:18,502 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-07-23 13:53:18,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-07-23 13:53:18,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-07-23 13:53:18,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-07-23 13:53:18,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 340 transitions. [2018-07-23 13:53:18,505 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 340 transitions. Word has length 337 [2018-07-23 13:53:18,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:18,506 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 340 transitions. [2018-07-23 13:53:18,506 INFO L472 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-07-23 13:53:18,506 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 340 transitions. [2018-07-23 13:53:18,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-07-23 13:53:18,507 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:18,507 INFO L357 BasicCegarLoop]: trace histogram [169, 168, 1, 1] [2018-07-23 13:53:18,507 INFO L414 AbstractCegarLoop]: === Iteration 169 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:18,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2009840176, now seen corresponding path program 168 times [2018-07-23 13:53:18,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:19,514 INFO L134 CoverageAnalysis]: Checked inductivity of 28392 backedges. 0 proven. 28392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:19,514 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:19,514 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-07-23 13:53:19,515 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:19,515 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:53:19,515 INFO L185 omatonBuilderFactory]: Interpolants [131138#(<= proc_i 0), 131139#(<= proc_i 4), 131136#true, 131137#false, 131142#(<= proc_i 16), 131143#(<= proc_i 20), 131140#(<= proc_i 8), 131141#(<= proc_i 12), 131146#(<= proc_i 32), 131147#(<= proc_i 36), 131144#(<= proc_i 24), 131145#(<= proc_i 28), 131150#(<= proc_i 48), 131151#(<= proc_i 52), 131148#(<= proc_i 40), 131149#(<= proc_i 44), 131154#(<= proc_i 64), 131155#(<= proc_i 68), 131152#(<= proc_i 56), 131153#(<= proc_i 60), 131158#(<= proc_i 80), 131159#(<= proc_i 84), 131156#(<= proc_i 72), 131157#(<= proc_i 76), 131162#(<= proc_i 96), 131163#(<= proc_i 100), 131160#(<= proc_i 88), 131161#(<= proc_i 92), 131166#(<= proc_i 112), 131167#(<= proc_i 116), 131164#(<= proc_i 104), 131165#(<= proc_i 108), 131170#(<= proc_i 128), 131171#(<= proc_i 132), 131168#(<= proc_i 120), 131169#(<= proc_i 124), 131174#(<= proc_i 144), 131175#(<= proc_i 148), 131172#(<= proc_i 136), 131173#(<= proc_i 140), 131178#(<= proc_i 160), 131179#(<= proc_i 164), 131176#(<= proc_i 152), 131177#(<= proc_i 156), 131182#(<= proc_i 176), 131183#(<= proc_i 180), 131180#(<= proc_i 168), 131181#(<= proc_i 172), 131186#(<= proc_i 192), 131187#(<= proc_i 196), 131184#(<= proc_i 184), 131185#(<= proc_i 188), 131190#(<= proc_i 208), 131191#(<= proc_i 212), 131188#(<= proc_i 200), 131189#(<= proc_i 204), 131194#(<= proc_i 224), 131195#(<= proc_i 228), 131192#(<= proc_i 216), 131193#(<= proc_i 220), 131198#(<= proc_i 240), 131199#(<= proc_i 244), 131196#(<= proc_i 232), 131197#(<= proc_i 236), 131202#(<= proc_i 256), 131203#(<= proc_i 260), 131200#(<= proc_i 248), 131201#(<= proc_i 252), 131206#(<= proc_i 272), 131207#(<= proc_i 276), 131204#(<= proc_i 264), 131205#(<= proc_i 268), 131210#(<= proc_i 288), 131211#(<= proc_i 292), 131208#(<= proc_i 280), 131209#(<= proc_i 284), 131214#(<= proc_i 304), 131215#(<= proc_i 308), 131212#(<= proc_i 296), 131213#(<= proc_i 300), 131218#(<= proc_i 320), 131219#(<= proc_i 324), 131216#(<= proc_i 312), 131217#(<= proc_i 316), 131222#(<= proc_i 336), 131223#(<= proc_i 340), 131220#(<= proc_i 328), 131221#(<= proc_i 332), 131226#(<= proc_i 352), 131227#(<= proc_i 356), 131224#(<= proc_i 344), 131225#(<= proc_i 348), 131230#(<= proc_i 368), 131231#(<= proc_i 372), 131228#(<= proc_i 360), 131229#(<= proc_i 364), 131234#(<= proc_i 384), 131235#(<= proc_i 388), 131232#(<= proc_i 376), 131233#(<= proc_i 380), 131238#(<= proc_i 400), 131239#(<= proc_i 404), 131236#(<= proc_i 392), 131237#(<= proc_i 396), 131242#(<= proc_i 416), 131243#(<= proc_i 420), 131240#(<= proc_i 408), 131241#(<= proc_i 412), 131246#(<= proc_i 432), 131247#(<= proc_i 436), 131244#(<= proc_i 424), 131245#(<= proc_i 428), 131250#(<= proc_i 448), 131251#(<= proc_i 452), 131248#(<= proc_i 440), 131249#(<= proc_i 444), 131254#(<= proc_i 464), 131255#(<= proc_i 468), 131252#(<= proc_i 456), 131253#(<= proc_i 460), 131258#(<= proc_i 480), 131259#(<= proc_i 484), 131256#(<= proc_i 472), 131257#(<= proc_i 476), 131262#(<= proc_i 496), 131263#(<= proc_i 500), 131260#(<= proc_i 488), 131261#(<= proc_i 492), 131266#(<= proc_i 512), 131267#(<= proc_i 516), 131264#(<= proc_i 504), 131265#(<= proc_i 508), 131270#(<= proc_i 528), 131271#(<= proc_i 532), 131268#(<= proc_i 520), 131269#(<= proc_i 524), 131274#(<= proc_i 544), 131275#(<= proc_i 548), 131272#(<= proc_i 536), 131273#(<= proc_i 540), 131278#(<= proc_i 560), 131279#(<= proc_i 564), 131276#(<= proc_i 552), 131277#(<= proc_i 556), 131282#(<= proc_i 576), 131283#(<= proc_i 580), 131280#(<= proc_i 568), 131281#(<= proc_i 572), 131286#(<= proc_i 592), 131287#(<= proc_i 596), 131284#(<= proc_i 584), 131285#(<= proc_i 588), 131290#(<= proc_i 608), 131291#(<= proc_i 612), 131288#(<= proc_i 600), 131289#(<= proc_i 604), 131294#(<= proc_i 624), 131295#(<= proc_i 628), 131292#(<= proc_i 616), 131293#(<= proc_i 620), 131298#(<= proc_i 640), 131299#(<= proc_i 644), 131296#(<= proc_i 632), 131297#(<= proc_i 636), 131302#(<= proc_i 656), 131303#(<= proc_i 660), 131300#(<= proc_i 648), 131301#(<= proc_i 652), 131306#(<= proc_i 672), 131304#(<= proc_i 664), 131305#(<= proc_i 668)] [2018-07-23 13:53:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 28392 backedges. 0 proven. 28392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:19,517 INFO L450 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-07-23 13:53:19,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-07-23 13:53:19,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-07-23 13:53:19,521 INFO L87 Difference]: Start difference. First operand 340 states and 340 transitions. Second operand 171 states. [2018-07-23 13:53:20,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:20,685 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-07-23 13:53:20,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-07-23 13:53:20,685 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 339 [2018-07-23 13:53:20,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:20,686 INFO L225 Difference]: With dead ends: 343 [2018-07-23 13:53:20,686 INFO L226 Difference]: Without dead ends: 342 [2018-07-23 13:53:20,686 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-07-23 13:53:20,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-07-23 13:53:20,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2018-07-23 13:53:20,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-07-23 13:53:20,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 342 transitions. [2018-07-23 13:53:20,690 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 342 transitions. Word has length 339 [2018-07-23 13:53:20,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:20,690 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 342 transitions. [2018-07-23 13:53:20,690 INFO L472 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-07-23 13:53:20,690 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 342 transitions. [2018-07-23 13:53:20,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-07-23 13:53:20,691 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:20,691 INFO L357 BasicCegarLoop]: trace histogram [170, 169, 1, 1] [2018-07-23 13:53:20,691 INFO L414 AbstractCegarLoop]: === Iteration 170 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:20,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1278872974, now seen corresponding path program 169 times [2018-07-23 13:53:20,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:21,686 INFO L134 CoverageAnalysis]: Checked inductivity of 28730 backedges. 0 proven. 28730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:21,687 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:21,687 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-07-23 13:53:21,687 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:21,687 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:53:21,687 INFO L185 omatonBuilderFactory]: Interpolants [132678#false, 132679#(<= proc_i 0), 132677#true, 132682#(<= proc_i 12), 132683#(<= proc_i 16), 132680#(<= proc_i 4), 132681#(<= proc_i 8), 132686#(<= proc_i 28), 132687#(<= proc_i 32), 132684#(<= proc_i 20), 132685#(<= proc_i 24), 132690#(<= proc_i 44), 132691#(<= proc_i 48), 132688#(<= proc_i 36), 132689#(<= proc_i 40), 132694#(<= proc_i 60), 132695#(<= proc_i 64), 132692#(<= proc_i 52), 132693#(<= proc_i 56), 132698#(<= proc_i 76), 132699#(<= proc_i 80), 132696#(<= proc_i 68), 132697#(<= proc_i 72), 132702#(<= proc_i 92), 132703#(<= proc_i 96), 132700#(<= proc_i 84), 132701#(<= proc_i 88), 132706#(<= proc_i 108), 132707#(<= proc_i 112), 132704#(<= proc_i 100), 132705#(<= proc_i 104), 132710#(<= proc_i 124), 132711#(<= proc_i 128), 132708#(<= proc_i 116), 132709#(<= proc_i 120), 132714#(<= proc_i 140), 132715#(<= proc_i 144), 132712#(<= proc_i 132), 132713#(<= proc_i 136), 132718#(<= proc_i 156), 132719#(<= proc_i 160), 132716#(<= proc_i 148), 132717#(<= proc_i 152), 132722#(<= proc_i 172), 132723#(<= proc_i 176), 132720#(<= proc_i 164), 132721#(<= proc_i 168), 132726#(<= proc_i 188), 132727#(<= proc_i 192), 132724#(<= proc_i 180), 132725#(<= proc_i 184), 132730#(<= proc_i 204), 132731#(<= proc_i 208), 132728#(<= proc_i 196), 132729#(<= proc_i 200), 132734#(<= proc_i 220), 132735#(<= proc_i 224), 132732#(<= proc_i 212), 132733#(<= proc_i 216), 132738#(<= proc_i 236), 132739#(<= proc_i 240), 132736#(<= proc_i 228), 132737#(<= proc_i 232), 132742#(<= proc_i 252), 132743#(<= proc_i 256), 132740#(<= proc_i 244), 132741#(<= proc_i 248), 132746#(<= proc_i 268), 132747#(<= proc_i 272), 132744#(<= proc_i 260), 132745#(<= proc_i 264), 132750#(<= proc_i 284), 132751#(<= proc_i 288), 132748#(<= proc_i 276), 132749#(<= proc_i 280), 132754#(<= proc_i 300), 132755#(<= proc_i 304), 132752#(<= proc_i 292), 132753#(<= proc_i 296), 132758#(<= proc_i 316), 132759#(<= proc_i 320), 132756#(<= proc_i 308), 132757#(<= proc_i 312), 132762#(<= proc_i 332), 132763#(<= proc_i 336), 132760#(<= proc_i 324), 132761#(<= proc_i 328), 132766#(<= proc_i 348), 132767#(<= proc_i 352), 132764#(<= proc_i 340), 132765#(<= proc_i 344), 132770#(<= proc_i 364), 132771#(<= proc_i 368), 132768#(<= proc_i 356), 132769#(<= proc_i 360), 132774#(<= proc_i 380), 132775#(<= proc_i 384), 132772#(<= proc_i 372), 132773#(<= proc_i 376), 132778#(<= proc_i 396), 132779#(<= proc_i 400), 132776#(<= proc_i 388), 132777#(<= proc_i 392), 132782#(<= proc_i 412), 132783#(<= proc_i 416), 132780#(<= proc_i 404), 132781#(<= proc_i 408), 132786#(<= proc_i 428), 132787#(<= proc_i 432), 132784#(<= proc_i 420), 132785#(<= proc_i 424), 132790#(<= proc_i 444), 132791#(<= proc_i 448), 132788#(<= proc_i 436), 132789#(<= proc_i 440), 132794#(<= proc_i 460), 132795#(<= proc_i 464), 132792#(<= proc_i 452), 132793#(<= proc_i 456), 132798#(<= proc_i 476), 132799#(<= proc_i 480), 132796#(<= proc_i 468), 132797#(<= proc_i 472), 132802#(<= proc_i 492), 132803#(<= proc_i 496), 132800#(<= proc_i 484), 132801#(<= proc_i 488), 132806#(<= proc_i 508), 132807#(<= proc_i 512), 132804#(<= proc_i 500), 132805#(<= proc_i 504), 132810#(<= proc_i 524), 132811#(<= proc_i 528), 132808#(<= proc_i 516), 132809#(<= proc_i 520), 132814#(<= proc_i 540), 132815#(<= proc_i 544), 132812#(<= proc_i 532), 132813#(<= proc_i 536), 132818#(<= proc_i 556), 132819#(<= proc_i 560), 132816#(<= proc_i 548), 132817#(<= proc_i 552), 132822#(<= proc_i 572), 132823#(<= proc_i 576), 132820#(<= proc_i 564), 132821#(<= proc_i 568), 132826#(<= proc_i 588), 132827#(<= proc_i 592), 132824#(<= proc_i 580), 132825#(<= proc_i 584), 132830#(<= proc_i 604), 132831#(<= proc_i 608), 132828#(<= proc_i 596), 132829#(<= proc_i 600), 132834#(<= proc_i 620), 132835#(<= proc_i 624), 132832#(<= proc_i 612), 132833#(<= proc_i 616), 132838#(<= proc_i 636), 132839#(<= proc_i 640), 132836#(<= proc_i 628), 132837#(<= proc_i 632), 132842#(<= proc_i 652), 132843#(<= proc_i 656), 132840#(<= proc_i 644), 132841#(<= proc_i 648), 132846#(<= proc_i 668), 132847#(<= proc_i 672), 132844#(<= proc_i 660), 132845#(<= proc_i 664), 132848#(<= proc_i 676)] [2018-07-23 13:53:21,689 INFO L134 CoverageAnalysis]: Checked inductivity of 28730 backedges. 0 proven. 28730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:21,689 INFO L450 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-07-23 13:53:21,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-07-23 13:53:21,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-07-23 13:53:21,693 INFO L87 Difference]: Start difference. First operand 342 states and 342 transitions. Second operand 172 states. [2018-07-23 13:53:23,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:23,015 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-07-23 13:53:23,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-07-23 13:53:23,015 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 341 [2018-07-23 13:53:23,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:23,016 INFO L225 Difference]: With dead ends: 345 [2018-07-23 13:53:23,016 INFO L226 Difference]: Without dead ends: 344 [2018-07-23 13:53:23,018 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-07-23 13:53:23,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-07-23 13:53:23,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2018-07-23 13:53:23,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-07-23 13:53:23,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 344 transitions. [2018-07-23 13:53:23,022 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 344 transitions. Word has length 341 [2018-07-23 13:53:23,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:23,022 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 344 transitions. [2018-07-23 13:53:23,022 INFO L472 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-07-23 13:53:23,023 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 344 transitions. [2018-07-23 13:53:23,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-07-23 13:53:23,024 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:23,024 INFO L357 BasicCegarLoop]: trace histogram [171, 170, 1, 1] [2018-07-23 13:53:23,024 INFO L414 AbstractCegarLoop]: === Iteration 171 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:23,024 INFO L82 PathProgramCache]: Analyzing trace with hash -636280268, now seen corresponding path program 170 times [2018-07-23 13:53:23,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:24,080 INFO L134 CoverageAnalysis]: Checked inductivity of 29070 backedges. 0 proven. 29070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:24,080 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:24,080 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-07-23 13:53:24,081 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:24,081 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:53:24,081 INFO L185 omatonBuilderFactory]: Interpolants [134227#true, 134230#(<= proc_i 4), 134231#(<= proc_i 8), 134228#false, 134229#(<= proc_i 0), 134234#(<= proc_i 20), 134235#(<= proc_i 24), 134232#(<= proc_i 12), 134233#(<= proc_i 16), 134238#(<= proc_i 36), 134239#(<= proc_i 40), 134236#(<= proc_i 28), 134237#(<= proc_i 32), 134242#(<= proc_i 52), 134243#(<= proc_i 56), 134240#(<= proc_i 44), 134241#(<= proc_i 48), 134246#(<= proc_i 68), 134247#(<= proc_i 72), 134244#(<= proc_i 60), 134245#(<= proc_i 64), 134250#(<= proc_i 84), 134251#(<= proc_i 88), 134248#(<= proc_i 76), 134249#(<= proc_i 80), 134254#(<= proc_i 100), 134255#(<= proc_i 104), 134252#(<= proc_i 92), 134253#(<= proc_i 96), 134258#(<= proc_i 116), 134259#(<= proc_i 120), 134256#(<= proc_i 108), 134257#(<= proc_i 112), 134262#(<= proc_i 132), 134263#(<= proc_i 136), 134260#(<= proc_i 124), 134261#(<= proc_i 128), 134266#(<= proc_i 148), 134267#(<= proc_i 152), 134264#(<= proc_i 140), 134265#(<= proc_i 144), 134270#(<= proc_i 164), 134271#(<= proc_i 168), 134268#(<= proc_i 156), 134269#(<= proc_i 160), 134274#(<= proc_i 180), 134275#(<= proc_i 184), 134272#(<= proc_i 172), 134273#(<= proc_i 176), 134278#(<= proc_i 196), 134279#(<= proc_i 200), 134276#(<= proc_i 188), 134277#(<= proc_i 192), 134282#(<= proc_i 212), 134283#(<= proc_i 216), 134280#(<= proc_i 204), 134281#(<= proc_i 208), 134286#(<= proc_i 228), 134287#(<= proc_i 232), 134284#(<= proc_i 220), 134285#(<= proc_i 224), 134290#(<= proc_i 244), 134291#(<= proc_i 248), 134288#(<= proc_i 236), 134289#(<= proc_i 240), 134294#(<= proc_i 260), 134295#(<= proc_i 264), 134292#(<= proc_i 252), 134293#(<= proc_i 256), 134298#(<= proc_i 276), 134299#(<= proc_i 280), 134296#(<= proc_i 268), 134297#(<= proc_i 272), 134302#(<= proc_i 292), 134303#(<= proc_i 296), 134300#(<= proc_i 284), 134301#(<= proc_i 288), 134306#(<= proc_i 308), 134307#(<= proc_i 312), 134304#(<= proc_i 300), 134305#(<= proc_i 304), 134310#(<= proc_i 324), 134311#(<= proc_i 328), 134308#(<= proc_i 316), 134309#(<= proc_i 320), 134314#(<= proc_i 340), 134315#(<= proc_i 344), 134312#(<= proc_i 332), 134313#(<= proc_i 336), 134318#(<= proc_i 356), 134319#(<= proc_i 360), 134316#(<= proc_i 348), 134317#(<= proc_i 352), 134322#(<= proc_i 372), 134323#(<= proc_i 376), 134320#(<= proc_i 364), 134321#(<= proc_i 368), 134326#(<= proc_i 388), 134327#(<= proc_i 392), 134324#(<= proc_i 380), 134325#(<= proc_i 384), 134330#(<= proc_i 404), 134331#(<= proc_i 408), 134328#(<= proc_i 396), 134329#(<= proc_i 400), 134334#(<= proc_i 420), 134335#(<= proc_i 424), 134332#(<= proc_i 412), 134333#(<= proc_i 416), 134338#(<= proc_i 436), 134339#(<= proc_i 440), 134336#(<= proc_i 428), 134337#(<= proc_i 432), 134342#(<= proc_i 452), 134343#(<= proc_i 456), 134340#(<= proc_i 444), 134341#(<= proc_i 448), 134346#(<= proc_i 468), 134347#(<= proc_i 472), 134344#(<= proc_i 460), 134345#(<= proc_i 464), 134350#(<= proc_i 484), 134351#(<= proc_i 488), 134348#(<= proc_i 476), 134349#(<= proc_i 480), 134354#(<= proc_i 500), 134355#(<= proc_i 504), 134352#(<= proc_i 492), 134353#(<= proc_i 496), 134358#(<= proc_i 516), 134359#(<= proc_i 520), 134356#(<= proc_i 508), 134357#(<= proc_i 512), 134362#(<= proc_i 532), 134363#(<= proc_i 536), 134360#(<= proc_i 524), 134361#(<= proc_i 528), 134366#(<= proc_i 548), 134367#(<= proc_i 552), 134364#(<= proc_i 540), 134365#(<= proc_i 544), 134370#(<= proc_i 564), 134371#(<= proc_i 568), 134368#(<= proc_i 556), 134369#(<= proc_i 560), 134374#(<= proc_i 580), 134375#(<= proc_i 584), 134372#(<= proc_i 572), 134373#(<= proc_i 576), 134378#(<= proc_i 596), 134379#(<= proc_i 600), 134376#(<= proc_i 588), 134377#(<= proc_i 592), 134382#(<= proc_i 612), 134383#(<= proc_i 616), 134380#(<= proc_i 604), 134381#(<= proc_i 608), 134386#(<= proc_i 628), 134387#(<= proc_i 632), 134384#(<= proc_i 620), 134385#(<= proc_i 624), 134390#(<= proc_i 644), 134391#(<= proc_i 648), 134388#(<= proc_i 636), 134389#(<= proc_i 640), 134394#(<= proc_i 660), 134395#(<= proc_i 664), 134392#(<= proc_i 652), 134393#(<= proc_i 656), 134398#(<= proc_i 676), 134399#(<= proc_i 680), 134396#(<= proc_i 668), 134397#(<= proc_i 672)] [2018-07-23 13:53:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 29070 backedges. 0 proven. 29070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:24,084 INFO L450 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-07-23 13:53:24,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-07-23 13:53:24,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-07-23 13:53:24,090 INFO L87 Difference]: Start difference. First operand 344 states and 344 transitions. Second operand 173 states. [2018-07-23 13:53:25,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:25,401 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2018-07-23 13:53:25,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-07-23 13:53:25,401 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 343 [2018-07-23 13:53:25,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:25,402 INFO L225 Difference]: With dead ends: 347 [2018-07-23 13:53:25,402 INFO L226 Difference]: Without dead ends: 346 [2018-07-23 13:53:25,404 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-07-23 13:53:25,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-07-23 13:53:25,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2018-07-23 13:53:25,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-07-23 13:53:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2018-07-23 13:53:25,408 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 343 [2018-07-23 13:53:25,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:25,408 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2018-07-23 13:53:25,408 INFO L472 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-07-23 13:53:25,409 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2018-07-23 13:53:25,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-07-23 13:53:25,410 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:25,410 INFO L357 BasicCegarLoop]: trace histogram [172, 171, 1, 1] [2018-07-23 13:53:25,410 INFO L414 AbstractCegarLoop]: === Iteration 172 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:25,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1579980426, now seen corresponding path program 171 times [2018-07-23 13:53:25,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 29412 backedges. 0 proven. 29412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:26,507 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:26,507 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-07-23 13:53:26,507 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:26,508 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:53:26,508 INFO L185 omatonBuilderFactory]: Interpolants [135938#(<= proc_i 600), 135939#(<= proc_i 604), 135936#(<= proc_i 592), 135937#(<= proc_i 596), 135942#(<= proc_i 616), 135943#(<= proc_i 620), 135940#(<= proc_i 608), 135941#(<= proc_i 612), 135946#(<= proc_i 632), 135947#(<= proc_i 636), 135944#(<= proc_i 624), 135945#(<= proc_i 628), 135950#(<= proc_i 648), 135951#(<= proc_i 652), 135948#(<= proc_i 640), 135949#(<= proc_i 644), 135954#(<= proc_i 664), 135955#(<= proc_i 668), 135952#(<= proc_i 656), 135953#(<= proc_i 660), 135958#(<= proc_i 680), 135959#(<= proc_i 684), 135956#(<= proc_i 672), 135957#(<= proc_i 676), 135786#true, 135787#false, 135790#(<= proc_i 8), 135791#(<= proc_i 12), 135788#(<= proc_i 0), 135789#(<= proc_i 4), 135794#(<= proc_i 24), 135795#(<= proc_i 28), 135792#(<= proc_i 16), 135793#(<= proc_i 20), 135798#(<= proc_i 40), 135799#(<= proc_i 44), 135796#(<= proc_i 32), 135797#(<= proc_i 36), 135802#(<= proc_i 56), 135803#(<= proc_i 60), 135800#(<= proc_i 48), 135801#(<= proc_i 52), 135806#(<= proc_i 72), 135807#(<= proc_i 76), 135804#(<= proc_i 64), 135805#(<= proc_i 68), 135810#(<= proc_i 88), 135811#(<= proc_i 92), 135808#(<= proc_i 80), 135809#(<= proc_i 84), 135814#(<= proc_i 104), 135815#(<= proc_i 108), 135812#(<= proc_i 96), 135813#(<= proc_i 100), 135818#(<= proc_i 120), 135819#(<= proc_i 124), 135816#(<= proc_i 112), 135817#(<= proc_i 116), 135822#(<= proc_i 136), 135823#(<= proc_i 140), 135820#(<= proc_i 128), 135821#(<= proc_i 132), 135826#(<= proc_i 152), 135827#(<= proc_i 156), 135824#(<= proc_i 144), 135825#(<= proc_i 148), 135830#(<= proc_i 168), 135831#(<= proc_i 172), 135828#(<= proc_i 160), 135829#(<= proc_i 164), 135834#(<= proc_i 184), 135835#(<= proc_i 188), 135832#(<= proc_i 176), 135833#(<= proc_i 180), 135838#(<= proc_i 200), 135839#(<= proc_i 204), 135836#(<= proc_i 192), 135837#(<= proc_i 196), 135842#(<= proc_i 216), 135843#(<= proc_i 220), 135840#(<= proc_i 208), 135841#(<= proc_i 212), 135846#(<= proc_i 232), 135847#(<= proc_i 236), 135844#(<= proc_i 224), 135845#(<= proc_i 228), 135850#(<= proc_i 248), 135851#(<= proc_i 252), 135848#(<= proc_i 240), 135849#(<= proc_i 244), 135854#(<= proc_i 264), 135855#(<= proc_i 268), 135852#(<= proc_i 256), 135853#(<= proc_i 260), 135858#(<= proc_i 280), 135859#(<= proc_i 284), 135856#(<= proc_i 272), 135857#(<= proc_i 276), 135862#(<= proc_i 296), 135863#(<= proc_i 300), 135860#(<= proc_i 288), 135861#(<= proc_i 292), 135866#(<= proc_i 312), 135867#(<= proc_i 316), 135864#(<= proc_i 304), 135865#(<= proc_i 308), 135870#(<= proc_i 328), 135871#(<= proc_i 332), 135868#(<= proc_i 320), 135869#(<= proc_i 324), 135874#(<= proc_i 344), 135875#(<= proc_i 348), 135872#(<= proc_i 336), 135873#(<= proc_i 340), 135878#(<= proc_i 360), 135879#(<= proc_i 364), 135876#(<= proc_i 352), 135877#(<= proc_i 356), 135882#(<= proc_i 376), 135883#(<= proc_i 380), 135880#(<= proc_i 368), 135881#(<= proc_i 372), 135886#(<= proc_i 392), 135887#(<= proc_i 396), 135884#(<= proc_i 384), 135885#(<= proc_i 388), 135890#(<= proc_i 408), 135891#(<= proc_i 412), 135888#(<= proc_i 400), 135889#(<= proc_i 404), 135894#(<= proc_i 424), 135895#(<= proc_i 428), 135892#(<= proc_i 416), 135893#(<= proc_i 420), 135898#(<= proc_i 440), 135899#(<= proc_i 444), 135896#(<= proc_i 432), 135897#(<= proc_i 436), 135902#(<= proc_i 456), 135903#(<= proc_i 460), 135900#(<= proc_i 448), 135901#(<= proc_i 452), 135906#(<= proc_i 472), 135907#(<= proc_i 476), 135904#(<= proc_i 464), 135905#(<= proc_i 468), 135910#(<= proc_i 488), 135911#(<= proc_i 492), 135908#(<= proc_i 480), 135909#(<= proc_i 484), 135914#(<= proc_i 504), 135915#(<= proc_i 508), 135912#(<= proc_i 496), 135913#(<= proc_i 500), 135918#(<= proc_i 520), 135919#(<= proc_i 524), 135916#(<= proc_i 512), 135917#(<= proc_i 516), 135922#(<= proc_i 536), 135923#(<= proc_i 540), 135920#(<= proc_i 528), 135921#(<= proc_i 532), 135926#(<= proc_i 552), 135927#(<= proc_i 556), 135924#(<= proc_i 544), 135925#(<= proc_i 548), 135930#(<= proc_i 568), 135931#(<= proc_i 572), 135928#(<= proc_i 560), 135929#(<= proc_i 564), 135934#(<= proc_i 584), 135935#(<= proc_i 588), 135932#(<= proc_i 576), 135933#(<= proc_i 580)] [2018-07-23 13:53:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 29412 backedges. 0 proven. 29412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:26,510 INFO L450 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-07-23 13:53:26,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-07-23 13:53:26,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-07-23 13:53:26,513 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 174 states. [2018-07-23 13:53:27,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:27,297 INFO L93 Difference]: Finished difference Result 349 states and 349 transitions. [2018-07-23 13:53:27,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-07-23 13:53:27,297 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 345 [2018-07-23 13:53:27,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:27,298 INFO L225 Difference]: With dead ends: 349 [2018-07-23 13:53:27,298 INFO L226 Difference]: Without dead ends: 348 [2018-07-23 13:53:27,299 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-07-23 13:53:27,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-07-23 13:53:27,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2018-07-23 13:53:27,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-07-23 13:53:27,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 348 transitions. [2018-07-23 13:53:27,304 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 348 transitions. Word has length 345 [2018-07-23 13:53:27,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:27,304 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 348 transitions. [2018-07-23 13:53:27,305 INFO L472 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-07-23 13:53:27,305 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 348 transitions. [2018-07-23 13:53:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-07-23 13:53:27,306 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:27,306 INFO L357 BasicCegarLoop]: trace histogram [173, 172, 1, 1] [2018-07-23 13:53:27,306 INFO L414 AbstractCegarLoop]: === Iteration 173 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:27,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2057234488, now seen corresponding path program 172 times [2018-07-23 13:53:27,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 29756 backedges. 0 proven. 29756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:28,366 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:28,366 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-07-23 13:53:28,367 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:28,367 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:53:28,367 INFO L185 omatonBuilderFactory]: Interpolants [137474#(<= proc_i 472), 137475#(<= proc_i 476), 137472#(<= proc_i 464), 137473#(<= proc_i 468), 137478#(<= proc_i 488), 137479#(<= proc_i 492), 137476#(<= proc_i 480), 137477#(<= proc_i 484), 137482#(<= proc_i 504), 137483#(<= proc_i 508), 137480#(<= proc_i 496), 137481#(<= proc_i 500), 137486#(<= proc_i 520), 137487#(<= proc_i 524), 137484#(<= proc_i 512), 137485#(<= proc_i 516), 137490#(<= proc_i 536), 137491#(<= proc_i 540), 137488#(<= proc_i 528), 137489#(<= proc_i 532), 137494#(<= proc_i 552), 137495#(<= proc_i 556), 137492#(<= proc_i 544), 137493#(<= proc_i 548), 137498#(<= proc_i 568), 137499#(<= proc_i 572), 137496#(<= proc_i 560), 137497#(<= proc_i 564), 137502#(<= proc_i 584), 137503#(<= proc_i 588), 137500#(<= proc_i 576), 137501#(<= proc_i 580), 137506#(<= proc_i 600), 137507#(<= proc_i 604), 137504#(<= proc_i 592), 137505#(<= proc_i 596), 137510#(<= proc_i 616), 137511#(<= proc_i 620), 137508#(<= proc_i 608), 137509#(<= proc_i 612), 137514#(<= proc_i 632), 137515#(<= proc_i 636), 137512#(<= proc_i 624), 137513#(<= proc_i 628), 137518#(<= proc_i 648), 137519#(<= proc_i 652), 137516#(<= proc_i 640), 137517#(<= proc_i 644), 137522#(<= proc_i 664), 137523#(<= proc_i 668), 137520#(<= proc_i 656), 137521#(<= proc_i 660), 137526#(<= proc_i 680), 137527#(<= proc_i 684), 137524#(<= proc_i 672), 137525#(<= proc_i 676), 137528#(<= proc_i 688), 137354#true, 137355#false, 137358#(<= proc_i 8), 137359#(<= proc_i 12), 137356#(<= proc_i 0), 137357#(<= proc_i 4), 137362#(<= proc_i 24), 137363#(<= proc_i 28), 137360#(<= proc_i 16), 137361#(<= proc_i 20), 137366#(<= proc_i 40), 137367#(<= proc_i 44), 137364#(<= proc_i 32), 137365#(<= proc_i 36), 137370#(<= proc_i 56), 137371#(<= proc_i 60), 137368#(<= proc_i 48), 137369#(<= proc_i 52), 137374#(<= proc_i 72), 137375#(<= proc_i 76), 137372#(<= proc_i 64), 137373#(<= proc_i 68), 137378#(<= proc_i 88), 137379#(<= proc_i 92), 137376#(<= proc_i 80), 137377#(<= proc_i 84), 137382#(<= proc_i 104), 137383#(<= proc_i 108), 137380#(<= proc_i 96), 137381#(<= proc_i 100), 137386#(<= proc_i 120), 137387#(<= proc_i 124), 137384#(<= proc_i 112), 137385#(<= proc_i 116), 137390#(<= proc_i 136), 137391#(<= proc_i 140), 137388#(<= proc_i 128), 137389#(<= proc_i 132), 137394#(<= proc_i 152), 137395#(<= proc_i 156), 137392#(<= proc_i 144), 137393#(<= proc_i 148), 137398#(<= proc_i 168), 137399#(<= proc_i 172), 137396#(<= proc_i 160), 137397#(<= proc_i 164), 137402#(<= proc_i 184), 137403#(<= proc_i 188), 137400#(<= proc_i 176), 137401#(<= proc_i 180), 137406#(<= proc_i 200), 137407#(<= proc_i 204), 137404#(<= proc_i 192), 137405#(<= proc_i 196), 137410#(<= proc_i 216), 137411#(<= proc_i 220), 137408#(<= proc_i 208), 137409#(<= proc_i 212), 137414#(<= proc_i 232), 137415#(<= proc_i 236), 137412#(<= proc_i 224), 137413#(<= proc_i 228), 137418#(<= proc_i 248), 137419#(<= proc_i 252), 137416#(<= proc_i 240), 137417#(<= proc_i 244), 137422#(<= proc_i 264), 137423#(<= proc_i 268), 137420#(<= proc_i 256), 137421#(<= proc_i 260), 137426#(<= proc_i 280), 137427#(<= proc_i 284), 137424#(<= proc_i 272), 137425#(<= proc_i 276), 137430#(<= proc_i 296), 137431#(<= proc_i 300), 137428#(<= proc_i 288), 137429#(<= proc_i 292), 137434#(<= proc_i 312), 137435#(<= proc_i 316), 137432#(<= proc_i 304), 137433#(<= proc_i 308), 137438#(<= proc_i 328), 137439#(<= proc_i 332), 137436#(<= proc_i 320), 137437#(<= proc_i 324), 137442#(<= proc_i 344), 137443#(<= proc_i 348), 137440#(<= proc_i 336), 137441#(<= proc_i 340), 137446#(<= proc_i 360), 137447#(<= proc_i 364), 137444#(<= proc_i 352), 137445#(<= proc_i 356), 137450#(<= proc_i 376), 137451#(<= proc_i 380), 137448#(<= proc_i 368), 137449#(<= proc_i 372), 137454#(<= proc_i 392), 137455#(<= proc_i 396), 137452#(<= proc_i 384), 137453#(<= proc_i 388), 137458#(<= proc_i 408), 137459#(<= proc_i 412), 137456#(<= proc_i 400), 137457#(<= proc_i 404), 137462#(<= proc_i 424), 137463#(<= proc_i 428), 137460#(<= proc_i 416), 137461#(<= proc_i 420), 137466#(<= proc_i 440), 137467#(<= proc_i 444), 137464#(<= proc_i 432), 137465#(<= proc_i 436), 137470#(<= proc_i 456), 137471#(<= proc_i 460), 137468#(<= proc_i 448), 137469#(<= proc_i 452)] [2018-07-23 13:53:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 29756 backedges. 0 proven. 29756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:28,368 INFO L450 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-07-23 13:53:28,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-07-23 13:53:28,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-07-23 13:53:28,371 INFO L87 Difference]: Start difference. First operand 348 states and 348 transitions. Second operand 175 states. [2018-07-23 13:53:28,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:28,769 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2018-07-23 13:53:28,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-07-23 13:53:28,770 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 347 [2018-07-23 13:53:28,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:28,770 INFO L225 Difference]: With dead ends: 351 [2018-07-23 13:53:28,770 INFO L226 Difference]: Without dead ends: 350 [2018-07-23 13:53:28,772 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-07-23 13:53:28,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-07-23 13:53:28,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2018-07-23 13:53:28,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-07-23 13:53:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 350 transitions. [2018-07-23 13:53:28,775 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 350 transitions. Word has length 347 [2018-07-23 13:53:28,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:28,776 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 350 transitions. [2018-07-23 13:53:28,776 INFO L472 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-07-23 13:53:28,776 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 350 transitions. [2018-07-23 13:53:28,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-07-23 13:53:28,777 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:28,777 INFO L357 BasicCegarLoop]: trace histogram [174, 173, 1, 1] [2018-07-23 13:53:28,777 INFO L414 AbstractCegarLoop]: === Iteration 174 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:28,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1317387898, now seen corresponding path program 173 times [2018-07-23 13:53:28,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 30102 backedges. 0 proven. 30102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:29,788 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:29,788 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-07-23 13:53:29,788 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:29,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:53:29,789 INFO L185 omatonBuilderFactory]: Interpolants [139010#(<= proc_i 308), 139011#(<= proc_i 312), 139008#(<= proc_i 300), 139009#(<= proc_i 304), 139014#(<= proc_i 324), 139015#(<= proc_i 328), 139012#(<= proc_i 316), 139013#(<= proc_i 320), 139018#(<= proc_i 340), 139019#(<= proc_i 344), 139016#(<= proc_i 332), 139017#(<= proc_i 336), 139022#(<= proc_i 356), 139023#(<= proc_i 360), 139020#(<= proc_i 348), 139021#(<= proc_i 352), 139026#(<= proc_i 372), 139027#(<= proc_i 376), 139024#(<= proc_i 364), 139025#(<= proc_i 368), 139030#(<= proc_i 388), 139031#(<= proc_i 392), 139028#(<= proc_i 380), 139029#(<= proc_i 384), 139034#(<= proc_i 404), 139035#(<= proc_i 408), 139032#(<= proc_i 396), 139033#(<= proc_i 400), 139038#(<= proc_i 420), 139039#(<= proc_i 424), 139036#(<= proc_i 412), 139037#(<= proc_i 416), 139042#(<= proc_i 436), 139043#(<= proc_i 440), 139040#(<= proc_i 428), 139041#(<= proc_i 432), 139046#(<= proc_i 452), 139047#(<= proc_i 456), 139044#(<= proc_i 444), 139045#(<= proc_i 448), 139050#(<= proc_i 468), 139051#(<= proc_i 472), 139048#(<= proc_i 460), 139049#(<= proc_i 464), 139054#(<= proc_i 484), 139055#(<= proc_i 488), 139052#(<= proc_i 476), 139053#(<= proc_i 480), 139058#(<= proc_i 500), 139059#(<= proc_i 504), 139056#(<= proc_i 492), 139057#(<= proc_i 496), 139062#(<= proc_i 516), 139063#(<= proc_i 520), 139060#(<= proc_i 508), 139061#(<= proc_i 512), 139066#(<= proc_i 532), 139067#(<= proc_i 536), 139064#(<= proc_i 524), 139065#(<= proc_i 528), 139070#(<= proc_i 548), 139071#(<= proc_i 552), 139068#(<= proc_i 540), 139069#(<= proc_i 544), 139074#(<= proc_i 564), 139075#(<= proc_i 568), 139072#(<= proc_i 556), 139073#(<= proc_i 560), 139078#(<= proc_i 580), 139079#(<= proc_i 584), 139076#(<= proc_i 572), 139077#(<= proc_i 576), 139082#(<= proc_i 596), 139083#(<= proc_i 600), 139080#(<= proc_i 588), 139081#(<= proc_i 592), 139086#(<= proc_i 612), 139087#(<= proc_i 616), 139084#(<= proc_i 604), 139085#(<= proc_i 608), 139090#(<= proc_i 628), 139091#(<= proc_i 632), 139088#(<= proc_i 620), 139089#(<= proc_i 624), 139094#(<= proc_i 644), 139095#(<= proc_i 648), 139092#(<= proc_i 636), 139093#(<= proc_i 640), 139098#(<= proc_i 660), 139099#(<= proc_i 664), 139096#(<= proc_i 652), 139097#(<= proc_i 656), 139102#(<= proc_i 676), 139103#(<= proc_i 680), 139100#(<= proc_i 668), 139101#(<= proc_i 672), 139106#(<= proc_i 692), 139104#(<= proc_i 684), 139105#(<= proc_i 688), 138931#true, 138934#(<= proc_i 4), 138935#(<= proc_i 8), 138932#false, 138933#(<= proc_i 0), 138938#(<= proc_i 20), 138939#(<= proc_i 24), 138936#(<= proc_i 12), 138937#(<= proc_i 16), 138942#(<= proc_i 36), 138943#(<= proc_i 40), 138940#(<= proc_i 28), 138941#(<= proc_i 32), 138946#(<= proc_i 52), 138947#(<= proc_i 56), 138944#(<= proc_i 44), 138945#(<= proc_i 48), 138950#(<= proc_i 68), 138951#(<= proc_i 72), 138948#(<= proc_i 60), 138949#(<= proc_i 64), 138954#(<= proc_i 84), 138955#(<= proc_i 88), 138952#(<= proc_i 76), 138953#(<= proc_i 80), 138958#(<= proc_i 100), 138959#(<= proc_i 104), 138956#(<= proc_i 92), 138957#(<= proc_i 96), 138962#(<= proc_i 116), 138963#(<= proc_i 120), 138960#(<= proc_i 108), 138961#(<= proc_i 112), 138966#(<= proc_i 132), 138967#(<= proc_i 136), 138964#(<= proc_i 124), 138965#(<= proc_i 128), 138970#(<= proc_i 148), 138971#(<= proc_i 152), 138968#(<= proc_i 140), 138969#(<= proc_i 144), 138974#(<= proc_i 164), 138975#(<= proc_i 168), 138972#(<= proc_i 156), 138973#(<= proc_i 160), 138978#(<= proc_i 180), 138979#(<= proc_i 184), 138976#(<= proc_i 172), 138977#(<= proc_i 176), 138982#(<= proc_i 196), 138983#(<= proc_i 200), 138980#(<= proc_i 188), 138981#(<= proc_i 192), 138986#(<= proc_i 212), 138987#(<= proc_i 216), 138984#(<= proc_i 204), 138985#(<= proc_i 208), 138990#(<= proc_i 228), 138991#(<= proc_i 232), 138988#(<= proc_i 220), 138989#(<= proc_i 224), 138994#(<= proc_i 244), 138995#(<= proc_i 248), 138992#(<= proc_i 236), 138993#(<= proc_i 240), 138998#(<= proc_i 260), 138999#(<= proc_i 264), 138996#(<= proc_i 252), 138997#(<= proc_i 256), 139002#(<= proc_i 276), 139003#(<= proc_i 280), 139000#(<= proc_i 268), 139001#(<= proc_i 272), 139006#(<= proc_i 292), 139007#(<= proc_i 296), 139004#(<= proc_i 284), 139005#(<= proc_i 288)] [2018-07-23 13:53:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 30102 backedges. 0 proven. 30102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:29,791 INFO L450 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-07-23 13:53:29,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-07-23 13:53:29,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-07-23 13:53:29,794 INFO L87 Difference]: Start difference. First operand 350 states and 350 transitions. Second operand 176 states. [2018-07-23 13:53:30,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:30,314 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-07-23 13:53:30,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-07-23 13:53:30,314 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 349 [2018-07-23 13:53:30,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:30,314 INFO L225 Difference]: With dead ends: 353 [2018-07-23 13:53:30,315 INFO L226 Difference]: Without dead ends: 352 [2018-07-23 13:53:30,315 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-07-23 13:53:30,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-07-23 13:53:30,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2018-07-23 13:53:30,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-07-23 13:53:30,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 352 transitions. [2018-07-23 13:53:30,318 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 352 transitions. Word has length 349 [2018-07-23 13:53:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:30,319 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 352 transitions. [2018-07-23 13:53:30,319 INFO L472 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-07-23 13:53:30,319 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 352 transitions. [2018-07-23 13:53:30,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-07-23 13:53:30,320 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:30,320 INFO L357 BasicCegarLoop]: trace histogram [175, 174, 1, 1] [2018-07-23 13:53:30,320 INFO L414 AbstractCegarLoop]: === Iteration 175 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:30,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1005581252, now seen corresponding path program 174 times [2018-07-23 13:53:30,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 30450 backedges. 0 proven. 30450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:31,373 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:31,374 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-07-23 13:53:31,374 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:31,374 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:53:31,374 INFO L185 omatonBuilderFactory]: Interpolants [140546#(<= proc_i 108), 140547#(<= proc_i 112), 140544#(<= proc_i 100), 140545#(<= proc_i 104), 140550#(<= proc_i 124), 140551#(<= proc_i 128), 140548#(<= proc_i 116), 140549#(<= proc_i 120), 140554#(<= proc_i 140), 140555#(<= proc_i 144), 140552#(<= proc_i 132), 140553#(<= proc_i 136), 140558#(<= proc_i 156), 140559#(<= proc_i 160), 140556#(<= proc_i 148), 140557#(<= proc_i 152), 140562#(<= proc_i 172), 140563#(<= proc_i 176), 140560#(<= proc_i 164), 140561#(<= proc_i 168), 140566#(<= proc_i 188), 140567#(<= proc_i 192), 140564#(<= proc_i 180), 140565#(<= proc_i 184), 140570#(<= proc_i 204), 140571#(<= proc_i 208), 140568#(<= proc_i 196), 140569#(<= proc_i 200), 140574#(<= proc_i 220), 140575#(<= proc_i 224), 140572#(<= proc_i 212), 140573#(<= proc_i 216), 140578#(<= proc_i 236), 140579#(<= proc_i 240), 140576#(<= proc_i 228), 140577#(<= proc_i 232), 140582#(<= proc_i 252), 140583#(<= proc_i 256), 140580#(<= proc_i 244), 140581#(<= proc_i 248), 140586#(<= proc_i 268), 140587#(<= proc_i 272), 140584#(<= proc_i 260), 140585#(<= proc_i 264), 140590#(<= proc_i 284), 140591#(<= proc_i 288), 140588#(<= proc_i 276), 140589#(<= proc_i 280), 140594#(<= proc_i 300), 140595#(<= proc_i 304), 140592#(<= proc_i 292), 140593#(<= proc_i 296), 140598#(<= proc_i 316), 140599#(<= proc_i 320), 140596#(<= proc_i 308), 140597#(<= proc_i 312), 140602#(<= proc_i 332), 140603#(<= proc_i 336), 140600#(<= proc_i 324), 140601#(<= proc_i 328), 140606#(<= proc_i 348), 140607#(<= proc_i 352), 140604#(<= proc_i 340), 140605#(<= proc_i 344), 140610#(<= proc_i 364), 140611#(<= proc_i 368), 140608#(<= proc_i 356), 140609#(<= proc_i 360), 140614#(<= proc_i 380), 140615#(<= proc_i 384), 140612#(<= proc_i 372), 140613#(<= proc_i 376), 140618#(<= proc_i 396), 140619#(<= proc_i 400), 140616#(<= proc_i 388), 140617#(<= proc_i 392), 140622#(<= proc_i 412), 140623#(<= proc_i 416), 140620#(<= proc_i 404), 140621#(<= proc_i 408), 140626#(<= proc_i 428), 140627#(<= proc_i 432), 140624#(<= proc_i 420), 140625#(<= proc_i 424), 140630#(<= proc_i 444), 140631#(<= proc_i 448), 140628#(<= proc_i 436), 140629#(<= proc_i 440), 140634#(<= proc_i 460), 140635#(<= proc_i 464), 140632#(<= proc_i 452), 140633#(<= proc_i 456), 140638#(<= proc_i 476), 140639#(<= proc_i 480), 140636#(<= proc_i 468), 140637#(<= proc_i 472), 140642#(<= proc_i 492), 140643#(<= proc_i 496), 140640#(<= proc_i 484), 140641#(<= proc_i 488), 140646#(<= proc_i 508), 140647#(<= proc_i 512), 140644#(<= proc_i 500), 140645#(<= proc_i 504), 140650#(<= proc_i 524), 140651#(<= proc_i 528), 140648#(<= proc_i 516), 140649#(<= proc_i 520), 140654#(<= proc_i 540), 140655#(<= proc_i 544), 140652#(<= proc_i 532), 140653#(<= proc_i 536), 140658#(<= proc_i 556), 140659#(<= proc_i 560), 140656#(<= proc_i 548), 140657#(<= proc_i 552), 140662#(<= proc_i 572), 140663#(<= proc_i 576), 140660#(<= proc_i 564), 140661#(<= proc_i 568), 140666#(<= proc_i 588), 140667#(<= proc_i 592), 140664#(<= proc_i 580), 140665#(<= proc_i 584), 140670#(<= proc_i 604), 140671#(<= proc_i 608), 140668#(<= proc_i 596), 140669#(<= proc_i 600), 140674#(<= proc_i 620), 140675#(<= proc_i 624), 140672#(<= proc_i 612), 140673#(<= proc_i 616), 140678#(<= proc_i 636), 140679#(<= proc_i 640), 140676#(<= proc_i 628), 140677#(<= proc_i 632), 140682#(<= proc_i 652), 140683#(<= proc_i 656), 140680#(<= proc_i 644), 140681#(<= proc_i 648), 140686#(<= proc_i 668), 140687#(<= proc_i 672), 140684#(<= proc_i 660), 140685#(<= proc_i 664), 140690#(<= proc_i 684), 140691#(<= proc_i 688), 140688#(<= proc_i 676), 140689#(<= proc_i 680), 140692#(<= proc_i 692), 140693#(<= proc_i 696), 140518#false, 140519#(<= proc_i 0), 140517#true, 140522#(<= proc_i 12), 140523#(<= proc_i 16), 140520#(<= proc_i 4), 140521#(<= proc_i 8), 140526#(<= proc_i 28), 140527#(<= proc_i 32), 140524#(<= proc_i 20), 140525#(<= proc_i 24), 140530#(<= proc_i 44), 140531#(<= proc_i 48), 140528#(<= proc_i 36), 140529#(<= proc_i 40), 140534#(<= proc_i 60), 140535#(<= proc_i 64), 140532#(<= proc_i 52), 140533#(<= proc_i 56), 140538#(<= proc_i 76), 140539#(<= proc_i 80), 140536#(<= proc_i 68), 140537#(<= proc_i 72), 140542#(<= proc_i 92), 140543#(<= proc_i 96), 140540#(<= proc_i 84), 140541#(<= proc_i 88)] [2018-07-23 13:53:31,376 INFO L134 CoverageAnalysis]: Checked inductivity of 30450 backedges. 0 proven. 30450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:31,376 INFO L450 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-07-23 13:53:31,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-07-23 13:53:31,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-07-23 13:53:31,380 INFO L87 Difference]: Start difference. First operand 352 states and 352 transitions. Second operand 177 states. [2018-07-23 13:53:32,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:32,526 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-07-23 13:53:32,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-07-23 13:53:32,527 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 351 [2018-07-23 13:53:32,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:32,527 INFO L225 Difference]: With dead ends: 355 [2018-07-23 13:53:32,527 INFO L226 Difference]: Without dead ends: 354 [2018-07-23 13:53:32,529 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-07-23 13:53:32,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-07-23 13:53:32,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2018-07-23 13:53:32,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-07-23 13:53:32,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 354 transitions. [2018-07-23 13:53:32,533 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 354 transitions. Word has length 351 [2018-07-23 13:53:32,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:32,533 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 354 transitions. [2018-07-23 13:53:32,533 INFO L472 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-07-23 13:53:32,533 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 354 transitions. [2018-07-23 13:53:32,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-07-23 13:53:32,534 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:32,534 INFO L357 BasicCegarLoop]: trace histogram [176, 175, 1, 1] [2018-07-23 13:53:32,535 INFO L414 AbstractCegarLoop]: === Iteration 176 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:32,535 INFO L82 PathProgramCache]: Analyzing trace with hash 4059518, now seen corresponding path program 175 times [2018-07-23 13:53:32,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 30800 backedges. 0 proven. 30800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:33,671 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:33,671 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-07-23 13:53:33,671 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:33,671 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:53:33,672 INFO L185 omatonBuilderFactory]: Interpolants [142114#(<= proc_i 0), 142115#(<= proc_i 4), 142112#true, 142113#false, 142118#(<= proc_i 16), 142119#(<= proc_i 20), 142116#(<= proc_i 8), 142117#(<= proc_i 12), 142122#(<= proc_i 32), 142123#(<= proc_i 36), 142120#(<= proc_i 24), 142121#(<= proc_i 28), 142126#(<= proc_i 48), 142127#(<= proc_i 52), 142124#(<= proc_i 40), 142125#(<= proc_i 44), 142130#(<= proc_i 64), 142131#(<= proc_i 68), 142128#(<= proc_i 56), 142129#(<= proc_i 60), 142134#(<= proc_i 80), 142135#(<= proc_i 84), 142132#(<= proc_i 72), 142133#(<= proc_i 76), 142138#(<= proc_i 96), 142139#(<= proc_i 100), 142136#(<= proc_i 88), 142137#(<= proc_i 92), 142142#(<= proc_i 112), 142143#(<= proc_i 116), 142140#(<= proc_i 104), 142141#(<= proc_i 108), 142146#(<= proc_i 128), 142147#(<= proc_i 132), 142144#(<= proc_i 120), 142145#(<= proc_i 124), 142150#(<= proc_i 144), 142151#(<= proc_i 148), 142148#(<= proc_i 136), 142149#(<= proc_i 140), 142154#(<= proc_i 160), 142155#(<= proc_i 164), 142152#(<= proc_i 152), 142153#(<= proc_i 156), 142158#(<= proc_i 176), 142159#(<= proc_i 180), 142156#(<= proc_i 168), 142157#(<= proc_i 172), 142162#(<= proc_i 192), 142163#(<= proc_i 196), 142160#(<= proc_i 184), 142161#(<= proc_i 188), 142166#(<= proc_i 208), 142167#(<= proc_i 212), 142164#(<= proc_i 200), 142165#(<= proc_i 204), 142170#(<= proc_i 224), 142171#(<= proc_i 228), 142168#(<= proc_i 216), 142169#(<= proc_i 220), 142174#(<= proc_i 240), 142175#(<= proc_i 244), 142172#(<= proc_i 232), 142173#(<= proc_i 236), 142178#(<= proc_i 256), 142179#(<= proc_i 260), 142176#(<= proc_i 248), 142177#(<= proc_i 252), 142182#(<= proc_i 272), 142183#(<= proc_i 276), 142180#(<= proc_i 264), 142181#(<= proc_i 268), 142186#(<= proc_i 288), 142187#(<= proc_i 292), 142184#(<= proc_i 280), 142185#(<= proc_i 284), 142190#(<= proc_i 304), 142191#(<= proc_i 308), 142188#(<= proc_i 296), 142189#(<= proc_i 300), 142194#(<= proc_i 320), 142195#(<= proc_i 324), 142192#(<= proc_i 312), 142193#(<= proc_i 316), 142198#(<= proc_i 336), 142199#(<= proc_i 340), 142196#(<= proc_i 328), 142197#(<= proc_i 332), 142202#(<= proc_i 352), 142203#(<= proc_i 356), 142200#(<= proc_i 344), 142201#(<= proc_i 348), 142206#(<= proc_i 368), 142207#(<= proc_i 372), 142204#(<= proc_i 360), 142205#(<= proc_i 364), 142210#(<= proc_i 384), 142211#(<= proc_i 388), 142208#(<= proc_i 376), 142209#(<= proc_i 380), 142214#(<= proc_i 400), 142215#(<= proc_i 404), 142212#(<= proc_i 392), 142213#(<= proc_i 396), 142218#(<= proc_i 416), 142219#(<= proc_i 420), 142216#(<= proc_i 408), 142217#(<= proc_i 412), 142222#(<= proc_i 432), 142223#(<= proc_i 436), 142220#(<= proc_i 424), 142221#(<= proc_i 428), 142226#(<= proc_i 448), 142227#(<= proc_i 452), 142224#(<= proc_i 440), 142225#(<= proc_i 444), 142230#(<= proc_i 464), 142231#(<= proc_i 468), 142228#(<= proc_i 456), 142229#(<= proc_i 460), 142234#(<= proc_i 480), 142235#(<= proc_i 484), 142232#(<= proc_i 472), 142233#(<= proc_i 476), 142238#(<= proc_i 496), 142239#(<= proc_i 500), 142236#(<= proc_i 488), 142237#(<= proc_i 492), 142242#(<= proc_i 512), 142243#(<= proc_i 516), 142240#(<= proc_i 504), 142241#(<= proc_i 508), 142246#(<= proc_i 528), 142247#(<= proc_i 532), 142244#(<= proc_i 520), 142245#(<= proc_i 524), 142250#(<= proc_i 544), 142251#(<= proc_i 548), 142248#(<= proc_i 536), 142249#(<= proc_i 540), 142254#(<= proc_i 560), 142255#(<= proc_i 564), 142252#(<= proc_i 552), 142253#(<= proc_i 556), 142258#(<= proc_i 576), 142259#(<= proc_i 580), 142256#(<= proc_i 568), 142257#(<= proc_i 572), 142262#(<= proc_i 592), 142263#(<= proc_i 596), 142260#(<= proc_i 584), 142261#(<= proc_i 588), 142266#(<= proc_i 608), 142267#(<= proc_i 612), 142264#(<= proc_i 600), 142265#(<= proc_i 604), 142270#(<= proc_i 624), 142271#(<= proc_i 628), 142268#(<= proc_i 616), 142269#(<= proc_i 620), 142274#(<= proc_i 640), 142275#(<= proc_i 644), 142272#(<= proc_i 632), 142273#(<= proc_i 636), 142278#(<= proc_i 656), 142279#(<= proc_i 660), 142276#(<= proc_i 648), 142277#(<= proc_i 652), 142282#(<= proc_i 672), 142283#(<= proc_i 676), 142280#(<= proc_i 664), 142281#(<= proc_i 668), 142286#(<= proc_i 688), 142287#(<= proc_i 692), 142284#(<= proc_i 680), 142285#(<= proc_i 684), 142288#(<= proc_i 696), 142289#(<= proc_i 700)] [2018-07-23 13:53:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 30800 backedges. 0 proven. 30800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:33,673 INFO L450 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-07-23 13:53:33,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-07-23 13:53:33,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-07-23 13:53:33,677 INFO L87 Difference]: Start difference. First operand 354 states and 354 transitions. Second operand 178 states. [2018-07-23 13:53:35,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:35,381 INFO L93 Difference]: Finished difference Result 357 states and 357 transitions. [2018-07-23 13:53:35,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-07-23 13:53:35,381 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 353 [2018-07-23 13:53:35,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:35,382 INFO L225 Difference]: With dead ends: 357 [2018-07-23 13:53:35,382 INFO L226 Difference]: Without dead ends: 356 [2018-07-23 13:53:35,384 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-07-23 13:53:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-07-23 13:53:35,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-07-23 13:53:35,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-07-23 13:53:35,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2018-07-23 13:53:35,388 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 353 [2018-07-23 13:53:35,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:35,388 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2018-07-23 13:53:35,388 INFO L472 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-07-23 13:53:35,388 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2018-07-23 13:53:35,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-07-23 13:53:35,389 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:35,389 INFO L357 BasicCegarLoop]: trace histogram [177, 176, 1, 1] [2018-07-23 13:53:35,389 INFO L414 AbstractCegarLoop]: === Iteration 177 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:35,390 INFO L82 PathProgramCache]: Analyzing trace with hash -393769408, now seen corresponding path program 176 times [2018-07-23 13:53:35,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:36,559 INFO L134 CoverageAnalysis]: Checked inductivity of 31152 backedges. 0 proven. 31152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:36,559 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:36,560 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-07-23 13:53:36,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:36,560 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:53:36,560 INFO L185 omatonBuilderFactory]: Interpolants [143874#(<= proc_i 624), 143875#(<= proc_i 628), 143872#(<= proc_i 616), 143873#(<= proc_i 620), 143878#(<= proc_i 640), 143879#(<= proc_i 644), 143876#(<= proc_i 632), 143877#(<= proc_i 636), 143882#(<= proc_i 656), 143883#(<= proc_i 660), 143880#(<= proc_i 648), 143881#(<= proc_i 652), 143886#(<= proc_i 672), 143887#(<= proc_i 676), 143884#(<= proc_i 664), 143885#(<= proc_i 668), 143890#(<= proc_i 688), 143891#(<= proc_i 692), 143888#(<= proc_i 680), 143889#(<= proc_i 684), 143894#(<= proc_i 704), 143892#(<= proc_i 696), 143893#(<= proc_i 700), 143718#(<= proc_i 0), 143719#(<= proc_i 4), 143716#true, 143717#false, 143722#(<= proc_i 16), 143723#(<= proc_i 20), 143720#(<= proc_i 8), 143721#(<= proc_i 12), 143726#(<= proc_i 32), 143727#(<= proc_i 36), 143724#(<= proc_i 24), 143725#(<= proc_i 28), 143730#(<= proc_i 48), 143731#(<= proc_i 52), 143728#(<= proc_i 40), 143729#(<= proc_i 44), 143734#(<= proc_i 64), 143735#(<= proc_i 68), 143732#(<= proc_i 56), 143733#(<= proc_i 60), 143738#(<= proc_i 80), 143739#(<= proc_i 84), 143736#(<= proc_i 72), 143737#(<= proc_i 76), 143742#(<= proc_i 96), 143743#(<= proc_i 100), 143740#(<= proc_i 88), 143741#(<= proc_i 92), 143746#(<= proc_i 112), 143747#(<= proc_i 116), 143744#(<= proc_i 104), 143745#(<= proc_i 108), 143750#(<= proc_i 128), 143751#(<= proc_i 132), 143748#(<= proc_i 120), 143749#(<= proc_i 124), 143754#(<= proc_i 144), 143755#(<= proc_i 148), 143752#(<= proc_i 136), 143753#(<= proc_i 140), 143758#(<= proc_i 160), 143759#(<= proc_i 164), 143756#(<= proc_i 152), 143757#(<= proc_i 156), 143762#(<= proc_i 176), 143763#(<= proc_i 180), 143760#(<= proc_i 168), 143761#(<= proc_i 172), 143766#(<= proc_i 192), 143767#(<= proc_i 196), 143764#(<= proc_i 184), 143765#(<= proc_i 188), 143770#(<= proc_i 208), 143771#(<= proc_i 212), 143768#(<= proc_i 200), 143769#(<= proc_i 204), 143774#(<= proc_i 224), 143775#(<= proc_i 228), 143772#(<= proc_i 216), 143773#(<= proc_i 220), 143778#(<= proc_i 240), 143779#(<= proc_i 244), 143776#(<= proc_i 232), 143777#(<= proc_i 236), 143782#(<= proc_i 256), 143783#(<= proc_i 260), 143780#(<= proc_i 248), 143781#(<= proc_i 252), 143786#(<= proc_i 272), 143787#(<= proc_i 276), 143784#(<= proc_i 264), 143785#(<= proc_i 268), 143790#(<= proc_i 288), 143791#(<= proc_i 292), 143788#(<= proc_i 280), 143789#(<= proc_i 284), 143794#(<= proc_i 304), 143795#(<= proc_i 308), 143792#(<= proc_i 296), 143793#(<= proc_i 300), 143798#(<= proc_i 320), 143799#(<= proc_i 324), 143796#(<= proc_i 312), 143797#(<= proc_i 316), 143802#(<= proc_i 336), 143803#(<= proc_i 340), 143800#(<= proc_i 328), 143801#(<= proc_i 332), 143806#(<= proc_i 352), 143807#(<= proc_i 356), 143804#(<= proc_i 344), 143805#(<= proc_i 348), 143810#(<= proc_i 368), 143811#(<= proc_i 372), 143808#(<= proc_i 360), 143809#(<= proc_i 364), 143814#(<= proc_i 384), 143815#(<= proc_i 388), 143812#(<= proc_i 376), 143813#(<= proc_i 380), 143818#(<= proc_i 400), 143819#(<= proc_i 404), 143816#(<= proc_i 392), 143817#(<= proc_i 396), 143822#(<= proc_i 416), 143823#(<= proc_i 420), 143820#(<= proc_i 408), 143821#(<= proc_i 412), 143826#(<= proc_i 432), 143827#(<= proc_i 436), 143824#(<= proc_i 424), 143825#(<= proc_i 428), 143830#(<= proc_i 448), 143831#(<= proc_i 452), 143828#(<= proc_i 440), 143829#(<= proc_i 444), 143834#(<= proc_i 464), 143835#(<= proc_i 468), 143832#(<= proc_i 456), 143833#(<= proc_i 460), 143838#(<= proc_i 480), 143839#(<= proc_i 484), 143836#(<= proc_i 472), 143837#(<= proc_i 476), 143842#(<= proc_i 496), 143843#(<= proc_i 500), 143840#(<= proc_i 488), 143841#(<= proc_i 492), 143846#(<= proc_i 512), 143847#(<= proc_i 516), 143844#(<= proc_i 504), 143845#(<= proc_i 508), 143850#(<= proc_i 528), 143851#(<= proc_i 532), 143848#(<= proc_i 520), 143849#(<= proc_i 524), 143854#(<= proc_i 544), 143855#(<= proc_i 548), 143852#(<= proc_i 536), 143853#(<= proc_i 540), 143858#(<= proc_i 560), 143859#(<= proc_i 564), 143856#(<= proc_i 552), 143857#(<= proc_i 556), 143862#(<= proc_i 576), 143863#(<= proc_i 580), 143860#(<= proc_i 568), 143861#(<= proc_i 572), 143866#(<= proc_i 592), 143867#(<= proc_i 596), 143864#(<= proc_i 584), 143865#(<= proc_i 588), 143870#(<= proc_i 608), 143871#(<= proc_i 612), 143868#(<= proc_i 600), 143869#(<= proc_i 604)] [2018-07-23 13:53:36,562 INFO L134 CoverageAnalysis]: Checked inductivity of 31152 backedges. 0 proven. 31152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:36,562 INFO L450 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-07-23 13:53:36,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-07-23 13:53:36,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-07-23 13:53:36,565 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 179 states. [2018-07-23 13:53:37,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:37,601 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2018-07-23 13:53:37,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-07-23 13:53:37,601 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 355 [2018-07-23 13:53:37,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:37,602 INFO L225 Difference]: With dead ends: 359 [2018-07-23 13:53:37,602 INFO L226 Difference]: Without dead ends: 358 [2018-07-23 13:53:37,604 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-07-23 13:53:37,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-07-23 13:53:37,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2018-07-23 13:53:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-07-23 13:53:37,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 358 transitions. [2018-07-23 13:53:37,608 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 358 transitions. Word has length 355 [2018-07-23 13:53:37,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:37,608 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 358 transitions. [2018-07-23 13:53:37,608 INFO L472 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-07-23 13:53:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 358 transitions. [2018-07-23 13:53:37,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-07-23 13:53:37,609 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:37,609 INFO L357 BasicCegarLoop]: trace histogram [178, 177, 1, 1] [2018-07-23 13:53:37,609 INFO L414 AbstractCegarLoop]: === Iteration 178 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:37,610 INFO L82 PathProgramCache]: Analyzing trace with hash -455277950, now seen corresponding path program 177 times [2018-07-23 13:53:37,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:38,839 INFO L134 CoverageAnalysis]: Checked inductivity of 31506 backedges. 0 proven. 31506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:38,839 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:38,840 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2018-07-23 13:53:38,840 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:38,840 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:53:38,840 INFO L185 omatonBuilderFactory]: Interpolants [145410#(<= proc_i 316), 145411#(<= proc_i 320), 145408#(<= proc_i 308), 145409#(<= proc_i 312), 145414#(<= proc_i 332), 145415#(<= proc_i 336), 145412#(<= proc_i 324), 145413#(<= proc_i 328), 145418#(<= proc_i 348), 145419#(<= proc_i 352), 145416#(<= proc_i 340), 145417#(<= proc_i 344), 145422#(<= proc_i 364), 145423#(<= proc_i 368), 145420#(<= proc_i 356), 145421#(<= proc_i 360), 145426#(<= proc_i 380), 145427#(<= proc_i 384), 145424#(<= proc_i 372), 145425#(<= proc_i 376), 145430#(<= proc_i 396), 145431#(<= proc_i 400), 145428#(<= proc_i 388), 145429#(<= proc_i 392), 145434#(<= proc_i 412), 145435#(<= proc_i 416), 145432#(<= proc_i 404), 145433#(<= proc_i 408), 145438#(<= proc_i 428), 145439#(<= proc_i 432), 145436#(<= proc_i 420), 145437#(<= proc_i 424), 145442#(<= proc_i 444), 145443#(<= proc_i 448), 145440#(<= proc_i 436), 145441#(<= proc_i 440), 145446#(<= proc_i 460), 145447#(<= proc_i 464), 145444#(<= proc_i 452), 145445#(<= proc_i 456), 145450#(<= proc_i 476), 145451#(<= proc_i 480), 145448#(<= proc_i 468), 145449#(<= proc_i 472), 145454#(<= proc_i 492), 145455#(<= proc_i 496), 145452#(<= proc_i 484), 145453#(<= proc_i 488), 145458#(<= proc_i 508), 145459#(<= proc_i 512), 145456#(<= proc_i 500), 145457#(<= proc_i 504), 145462#(<= proc_i 524), 145463#(<= proc_i 528), 145460#(<= proc_i 516), 145461#(<= proc_i 520), 145466#(<= proc_i 540), 145467#(<= proc_i 544), 145464#(<= proc_i 532), 145465#(<= proc_i 536), 145470#(<= proc_i 556), 145471#(<= proc_i 560), 145468#(<= proc_i 548), 145469#(<= proc_i 552), 145474#(<= proc_i 572), 145475#(<= proc_i 576), 145472#(<= proc_i 564), 145473#(<= proc_i 568), 145478#(<= proc_i 588), 145479#(<= proc_i 592), 145476#(<= proc_i 580), 145477#(<= proc_i 584), 145482#(<= proc_i 604), 145483#(<= proc_i 608), 145480#(<= proc_i 596), 145481#(<= proc_i 600), 145486#(<= proc_i 620), 145487#(<= proc_i 624), 145484#(<= proc_i 612), 145485#(<= proc_i 616), 145490#(<= proc_i 636), 145491#(<= proc_i 640), 145488#(<= proc_i 628), 145489#(<= proc_i 632), 145494#(<= proc_i 652), 145495#(<= proc_i 656), 145492#(<= proc_i 644), 145493#(<= proc_i 648), 145498#(<= proc_i 668), 145499#(<= proc_i 672), 145496#(<= proc_i 660), 145497#(<= proc_i 664), 145502#(<= proc_i 684), 145503#(<= proc_i 688), 145500#(<= proc_i 676), 145501#(<= proc_i 680), 145506#(<= proc_i 700), 145507#(<= proc_i 704), 145504#(<= proc_i 692), 145505#(<= proc_i 696), 145508#(<= proc_i 708), 145330#false, 145331#(<= proc_i 0), 145329#true, 145334#(<= proc_i 12), 145335#(<= proc_i 16), 145332#(<= proc_i 4), 145333#(<= proc_i 8), 145338#(<= proc_i 28), 145339#(<= proc_i 32), 145336#(<= proc_i 20), 145337#(<= proc_i 24), 145342#(<= proc_i 44), 145343#(<= proc_i 48), 145340#(<= proc_i 36), 145341#(<= proc_i 40), 145346#(<= proc_i 60), 145347#(<= proc_i 64), 145344#(<= proc_i 52), 145345#(<= proc_i 56), 145350#(<= proc_i 76), 145351#(<= proc_i 80), 145348#(<= proc_i 68), 145349#(<= proc_i 72), 145354#(<= proc_i 92), 145355#(<= proc_i 96), 145352#(<= proc_i 84), 145353#(<= proc_i 88), 145358#(<= proc_i 108), 145359#(<= proc_i 112), 145356#(<= proc_i 100), 145357#(<= proc_i 104), 145362#(<= proc_i 124), 145363#(<= proc_i 128), 145360#(<= proc_i 116), 145361#(<= proc_i 120), 145366#(<= proc_i 140), 145367#(<= proc_i 144), 145364#(<= proc_i 132), 145365#(<= proc_i 136), 145370#(<= proc_i 156), 145371#(<= proc_i 160), 145368#(<= proc_i 148), 145369#(<= proc_i 152), 145374#(<= proc_i 172), 145375#(<= proc_i 176), 145372#(<= proc_i 164), 145373#(<= proc_i 168), 145378#(<= proc_i 188), 145379#(<= proc_i 192), 145376#(<= proc_i 180), 145377#(<= proc_i 184), 145382#(<= proc_i 204), 145383#(<= proc_i 208), 145380#(<= proc_i 196), 145381#(<= proc_i 200), 145386#(<= proc_i 220), 145387#(<= proc_i 224), 145384#(<= proc_i 212), 145385#(<= proc_i 216), 145390#(<= proc_i 236), 145391#(<= proc_i 240), 145388#(<= proc_i 228), 145389#(<= proc_i 232), 145394#(<= proc_i 252), 145395#(<= proc_i 256), 145392#(<= proc_i 244), 145393#(<= proc_i 248), 145398#(<= proc_i 268), 145399#(<= proc_i 272), 145396#(<= proc_i 260), 145397#(<= proc_i 264), 145402#(<= proc_i 284), 145403#(<= proc_i 288), 145400#(<= proc_i 276), 145401#(<= proc_i 280), 145406#(<= proc_i 300), 145407#(<= proc_i 304), 145404#(<= proc_i 292), 145405#(<= proc_i 296)] [2018-07-23 13:53:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 31506 backedges. 0 proven. 31506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:38,842 INFO L450 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-07-23 13:53:38,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-07-23 13:53:38,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-07-23 13:53:38,846 INFO L87 Difference]: Start difference. First operand 358 states and 358 transitions. Second operand 180 states. [2018-07-23 13:53:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:39,457 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2018-07-23 13:53:39,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-07-23 13:53:39,457 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 357 [2018-07-23 13:53:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:39,458 INFO L225 Difference]: With dead ends: 361 [2018-07-23 13:53:39,458 INFO L226 Difference]: Without dead ends: 360 [2018-07-23 13:53:39,461 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-07-23 13:53:39,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-07-23 13:53:39,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2018-07-23 13:53:39,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-07-23 13:53:39,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 360 transitions. [2018-07-23 13:53:39,465 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 360 transitions. Word has length 357 [2018-07-23 13:53:39,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:39,465 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 360 transitions. [2018-07-23 13:53:39,465 INFO L472 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-07-23 13:53:39,465 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 360 transitions. [2018-07-23 13:53:39,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-07-23 13:53:39,466 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:39,466 INFO L357 BasicCegarLoop]: trace histogram [179, 178, 1, 1] [2018-07-23 13:53:39,466 INFO L414 AbstractCegarLoop]: === Iteration 179 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:39,467 INFO L82 PathProgramCache]: Analyzing trace with hash 564555332, now seen corresponding path program 178 times [2018-07-23 13:53:39,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:40,677 INFO L134 CoverageAnalysis]: Checked inductivity of 31862 backedges. 0 proven. 31862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:40,678 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:40,678 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-07-23 13:53:40,678 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:40,678 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:53:40,679 INFO L185 omatonBuilderFactory]: Interpolants [146951#true, 146954#(<= proc_i 4), 146955#(<= proc_i 8), 146952#false, 146953#(<= proc_i 0), 146958#(<= proc_i 20), 146959#(<= proc_i 24), 146956#(<= proc_i 12), 146957#(<= proc_i 16), 146962#(<= proc_i 36), 146963#(<= proc_i 40), 146960#(<= proc_i 28), 146961#(<= proc_i 32), 146966#(<= proc_i 52), 146967#(<= proc_i 56), 146964#(<= proc_i 44), 146965#(<= proc_i 48), 146970#(<= proc_i 68), 146971#(<= proc_i 72), 146968#(<= proc_i 60), 146969#(<= proc_i 64), 146974#(<= proc_i 84), 146975#(<= proc_i 88), 146972#(<= proc_i 76), 146973#(<= proc_i 80), 146978#(<= proc_i 100), 146979#(<= proc_i 104), 146976#(<= proc_i 92), 146977#(<= proc_i 96), 146982#(<= proc_i 116), 146983#(<= proc_i 120), 146980#(<= proc_i 108), 146981#(<= proc_i 112), 146986#(<= proc_i 132), 146987#(<= proc_i 136), 146984#(<= proc_i 124), 146985#(<= proc_i 128), 146990#(<= proc_i 148), 146991#(<= proc_i 152), 146988#(<= proc_i 140), 146989#(<= proc_i 144), 146994#(<= proc_i 164), 146995#(<= proc_i 168), 146992#(<= proc_i 156), 146993#(<= proc_i 160), 146998#(<= proc_i 180), 146999#(<= proc_i 184), 146996#(<= proc_i 172), 146997#(<= proc_i 176), 147002#(<= proc_i 196), 147003#(<= proc_i 200), 147000#(<= proc_i 188), 147001#(<= proc_i 192), 147006#(<= proc_i 212), 147007#(<= proc_i 216), 147004#(<= proc_i 204), 147005#(<= proc_i 208), 147010#(<= proc_i 228), 147011#(<= proc_i 232), 147008#(<= proc_i 220), 147009#(<= proc_i 224), 147014#(<= proc_i 244), 147015#(<= proc_i 248), 147012#(<= proc_i 236), 147013#(<= proc_i 240), 147018#(<= proc_i 260), 147019#(<= proc_i 264), 147016#(<= proc_i 252), 147017#(<= proc_i 256), 147022#(<= proc_i 276), 147023#(<= proc_i 280), 147020#(<= proc_i 268), 147021#(<= proc_i 272), 147026#(<= proc_i 292), 147027#(<= proc_i 296), 147024#(<= proc_i 284), 147025#(<= proc_i 288), 147030#(<= proc_i 308), 147031#(<= proc_i 312), 147028#(<= proc_i 300), 147029#(<= proc_i 304), 147034#(<= proc_i 324), 147035#(<= proc_i 328), 147032#(<= proc_i 316), 147033#(<= proc_i 320), 147038#(<= proc_i 340), 147039#(<= proc_i 344), 147036#(<= proc_i 332), 147037#(<= proc_i 336), 147042#(<= proc_i 356), 147043#(<= proc_i 360), 147040#(<= proc_i 348), 147041#(<= proc_i 352), 147046#(<= proc_i 372), 147047#(<= proc_i 376), 147044#(<= proc_i 364), 147045#(<= proc_i 368), 147050#(<= proc_i 388), 147051#(<= proc_i 392), 147048#(<= proc_i 380), 147049#(<= proc_i 384), 147054#(<= proc_i 404), 147055#(<= proc_i 408), 147052#(<= proc_i 396), 147053#(<= proc_i 400), 147058#(<= proc_i 420), 147059#(<= proc_i 424), 147056#(<= proc_i 412), 147057#(<= proc_i 416), 147062#(<= proc_i 436), 147063#(<= proc_i 440), 147060#(<= proc_i 428), 147061#(<= proc_i 432), 147066#(<= proc_i 452), 147067#(<= proc_i 456), 147064#(<= proc_i 444), 147065#(<= proc_i 448), 147070#(<= proc_i 468), 147071#(<= proc_i 472), 147068#(<= proc_i 460), 147069#(<= proc_i 464), 147074#(<= proc_i 484), 147075#(<= proc_i 488), 147072#(<= proc_i 476), 147073#(<= proc_i 480), 147078#(<= proc_i 500), 147079#(<= proc_i 504), 147076#(<= proc_i 492), 147077#(<= proc_i 496), 147082#(<= proc_i 516), 147083#(<= proc_i 520), 147080#(<= proc_i 508), 147081#(<= proc_i 512), 147086#(<= proc_i 532), 147087#(<= proc_i 536), 147084#(<= proc_i 524), 147085#(<= proc_i 528), 147090#(<= proc_i 548), 147091#(<= proc_i 552), 147088#(<= proc_i 540), 147089#(<= proc_i 544), 147094#(<= proc_i 564), 147095#(<= proc_i 568), 147092#(<= proc_i 556), 147093#(<= proc_i 560), 147098#(<= proc_i 580), 147099#(<= proc_i 584), 147096#(<= proc_i 572), 147097#(<= proc_i 576), 147102#(<= proc_i 596), 147103#(<= proc_i 600), 147100#(<= proc_i 588), 147101#(<= proc_i 592), 147106#(<= proc_i 612), 147107#(<= proc_i 616), 147104#(<= proc_i 604), 147105#(<= proc_i 608), 147110#(<= proc_i 628), 147111#(<= proc_i 632), 147108#(<= proc_i 620), 147109#(<= proc_i 624), 147114#(<= proc_i 644), 147115#(<= proc_i 648), 147112#(<= proc_i 636), 147113#(<= proc_i 640), 147118#(<= proc_i 660), 147119#(<= proc_i 664), 147116#(<= proc_i 652), 147117#(<= proc_i 656), 147122#(<= proc_i 676), 147123#(<= proc_i 680), 147120#(<= proc_i 668), 147121#(<= proc_i 672), 147126#(<= proc_i 692), 147127#(<= proc_i 696), 147124#(<= proc_i 684), 147125#(<= proc_i 688), 147130#(<= proc_i 708), 147131#(<= proc_i 712), 147128#(<= proc_i 700), 147129#(<= proc_i 704)] [2018-07-23 13:53:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 31862 backedges. 0 proven. 31862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:40,680 INFO L450 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-07-23 13:53:40,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-07-23 13:53:40,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-07-23 13:53:40,682 INFO L87 Difference]: Start difference. First operand 360 states and 360 transitions. Second operand 181 states. [2018-07-23 13:53:42,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:42,009 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2018-07-23 13:53:42,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-07-23 13:53:42,009 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 359 [2018-07-23 13:53:42,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:42,009 INFO L225 Difference]: With dead ends: 363 [2018-07-23 13:53:42,010 INFO L226 Difference]: Without dead ends: 362 [2018-07-23 13:53:42,010 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-07-23 13:53:42,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-07-23 13:53:42,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2018-07-23 13:53:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-07-23 13:53:42,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 362 transitions. [2018-07-23 13:53:42,014 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 362 transitions. Word has length 359 [2018-07-23 13:53:42,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:42,015 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 362 transitions. [2018-07-23 13:53:42,015 INFO L472 AbstractCegarLoop]: Interpolant automaton has 181 states. [2018-07-23 13:53:42,015 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 362 transitions. [2018-07-23 13:53:42,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-07-23 13:53:42,016 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:42,016 INFO L357 BasicCegarLoop]: trace histogram [180, 179, 1, 1] [2018-07-23 13:53:42,016 INFO L414 AbstractCegarLoop]: === Iteration 180 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:42,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1371795846, now seen corresponding path program 179 times [2018-07-23 13:53:42,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:43,165 INFO L134 CoverageAnalysis]: Checked inductivity of 32220 backedges. 0 proven. 32220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:43,165 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:43,165 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2018-07-23 13:53:43,166 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:43,166 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:53:43,166 INFO L185 omatonBuilderFactory]: Interpolants [148738#(<= proc_i 616), 148739#(<= proc_i 620), 148736#(<= proc_i 608), 148737#(<= proc_i 612), 148742#(<= proc_i 632), 148743#(<= proc_i 636), 148740#(<= proc_i 624), 148741#(<= proc_i 628), 148746#(<= proc_i 648), 148747#(<= proc_i 652), 148744#(<= proc_i 640), 148745#(<= proc_i 644), 148750#(<= proc_i 664), 148751#(<= proc_i 668), 148748#(<= proc_i 656), 148749#(<= proc_i 660), 148754#(<= proc_i 680), 148755#(<= proc_i 684), 148752#(<= proc_i 672), 148753#(<= proc_i 676), 148758#(<= proc_i 696), 148759#(<= proc_i 700), 148756#(<= proc_i 688), 148757#(<= proc_i 692), 148762#(<= proc_i 712), 148763#(<= proc_i 716), 148760#(<= proc_i 704), 148761#(<= proc_i 708), 148582#true, 148583#false, 148586#(<= proc_i 8), 148587#(<= proc_i 12), 148584#(<= proc_i 0), 148585#(<= proc_i 4), 148590#(<= proc_i 24), 148591#(<= proc_i 28), 148588#(<= proc_i 16), 148589#(<= proc_i 20), 148594#(<= proc_i 40), 148595#(<= proc_i 44), 148592#(<= proc_i 32), 148593#(<= proc_i 36), 148598#(<= proc_i 56), 148599#(<= proc_i 60), 148596#(<= proc_i 48), 148597#(<= proc_i 52), 148602#(<= proc_i 72), 148603#(<= proc_i 76), 148600#(<= proc_i 64), 148601#(<= proc_i 68), 148606#(<= proc_i 88), 148607#(<= proc_i 92), 148604#(<= proc_i 80), 148605#(<= proc_i 84), 148610#(<= proc_i 104), 148611#(<= proc_i 108), 148608#(<= proc_i 96), 148609#(<= proc_i 100), 148614#(<= proc_i 120), 148615#(<= proc_i 124), 148612#(<= proc_i 112), 148613#(<= proc_i 116), 148618#(<= proc_i 136), 148619#(<= proc_i 140), 148616#(<= proc_i 128), 148617#(<= proc_i 132), 148622#(<= proc_i 152), 148623#(<= proc_i 156), 148620#(<= proc_i 144), 148621#(<= proc_i 148), 148626#(<= proc_i 168), 148627#(<= proc_i 172), 148624#(<= proc_i 160), 148625#(<= proc_i 164), 148630#(<= proc_i 184), 148631#(<= proc_i 188), 148628#(<= proc_i 176), 148629#(<= proc_i 180), 148634#(<= proc_i 200), 148635#(<= proc_i 204), 148632#(<= proc_i 192), 148633#(<= proc_i 196), 148638#(<= proc_i 216), 148639#(<= proc_i 220), 148636#(<= proc_i 208), 148637#(<= proc_i 212), 148642#(<= proc_i 232), 148643#(<= proc_i 236), 148640#(<= proc_i 224), 148641#(<= proc_i 228), 148646#(<= proc_i 248), 148647#(<= proc_i 252), 148644#(<= proc_i 240), 148645#(<= proc_i 244), 148650#(<= proc_i 264), 148651#(<= proc_i 268), 148648#(<= proc_i 256), 148649#(<= proc_i 260), 148654#(<= proc_i 280), 148655#(<= proc_i 284), 148652#(<= proc_i 272), 148653#(<= proc_i 276), 148658#(<= proc_i 296), 148659#(<= proc_i 300), 148656#(<= proc_i 288), 148657#(<= proc_i 292), 148662#(<= proc_i 312), 148663#(<= proc_i 316), 148660#(<= proc_i 304), 148661#(<= proc_i 308), 148666#(<= proc_i 328), 148667#(<= proc_i 332), 148664#(<= proc_i 320), 148665#(<= proc_i 324), 148670#(<= proc_i 344), 148671#(<= proc_i 348), 148668#(<= proc_i 336), 148669#(<= proc_i 340), 148674#(<= proc_i 360), 148675#(<= proc_i 364), 148672#(<= proc_i 352), 148673#(<= proc_i 356), 148678#(<= proc_i 376), 148679#(<= proc_i 380), 148676#(<= proc_i 368), 148677#(<= proc_i 372), 148682#(<= proc_i 392), 148683#(<= proc_i 396), 148680#(<= proc_i 384), 148681#(<= proc_i 388), 148686#(<= proc_i 408), 148687#(<= proc_i 412), 148684#(<= proc_i 400), 148685#(<= proc_i 404), 148690#(<= proc_i 424), 148691#(<= proc_i 428), 148688#(<= proc_i 416), 148689#(<= proc_i 420), 148694#(<= proc_i 440), 148695#(<= proc_i 444), 148692#(<= proc_i 432), 148693#(<= proc_i 436), 148698#(<= proc_i 456), 148699#(<= proc_i 460), 148696#(<= proc_i 448), 148697#(<= proc_i 452), 148702#(<= proc_i 472), 148703#(<= proc_i 476), 148700#(<= proc_i 464), 148701#(<= proc_i 468), 148706#(<= proc_i 488), 148707#(<= proc_i 492), 148704#(<= proc_i 480), 148705#(<= proc_i 484), 148710#(<= proc_i 504), 148711#(<= proc_i 508), 148708#(<= proc_i 496), 148709#(<= proc_i 500), 148714#(<= proc_i 520), 148715#(<= proc_i 524), 148712#(<= proc_i 512), 148713#(<= proc_i 516), 148718#(<= proc_i 536), 148719#(<= proc_i 540), 148716#(<= proc_i 528), 148717#(<= proc_i 532), 148722#(<= proc_i 552), 148723#(<= proc_i 556), 148720#(<= proc_i 544), 148721#(<= proc_i 548), 148726#(<= proc_i 568), 148727#(<= proc_i 572), 148724#(<= proc_i 560), 148725#(<= proc_i 564), 148730#(<= proc_i 584), 148731#(<= proc_i 588), 148728#(<= proc_i 576), 148729#(<= proc_i 580), 148734#(<= proc_i 600), 148735#(<= proc_i 604), 148732#(<= proc_i 592), 148733#(<= proc_i 596)] [2018-07-23 13:53:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 32220 backedges. 0 proven. 32220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:43,168 INFO L450 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-07-23 13:53:43,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-07-23 13:53:43,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-07-23 13:53:43,173 INFO L87 Difference]: Start difference. First operand 362 states and 362 transitions. Second operand 182 states. [2018-07-23 13:53:44,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:44,209 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-07-23 13:53:44,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-07-23 13:53:44,209 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 361 [2018-07-23 13:53:44,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:44,210 INFO L225 Difference]: With dead ends: 365 [2018-07-23 13:53:44,210 INFO L226 Difference]: Without dead ends: 364 [2018-07-23 13:53:44,212 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-07-23 13:53:44,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-07-23 13:53:44,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2018-07-23 13:53:44,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-07-23 13:53:44,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 364 transitions. [2018-07-23 13:53:44,216 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 364 transitions. Word has length 361 [2018-07-23 13:53:44,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:44,216 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 364 transitions. [2018-07-23 13:53:44,216 INFO L472 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-07-23 13:53:44,217 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 364 transitions. [2018-07-23 13:53:44,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-07-23 13:53:44,218 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:44,218 INFO L357 BasicCegarLoop]: trace histogram [181, 180, 1, 1] [2018-07-23 13:53:44,218 INFO L414 AbstractCegarLoop]: === Iteration 181 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:44,218 INFO L82 PathProgramCache]: Analyzing trace with hash -259150776, now seen corresponding path program 180 times [2018-07-23 13:53:44,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 32580 backedges. 0 proven. 32580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:45,498 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:45,499 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2018-07-23 13:53:45,499 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:45,499 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:53:45,499 INFO L185 omatonBuilderFactory]: Interpolants [150274#(<= proc_i 200), 150275#(<= proc_i 204), 150272#(<= proc_i 192), 150273#(<= proc_i 196), 150278#(<= proc_i 216), 150279#(<= proc_i 220), 150276#(<= proc_i 208), 150277#(<= proc_i 212), 150282#(<= proc_i 232), 150283#(<= proc_i 236), 150280#(<= proc_i 224), 150281#(<= proc_i 228), 150286#(<= proc_i 248), 150287#(<= proc_i 252), 150284#(<= proc_i 240), 150285#(<= proc_i 244), 150290#(<= proc_i 264), 150291#(<= proc_i 268), 150288#(<= proc_i 256), 150289#(<= proc_i 260), 150294#(<= proc_i 280), 150295#(<= proc_i 284), 150292#(<= proc_i 272), 150293#(<= proc_i 276), 150298#(<= proc_i 296), 150299#(<= proc_i 300), 150296#(<= proc_i 288), 150297#(<= proc_i 292), 150302#(<= proc_i 312), 150303#(<= proc_i 316), 150300#(<= proc_i 304), 150301#(<= proc_i 308), 150306#(<= proc_i 328), 150307#(<= proc_i 332), 150304#(<= proc_i 320), 150305#(<= proc_i 324), 150310#(<= proc_i 344), 150311#(<= proc_i 348), 150308#(<= proc_i 336), 150309#(<= proc_i 340), 150314#(<= proc_i 360), 150315#(<= proc_i 364), 150312#(<= proc_i 352), 150313#(<= proc_i 356), 150318#(<= proc_i 376), 150319#(<= proc_i 380), 150316#(<= proc_i 368), 150317#(<= proc_i 372), 150322#(<= proc_i 392), 150323#(<= proc_i 396), 150320#(<= proc_i 384), 150321#(<= proc_i 388), 150326#(<= proc_i 408), 150327#(<= proc_i 412), 150324#(<= proc_i 400), 150325#(<= proc_i 404), 150330#(<= proc_i 424), 150331#(<= proc_i 428), 150328#(<= proc_i 416), 150329#(<= proc_i 420), 150334#(<= proc_i 440), 150335#(<= proc_i 444), 150332#(<= proc_i 432), 150333#(<= proc_i 436), 150338#(<= proc_i 456), 150339#(<= proc_i 460), 150336#(<= proc_i 448), 150337#(<= proc_i 452), 150342#(<= proc_i 472), 150343#(<= proc_i 476), 150340#(<= proc_i 464), 150341#(<= proc_i 468), 150346#(<= proc_i 488), 150347#(<= proc_i 492), 150344#(<= proc_i 480), 150345#(<= proc_i 484), 150350#(<= proc_i 504), 150351#(<= proc_i 508), 150348#(<= proc_i 496), 150349#(<= proc_i 500), 150354#(<= proc_i 520), 150355#(<= proc_i 524), 150352#(<= proc_i 512), 150353#(<= proc_i 516), 150358#(<= proc_i 536), 150359#(<= proc_i 540), 150356#(<= proc_i 528), 150357#(<= proc_i 532), 150362#(<= proc_i 552), 150363#(<= proc_i 556), 150360#(<= proc_i 544), 150361#(<= proc_i 548), 150366#(<= proc_i 568), 150367#(<= proc_i 572), 150364#(<= proc_i 560), 150365#(<= proc_i 564), 150370#(<= proc_i 584), 150371#(<= proc_i 588), 150368#(<= proc_i 576), 150369#(<= proc_i 580), 150374#(<= proc_i 600), 150375#(<= proc_i 604), 150372#(<= proc_i 592), 150373#(<= proc_i 596), 150378#(<= proc_i 616), 150379#(<= proc_i 620), 150376#(<= proc_i 608), 150377#(<= proc_i 612), 150382#(<= proc_i 632), 150383#(<= proc_i 636), 150380#(<= proc_i 624), 150381#(<= proc_i 628), 150386#(<= proc_i 648), 150387#(<= proc_i 652), 150384#(<= proc_i 640), 150385#(<= proc_i 644), 150390#(<= proc_i 664), 150391#(<= proc_i 668), 150388#(<= proc_i 656), 150389#(<= proc_i 660), 150394#(<= proc_i 680), 150395#(<= proc_i 684), 150392#(<= proc_i 672), 150393#(<= proc_i 676), 150398#(<= proc_i 696), 150399#(<= proc_i 700), 150396#(<= proc_i 688), 150397#(<= proc_i 692), 150402#(<= proc_i 712), 150403#(<= proc_i 716), 150400#(<= proc_i 704), 150401#(<= proc_i 708), 150404#(<= proc_i 720), 150222#true, 150223#false, 150226#(<= proc_i 8), 150227#(<= proc_i 12), 150224#(<= proc_i 0), 150225#(<= proc_i 4), 150230#(<= proc_i 24), 150231#(<= proc_i 28), 150228#(<= proc_i 16), 150229#(<= proc_i 20), 150234#(<= proc_i 40), 150235#(<= proc_i 44), 150232#(<= proc_i 32), 150233#(<= proc_i 36), 150238#(<= proc_i 56), 150239#(<= proc_i 60), 150236#(<= proc_i 48), 150237#(<= proc_i 52), 150242#(<= proc_i 72), 150243#(<= proc_i 76), 150240#(<= proc_i 64), 150241#(<= proc_i 68), 150246#(<= proc_i 88), 150247#(<= proc_i 92), 150244#(<= proc_i 80), 150245#(<= proc_i 84), 150250#(<= proc_i 104), 150251#(<= proc_i 108), 150248#(<= proc_i 96), 150249#(<= proc_i 100), 150254#(<= proc_i 120), 150255#(<= proc_i 124), 150252#(<= proc_i 112), 150253#(<= proc_i 116), 150258#(<= proc_i 136), 150259#(<= proc_i 140), 150256#(<= proc_i 128), 150257#(<= proc_i 132), 150262#(<= proc_i 152), 150263#(<= proc_i 156), 150260#(<= proc_i 144), 150261#(<= proc_i 148), 150266#(<= proc_i 168), 150267#(<= proc_i 172), 150264#(<= proc_i 160), 150265#(<= proc_i 164), 150270#(<= proc_i 184), 150271#(<= proc_i 188), 150268#(<= proc_i 176), 150269#(<= proc_i 180)] [2018-07-23 13:53:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 32580 backedges. 0 proven. 32580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:45,501 INFO L450 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-07-23 13:53:45,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-07-23 13:53:45,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-07-23 13:53:45,505 INFO L87 Difference]: Start difference. First operand 364 states and 364 transitions. Second operand 183 states. [2018-07-23 13:53:46,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:46,431 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2018-07-23 13:53:46,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-07-23 13:53:46,432 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 363 [2018-07-23 13:53:46,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:46,432 INFO L225 Difference]: With dead ends: 367 [2018-07-23 13:53:46,432 INFO L226 Difference]: Without dead ends: 366 [2018-07-23 13:53:46,433 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-07-23 13:53:46,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-07-23 13:53:46,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2018-07-23 13:53:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-07-23 13:53:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2018-07-23 13:53:46,437 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 363 [2018-07-23 13:53:46,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:46,437 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2018-07-23 13:53:46,437 INFO L472 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-07-23 13:53:46,437 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2018-07-23 13:53:46,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-07-23 13:53:46,438 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:46,438 INFO L357 BasicCegarLoop]: trace histogram [182, 181, 1, 1] [2018-07-23 13:53:46,438 INFO L414 AbstractCegarLoop]: === Iteration 182 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:46,438 INFO L82 PathProgramCache]: Analyzing trace with hash 64208522, now seen corresponding path program 181 times [2018-07-23 13:53:46,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:47,530 INFO L134 CoverageAnalysis]: Checked inductivity of 32942 backedges. 0 proven. 32942 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:47,530 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:47,530 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [182] total 182 [2018-07-23 13:53:47,530 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:47,531 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:53:47,531 INFO L185 omatonBuilderFactory]: Interpolants [151871#true, 151874#(<= proc_i 4), 151875#(<= proc_i 8), 151872#false, 151873#(<= proc_i 0), 151878#(<= proc_i 20), 151879#(<= proc_i 24), 151876#(<= proc_i 12), 151877#(<= proc_i 16), 151882#(<= proc_i 36), 151883#(<= proc_i 40), 151880#(<= proc_i 28), 151881#(<= proc_i 32), 151886#(<= proc_i 52), 151887#(<= proc_i 56), 151884#(<= proc_i 44), 151885#(<= proc_i 48), 151890#(<= proc_i 68), 151891#(<= proc_i 72), 151888#(<= proc_i 60), 151889#(<= proc_i 64), 151894#(<= proc_i 84), 151895#(<= proc_i 88), 151892#(<= proc_i 76), 151893#(<= proc_i 80), 151898#(<= proc_i 100), 151899#(<= proc_i 104), 151896#(<= proc_i 92), 151897#(<= proc_i 96), 151902#(<= proc_i 116), 151903#(<= proc_i 120), 151900#(<= proc_i 108), 151901#(<= proc_i 112), 151906#(<= proc_i 132), 151907#(<= proc_i 136), 151904#(<= proc_i 124), 151905#(<= proc_i 128), 151910#(<= proc_i 148), 151911#(<= proc_i 152), 151908#(<= proc_i 140), 151909#(<= proc_i 144), 151914#(<= proc_i 164), 151915#(<= proc_i 168), 151912#(<= proc_i 156), 151913#(<= proc_i 160), 151918#(<= proc_i 180), 151919#(<= proc_i 184), 151916#(<= proc_i 172), 151917#(<= proc_i 176), 151922#(<= proc_i 196), 151923#(<= proc_i 200), 151920#(<= proc_i 188), 151921#(<= proc_i 192), 151926#(<= proc_i 212), 151927#(<= proc_i 216), 151924#(<= proc_i 204), 151925#(<= proc_i 208), 151930#(<= proc_i 228), 151931#(<= proc_i 232), 151928#(<= proc_i 220), 151929#(<= proc_i 224), 151934#(<= proc_i 244), 151935#(<= proc_i 248), 151932#(<= proc_i 236), 151933#(<= proc_i 240), 151938#(<= proc_i 260), 151939#(<= proc_i 264), 151936#(<= proc_i 252), 151937#(<= proc_i 256), 151942#(<= proc_i 276), 151943#(<= proc_i 280), 151940#(<= proc_i 268), 151941#(<= proc_i 272), 151946#(<= proc_i 292), 151947#(<= proc_i 296), 151944#(<= proc_i 284), 151945#(<= proc_i 288), 151950#(<= proc_i 308), 151951#(<= proc_i 312), 151948#(<= proc_i 300), 151949#(<= proc_i 304), 151954#(<= proc_i 324), 151955#(<= proc_i 328), 151952#(<= proc_i 316), 151953#(<= proc_i 320), 151958#(<= proc_i 340), 151959#(<= proc_i 344), 151956#(<= proc_i 332), 151957#(<= proc_i 336), 151962#(<= proc_i 356), 151963#(<= proc_i 360), 151960#(<= proc_i 348), 151961#(<= proc_i 352), 151966#(<= proc_i 372), 151967#(<= proc_i 376), 151964#(<= proc_i 364), 151965#(<= proc_i 368), 151970#(<= proc_i 388), 151971#(<= proc_i 392), 151968#(<= proc_i 380), 151969#(<= proc_i 384), 151974#(<= proc_i 404), 151975#(<= proc_i 408), 151972#(<= proc_i 396), 151973#(<= proc_i 400), 151978#(<= proc_i 420), 151979#(<= proc_i 424), 151976#(<= proc_i 412), 151977#(<= proc_i 416), 151982#(<= proc_i 436), 151983#(<= proc_i 440), 151980#(<= proc_i 428), 151981#(<= proc_i 432), 151986#(<= proc_i 452), 151987#(<= proc_i 456), 151984#(<= proc_i 444), 151985#(<= proc_i 448), 151990#(<= proc_i 468), 151991#(<= proc_i 472), 151988#(<= proc_i 460), 151989#(<= proc_i 464), 151994#(<= proc_i 484), 151995#(<= proc_i 488), 151992#(<= proc_i 476), 151993#(<= proc_i 480), 151998#(<= proc_i 500), 151999#(<= proc_i 504), 151996#(<= proc_i 492), 151997#(<= proc_i 496), 152002#(<= proc_i 516), 152003#(<= proc_i 520), 152000#(<= proc_i 508), 152001#(<= proc_i 512), 152006#(<= proc_i 532), 152007#(<= proc_i 536), 152004#(<= proc_i 524), 152005#(<= proc_i 528), 152010#(<= proc_i 548), 152011#(<= proc_i 552), 152008#(<= proc_i 540), 152009#(<= proc_i 544), 152014#(<= proc_i 564), 152015#(<= proc_i 568), 152012#(<= proc_i 556), 152013#(<= proc_i 560), 152018#(<= proc_i 580), 152019#(<= proc_i 584), 152016#(<= proc_i 572), 152017#(<= proc_i 576), 152022#(<= proc_i 596), 152023#(<= proc_i 600), 152020#(<= proc_i 588), 152021#(<= proc_i 592), 152026#(<= proc_i 612), 152027#(<= proc_i 616), 152024#(<= proc_i 604), 152025#(<= proc_i 608), 152030#(<= proc_i 628), 152031#(<= proc_i 632), 152028#(<= proc_i 620), 152029#(<= proc_i 624), 152034#(<= proc_i 644), 152035#(<= proc_i 648), 152032#(<= proc_i 636), 152033#(<= proc_i 640), 152038#(<= proc_i 660), 152039#(<= proc_i 664), 152036#(<= proc_i 652), 152037#(<= proc_i 656), 152042#(<= proc_i 676), 152043#(<= proc_i 680), 152040#(<= proc_i 668), 152041#(<= proc_i 672), 152046#(<= proc_i 692), 152047#(<= proc_i 696), 152044#(<= proc_i 684), 152045#(<= proc_i 688), 152050#(<= proc_i 708), 152051#(<= proc_i 712), 152048#(<= proc_i 700), 152049#(<= proc_i 704), 152054#(<= proc_i 724), 152052#(<= proc_i 716), 152053#(<= proc_i 720)] [2018-07-23 13:53:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 32942 backedges. 0 proven. 32942 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:47,533 INFO L450 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-07-23 13:53:47,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-07-23 13:53:47,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-07-23 13:53:47,536 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 184 states. [2018-07-23 13:53:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:48,921 INFO L93 Difference]: Finished difference Result 369 states and 369 transitions. [2018-07-23 13:53:48,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-07-23 13:53:48,922 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 365 [2018-07-23 13:53:48,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:48,922 INFO L225 Difference]: With dead ends: 369 [2018-07-23 13:53:48,922 INFO L226 Difference]: Without dead ends: 368 [2018-07-23 13:53:48,924 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-07-23 13:53:48,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-07-23 13:53:48,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2018-07-23 13:53:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-07-23 13:53:48,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 368 transitions. [2018-07-23 13:53:48,927 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 368 transitions. Word has length 365 [2018-07-23 13:53:48,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:48,927 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 368 transitions. [2018-07-23 13:53:48,928 INFO L472 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-07-23 13:53:48,928 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 368 transitions. [2018-07-23 13:53:48,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-07-23 13:53:48,929 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:48,929 INFO L357 BasicCegarLoop]: trace histogram [183, 182, 1, 1] [2018-07-23 13:53:48,929 INFO L414 AbstractCegarLoop]: === Iteration 183 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:48,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1574848588, now seen corresponding path program 182 times [2018-07-23 13:53:48,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 33306 backedges. 0 proven. 33306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:50,098 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:50,098 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [183] total 183 [2018-07-23 13:53:50,099 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:50,099 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:53:50,099 INFO L185 omatonBuilderFactory]: Interpolants [153602#(<= proc_i 284), 153603#(<= proc_i 288), 153600#(<= proc_i 276), 153601#(<= proc_i 280), 153606#(<= proc_i 300), 153607#(<= proc_i 304), 153604#(<= proc_i 292), 153605#(<= proc_i 296), 153610#(<= proc_i 316), 153611#(<= proc_i 320), 153608#(<= proc_i 308), 153609#(<= proc_i 312), 153614#(<= proc_i 332), 153615#(<= proc_i 336), 153612#(<= proc_i 324), 153613#(<= proc_i 328), 153618#(<= proc_i 348), 153619#(<= proc_i 352), 153616#(<= proc_i 340), 153617#(<= proc_i 344), 153622#(<= proc_i 364), 153623#(<= proc_i 368), 153620#(<= proc_i 356), 153621#(<= proc_i 360), 153626#(<= proc_i 380), 153627#(<= proc_i 384), 153624#(<= proc_i 372), 153625#(<= proc_i 376), 153630#(<= proc_i 396), 153631#(<= proc_i 400), 153628#(<= proc_i 388), 153629#(<= proc_i 392), 153634#(<= proc_i 412), 153635#(<= proc_i 416), 153632#(<= proc_i 404), 153633#(<= proc_i 408), 153638#(<= proc_i 428), 153639#(<= proc_i 432), 153636#(<= proc_i 420), 153637#(<= proc_i 424), 153642#(<= proc_i 444), 153643#(<= proc_i 448), 153640#(<= proc_i 436), 153641#(<= proc_i 440), 153646#(<= proc_i 460), 153647#(<= proc_i 464), 153644#(<= proc_i 452), 153645#(<= proc_i 456), 153650#(<= proc_i 476), 153651#(<= proc_i 480), 153648#(<= proc_i 468), 153649#(<= proc_i 472), 153654#(<= proc_i 492), 153655#(<= proc_i 496), 153652#(<= proc_i 484), 153653#(<= proc_i 488), 153658#(<= proc_i 508), 153659#(<= proc_i 512), 153656#(<= proc_i 500), 153657#(<= proc_i 504), 153662#(<= proc_i 524), 153663#(<= proc_i 528), 153660#(<= proc_i 516), 153661#(<= proc_i 520), 153666#(<= proc_i 540), 153667#(<= proc_i 544), 153664#(<= proc_i 532), 153665#(<= proc_i 536), 153670#(<= proc_i 556), 153671#(<= proc_i 560), 153668#(<= proc_i 548), 153669#(<= proc_i 552), 153674#(<= proc_i 572), 153675#(<= proc_i 576), 153672#(<= proc_i 564), 153673#(<= proc_i 568), 153678#(<= proc_i 588), 153679#(<= proc_i 592), 153676#(<= proc_i 580), 153677#(<= proc_i 584), 153682#(<= proc_i 604), 153683#(<= proc_i 608), 153680#(<= proc_i 596), 153681#(<= proc_i 600), 153686#(<= proc_i 620), 153687#(<= proc_i 624), 153684#(<= proc_i 612), 153685#(<= proc_i 616), 153690#(<= proc_i 636), 153691#(<= proc_i 640), 153688#(<= proc_i 628), 153689#(<= proc_i 632), 153694#(<= proc_i 652), 153695#(<= proc_i 656), 153692#(<= proc_i 644), 153693#(<= proc_i 648), 153698#(<= proc_i 668), 153699#(<= proc_i 672), 153696#(<= proc_i 660), 153697#(<= proc_i 664), 153702#(<= proc_i 684), 153703#(<= proc_i 688), 153700#(<= proc_i 676), 153701#(<= proc_i 680), 153706#(<= proc_i 700), 153707#(<= proc_i 704), 153704#(<= proc_i 692), 153705#(<= proc_i 696), 153710#(<= proc_i 716), 153711#(<= proc_i 720), 153708#(<= proc_i 708), 153709#(<= proc_i 712), 153712#(<= proc_i 724), 153713#(<= proc_i 728), 153530#false, 153531#(<= proc_i 0), 153529#true, 153534#(<= proc_i 12), 153535#(<= proc_i 16), 153532#(<= proc_i 4), 153533#(<= proc_i 8), 153538#(<= proc_i 28), 153539#(<= proc_i 32), 153536#(<= proc_i 20), 153537#(<= proc_i 24), 153542#(<= proc_i 44), 153543#(<= proc_i 48), 153540#(<= proc_i 36), 153541#(<= proc_i 40), 153546#(<= proc_i 60), 153547#(<= proc_i 64), 153544#(<= proc_i 52), 153545#(<= proc_i 56), 153550#(<= proc_i 76), 153551#(<= proc_i 80), 153548#(<= proc_i 68), 153549#(<= proc_i 72), 153554#(<= proc_i 92), 153555#(<= proc_i 96), 153552#(<= proc_i 84), 153553#(<= proc_i 88), 153558#(<= proc_i 108), 153559#(<= proc_i 112), 153556#(<= proc_i 100), 153557#(<= proc_i 104), 153562#(<= proc_i 124), 153563#(<= proc_i 128), 153560#(<= proc_i 116), 153561#(<= proc_i 120), 153566#(<= proc_i 140), 153567#(<= proc_i 144), 153564#(<= proc_i 132), 153565#(<= proc_i 136), 153570#(<= proc_i 156), 153571#(<= proc_i 160), 153568#(<= proc_i 148), 153569#(<= proc_i 152), 153574#(<= proc_i 172), 153575#(<= proc_i 176), 153572#(<= proc_i 164), 153573#(<= proc_i 168), 153578#(<= proc_i 188), 153579#(<= proc_i 192), 153576#(<= proc_i 180), 153577#(<= proc_i 184), 153582#(<= proc_i 204), 153583#(<= proc_i 208), 153580#(<= proc_i 196), 153581#(<= proc_i 200), 153586#(<= proc_i 220), 153587#(<= proc_i 224), 153584#(<= proc_i 212), 153585#(<= proc_i 216), 153590#(<= proc_i 236), 153591#(<= proc_i 240), 153588#(<= proc_i 228), 153589#(<= proc_i 232), 153594#(<= proc_i 252), 153595#(<= proc_i 256), 153592#(<= proc_i 244), 153593#(<= proc_i 248), 153598#(<= proc_i 268), 153599#(<= proc_i 272), 153596#(<= proc_i 260), 153597#(<= proc_i 264)] [2018-07-23 13:53:50,101 INFO L134 CoverageAnalysis]: Checked inductivity of 33306 backedges. 0 proven. 33306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:50,101 INFO L450 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-07-23 13:53:50,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-07-23 13:53:50,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-07-23 13:53:50,105 INFO L87 Difference]: Start difference. First operand 368 states and 368 transitions. Second operand 185 states. [2018-07-23 13:53:50,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:50,882 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2018-07-23 13:53:50,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-07-23 13:53:50,882 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 367 [2018-07-23 13:53:50,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:50,883 INFO L225 Difference]: With dead ends: 371 [2018-07-23 13:53:50,883 INFO L226 Difference]: Without dead ends: 370 [2018-07-23 13:53:50,884 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-07-23 13:53:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-07-23 13:53:50,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2018-07-23 13:53:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-07-23 13:53:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 370 transitions. [2018-07-23 13:53:50,888 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 370 transitions. Word has length 367 [2018-07-23 13:53:50,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:50,888 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 370 transitions. [2018-07-23 13:53:50,888 INFO L472 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-07-23 13:53:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 370 transitions. [2018-07-23 13:53:50,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-07-23 13:53:50,889 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:50,889 INFO L357 BasicCegarLoop]: trace histogram [184, 183, 1, 1] [2018-07-23 13:53:50,889 INFO L414 AbstractCegarLoop]: === Iteration 184 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:50,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1601005966, now seen corresponding path program 183 times [2018-07-23 13:53:50,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 33672 backedges. 0 proven. 33672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:52,108 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:52,108 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [184] total 184 [2018-07-23 13:53:52,108 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:52,109 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:53:52,109 INFO L185 omatonBuilderFactory]: Interpolants [155198#(<= proc_i 0), 155199#(<= proc_i 4), 155196#true, 155197#false, 155202#(<= proc_i 16), 155203#(<= proc_i 20), 155200#(<= proc_i 8), 155201#(<= proc_i 12), 155206#(<= proc_i 32), 155207#(<= proc_i 36), 155204#(<= proc_i 24), 155205#(<= proc_i 28), 155210#(<= proc_i 48), 155211#(<= proc_i 52), 155208#(<= proc_i 40), 155209#(<= proc_i 44), 155214#(<= proc_i 64), 155215#(<= proc_i 68), 155212#(<= proc_i 56), 155213#(<= proc_i 60), 155218#(<= proc_i 80), 155219#(<= proc_i 84), 155216#(<= proc_i 72), 155217#(<= proc_i 76), 155222#(<= proc_i 96), 155223#(<= proc_i 100), 155220#(<= proc_i 88), 155221#(<= proc_i 92), 155226#(<= proc_i 112), 155227#(<= proc_i 116), 155224#(<= proc_i 104), 155225#(<= proc_i 108), 155230#(<= proc_i 128), 155231#(<= proc_i 132), 155228#(<= proc_i 120), 155229#(<= proc_i 124), 155234#(<= proc_i 144), 155235#(<= proc_i 148), 155232#(<= proc_i 136), 155233#(<= proc_i 140), 155238#(<= proc_i 160), 155239#(<= proc_i 164), 155236#(<= proc_i 152), 155237#(<= proc_i 156), 155242#(<= proc_i 176), 155243#(<= proc_i 180), 155240#(<= proc_i 168), 155241#(<= proc_i 172), 155246#(<= proc_i 192), 155247#(<= proc_i 196), 155244#(<= proc_i 184), 155245#(<= proc_i 188), 155250#(<= proc_i 208), 155251#(<= proc_i 212), 155248#(<= proc_i 200), 155249#(<= proc_i 204), 155254#(<= proc_i 224), 155255#(<= proc_i 228), 155252#(<= proc_i 216), 155253#(<= proc_i 220), 155258#(<= proc_i 240), 155259#(<= proc_i 244), 155256#(<= proc_i 232), 155257#(<= proc_i 236), 155262#(<= proc_i 256), 155263#(<= proc_i 260), 155260#(<= proc_i 248), 155261#(<= proc_i 252), 155266#(<= proc_i 272), 155267#(<= proc_i 276), 155264#(<= proc_i 264), 155265#(<= proc_i 268), 155270#(<= proc_i 288), 155271#(<= proc_i 292), 155268#(<= proc_i 280), 155269#(<= proc_i 284), 155274#(<= proc_i 304), 155275#(<= proc_i 308), 155272#(<= proc_i 296), 155273#(<= proc_i 300), 155278#(<= proc_i 320), 155279#(<= proc_i 324), 155276#(<= proc_i 312), 155277#(<= proc_i 316), 155282#(<= proc_i 336), 155283#(<= proc_i 340), 155280#(<= proc_i 328), 155281#(<= proc_i 332), 155286#(<= proc_i 352), 155287#(<= proc_i 356), 155284#(<= proc_i 344), 155285#(<= proc_i 348), 155290#(<= proc_i 368), 155291#(<= proc_i 372), 155288#(<= proc_i 360), 155289#(<= proc_i 364), 155294#(<= proc_i 384), 155295#(<= proc_i 388), 155292#(<= proc_i 376), 155293#(<= proc_i 380), 155298#(<= proc_i 400), 155299#(<= proc_i 404), 155296#(<= proc_i 392), 155297#(<= proc_i 396), 155302#(<= proc_i 416), 155303#(<= proc_i 420), 155300#(<= proc_i 408), 155301#(<= proc_i 412), 155306#(<= proc_i 432), 155307#(<= proc_i 436), 155304#(<= proc_i 424), 155305#(<= proc_i 428), 155310#(<= proc_i 448), 155311#(<= proc_i 452), 155308#(<= proc_i 440), 155309#(<= proc_i 444), 155314#(<= proc_i 464), 155315#(<= proc_i 468), 155312#(<= proc_i 456), 155313#(<= proc_i 460), 155318#(<= proc_i 480), 155319#(<= proc_i 484), 155316#(<= proc_i 472), 155317#(<= proc_i 476), 155322#(<= proc_i 496), 155323#(<= proc_i 500), 155320#(<= proc_i 488), 155321#(<= proc_i 492), 155326#(<= proc_i 512), 155327#(<= proc_i 516), 155324#(<= proc_i 504), 155325#(<= proc_i 508), 155330#(<= proc_i 528), 155331#(<= proc_i 532), 155328#(<= proc_i 520), 155329#(<= proc_i 524), 155334#(<= proc_i 544), 155335#(<= proc_i 548), 155332#(<= proc_i 536), 155333#(<= proc_i 540), 155338#(<= proc_i 560), 155339#(<= proc_i 564), 155336#(<= proc_i 552), 155337#(<= proc_i 556), 155342#(<= proc_i 576), 155343#(<= proc_i 580), 155340#(<= proc_i 568), 155341#(<= proc_i 572), 155346#(<= proc_i 592), 155347#(<= proc_i 596), 155344#(<= proc_i 584), 155345#(<= proc_i 588), 155350#(<= proc_i 608), 155351#(<= proc_i 612), 155348#(<= proc_i 600), 155349#(<= proc_i 604), 155354#(<= proc_i 624), 155355#(<= proc_i 628), 155352#(<= proc_i 616), 155353#(<= proc_i 620), 155358#(<= proc_i 640), 155359#(<= proc_i 644), 155356#(<= proc_i 632), 155357#(<= proc_i 636), 155362#(<= proc_i 656), 155363#(<= proc_i 660), 155360#(<= proc_i 648), 155361#(<= proc_i 652), 155366#(<= proc_i 672), 155367#(<= proc_i 676), 155364#(<= proc_i 664), 155365#(<= proc_i 668), 155370#(<= proc_i 688), 155371#(<= proc_i 692), 155368#(<= proc_i 680), 155369#(<= proc_i 684), 155374#(<= proc_i 704), 155375#(<= proc_i 708), 155372#(<= proc_i 696), 155373#(<= proc_i 700), 155378#(<= proc_i 720), 155379#(<= proc_i 724), 155376#(<= proc_i 712), 155377#(<= proc_i 716), 155380#(<= proc_i 728), 155381#(<= proc_i 732)] [2018-07-23 13:53:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 33672 backedges. 0 proven. 33672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:52,110 INFO L450 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-07-23 13:53:52,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-07-23 13:53:52,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-07-23 13:53:52,114 INFO L87 Difference]: Start difference. First operand 370 states and 370 transitions. Second operand 186 states. [2018-07-23 13:53:53,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:53,688 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-07-23 13:53:53,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-07-23 13:53:53,688 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 369 [2018-07-23 13:53:53,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:53,688 INFO L225 Difference]: With dead ends: 373 [2018-07-23 13:53:53,689 INFO L226 Difference]: Without dead ends: 372 [2018-07-23 13:53:53,690 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-07-23 13:53:53,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-07-23 13:53:53,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2018-07-23 13:53:53,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-07-23 13:53:53,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 372 transitions. [2018-07-23 13:53:53,694 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 372 transitions. Word has length 369 [2018-07-23 13:53:53,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:53,694 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 372 transitions. [2018-07-23 13:53:53,694 INFO L472 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-07-23 13:53:53,694 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 372 transitions. [2018-07-23 13:53:53,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-07-23 13:53:53,696 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:53,696 INFO L357 BasicCegarLoop]: trace histogram [185, 184, 1, 1] [2018-07-23 13:53:53,696 INFO L414 AbstractCegarLoop]: === Iteration 185 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:53,696 INFO L82 PathProgramCache]: Analyzing trace with hash 968442448, now seen corresponding path program 184 times [2018-07-23 13:53:53,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:55,097 INFO L134 CoverageAnalysis]: Checked inductivity of 34040 backedges. 0 proven. 34040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:55,098 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:55,098 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [185] total 185 [2018-07-23 13:53:55,098 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:55,098 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:53:55,099 INFO L185 omatonBuilderFactory]: Interpolants [156930#(<= proc_i 224), 156931#(<= proc_i 228), 156928#(<= proc_i 216), 156929#(<= proc_i 220), 156934#(<= proc_i 240), 156935#(<= proc_i 244), 156932#(<= proc_i 232), 156933#(<= proc_i 236), 156938#(<= proc_i 256), 156939#(<= proc_i 260), 156936#(<= proc_i 248), 156937#(<= proc_i 252), 156942#(<= proc_i 272), 156943#(<= proc_i 276), 156940#(<= proc_i 264), 156941#(<= proc_i 268), 156946#(<= proc_i 288), 156947#(<= proc_i 292), 156944#(<= proc_i 280), 156945#(<= proc_i 284), 156950#(<= proc_i 304), 156951#(<= proc_i 308), 156948#(<= proc_i 296), 156949#(<= proc_i 300), 156954#(<= proc_i 320), 156955#(<= proc_i 324), 156952#(<= proc_i 312), 156953#(<= proc_i 316), 156958#(<= proc_i 336), 156959#(<= proc_i 340), 156956#(<= proc_i 328), 156957#(<= proc_i 332), 156962#(<= proc_i 352), 156963#(<= proc_i 356), 156960#(<= proc_i 344), 156961#(<= proc_i 348), 156966#(<= proc_i 368), 156967#(<= proc_i 372), 156964#(<= proc_i 360), 156965#(<= proc_i 364), 156970#(<= proc_i 384), 156971#(<= proc_i 388), 156968#(<= proc_i 376), 156969#(<= proc_i 380), 156974#(<= proc_i 400), 156975#(<= proc_i 404), 156972#(<= proc_i 392), 156973#(<= proc_i 396), 156978#(<= proc_i 416), 156979#(<= proc_i 420), 156976#(<= proc_i 408), 156977#(<= proc_i 412), 156982#(<= proc_i 432), 156983#(<= proc_i 436), 156980#(<= proc_i 424), 156981#(<= proc_i 428), 156986#(<= proc_i 448), 156987#(<= proc_i 452), 156984#(<= proc_i 440), 156985#(<= proc_i 444), 156990#(<= proc_i 464), 156991#(<= proc_i 468), 156988#(<= proc_i 456), 156989#(<= proc_i 460), 156994#(<= proc_i 480), 156995#(<= proc_i 484), 156992#(<= proc_i 472), 156993#(<= proc_i 476), 156998#(<= proc_i 496), 156999#(<= proc_i 500), 156996#(<= proc_i 488), 156997#(<= proc_i 492), 157002#(<= proc_i 512), 157003#(<= proc_i 516), 157000#(<= proc_i 504), 157001#(<= proc_i 508), 157006#(<= proc_i 528), 157007#(<= proc_i 532), 157004#(<= proc_i 520), 157005#(<= proc_i 524), 157010#(<= proc_i 544), 157011#(<= proc_i 548), 157008#(<= proc_i 536), 157009#(<= proc_i 540), 157014#(<= proc_i 560), 157015#(<= proc_i 564), 157012#(<= proc_i 552), 157013#(<= proc_i 556), 157018#(<= proc_i 576), 157019#(<= proc_i 580), 157016#(<= proc_i 568), 157017#(<= proc_i 572), 157022#(<= proc_i 592), 157023#(<= proc_i 596), 157020#(<= proc_i 584), 157021#(<= proc_i 588), 157026#(<= proc_i 608), 157027#(<= proc_i 612), 157024#(<= proc_i 600), 157025#(<= proc_i 604), 157030#(<= proc_i 624), 157031#(<= proc_i 628), 157028#(<= proc_i 616), 157029#(<= proc_i 620), 157034#(<= proc_i 640), 157035#(<= proc_i 644), 157032#(<= proc_i 632), 157033#(<= proc_i 636), 157038#(<= proc_i 656), 157039#(<= proc_i 660), 157036#(<= proc_i 648), 157037#(<= proc_i 652), 157042#(<= proc_i 672), 157043#(<= proc_i 676), 157040#(<= proc_i 664), 157041#(<= proc_i 668), 157046#(<= proc_i 688), 157047#(<= proc_i 692), 157044#(<= proc_i 680), 157045#(<= proc_i 684), 157050#(<= proc_i 704), 157051#(<= proc_i 708), 157048#(<= proc_i 696), 157049#(<= proc_i 700), 157054#(<= proc_i 720), 157055#(<= proc_i 724), 157052#(<= proc_i 712), 157053#(<= proc_i 716), 157058#(<= proc_i 736), 157056#(<= proc_i 728), 157057#(<= proc_i 732), 156874#(<= proc_i 0), 156875#(<= proc_i 4), 156872#true, 156873#false, 156878#(<= proc_i 16), 156879#(<= proc_i 20), 156876#(<= proc_i 8), 156877#(<= proc_i 12), 156882#(<= proc_i 32), 156883#(<= proc_i 36), 156880#(<= proc_i 24), 156881#(<= proc_i 28), 156886#(<= proc_i 48), 156887#(<= proc_i 52), 156884#(<= proc_i 40), 156885#(<= proc_i 44), 156890#(<= proc_i 64), 156891#(<= proc_i 68), 156888#(<= proc_i 56), 156889#(<= proc_i 60), 156894#(<= proc_i 80), 156895#(<= proc_i 84), 156892#(<= proc_i 72), 156893#(<= proc_i 76), 156898#(<= proc_i 96), 156899#(<= proc_i 100), 156896#(<= proc_i 88), 156897#(<= proc_i 92), 156902#(<= proc_i 112), 156903#(<= proc_i 116), 156900#(<= proc_i 104), 156901#(<= proc_i 108), 156906#(<= proc_i 128), 156907#(<= proc_i 132), 156904#(<= proc_i 120), 156905#(<= proc_i 124), 156910#(<= proc_i 144), 156911#(<= proc_i 148), 156908#(<= proc_i 136), 156909#(<= proc_i 140), 156914#(<= proc_i 160), 156915#(<= proc_i 164), 156912#(<= proc_i 152), 156913#(<= proc_i 156), 156918#(<= proc_i 176), 156919#(<= proc_i 180), 156916#(<= proc_i 168), 156917#(<= proc_i 172), 156922#(<= proc_i 192), 156923#(<= proc_i 196), 156920#(<= proc_i 184), 156921#(<= proc_i 188), 156926#(<= proc_i 208), 156927#(<= proc_i 212), 156924#(<= proc_i 200), 156925#(<= proc_i 204)] [2018-07-23 13:53:55,100 INFO L134 CoverageAnalysis]: Checked inductivity of 34040 backedges. 0 proven. 34040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:55,101 INFO L450 AbstractCegarLoop]: Interpolant automaton has 187 states [2018-07-23 13:53:55,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2018-07-23 13:53:55,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-07-23 13:53:55,105 INFO L87 Difference]: Start difference. First operand 372 states and 372 transitions. Second operand 187 states. [2018-07-23 13:53:56,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:56,201 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2018-07-23 13:53:56,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-07-23 13:53:56,201 INFO L78 Accepts]: Start accepts. Automaton has 187 states. Word has length 371 [2018-07-23 13:53:56,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:56,202 INFO L225 Difference]: With dead ends: 375 [2018-07-23 13:53:56,202 INFO L226 Difference]: Without dead ends: 374 [2018-07-23 13:53:56,203 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-07-23 13:53:56,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-07-23 13:53:56,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2018-07-23 13:53:56,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-07-23 13:53:56,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 374 transitions. [2018-07-23 13:53:56,207 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 374 transitions. Word has length 371 [2018-07-23 13:53:56,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:56,207 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 374 transitions. [2018-07-23 13:53:56,207 INFO L472 AbstractCegarLoop]: Interpolant automaton has 187 states. [2018-07-23 13:53:56,207 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 374 transitions. [2018-07-23 13:53:56,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-07-23 13:53:56,208 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:56,208 INFO L357 BasicCegarLoop]: trace histogram [186, 185, 1, 1] [2018-07-23 13:53:56,208 INFO L414 AbstractCegarLoop]: === Iteration 186 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:56,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1334709614, now seen corresponding path program 185 times [2018-07-23 13:53:56,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 34410 backedges. 0 proven. 34410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:57,545 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:57,545 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [186] total 186 [2018-07-23 13:53:57,545 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:57,546 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:53:57,546 INFO L185 omatonBuilderFactory]: Interpolants [158722#(<= proc_i 652), 158723#(<= proc_i 656), 158720#(<= proc_i 644), 158721#(<= proc_i 648), 158726#(<= proc_i 668), 158727#(<= proc_i 672), 158724#(<= proc_i 660), 158725#(<= proc_i 664), 158730#(<= proc_i 684), 158731#(<= proc_i 688), 158728#(<= proc_i 676), 158729#(<= proc_i 680), 158734#(<= proc_i 700), 158735#(<= proc_i 704), 158732#(<= proc_i 692), 158733#(<= proc_i 696), 158738#(<= proc_i 716), 158739#(<= proc_i 720), 158736#(<= proc_i 708), 158737#(<= proc_i 712), 158742#(<= proc_i 732), 158743#(<= proc_i 736), 158740#(<= proc_i 724), 158741#(<= proc_i 728), 158744#(<= proc_i 740), 158558#false, 158559#(<= proc_i 0), 158557#true, 158562#(<= proc_i 12), 158563#(<= proc_i 16), 158560#(<= proc_i 4), 158561#(<= proc_i 8), 158566#(<= proc_i 28), 158567#(<= proc_i 32), 158564#(<= proc_i 20), 158565#(<= proc_i 24), 158570#(<= proc_i 44), 158571#(<= proc_i 48), 158568#(<= proc_i 36), 158569#(<= proc_i 40), 158574#(<= proc_i 60), 158575#(<= proc_i 64), 158572#(<= proc_i 52), 158573#(<= proc_i 56), 158578#(<= proc_i 76), 158579#(<= proc_i 80), 158576#(<= proc_i 68), 158577#(<= proc_i 72), 158582#(<= proc_i 92), 158583#(<= proc_i 96), 158580#(<= proc_i 84), 158581#(<= proc_i 88), 158586#(<= proc_i 108), 158587#(<= proc_i 112), 158584#(<= proc_i 100), 158585#(<= proc_i 104), 158590#(<= proc_i 124), 158591#(<= proc_i 128), 158588#(<= proc_i 116), 158589#(<= proc_i 120), 158594#(<= proc_i 140), 158595#(<= proc_i 144), 158592#(<= proc_i 132), 158593#(<= proc_i 136), 158598#(<= proc_i 156), 158599#(<= proc_i 160), 158596#(<= proc_i 148), 158597#(<= proc_i 152), 158602#(<= proc_i 172), 158603#(<= proc_i 176), 158600#(<= proc_i 164), 158601#(<= proc_i 168), 158606#(<= proc_i 188), 158607#(<= proc_i 192), 158604#(<= proc_i 180), 158605#(<= proc_i 184), 158610#(<= proc_i 204), 158611#(<= proc_i 208), 158608#(<= proc_i 196), 158609#(<= proc_i 200), 158614#(<= proc_i 220), 158615#(<= proc_i 224), 158612#(<= proc_i 212), 158613#(<= proc_i 216), 158618#(<= proc_i 236), 158619#(<= proc_i 240), 158616#(<= proc_i 228), 158617#(<= proc_i 232), 158622#(<= proc_i 252), 158623#(<= proc_i 256), 158620#(<= proc_i 244), 158621#(<= proc_i 248), 158626#(<= proc_i 268), 158627#(<= proc_i 272), 158624#(<= proc_i 260), 158625#(<= proc_i 264), 158630#(<= proc_i 284), 158631#(<= proc_i 288), 158628#(<= proc_i 276), 158629#(<= proc_i 280), 158634#(<= proc_i 300), 158635#(<= proc_i 304), 158632#(<= proc_i 292), 158633#(<= proc_i 296), 158638#(<= proc_i 316), 158639#(<= proc_i 320), 158636#(<= proc_i 308), 158637#(<= proc_i 312), 158642#(<= proc_i 332), 158643#(<= proc_i 336), 158640#(<= proc_i 324), 158641#(<= proc_i 328), 158646#(<= proc_i 348), 158647#(<= proc_i 352), 158644#(<= proc_i 340), 158645#(<= proc_i 344), 158650#(<= proc_i 364), 158651#(<= proc_i 368), 158648#(<= proc_i 356), 158649#(<= proc_i 360), 158654#(<= proc_i 380), 158655#(<= proc_i 384), 158652#(<= proc_i 372), 158653#(<= proc_i 376), 158658#(<= proc_i 396), 158659#(<= proc_i 400), 158656#(<= proc_i 388), 158657#(<= proc_i 392), 158662#(<= proc_i 412), 158663#(<= proc_i 416), 158660#(<= proc_i 404), 158661#(<= proc_i 408), 158666#(<= proc_i 428), 158667#(<= proc_i 432), 158664#(<= proc_i 420), 158665#(<= proc_i 424), 158670#(<= proc_i 444), 158671#(<= proc_i 448), 158668#(<= proc_i 436), 158669#(<= proc_i 440), 158674#(<= proc_i 460), 158675#(<= proc_i 464), 158672#(<= proc_i 452), 158673#(<= proc_i 456), 158678#(<= proc_i 476), 158679#(<= proc_i 480), 158676#(<= proc_i 468), 158677#(<= proc_i 472), 158682#(<= proc_i 492), 158683#(<= proc_i 496), 158680#(<= proc_i 484), 158681#(<= proc_i 488), 158686#(<= proc_i 508), 158687#(<= proc_i 512), 158684#(<= proc_i 500), 158685#(<= proc_i 504), 158690#(<= proc_i 524), 158691#(<= proc_i 528), 158688#(<= proc_i 516), 158689#(<= proc_i 520), 158694#(<= proc_i 540), 158695#(<= proc_i 544), 158692#(<= proc_i 532), 158693#(<= proc_i 536), 158698#(<= proc_i 556), 158699#(<= proc_i 560), 158696#(<= proc_i 548), 158697#(<= proc_i 552), 158702#(<= proc_i 572), 158703#(<= proc_i 576), 158700#(<= proc_i 564), 158701#(<= proc_i 568), 158706#(<= proc_i 588), 158707#(<= proc_i 592), 158704#(<= proc_i 580), 158705#(<= proc_i 584), 158710#(<= proc_i 604), 158711#(<= proc_i 608), 158708#(<= proc_i 596), 158709#(<= proc_i 600), 158714#(<= proc_i 620), 158715#(<= proc_i 624), 158712#(<= proc_i 612), 158713#(<= proc_i 616), 158718#(<= proc_i 636), 158719#(<= proc_i 640), 158716#(<= proc_i 628), 158717#(<= proc_i 632)] [2018-07-23 13:53:57,548 INFO L134 CoverageAnalysis]: Checked inductivity of 34410 backedges. 0 proven. 34410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:57,548 INFO L450 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-07-23 13:53:57,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-07-23 13:53:57,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-07-23 13:53:57,553 INFO L87 Difference]: Start difference. First operand 374 states and 374 transitions. Second operand 188 states. [2018-07-23 13:53:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:58,788 INFO L93 Difference]: Finished difference Result 377 states and 377 transitions. [2018-07-23 13:53:58,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-07-23 13:53:58,789 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 373 [2018-07-23 13:53:58,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:58,789 INFO L225 Difference]: With dead ends: 377 [2018-07-23 13:53:58,789 INFO L226 Difference]: Without dead ends: 376 [2018-07-23 13:53:58,792 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-07-23 13:53:58,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-07-23 13:53:58,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2018-07-23 13:53:58,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-07-23 13:53:58,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2018-07-23 13:53:58,796 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 373 [2018-07-23 13:53:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:58,796 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2018-07-23 13:53:58,796 INFO L472 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-07-23 13:53:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2018-07-23 13:53:58,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-07-23 13:53:58,797 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:58,797 INFO L357 BasicCegarLoop]: trace histogram [187, 186, 1, 1] [2018-07-23 13:53:58,797 INFO L414 AbstractCegarLoop]: === Iteration 187 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:53:58,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1539283540, now seen corresponding path program 186 times [2018-07-23 13:53:58,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 34782 backedges. 0 proven. 34782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:00,156 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:54:00,156 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [187] total 187 [2018-07-23 13:54:00,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:54:00,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:54:00,157 INFO L185 omatonBuilderFactory]: Interpolants [160258#(<= proc_i 20), 160259#(<= proc_i 24), 160256#(<= proc_i 12), 160257#(<= proc_i 16), 160262#(<= proc_i 36), 160263#(<= proc_i 40), 160260#(<= proc_i 28), 160261#(<= proc_i 32), 160266#(<= proc_i 52), 160267#(<= proc_i 56), 160264#(<= proc_i 44), 160265#(<= proc_i 48), 160270#(<= proc_i 68), 160271#(<= proc_i 72), 160268#(<= proc_i 60), 160269#(<= proc_i 64), 160274#(<= proc_i 84), 160275#(<= proc_i 88), 160272#(<= proc_i 76), 160273#(<= proc_i 80), 160278#(<= proc_i 100), 160279#(<= proc_i 104), 160276#(<= proc_i 92), 160277#(<= proc_i 96), 160282#(<= proc_i 116), 160283#(<= proc_i 120), 160280#(<= proc_i 108), 160281#(<= proc_i 112), 160286#(<= proc_i 132), 160287#(<= proc_i 136), 160284#(<= proc_i 124), 160285#(<= proc_i 128), 160290#(<= proc_i 148), 160291#(<= proc_i 152), 160288#(<= proc_i 140), 160289#(<= proc_i 144), 160294#(<= proc_i 164), 160295#(<= proc_i 168), 160292#(<= proc_i 156), 160293#(<= proc_i 160), 160298#(<= proc_i 180), 160299#(<= proc_i 184), 160296#(<= proc_i 172), 160297#(<= proc_i 176), 160302#(<= proc_i 196), 160303#(<= proc_i 200), 160300#(<= proc_i 188), 160301#(<= proc_i 192), 160306#(<= proc_i 212), 160307#(<= proc_i 216), 160304#(<= proc_i 204), 160305#(<= proc_i 208), 160310#(<= proc_i 228), 160311#(<= proc_i 232), 160308#(<= proc_i 220), 160309#(<= proc_i 224), 160314#(<= proc_i 244), 160315#(<= proc_i 248), 160312#(<= proc_i 236), 160313#(<= proc_i 240), 160318#(<= proc_i 260), 160319#(<= proc_i 264), 160316#(<= proc_i 252), 160317#(<= proc_i 256), 160322#(<= proc_i 276), 160323#(<= proc_i 280), 160320#(<= proc_i 268), 160321#(<= proc_i 272), 160326#(<= proc_i 292), 160327#(<= proc_i 296), 160324#(<= proc_i 284), 160325#(<= proc_i 288), 160330#(<= proc_i 308), 160331#(<= proc_i 312), 160328#(<= proc_i 300), 160329#(<= proc_i 304), 160334#(<= proc_i 324), 160335#(<= proc_i 328), 160332#(<= proc_i 316), 160333#(<= proc_i 320), 160338#(<= proc_i 340), 160339#(<= proc_i 344), 160336#(<= proc_i 332), 160337#(<= proc_i 336), 160342#(<= proc_i 356), 160343#(<= proc_i 360), 160340#(<= proc_i 348), 160341#(<= proc_i 352), 160346#(<= proc_i 372), 160347#(<= proc_i 376), 160344#(<= proc_i 364), 160345#(<= proc_i 368), 160350#(<= proc_i 388), 160351#(<= proc_i 392), 160348#(<= proc_i 380), 160349#(<= proc_i 384), 160354#(<= proc_i 404), 160355#(<= proc_i 408), 160352#(<= proc_i 396), 160353#(<= proc_i 400), 160358#(<= proc_i 420), 160359#(<= proc_i 424), 160356#(<= proc_i 412), 160357#(<= proc_i 416), 160362#(<= proc_i 436), 160363#(<= proc_i 440), 160360#(<= proc_i 428), 160361#(<= proc_i 432), 160366#(<= proc_i 452), 160367#(<= proc_i 456), 160364#(<= proc_i 444), 160365#(<= proc_i 448), 160370#(<= proc_i 468), 160371#(<= proc_i 472), 160368#(<= proc_i 460), 160369#(<= proc_i 464), 160374#(<= proc_i 484), 160375#(<= proc_i 488), 160372#(<= proc_i 476), 160373#(<= proc_i 480), 160378#(<= proc_i 500), 160379#(<= proc_i 504), 160376#(<= proc_i 492), 160377#(<= proc_i 496), 160382#(<= proc_i 516), 160383#(<= proc_i 520), 160380#(<= proc_i 508), 160381#(<= proc_i 512), 160386#(<= proc_i 532), 160387#(<= proc_i 536), 160384#(<= proc_i 524), 160385#(<= proc_i 528), 160390#(<= proc_i 548), 160391#(<= proc_i 552), 160388#(<= proc_i 540), 160389#(<= proc_i 544), 160394#(<= proc_i 564), 160395#(<= proc_i 568), 160392#(<= proc_i 556), 160393#(<= proc_i 560), 160398#(<= proc_i 580), 160399#(<= proc_i 584), 160396#(<= proc_i 572), 160397#(<= proc_i 576), 160402#(<= proc_i 596), 160403#(<= proc_i 600), 160400#(<= proc_i 588), 160401#(<= proc_i 592), 160406#(<= proc_i 612), 160407#(<= proc_i 616), 160404#(<= proc_i 604), 160405#(<= proc_i 608), 160410#(<= proc_i 628), 160411#(<= proc_i 632), 160408#(<= proc_i 620), 160409#(<= proc_i 624), 160414#(<= proc_i 644), 160415#(<= proc_i 648), 160412#(<= proc_i 636), 160413#(<= proc_i 640), 160418#(<= proc_i 660), 160419#(<= proc_i 664), 160416#(<= proc_i 652), 160417#(<= proc_i 656), 160422#(<= proc_i 676), 160423#(<= proc_i 680), 160420#(<= proc_i 668), 160421#(<= proc_i 672), 160426#(<= proc_i 692), 160427#(<= proc_i 696), 160424#(<= proc_i 684), 160425#(<= proc_i 688), 160430#(<= proc_i 708), 160431#(<= proc_i 712), 160428#(<= proc_i 700), 160429#(<= proc_i 704), 160434#(<= proc_i 724), 160435#(<= proc_i 728), 160432#(<= proc_i 716), 160433#(<= proc_i 720), 160438#(<= proc_i 740), 160439#(<= proc_i 744), 160436#(<= proc_i 732), 160437#(<= proc_i 736), 160251#true, 160254#(<= proc_i 4), 160255#(<= proc_i 8), 160252#false, 160253#(<= proc_i 0)] [2018-07-23 13:54:00,159 INFO L134 CoverageAnalysis]: Checked inductivity of 34782 backedges. 0 proven. 34782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:00,159 INFO L450 AbstractCegarLoop]: Interpolant automaton has 189 states [2018-07-23 13:54:00,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2018-07-23 13:54:00,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-07-23 13:54:00,163 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 189 states. [2018-07-23 13:54:01,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:54:01,923 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2018-07-23 13:54:01,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-07-23 13:54:01,923 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 375 [2018-07-23 13:54:01,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:54:01,924 INFO L225 Difference]: With dead ends: 379 [2018-07-23 13:54:01,924 INFO L226 Difference]: Without dead ends: 378 [2018-07-23 13:54:01,926 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-07-23 13:54:01,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-07-23 13:54:01,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2018-07-23 13:54:01,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-07-23 13:54:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 378 transitions. [2018-07-23 13:54:01,930 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 378 transitions. Word has length 375 [2018-07-23 13:54:01,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:54:01,930 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 378 transitions. [2018-07-23 13:54:01,930 INFO L472 AbstractCegarLoop]: Interpolant automaton has 189 states. [2018-07-23 13:54:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 378 transitions. [2018-07-23 13:54:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-07-23 13:54:01,931 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:54:01,931 INFO L357 BasicCegarLoop]: trace histogram [188, 187, 1, 1] [2018-07-23 13:54:01,932 INFO L414 AbstractCegarLoop]: === Iteration 188 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:54:01,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1782733206, now seen corresponding path program 187 times [2018-07-23 13:54:01,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:54:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:03,232 INFO L134 CoverageAnalysis]: Checked inductivity of 35156 backedges. 0 proven. 35156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:03,232 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:54:03,232 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [188] total 188 [2018-07-23 13:54:03,233 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:54:03,233 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:54:03,233 INFO L185 omatonBuilderFactory]: Interpolants [162050#(<= proc_i 376), 162051#(<= proc_i 380), 162048#(<= proc_i 368), 162049#(<= proc_i 372), 162054#(<= proc_i 392), 162055#(<= proc_i 396), 162052#(<= proc_i 384), 162053#(<= proc_i 388), 162058#(<= proc_i 408), 162059#(<= proc_i 412), 162056#(<= proc_i 400), 162057#(<= proc_i 404), 162062#(<= proc_i 424), 162063#(<= proc_i 428), 162060#(<= proc_i 416), 162061#(<= proc_i 420), 162066#(<= proc_i 440), 162067#(<= proc_i 444), 162064#(<= proc_i 432), 162065#(<= proc_i 436), 162070#(<= proc_i 456), 162071#(<= proc_i 460), 162068#(<= proc_i 448), 162069#(<= proc_i 452), 162074#(<= proc_i 472), 162075#(<= proc_i 476), 162072#(<= proc_i 464), 162073#(<= proc_i 468), 162078#(<= proc_i 488), 162079#(<= proc_i 492), 162076#(<= proc_i 480), 162077#(<= proc_i 484), 162082#(<= proc_i 504), 162083#(<= proc_i 508), 162080#(<= proc_i 496), 162081#(<= proc_i 500), 162086#(<= proc_i 520), 162087#(<= proc_i 524), 162084#(<= proc_i 512), 162085#(<= proc_i 516), 162090#(<= proc_i 536), 162091#(<= proc_i 540), 162088#(<= proc_i 528), 162089#(<= proc_i 532), 162094#(<= proc_i 552), 162095#(<= proc_i 556), 162092#(<= proc_i 544), 162093#(<= proc_i 548), 162098#(<= proc_i 568), 162099#(<= proc_i 572), 162096#(<= proc_i 560), 162097#(<= proc_i 564), 162102#(<= proc_i 584), 162103#(<= proc_i 588), 162100#(<= proc_i 576), 162101#(<= proc_i 580), 162106#(<= proc_i 600), 162107#(<= proc_i 604), 162104#(<= proc_i 592), 162105#(<= proc_i 596), 162110#(<= proc_i 616), 162111#(<= proc_i 620), 162108#(<= proc_i 608), 162109#(<= proc_i 612), 162114#(<= proc_i 632), 162115#(<= proc_i 636), 162112#(<= proc_i 624), 162113#(<= proc_i 628), 162118#(<= proc_i 648), 162119#(<= proc_i 652), 162116#(<= proc_i 640), 162117#(<= proc_i 644), 162122#(<= proc_i 664), 162123#(<= proc_i 668), 162120#(<= proc_i 656), 162121#(<= proc_i 660), 162126#(<= proc_i 680), 162127#(<= proc_i 684), 162124#(<= proc_i 672), 162125#(<= proc_i 676), 162130#(<= proc_i 696), 162131#(<= proc_i 700), 162128#(<= proc_i 688), 162129#(<= proc_i 692), 162134#(<= proc_i 712), 162135#(<= proc_i 716), 162132#(<= proc_i 704), 162133#(<= proc_i 708), 162138#(<= proc_i 728), 162139#(<= proc_i 732), 162136#(<= proc_i 720), 162137#(<= proc_i 724), 162142#(<= proc_i 744), 162143#(<= proc_i 748), 162140#(<= proc_i 736), 162141#(<= proc_i 740), 161954#true, 161955#false, 161958#(<= proc_i 8), 161959#(<= proc_i 12), 161956#(<= proc_i 0), 161957#(<= proc_i 4), 161962#(<= proc_i 24), 161963#(<= proc_i 28), 161960#(<= proc_i 16), 161961#(<= proc_i 20), 161966#(<= proc_i 40), 161967#(<= proc_i 44), 161964#(<= proc_i 32), 161965#(<= proc_i 36), 161970#(<= proc_i 56), 161971#(<= proc_i 60), 161968#(<= proc_i 48), 161969#(<= proc_i 52), 161974#(<= proc_i 72), 161975#(<= proc_i 76), 161972#(<= proc_i 64), 161973#(<= proc_i 68), 161978#(<= proc_i 88), 161979#(<= proc_i 92), 161976#(<= proc_i 80), 161977#(<= proc_i 84), 161982#(<= proc_i 104), 161983#(<= proc_i 108), 161980#(<= proc_i 96), 161981#(<= proc_i 100), 161986#(<= proc_i 120), 161987#(<= proc_i 124), 161984#(<= proc_i 112), 161985#(<= proc_i 116), 161990#(<= proc_i 136), 161991#(<= proc_i 140), 161988#(<= proc_i 128), 161989#(<= proc_i 132), 161994#(<= proc_i 152), 161995#(<= proc_i 156), 161992#(<= proc_i 144), 161993#(<= proc_i 148), 161998#(<= proc_i 168), 161999#(<= proc_i 172), 161996#(<= proc_i 160), 161997#(<= proc_i 164), 162002#(<= proc_i 184), 162003#(<= proc_i 188), 162000#(<= proc_i 176), 162001#(<= proc_i 180), 162006#(<= proc_i 200), 162007#(<= proc_i 204), 162004#(<= proc_i 192), 162005#(<= proc_i 196), 162010#(<= proc_i 216), 162011#(<= proc_i 220), 162008#(<= proc_i 208), 162009#(<= proc_i 212), 162014#(<= proc_i 232), 162015#(<= proc_i 236), 162012#(<= proc_i 224), 162013#(<= proc_i 228), 162018#(<= proc_i 248), 162019#(<= proc_i 252), 162016#(<= proc_i 240), 162017#(<= proc_i 244), 162022#(<= proc_i 264), 162023#(<= proc_i 268), 162020#(<= proc_i 256), 162021#(<= proc_i 260), 162026#(<= proc_i 280), 162027#(<= proc_i 284), 162024#(<= proc_i 272), 162025#(<= proc_i 276), 162030#(<= proc_i 296), 162031#(<= proc_i 300), 162028#(<= proc_i 288), 162029#(<= proc_i 292), 162034#(<= proc_i 312), 162035#(<= proc_i 316), 162032#(<= proc_i 304), 162033#(<= proc_i 308), 162038#(<= proc_i 328), 162039#(<= proc_i 332), 162036#(<= proc_i 320), 162037#(<= proc_i 324), 162042#(<= proc_i 344), 162043#(<= proc_i 348), 162040#(<= proc_i 336), 162041#(<= proc_i 340), 162046#(<= proc_i 360), 162047#(<= proc_i 364), 162044#(<= proc_i 352), 162045#(<= proc_i 356)] [2018-07-23 13:54:03,235 INFO L134 CoverageAnalysis]: Checked inductivity of 35156 backedges. 0 proven. 35156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:03,235 INFO L450 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-07-23 13:54:03,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-07-23 13:54:03,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-07-23 13:54:03,239 INFO L87 Difference]: Start difference. First operand 378 states and 378 transitions. Second operand 190 states. [2018-07-23 13:54:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:54:03,812 INFO L93 Difference]: Finished difference Result 381 states and 381 transitions. [2018-07-23 13:54:03,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-07-23 13:54:03,812 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 377 [2018-07-23 13:54:03,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:54:03,813 INFO L225 Difference]: With dead ends: 381 [2018-07-23 13:54:03,813 INFO L226 Difference]: Without dead ends: 380 [2018-07-23 13:54:03,815 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-07-23 13:54:03,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-07-23 13:54:03,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-07-23 13:54:03,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-07-23 13:54:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 380 transitions. [2018-07-23 13:54:03,818 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 380 transitions. Word has length 377 [2018-07-23 13:54:03,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:54:03,818 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 380 transitions. [2018-07-23 13:54:03,819 INFO L472 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-07-23 13:54:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 380 transitions. [2018-07-23 13:54:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-07-23 13:54:03,820 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:54:03,820 INFO L357 BasicCegarLoop]: trace histogram [189, 188, 1, 1] [2018-07-23 13:54:03,821 INFO L414 AbstractCegarLoop]: === Iteration 189 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:54:03,821 INFO L82 PathProgramCache]: Analyzing trace with hash -485339048, now seen corresponding path program 188 times [2018-07-23 13:54:03,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:54:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:05,233 INFO L134 CoverageAnalysis]: Checked inductivity of 35532 backedges. 0 proven. 35532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:05,233 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:54:05,234 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [189] total 189 [2018-07-23 13:54:05,234 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:54:05,234 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:54:05,234 INFO L185 omatonBuilderFactory]: Interpolants [163842#(<= proc_i 696), 163843#(<= proc_i 700), 163840#(<= proc_i 688), 163841#(<= proc_i 692), 163846#(<= proc_i 712), 163847#(<= proc_i 716), 163844#(<= proc_i 704), 163845#(<= proc_i 708), 163850#(<= proc_i 728), 163851#(<= proc_i 732), 163848#(<= proc_i 720), 163849#(<= proc_i 724), 163854#(<= proc_i 744), 163855#(<= proc_i 748), 163852#(<= proc_i 736), 163853#(<= proc_i 740), 163856#(<= proc_i 752), 163666#true, 163667#false, 163670#(<= proc_i 8), 163671#(<= proc_i 12), 163668#(<= proc_i 0), 163669#(<= proc_i 4), 163674#(<= proc_i 24), 163675#(<= proc_i 28), 163672#(<= proc_i 16), 163673#(<= proc_i 20), 163678#(<= proc_i 40), 163679#(<= proc_i 44), 163676#(<= proc_i 32), 163677#(<= proc_i 36), 163682#(<= proc_i 56), 163683#(<= proc_i 60), 163680#(<= proc_i 48), 163681#(<= proc_i 52), 163686#(<= proc_i 72), 163687#(<= proc_i 76), 163684#(<= proc_i 64), 163685#(<= proc_i 68), 163690#(<= proc_i 88), 163691#(<= proc_i 92), 163688#(<= proc_i 80), 163689#(<= proc_i 84), 163694#(<= proc_i 104), 163695#(<= proc_i 108), 163692#(<= proc_i 96), 163693#(<= proc_i 100), 163698#(<= proc_i 120), 163699#(<= proc_i 124), 163696#(<= proc_i 112), 163697#(<= proc_i 116), 163702#(<= proc_i 136), 163703#(<= proc_i 140), 163700#(<= proc_i 128), 163701#(<= proc_i 132), 163706#(<= proc_i 152), 163707#(<= proc_i 156), 163704#(<= proc_i 144), 163705#(<= proc_i 148), 163710#(<= proc_i 168), 163711#(<= proc_i 172), 163708#(<= proc_i 160), 163709#(<= proc_i 164), 163714#(<= proc_i 184), 163715#(<= proc_i 188), 163712#(<= proc_i 176), 163713#(<= proc_i 180), 163718#(<= proc_i 200), 163719#(<= proc_i 204), 163716#(<= proc_i 192), 163717#(<= proc_i 196), 163722#(<= proc_i 216), 163723#(<= proc_i 220), 163720#(<= proc_i 208), 163721#(<= proc_i 212), 163726#(<= proc_i 232), 163727#(<= proc_i 236), 163724#(<= proc_i 224), 163725#(<= proc_i 228), 163730#(<= proc_i 248), 163731#(<= proc_i 252), 163728#(<= proc_i 240), 163729#(<= proc_i 244), 163734#(<= proc_i 264), 163735#(<= proc_i 268), 163732#(<= proc_i 256), 163733#(<= proc_i 260), 163738#(<= proc_i 280), 163739#(<= proc_i 284), 163736#(<= proc_i 272), 163737#(<= proc_i 276), 163742#(<= proc_i 296), 163743#(<= proc_i 300), 163740#(<= proc_i 288), 163741#(<= proc_i 292), 163746#(<= proc_i 312), 163747#(<= proc_i 316), 163744#(<= proc_i 304), 163745#(<= proc_i 308), 163750#(<= proc_i 328), 163751#(<= proc_i 332), 163748#(<= proc_i 320), 163749#(<= proc_i 324), 163754#(<= proc_i 344), 163755#(<= proc_i 348), 163752#(<= proc_i 336), 163753#(<= proc_i 340), 163758#(<= proc_i 360), 163759#(<= proc_i 364), 163756#(<= proc_i 352), 163757#(<= proc_i 356), 163762#(<= proc_i 376), 163763#(<= proc_i 380), 163760#(<= proc_i 368), 163761#(<= proc_i 372), 163766#(<= proc_i 392), 163767#(<= proc_i 396), 163764#(<= proc_i 384), 163765#(<= proc_i 388), 163770#(<= proc_i 408), 163771#(<= proc_i 412), 163768#(<= proc_i 400), 163769#(<= proc_i 404), 163774#(<= proc_i 424), 163775#(<= proc_i 428), 163772#(<= proc_i 416), 163773#(<= proc_i 420), 163778#(<= proc_i 440), 163779#(<= proc_i 444), 163776#(<= proc_i 432), 163777#(<= proc_i 436), 163782#(<= proc_i 456), 163783#(<= proc_i 460), 163780#(<= proc_i 448), 163781#(<= proc_i 452), 163786#(<= proc_i 472), 163787#(<= proc_i 476), 163784#(<= proc_i 464), 163785#(<= proc_i 468), 163790#(<= proc_i 488), 163791#(<= proc_i 492), 163788#(<= proc_i 480), 163789#(<= proc_i 484), 163794#(<= proc_i 504), 163795#(<= proc_i 508), 163792#(<= proc_i 496), 163793#(<= proc_i 500), 163798#(<= proc_i 520), 163799#(<= proc_i 524), 163796#(<= proc_i 512), 163797#(<= proc_i 516), 163802#(<= proc_i 536), 163803#(<= proc_i 540), 163800#(<= proc_i 528), 163801#(<= proc_i 532), 163806#(<= proc_i 552), 163807#(<= proc_i 556), 163804#(<= proc_i 544), 163805#(<= proc_i 548), 163810#(<= proc_i 568), 163811#(<= proc_i 572), 163808#(<= proc_i 560), 163809#(<= proc_i 564), 163814#(<= proc_i 584), 163815#(<= proc_i 588), 163812#(<= proc_i 576), 163813#(<= proc_i 580), 163818#(<= proc_i 600), 163819#(<= proc_i 604), 163816#(<= proc_i 592), 163817#(<= proc_i 596), 163822#(<= proc_i 616), 163823#(<= proc_i 620), 163820#(<= proc_i 608), 163821#(<= proc_i 612), 163826#(<= proc_i 632), 163827#(<= proc_i 636), 163824#(<= proc_i 624), 163825#(<= proc_i 628), 163830#(<= proc_i 648), 163831#(<= proc_i 652), 163828#(<= proc_i 640), 163829#(<= proc_i 644), 163834#(<= proc_i 664), 163835#(<= proc_i 668), 163832#(<= proc_i 656), 163833#(<= proc_i 660), 163838#(<= proc_i 680), 163839#(<= proc_i 684), 163836#(<= proc_i 672), 163837#(<= proc_i 676)] [2018-07-23 13:54:05,236 INFO L134 CoverageAnalysis]: Checked inductivity of 35532 backedges. 0 proven. 35532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:05,237 INFO L450 AbstractCegarLoop]: Interpolant automaton has 191 states [2018-07-23 13:54:05,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2018-07-23 13:54:05,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-07-23 13:54:05,241 INFO L87 Difference]: Start difference. First operand 380 states and 380 transitions. Second operand 191 states. [2018-07-23 13:54:06,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:54:06,711 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2018-07-23 13:54:06,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-07-23 13:54:06,711 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 379 [2018-07-23 13:54:06,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:54:06,712 INFO L225 Difference]: With dead ends: 383 [2018-07-23 13:54:06,712 INFO L226 Difference]: Without dead ends: 382 [2018-07-23 13:54:06,714 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-07-23 13:54:06,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-07-23 13:54:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-07-23 13:54:06,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-07-23 13:54:06,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 382 transitions. [2018-07-23 13:54:06,718 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 382 transitions. Word has length 379 [2018-07-23 13:54:06,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:54:06,718 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 382 transitions. [2018-07-23 13:54:06,719 INFO L472 AbstractCegarLoop]: Interpolant automaton has 191 states. [2018-07-23 13:54:06,719 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 382 transitions. [2018-07-23 13:54:06,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-07-23 13:54:06,720 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:54:06,720 INFO L357 BasicCegarLoop]: trace histogram [190, 189, 1, 1] [2018-07-23 13:54:06,720 INFO L414 AbstractCegarLoop]: === Iteration 190 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:54:06,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1740611226, now seen corresponding path program 189 times [2018-07-23 13:54:06,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:54:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 35910 backedges. 0 proven. 35910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:08,105 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:54:08,105 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [190] total 190 [2018-07-23 13:54:08,105 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:54:08,105 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:54:08,105 INFO L185 omatonBuilderFactory]: Interpolants [165387#true, 165390#(<= proc_i 4), 165391#(<= proc_i 8), 165388#false, 165389#(<= proc_i 0), 165394#(<= proc_i 20), 165395#(<= proc_i 24), 165392#(<= proc_i 12), 165393#(<= proc_i 16), 165398#(<= proc_i 36), 165399#(<= proc_i 40), 165396#(<= proc_i 28), 165397#(<= proc_i 32), 165402#(<= proc_i 52), 165403#(<= proc_i 56), 165400#(<= proc_i 44), 165401#(<= proc_i 48), 165406#(<= proc_i 68), 165407#(<= proc_i 72), 165404#(<= proc_i 60), 165405#(<= proc_i 64), 165410#(<= proc_i 84), 165411#(<= proc_i 88), 165408#(<= proc_i 76), 165409#(<= proc_i 80), 165414#(<= proc_i 100), 165415#(<= proc_i 104), 165412#(<= proc_i 92), 165413#(<= proc_i 96), 165418#(<= proc_i 116), 165419#(<= proc_i 120), 165416#(<= proc_i 108), 165417#(<= proc_i 112), 165422#(<= proc_i 132), 165423#(<= proc_i 136), 165420#(<= proc_i 124), 165421#(<= proc_i 128), 165426#(<= proc_i 148), 165427#(<= proc_i 152), 165424#(<= proc_i 140), 165425#(<= proc_i 144), 165430#(<= proc_i 164), 165431#(<= proc_i 168), 165428#(<= proc_i 156), 165429#(<= proc_i 160), 165434#(<= proc_i 180), 165435#(<= proc_i 184), 165432#(<= proc_i 172), 165433#(<= proc_i 176), 165438#(<= proc_i 196), 165439#(<= proc_i 200), 165436#(<= proc_i 188), 165437#(<= proc_i 192), 165442#(<= proc_i 212), 165443#(<= proc_i 216), 165440#(<= proc_i 204), 165441#(<= proc_i 208), 165446#(<= proc_i 228), 165447#(<= proc_i 232), 165444#(<= proc_i 220), 165445#(<= proc_i 224), 165450#(<= proc_i 244), 165451#(<= proc_i 248), 165448#(<= proc_i 236), 165449#(<= proc_i 240), 165454#(<= proc_i 260), 165455#(<= proc_i 264), 165452#(<= proc_i 252), 165453#(<= proc_i 256), 165458#(<= proc_i 276), 165459#(<= proc_i 280), 165456#(<= proc_i 268), 165457#(<= proc_i 272), 165462#(<= proc_i 292), 165463#(<= proc_i 296), 165460#(<= proc_i 284), 165461#(<= proc_i 288), 165466#(<= proc_i 308), 165467#(<= proc_i 312), 165464#(<= proc_i 300), 165465#(<= proc_i 304), 165470#(<= proc_i 324), 165471#(<= proc_i 328), 165468#(<= proc_i 316), 165469#(<= proc_i 320), 165474#(<= proc_i 340), 165475#(<= proc_i 344), 165472#(<= proc_i 332), 165473#(<= proc_i 336), 165478#(<= proc_i 356), 165479#(<= proc_i 360), 165476#(<= proc_i 348), 165477#(<= proc_i 352), 165482#(<= proc_i 372), 165483#(<= proc_i 376), 165480#(<= proc_i 364), 165481#(<= proc_i 368), 165486#(<= proc_i 388), 165487#(<= proc_i 392), 165484#(<= proc_i 380), 165485#(<= proc_i 384), 165490#(<= proc_i 404), 165491#(<= proc_i 408), 165488#(<= proc_i 396), 165489#(<= proc_i 400), 165494#(<= proc_i 420), 165495#(<= proc_i 424), 165492#(<= proc_i 412), 165493#(<= proc_i 416), 165498#(<= proc_i 436), 165499#(<= proc_i 440), 165496#(<= proc_i 428), 165497#(<= proc_i 432), 165502#(<= proc_i 452), 165503#(<= proc_i 456), 165500#(<= proc_i 444), 165501#(<= proc_i 448), 165506#(<= proc_i 468), 165507#(<= proc_i 472), 165504#(<= proc_i 460), 165505#(<= proc_i 464), 165510#(<= proc_i 484), 165511#(<= proc_i 488), 165508#(<= proc_i 476), 165509#(<= proc_i 480), 165514#(<= proc_i 500), 165515#(<= proc_i 504), 165512#(<= proc_i 492), 165513#(<= proc_i 496), 165518#(<= proc_i 516), 165519#(<= proc_i 520), 165516#(<= proc_i 508), 165517#(<= proc_i 512), 165522#(<= proc_i 532), 165523#(<= proc_i 536), 165520#(<= proc_i 524), 165521#(<= proc_i 528), 165526#(<= proc_i 548), 165527#(<= proc_i 552), 165524#(<= proc_i 540), 165525#(<= proc_i 544), 165530#(<= proc_i 564), 165531#(<= proc_i 568), 165528#(<= proc_i 556), 165529#(<= proc_i 560), 165534#(<= proc_i 580), 165535#(<= proc_i 584), 165532#(<= proc_i 572), 165533#(<= proc_i 576), 165538#(<= proc_i 596), 165539#(<= proc_i 600), 165536#(<= proc_i 588), 165537#(<= proc_i 592), 165542#(<= proc_i 612), 165543#(<= proc_i 616), 165540#(<= proc_i 604), 165541#(<= proc_i 608), 165546#(<= proc_i 628), 165547#(<= proc_i 632), 165544#(<= proc_i 620), 165545#(<= proc_i 624), 165550#(<= proc_i 644), 165551#(<= proc_i 648), 165548#(<= proc_i 636), 165549#(<= proc_i 640), 165554#(<= proc_i 660), 165555#(<= proc_i 664), 165552#(<= proc_i 652), 165553#(<= proc_i 656), 165558#(<= proc_i 676), 165559#(<= proc_i 680), 165556#(<= proc_i 668), 165557#(<= proc_i 672), 165562#(<= proc_i 692), 165563#(<= proc_i 696), 165560#(<= proc_i 684), 165561#(<= proc_i 688), 165566#(<= proc_i 708), 165567#(<= proc_i 712), 165564#(<= proc_i 700), 165565#(<= proc_i 704), 165570#(<= proc_i 724), 165571#(<= proc_i 728), 165568#(<= proc_i 716), 165569#(<= proc_i 720), 165574#(<= proc_i 740), 165575#(<= proc_i 744), 165572#(<= proc_i 732), 165573#(<= proc_i 736), 165578#(<= proc_i 756), 165576#(<= proc_i 748), 165577#(<= proc_i 752)] [2018-07-23 13:54:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 35910 backedges. 0 proven. 35910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:08,107 INFO L450 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-07-23 13:54:08,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-07-23 13:54:08,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-07-23 13:54:08,111 INFO L87 Difference]: Start difference. First operand 382 states and 382 transitions. Second operand 192 states. [2018-07-23 13:54:09,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:54:09,860 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2018-07-23 13:54:09,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-07-23 13:54:09,860 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 381 [2018-07-23 13:54:09,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:54:09,861 INFO L225 Difference]: With dead ends: 385 [2018-07-23 13:54:09,861 INFO L226 Difference]: Without dead ends: 384 [2018-07-23 13:54:09,863 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-07-23 13:54:09,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-07-23 13:54:09,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2018-07-23 13:54:09,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-07-23 13:54:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 384 transitions. [2018-07-23 13:54:09,866 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 384 transitions. Word has length 381 [2018-07-23 13:54:09,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:54:09,867 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 384 transitions. [2018-07-23 13:54:09,867 INFO L472 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-07-23 13:54:09,867 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 384 transitions. [2018-07-23 13:54:09,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-07-23 13:54:09,868 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:54:09,868 INFO L357 BasicCegarLoop]: trace histogram [191, 190, 1, 1] [2018-07-23 13:54:09,868 INFO L414 AbstractCegarLoop]: === Iteration 191 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:54:09,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1985111132, now seen corresponding path program 190 times [2018-07-23 13:54:09,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:54:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:11,216 INFO L134 CoverageAnalysis]: Checked inductivity of 36290 backedges. 0 proven. 36290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:11,216 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:54:11,217 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [191] total 191 [2018-07-23 13:54:11,217 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:54:11,217 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:54:11,217 INFO L185 omatonBuilderFactory]: Interpolants [167118#false, 167119#(<= proc_i 0), 167117#true, 167122#(<= proc_i 12), 167123#(<= proc_i 16), 167120#(<= proc_i 4), 167121#(<= proc_i 8), 167126#(<= proc_i 28), 167127#(<= proc_i 32), 167124#(<= proc_i 20), 167125#(<= proc_i 24), 167130#(<= proc_i 44), 167131#(<= proc_i 48), 167128#(<= proc_i 36), 167129#(<= proc_i 40), 167134#(<= proc_i 60), 167135#(<= proc_i 64), 167132#(<= proc_i 52), 167133#(<= proc_i 56), 167138#(<= proc_i 76), 167139#(<= proc_i 80), 167136#(<= proc_i 68), 167137#(<= proc_i 72), 167142#(<= proc_i 92), 167143#(<= proc_i 96), 167140#(<= proc_i 84), 167141#(<= proc_i 88), 167146#(<= proc_i 108), 167147#(<= proc_i 112), 167144#(<= proc_i 100), 167145#(<= proc_i 104), 167150#(<= proc_i 124), 167151#(<= proc_i 128), 167148#(<= proc_i 116), 167149#(<= proc_i 120), 167154#(<= proc_i 140), 167155#(<= proc_i 144), 167152#(<= proc_i 132), 167153#(<= proc_i 136), 167158#(<= proc_i 156), 167159#(<= proc_i 160), 167156#(<= proc_i 148), 167157#(<= proc_i 152), 167162#(<= proc_i 172), 167163#(<= proc_i 176), 167160#(<= proc_i 164), 167161#(<= proc_i 168), 167166#(<= proc_i 188), 167167#(<= proc_i 192), 167164#(<= proc_i 180), 167165#(<= proc_i 184), 167170#(<= proc_i 204), 167171#(<= proc_i 208), 167168#(<= proc_i 196), 167169#(<= proc_i 200), 167174#(<= proc_i 220), 167175#(<= proc_i 224), 167172#(<= proc_i 212), 167173#(<= proc_i 216), 167178#(<= proc_i 236), 167179#(<= proc_i 240), 167176#(<= proc_i 228), 167177#(<= proc_i 232), 167182#(<= proc_i 252), 167183#(<= proc_i 256), 167180#(<= proc_i 244), 167181#(<= proc_i 248), 167186#(<= proc_i 268), 167187#(<= proc_i 272), 167184#(<= proc_i 260), 167185#(<= proc_i 264), 167190#(<= proc_i 284), 167191#(<= proc_i 288), 167188#(<= proc_i 276), 167189#(<= proc_i 280), 167194#(<= proc_i 300), 167195#(<= proc_i 304), 167192#(<= proc_i 292), 167193#(<= proc_i 296), 167198#(<= proc_i 316), 167199#(<= proc_i 320), 167196#(<= proc_i 308), 167197#(<= proc_i 312), 167202#(<= proc_i 332), 167203#(<= proc_i 336), 167200#(<= proc_i 324), 167201#(<= proc_i 328), 167206#(<= proc_i 348), 167207#(<= proc_i 352), 167204#(<= proc_i 340), 167205#(<= proc_i 344), 167210#(<= proc_i 364), 167211#(<= proc_i 368), 167208#(<= proc_i 356), 167209#(<= proc_i 360), 167214#(<= proc_i 380), 167215#(<= proc_i 384), 167212#(<= proc_i 372), 167213#(<= proc_i 376), 167218#(<= proc_i 396), 167219#(<= proc_i 400), 167216#(<= proc_i 388), 167217#(<= proc_i 392), 167222#(<= proc_i 412), 167223#(<= proc_i 416), 167220#(<= proc_i 404), 167221#(<= proc_i 408), 167226#(<= proc_i 428), 167227#(<= proc_i 432), 167224#(<= proc_i 420), 167225#(<= proc_i 424), 167230#(<= proc_i 444), 167231#(<= proc_i 448), 167228#(<= proc_i 436), 167229#(<= proc_i 440), 167234#(<= proc_i 460), 167235#(<= proc_i 464), 167232#(<= proc_i 452), 167233#(<= proc_i 456), 167238#(<= proc_i 476), 167239#(<= proc_i 480), 167236#(<= proc_i 468), 167237#(<= proc_i 472), 167242#(<= proc_i 492), 167243#(<= proc_i 496), 167240#(<= proc_i 484), 167241#(<= proc_i 488), 167246#(<= proc_i 508), 167247#(<= proc_i 512), 167244#(<= proc_i 500), 167245#(<= proc_i 504), 167250#(<= proc_i 524), 167251#(<= proc_i 528), 167248#(<= proc_i 516), 167249#(<= proc_i 520), 167254#(<= proc_i 540), 167255#(<= proc_i 544), 167252#(<= proc_i 532), 167253#(<= proc_i 536), 167258#(<= proc_i 556), 167259#(<= proc_i 560), 167256#(<= proc_i 548), 167257#(<= proc_i 552), 167262#(<= proc_i 572), 167263#(<= proc_i 576), 167260#(<= proc_i 564), 167261#(<= proc_i 568), 167266#(<= proc_i 588), 167267#(<= proc_i 592), 167264#(<= proc_i 580), 167265#(<= proc_i 584), 167270#(<= proc_i 604), 167271#(<= proc_i 608), 167268#(<= proc_i 596), 167269#(<= proc_i 600), 167274#(<= proc_i 620), 167275#(<= proc_i 624), 167272#(<= proc_i 612), 167273#(<= proc_i 616), 167278#(<= proc_i 636), 167279#(<= proc_i 640), 167276#(<= proc_i 628), 167277#(<= proc_i 632), 167282#(<= proc_i 652), 167283#(<= proc_i 656), 167280#(<= proc_i 644), 167281#(<= proc_i 648), 167286#(<= proc_i 668), 167287#(<= proc_i 672), 167284#(<= proc_i 660), 167285#(<= proc_i 664), 167290#(<= proc_i 684), 167291#(<= proc_i 688), 167288#(<= proc_i 676), 167289#(<= proc_i 680), 167294#(<= proc_i 700), 167295#(<= proc_i 704), 167292#(<= proc_i 692), 167293#(<= proc_i 696), 167298#(<= proc_i 716), 167299#(<= proc_i 720), 167296#(<= proc_i 708), 167297#(<= proc_i 712), 167302#(<= proc_i 732), 167303#(<= proc_i 736), 167300#(<= proc_i 724), 167301#(<= proc_i 728), 167306#(<= proc_i 748), 167307#(<= proc_i 752), 167304#(<= proc_i 740), 167305#(<= proc_i 744), 167308#(<= proc_i 756), 167309#(<= proc_i 760)] [2018-07-23 13:54:11,220 INFO L134 CoverageAnalysis]: Checked inductivity of 36290 backedges. 0 proven. 36290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:11,220 INFO L450 AbstractCegarLoop]: Interpolant automaton has 193 states [2018-07-23 13:54:11,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2018-07-23 13:54:11,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-07-23 13:54:11,227 INFO L87 Difference]: Start difference. First operand 384 states and 384 transitions. Second operand 193 states. [2018-07-23 13:54:12,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:54:12,361 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2018-07-23 13:54:12,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-07-23 13:54:12,361 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 383 [2018-07-23 13:54:12,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:54:12,362 INFO L225 Difference]: With dead ends: 387 [2018-07-23 13:54:12,362 INFO L226 Difference]: Without dead ends: 386 [2018-07-23 13:54:12,364 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-07-23 13:54:12,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-07-23 13:54:12,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2018-07-23 13:54:12,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-07-23 13:54:12,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2018-07-23 13:54:12,367 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 383 [2018-07-23 13:54:12,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:54:12,368 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2018-07-23 13:54:12,368 INFO L472 AbstractCegarLoop]: Interpolant automaton has 193 states. [2018-07-23 13:54:12,368 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2018-07-23 13:54:12,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-07-23 13:54:12,369 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:54:12,370 INFO L357 BasicCegarLoop]: trace histogram [192, 191, 1, 1] [2018-07-23 13:54:12,370 INFO L414 AbstractCegarLoop]: === Iteration 192 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:54:12,370 INFO L82 PathProgramCache]: Analyzing trace with hash 726319518, now seen corresponding path program 191 times [2018-07-23 13:54:12,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:54:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 36672 backedges. 0 proven. 36672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:13,762 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:54:13,762 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [192] total 192 [2018-07-23 13:54:13,762 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:54:13,763 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:54:13,763 INFO L185 omatonBuilderFactory]: Interpolants [168962#(<= proc_i 416), 168963#(<= proc_i 420), 168960#(<= proc_i 408), 168961#(<= proc_i 412), 168966#(<= proc_i 432), 168967#(<= proc_i 436), 168964#(<= proc_i 424), 168965#(<= proc_i 428), 168970#(<= proc_i 448), 168971#(<= proc_i 452), 168968#(<= proc_i 440), 168969#(<= proc_i 444), 168974#(<= proc_i 464), 168975#(<= proc_i 468), 168972#(<= proc_i 456), 168973#(<= proc_i 460), 168978#(<= proc_i 480), 168979#(<= proc_i 484), 168976#(<= proc_i 472), 168977#(<= proc_i 476), 168982#(<= proc_i 496), 168983#(<= proc_i 500), 168980#(<= proc_i 488), 168981#(<= proc_i 492), 168986#(<= proc_i 512), 168987#(<= proc_i 516), 168984#(<= proc_i 504), 168985#(<= proc_i 508), 168990#(<= proc_i 528), 168991#(<= proc_i 532), 168988#(<= proc_i 520), 168989#(<= proc_i 524), 168994#(<= proc_i 544), 168995#(<= proc_i 548), 168992#(<= proc_i 536), 168993#(<= proc_i 540), 168998#(<= proc_i 560), 168999#(<= proc_i 564), 168996#(<= proc_i 552), 168997#(<= proc_i 556), 169002#(<= proc_i 576), 169003#(<= proc_i 580), 169000#(<= proc_i 568), 169001#(<= proc_i 572), 169006#(<= proc_i 592), 169007#(<= proc_i 596), 169004#(<= proc_i 584), 169005#(<= proc_i 588), 169010#(<= proc_i 608), 169011#(<= proc_i 612), 169008#(<= proc_i 600), 169009#(<= proc_i 604), 169014#(<= proc_i 624), 169015#(<= proc_i 628), 169012#(<= proc_i 616), 169013#(<= proc_i 620), 169018#(<= proc_i 640), 169019#(<= proc_i 644), 169016#(<= proc_i 632), 169017#(<= proc_i 636), 169022#(<= proc_i 656), 169023#(<= proc_i 660), 169020#(<= proc_i 648), 169021#(<= proc_i 652), 169026#(<= proc_i 672), 169027#(<= proc_i 676), 169024#(<= proc_i 664), 169025#(<= proc_i 668), 169030#(<= proc_i 688), 169031#(<= proc_i 692), 169028#(<= proc_i 680), 169029#(<= proc_i 684), 169034#(<= proc_i 704), 169035#(<= proc_i 708), 169032#(<= proc_i 696), 169033#(<= proc_i 700), 169038#(<= proc_i 720), 169039#(<= proc_i 724), 169036#(<= proc_i 712), 169037#(<= proc_i 716), 169042#(<= proc_i 736), 169043#(<= proc_i 740), 169040#(<= proc_i 728), 169041#(<= proc_i 732), 169046#(<= proc_i 752), 169047#(<= proc_i 756), 169044#(<= proc_i 744), 169045#(<= proc_i 748), 169048#(<= proc_i 760), 169049#(<= proc_i 764), 168858#(<= proc_i 0), 168859#(<= proc_i 4), 168856#true, 168857#false, 168862#(<= proc_i 16), 168863#(<= proc_i 20), 168860#(<= proc_i 8), 168861#(<= proc_i 12), 168866#(<= proc_i 32), 168867#(<= proc_i 36), 168864#(<= proc_i 24), 168865#(<= proc_i 28), 168870#(<= proc_i 48), 168871#(<= proc_i 52), 168868#(<= proc_i 40), 168869#(<= proc_i 44), 168874#(<= proc_i 64), 168875#(<= proc_i 68), 168872#(<= proc_i 56), 168873#(<= proc_i 60), 168878#(<= proc_i 80), 168879#(<= proc_i 84), 168876#(<= proc_i 72), 168877#(<= proc_i 76), 168882#(<= proc_i 96), 168883#(<= proc_i 100), 168880#(<= proc_i 88), 168881#(<= proc_i 92), 168886#(<= proc_i 112), 168887#(<= proc_i 116), 168884#(<= proc_i 104), 168885#(<= proc_i 108), 168890#(<= proc_i 128), 168891#(<= proc_i 132), 168888#(<= proc_i 120), 168889#(<= proc_i 124), 168894#(<= proc_i 144), 168895#(<= proc_i 148), 168892#(<= proc_i 136), 168893#(<= proc_i 140), 168898#(<= proc_i 160), 168899#(<= proc_i 164), 168896#(<= proc_i 152), 168897#(<= proc_i 156), 168902#(<= proc_i 176), 168903#(<= proc_i 180), 168900#(<= proc_i 168), 168901#(<= proc_i 172), 168906#(<= proc_i 192), 168907#(<= proc_i 196), 168904#(<= proc_i 184), 168905#(<= proc_i 188), 168910#(<= proc_i 208), 168911#(<= proc_i 212), 168908#(<= proc_i 200), 168909#(<= proc_i 204), 168914#(<= proc_i 224), 168915#(<= proc_i 228), 168912#(<= proc_i 216), 168913#(<= proc_i 220), 168918#(<= proc_i 240), 168919#(<= proc_i 244), 168916#(<= proc_i 232), 168917#(<= proc_i 236), 168922#(<= proc_i 256), 168923#(<= proc_i 260), 168920#(<= proc_i 248), 168921#(<= proc_i 252), 168926#(<= proc_i 272), 168927#(<= proc_i 276), 168924#(<= proc_i 264), 168925#(<= proc_i 268), 168930#(<= proc_i 288), 168931#(<= proc_i 292), 168928#(<= proc_i 280), 168929#(<= proc_i 284), 168934#(<= proc_i 304), 168935#(<= proc_i 308), 168932#(<= proc_i 296), 168933#(<= proc_i 300), 168938#(<= proc_i 320), 168939#(<= proc_i 324), 168936#(<= proc_i 312), 168937#(<= proc_i 316), 168942#(<= proc_i 336), 168943#(<= proc_i 340), 168940#(<= proc_i 328), 168941#(<= proc_i 332), 168946#(<= proc_i 352), 168947#(<= proc_i 356), 168944#(<= proc_i 344), 168945#(<= proc_i 348), 168950#(<= proc_i 368), 168951#(<= proc_i 372), 168948#(<= proc_i 360), 168949#(<= proc_i 364), 168954#(<= proc_i 384), 168955#(<= proc_i 388), 168952#(<= proc_i 376), 168953#(<= proc_i 380), 168958#(<= proc_i 400), 168959#(<= proc_i 404), 168956#(<= proc_i 392), 168957#(<= proc_i 396)] [2018-07-23 13:54:13,765 INFO L134 CoverageAnalysis]: Checked inductivity of 36672 backedges. 0 proven. 36672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:13,765 INFO L450 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-07-23 13:54:13,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-07-23 13:54:13,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-07-23 13:54:13,769 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 194 states. [2018-07-23 13:54:14,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:54:14,385 INFO L93 Difference]: Finished difference Result 389 states and 389 transitions. [2018-07-23 13:54:14,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-07-23 13:54:14,385 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 385 [2018-07-23 13:54:14,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:54:14,386 INFO L225 Difference]: With dead ends: 389 [2018-07-23 13:54:14,386 INFO L226 Difference]: Without dead ends: 388 [2018-07-23 13:54:14,388 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-07-23 13:54:14,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-07-23 13:54:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2018-07-23 13:54:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-07-23 13:54:14,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 388 transitions. [2018-07-23 13:54:14,393 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 388 transitions. Word has length 385 [2018-07-23 13:54:14,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:54:14,393 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 388 transitions. [2018-07-23 13:54:14,393 INFO L472 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-07-23 13:54:14,393 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 388 transitions. [2018-07-23 13:54:14,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-07-23 13:54:14,395 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:54:14,395 INFO L357 BasicCegarLoop]: trace histogram [193, 192, 1, 1] [2018-07-23 13:54:14,395 INFO L414 AbstractCegarLoop]: === Iteration 193 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:54:14,395 INFO L82 PathProgramCache]: Analyzing trace with hash -2086611360, now seen corresponding path program 192 times [2018-07-23 13:54:14,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:54:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:15,845 INFO L134 CoverageAnalysis]: Checked inductivity of 37056 backedges. 0 proven. 37056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:15,845 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:54:15,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [193] total 193 [2018-07-23 13:54:15,846 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:54:15,846 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:54:15,846 INFO L185 omatonBuilderFactory]: Interpolants [170606#(<= proc_i 0), 170607#(<= proc_i 4), 170604#true, 170605#false, 170610#(<= proc_i 16), 170611#(<= proc_i 20), 170608#(<= proc_i 8), 170609#(<= proc_i 12), 170614#(<= proc_i 32), 170615#(<= proc_i 36), 170612#(<= proc_i 24), 170613#(<= proc_i 28), 170618#(<= proc_i 48), 170619#(<= proc_i 52), 170616#(<= proc_i 40), 170617#(<= proc_i 44), 170622#(<= proc_i 64), 170623#(<= proc_i 68), 170620#(<= proc_i 56), 170621#(<= proc_i 60), 170626#(<= proc_i 80), 170627#(<= proc_i 84), 170624#(<= proc_i 72), 170625#(<= proc_i 76), 170630#(<= proc_i 96), 170631#(<= proc_i 100), 170628#(<= proc_i 88), 170629#(<= proc_i 92), 170634#(<= proc_i 112), 170635#(<= proc_i 116), 170632#(<= proc_i 104), 170633#(<= proc_i 108), 170638#(<= proc_i 128), 170639#(<= proc_i 132), 170636#(<= proc_i 120), 170637#(<= proc_i 124), 170642#(<= proc_i 144), 170643#(<= proc_i 148), 170640#(<= proc_i 136), 170641#(<= proc_i 140), 170646#(<= proc_i 160), 170647#(<= proc_i 164), 170644#(<= proc_i 152), 170645#(<= proc_i 156), 170650#(<= proc_i 176), 170651#(<= proc_i 180), 170648#(<= proc_i 168), 170649#(<= proc_i 172), 170654#(<= proc_i 192), 170655#(<= proc_i 196), 170652#(<= proc_i 184), 170653#(<= proc_i 188), 170658#(<= proc_i 208), 170659#(<= proc_i 212), 170656#(<= proc_i 200), 170657#(<= proc_i 204), 170662#(<= proc_i 224), 170663#(<= proc_i 228), 170660#(<= proc_i 216), 170661#(<= proc_i 220), 170666#(<= proc_i 240), 170667#(<= proc_i 244), 170664#(<= proc_i 232), 170665#(<= proc_i 236), 170670#(<= proc_i 256), 170671#(<= proc_i 260), 170668#(<= proc_i 248), 170669#(<= proc_i 252), 170674#(<= proc_i 272), 170675#(<= proc_i 276), 170672#(<= proc_i 264), 170673#(<= proc_i 268), 170678#(<= proc_i 288), 170679#(<= proc_i 292), 170676#(<= proc_i 280), 170677#(<= proc_i 284), 170682#(<= proc_i 304), 170683#(<= proc_i 308), 170680#(<= proc_i 296), 170681#(<= proc_i 300), 170686#(<= proc_i 320), 170687#(<= proc_i 324), 170684#(<= proc_i 312), 170685#(<= proc_i 316), 170690#(<= proc_i 336), 170691#(<= proc_i 340), 170688#(<= proc_i 328), 170689#(<= proc_i 332), 170694#(<= proc_i 352), 170695#(<= proc_i 356), 170692#(<= proc_i 344), 170693#(<= proc_i 348), 170698#(<= proc_i 368), 170699#(<= proc_i 372), 170696#(<= proc_i 360), 170697#(<= proc_i 364), 170702#(<= proc_i 384), 170703#(<= proc_i 388), 170700#(<= proc_i 376), 170701#(<= proc_i 380), 170706#(<= proc_i 400), 170707#(<= proc_i 404), 170704#(<= proc_i 392), 170705#(<= proc_i 396), 170710#(<= proc_i 416), 170711#(<= proc_i 420), 170708#(<= proc_i 408), 170709#(<= proc_i 412), 170714#(<= proc_i 432), 170715#(<= proc_i 436), 170712#(<= proc_i 424), 170713#(<= proc_i 428), 170718#(<= proc_i 448), 170719#(<= proc_i 452), 170716#(<= proc_i 440), 170717#(<= proc_i 444), 170722#(<= proc_i 464), 170723#(<= proc_i 468), 170720#(<= proc_i 456), 170721#(<= proc_i 460), 170726#(<= proc_i 480), 170727#(<= proc_i 484), 170724#(<= proc_i 472), 170725#(<= proc_i 476), 170730#(<= proc_i 496), 170731#(<= proc_i 500), 170728#(<= proc_i 488), 170729#(<= proc_i 492), 170734#(<= proc_i 512), 170735#(<= proc_i 516), 170732#(<= proc_i 504), 170733#(<= proc_i 508), 170738#(<= proc_i 528), 170739#(<= proc_i 532), 170736#(<= proc_i 520), 170737#(<= proc_i 524), 170742#(<= proc_i 544), 170743#(<= proc_i 548), 170740#(<= proc_i 536), 170741#(<= proc_i 540), 170746#(<= proc_i 560), 170747#(<= proc_i 564), 170744#(<= proc_i 552), 170745#(<= proc_i 556), 170750#(<= proc_i 576), 170751#(<= proc_i 580), 170748#(<= proc_i 568), 170749#(<= proc_i 572), 170754#(<= proc_i 592), 170755#(<= proc_i 596), 170752#(<= proc_i 584), 170753#(<= proc_i 588), 170758#(<= proc_i 608), 170759#(<= proc_i 612), 170756#(<= proc_i 600), 170757#(<= proc_i 604), 170762#(<= proc_i 624), 170763#(<= proc_i 628), 170760#(<= proc_i 616), 170761#(<= proc_i 620), 170766#(<= proc_i 640), 170767#(<= proc_i 644), 170764#(<= proc_i 632), 170765#(<= proc_i 636), 170770#(<= proc_i 656), 170771#(<= proc_i 660), 170768#(<= proc_i 648), 170769#(<= proc_i 652), 170774#(<= proc_i 672), 170775#(<= proc_i 676), 170772#(<= proc_i 664), 170773#(<= proc_i 668), 170778#(<= proc_i 688), 170779#(<= proc_i 692), 170776#(<= proc_i 680), 170777#(<= proc_i 684), 170782#(<= proc_i 704), 170783#(<= proc_i 708), 170780#(<= proc_i 696), 170781#(<= proc_i 700), 170786#(<= proc_i 720), 170787#(<= proc_i 724), 170784#(<= proc_i 712), 170785#(<= proc_i 716), 170790#(<= proc_i 736), 170791#(<= proc_i 740), 170788#(<= proc_i 728), 170789#(<= proc_i 732), 170794#(<= proc_i 752), 170795#(<= proc_i 756), 170792#(<= proc_i 744), 170793#(<= proc_i 748), 170798#(<= proc_i 768), 170796#(<= proc_i 760), 170797#(<= proc_i 764)] [2018-07-23 13:54:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 37056 backedges. 0 proven. 37056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:15,849 INFO L450 AbstractCegarLoop]: Interpolant automaton has 195 states [2018-07-23 13:54:15,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2018-07-23 13:54:15,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-07-23 13:54:15,856 INFO L87 Difference]: Start difference. First operand 388 states and 388 transitions. Second operand 195 states. [2018-07-23 13:54:16,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:54:16,902 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2018-07-23 13:54:16,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-07-23 13:54:16,902 INFO L78 Accepts]: Start accepts. Automaton has 195 states. Word has length 387 [2018-07-23 13:54:16,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:54:16,903 INFO L225 Difference]: With dead ends: 391 [2018-07-23 13:54:16,903 INFO L226 Difference]: Without dead ends: 390 [2018-07-23 13:54:16,906 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-07-23 13:54:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-07-23 13:54:16,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2018-07-23 13:54:16,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-07-23 13:54:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 390 transitions. [2018-07-23 13:54:16,910 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 390 transitions. Word has length 387 [2018-07-23 13:54:16,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:54:16,910 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 390 transitions. [2018-07-23 13:54:16,910 INFO L472 AbstractCegarLoop]: Interpolant automaton has 195 states. [2018-07-23 13:54:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 390 transitions. [2018-07-23 13:54:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-07-23 13:54:16,911 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:54:16,912 INFO L357 BasicCegarLoop]: trace histogram [194, 193, 1, 1] [2018-07-23 13:54:16,912 INFO L414 AbstractCegarLoop]: === Iteration 194 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:54:16,912 INFO L82 PathProgramCache]: Analyzing trace with hash 516211362, now seen corresponding path program 193 times [2018-07-23 13:54:16,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:54:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:18,390 INFO L134 CoverageAnalysis]: Checked inductivity of 37442 backedges. 0 proven. 37442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:18,390 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:54:18,390 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [194] total 194 [2018-07-23 13:54:18,390 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:54:18,391 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:54:18,391 INFO L185 omatonBuilderFactory]: Interpolants [172546#(<= proc_i 732), 172547#(<= proc_i 736), 172544#(<= proc_i 724), 172545#(<= proc_i 728), 172550#(<= proc_i 748), 172551#(<= proc_i 752), 172548#(<= proc_i 740), 172549#(<= proc_i 744), 172554#(<= proc_i 764), 172555#(<= proc_i 768), 172552#(<= proc_i 756), 172553#(<= proc_i 760), 172556#(<= proc_i 772), 172362#false, 172363#(<= proc_i 0), 172361#true, 172366#(<= proc_i 12), 172367#(<= proc_i 16), 172364#(<= proc_i 4), 172365#(<= proc_i 8), 172370#(<= proc_i 28), 172371#(<= proc_i 32), 172368#(<= proc_i 20), 172369#(<= proc_i 24), 172374#(<= proc_i 44), 172375#(<= proc_i 48), 172372#(<= proc_i 36), 172373#(<= proc_i 40), 172378#(<= proc_i 60), 172379#(<= proc_i 64), 172376#(<= proc_i 52), 172377#(<= proc_i 56), 172382#(<= proc_i 76), 172383#(<= proc_i 80), 172380#(<= proc_i 68), 172381#(<= proc_i 72), 172386#(<= proc_i 92), 172387#(<= proc_i 96), 172384#(<= proc_i 84), 172385#(<= proc_i 88), 172390#(<= proc_i 108), 172391#(<= proc_i 112), 172388#(<= proc_i 100), 172389#(<= proc_i 104), 172394#(<= proc_i 124), 172395#(<= proc_i 128), 172392#(<= proc_i 116), 172393#(<= proc_i 120), 172398#(<= proc_i 140), 172399#(<= proc_i 144), 172396#(<= proc_i 132), 172397#(<= proc_i 136), 172402#(<= proc_i 156), 172403#(<= proc_i 160), 172400#(<= proc_i 148), 172401#(<= proc_i 152), 172406#(<= proc_i 172), 172407#(<= proc_i 176), 172404#(<= proc_i 164), 172405#(<= proc_i 168), 172410#(<= proc_i 188), 172411#(<= proc_i 192), 172408#(<= proc_i 180), 172409#(<= proc_i 184), 172414#(<= proc_i 204), 172415#(<= proc_i 208), 172412#(<= proc_i 196), 172413#(<= proc_i 200), 172418#(<= proc_i 220), 172419#(<= proc_i 224), 172416#(<= proc_i 212), 172417#(<= proc_i 216), 172422#(<= proc_i 236), 172423#(<= proc_i 240), 172420#(<= proc_i 228), 172421#(<= proc_i 232), 172426#(<= proc_i 252), 172427#(<= proc_i 256), 172424#(<= proc_i 244), 172425#(<= proc_i 248), 172430#(<= proc_i 268), 172431#(<= proc_i 272), 172428#(<= proc_i 260), 172429#(<= proc_i 264), 172434#(<= proc_i 284), 172435#(<= proc_i 288), 172432#(<= proc_i 276), 172433#(<= proc_i 280), 172438#(<= proc_i 300), 172439#(<= proc_i 304), 172436#(<= proc_i 292), 172437#(<= proc_i 296), 172442#(<= proc_i 316), 172443#(<= proc_i 320), 172440#(<= proc_i 308), 172441#(<= proc_i 312), 172446#(<= proc_i 332), 172447#(<= proc_i 336), 172444#(<= proc_i 324), 172445#(<= proc_i 328), 172450#(<= proc_i 348), 172451#(<= proc_i 352), 172448#(<= proc_i 340), 172449#(<= proc_i 344), 172454#(<= proc_i 364), 172455#(<= proc_i 368), 172452#(<= proc_i 356), 172453#(<= proc_i 360), 172458#(<= proc_i 380), 172459#(<= proc_i 384), 172456#(<= proc_i 372), 172457#(<= proc_i 376), 172462#(<= proc_i 396), 172463#(<= proc_i 400), 172460#(<= proc_i 388), 172461#(<= proc_i 392), 172466#(<= proc_i 412), 172467#(<= proc_i 416), 172464#(<= proc_i 404), 172465#(<= proc_i 408), 172470#(<= proc_i 428), 172471#(<= proc_i 432), 172468#(<= proc_i 420), 172469#(<= proc_i 424), 172474#(<= proc_i 444), 172475#(<= proc_i 448), 172472#(<= proc_i 436), 172473#(<= proc_i 440), 172478#(<= proc_i 460), 172479#(<= proc_i 464), 172476#(<= proc_i 452), 172477#(<= proc_i 456), 172482#(<= proc_i 476), 172483#(<= proc_i 480), 172480#(<= proc_i 468), 172481#(<= proc_i 472), 172486#(<= proc_i 492), 172487#(<= proc_i 496), 172484#(<= proc_i 484), 172485#(<= proc_i 488), 172490#(<= proc_i 508), 172491#(<= proc_i 512), 172488#(<= proc_i 500), 172489#(<= proc_i 504), 172494#(<= proc_i 524), 172495#(<= proc_i 528), 172492#(<= proc_i 516), 172493#(<= proc_i 520), 172498#(<= proc_i 540), 172499#(<= proc_i 544), 172496#(<= proc_i 532), 172497#(<= proc_i 536), 172502#(<= proc_i 556), 172503#(<= proc_i 560), 172500#(<= proc_i 548), 172501#(<= proc_i 552), 172506#(<= proc_i 572), 172507#(<= proc_i 576), 172504#(<= proc_i 564), 172505#(<= proc_i 568), 172510#(<= proc_i 588), 172511#(<= proc_i 592), 172508#(<= proc_i 580), 172509#(<= proc_i 584), 172514#(<= proc_i 604), 172515#(<= proc_i 608), 172512#(<= proc_i 596), 172513#(<= proc_i 600), 172518#(<= proc_i 620), 172519#(<= proc_i 624), 172516#(<= proc_i 612), 172517#(<= proc_i 616), 172522#(<= proc_i 636), 172523#(<= proc_i 640), 172520#(<= proc_i 628), 172521#(<= proc_i 632), 172526#(<= proc_i 652), 172527#(<= proc_i 656), 172524#(<= proc_i 644), 172525#(<= proc_i 648), 172530#(<= proc_i 668), 172531#(<= proc_i 672), 172528#(<= proc_i 660), 172529#(<= proc_i 664), 172534#(<= proc_i 684), 172535#(<= proc_i 688), 172532#(<= proc_i 676), 172533#(<= proc_i 680), 172538#(<= proc_i 700), 172539#(<= proc_i 704), 172536#(<= proc_i 692), 172537#(<= proc_i 696), 172542#(<= proc_i 716), 172543#(<= proc_i 720), 172540#(<= proc_i 708), 172541#(<= proc_i 712)] [2018-07-23 13:54:18,393 INFO L134 CoverageAnalysis]: Checked inductivity of 37442 backedges. 0 proven. 37442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:18,393 INFO L450 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-07-23 13:54:18,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-07-23 13:54:18,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-07-23 13:54:18,398 INFO L87 Difference]: Start difference. First operand 390 states and 390 transitions. Second operand 196 states. [2018-07-23 13:54:20,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:54:20,106 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-07-23 13:54:20,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-07-23 13:54:20,106 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 389 [2018-07-23 13:54:20,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:54:20,107 INFO L225 Difference]: With dead ends: 393 [2018-07-23 13:54:20,107 INFO L226 Difference]: Without dead ends: 392 [2018-07-23 13:54:20,109 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-07-23 13:54:20,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-07-23 13:54:20,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2018-07-23 13:54:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-07-23 13:54:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 392 transitions. [2018-07-23 13:54:20,112 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 392 transitions. Word has length 389 [2018-07-23 13:54:20,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:54:20,113 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 392 transitions. [2018-07-23 13:54:20,113 INFO L472 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-07-23 13:54:20,113 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 392 transitions. [2018-07-23 13:54:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-07-23 13:54:20,114 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:54:20,114 INFO L357 BasicCegarLoop]: trace histogram [195, 194, 1, 1] [2018-07-23 13:54:20,114 INFO L414 AbstractCegarLoop]: === Iteration 195 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:54:20,114 INFO L82 PathProgramCache]: Analyzing trace with hash -2137086364, now seen corresponding path program 194 times [2018-07-23 13:54:20,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:54:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:21,579 INFO L134 CoverageAnalysis]: Checked inductivity of 37830 backedges. 0 proven. 37830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:21,579 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:54:21,580 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [195] total 195 [2018-07-23 13:54:21,580 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:54:21,580 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:54:21,580 INFO L185 omatonBuilderFactory]: Interpolants [174127#true, 174130#(<= proc_i 4), 174131#(<= proc_i 8), 174128#false, 174129#(<= proc_i 0), 174134#(<= proc_i 20), 174135#(<= proc_i 24), 174132#(<= proc_i 12), 174133#(<= proc_i 16), 174138#(<= proc_i 36), 174139#(<= proc_i 40), 174136#(<= proc_i 28), 174137#(<= proc_i 32), 174142#(<= proc_i 52), 174143#(<= proc_i 56), 174140#(<= proc_i 44), 174141#(<= proc_i 48), 174146#(<= proc_i 68), 174147#(<= proc_i 72), 174144#(<= proc_i 60), 174145#(<= proc_i 64), 174150#(<= proc_i 84), 174151#(<= proc_i 88), 174148#(<= proc_i 76), 174149#(<= proc_i 80), 174154#(<= proc_i 100), 174155#(<= proc_i 104), 174152#(<= proc_i 92), 174153#(<= proc_i 96), 174158#(<= proc_i 116), 174159#(<= proc_i 120), 174156#(<= proc_i 108), 174157#(<= proc_i 112), 174162#(<= proc_i 132), 174163#(<= proc_i 136), 174160#(<= proc_i 124), 174161#(<= proc_i 128), 174166#(<= proc_i 148), 174167#(<= proc_i 152), 174164#(<= proc_i 140), 174165#(<= proc_i 144), 174170#(<= proc_i 164), 174171#(<= proc_i 168), 174168#(<= proc_i 156), 174169#(<= proc_i 160), 174174#(<= proc_i 180), 174175#(<= proc_i 184), 174172#(<= proc_i 172), 174173#(<= proc_i 176), 174178#(<= proc_i 196), 174179#(<= proc_i 200), 174176#(<= proc_i 188), 174177#(<= proc_i 192), 174182#(<= proc_i 212), 174183#(<= proc_i 216), 174180#(<= proc_i 204), 174181#(<= proc_i 208), 174186#(<= proc_i 228), 174187#(<= proc_i 232), 174184#(<= proc_i 220), 174185#(<= proc_i 224), 174190#(<= proc_i 244), 174191#(<= proc_i 248), 174188#(<= proc_i 236), 174189#(<= proc_i 240), 174194#(<= proc_i 260), 174195#(<= proc_i 264), 174192#(<= proc_i 252), 174193#(<= proc_i 256), 174198#(<= proc_i 276), 174199#(<= proc_i 280), 174196#(<= proc_i 268), 174197#(<= proc_i 272), 174202#(<= proc_i 292), 174203#(<= proc_i 296), 174200#(<= proc_i 284), 174201#(<= proc_i 288), 174206#(<= proc_i 308), 174207#(<= proc_i 312), 174204#(<= proc_i 300), 174205#(<= proc_i 304), 174210#(<= proc_i 324), 174211#(<= proc_i 328), 174208#(<= proc_i 316), 174209#(<= proc_i 320), 174214#(<= proc_i 340), 174215#(<= proc_i 344), 174212#(<= proc_i 332), 174213#(<= proc_i 336), 174218#(<= proc_i 356), 174219#(<= proc_i 360), 174216#(<= proc_i 348), 174217#(<= proc_i 352), 174222#(<= proc_i 372), 174223#(<= proc_i 376), 174220#(<= proc_i 364), 174221#(<= proc_i 368), 174226#(<= proc_i 388), 174227#(<= proc_i 392), 174224#(<= proc_i 380), 174225#(<= proc_i 384), 174230#(<= proc_i 404), 174231#(<= proc_i 408), 174228#(<= proc_i 396), 174229#(<= proc_i 400), 174234#(<= proc_i 420), 174235#(<= proc_i 424), 174232#(<= proc_i 412), 174233#(<= proc_i 416), 174238#(<= proc_i 436), 174239#(<= proc_i 440), 174236#(<= proc_i 428), 174237#(<= proc_i 432), 174242#(<= proc_i 452), 174243#(<= proc_i 456), 174240#(<= proc_i 444), 174241#(<= proc_i 448), 174246#(<= proc_i 468), 174247#(<= proc_i 472), 174244#(<= proc_i 460), 174245#(<= proc_i 464), 174250#(<= proc_i 484), 174251#(<= proc_i 488), 174248#(<= proc_i 476), 174249#(<= proc_i 480), 174254#(<= proc_i 500), 174255#(<= proc_i 504), 174252#(<= proc_i 492), 174253#(<= proc_i 496), 174258#(<= proc_i 516), 174259#(<= proc_i 520), 174256#(<= proc_i 508), 174257#(<= proc_i 512), 174262#(<= proc_i 532), 174263#(<= proc_i 536), 174260#(<= proc_i 524), 174261#(<= proc_i 528), 174266#(<= proc_i 548), 174267#(<= proc_i 552), 174264#(<= proc_i 540), 174265#(<= proc_i 544), 174270#(<= proc_i 564), 174271#(<= proc_i 568), 174268#(<= proc_i 556), 174269#(<= proc_i 560), 174274#(<= proc_i 580), 174275#(<= proc_i 584), 174272#(<= proc_i 572), 174273#(<= proc_i 576), 174278#(<= proc_i 596), 174279#(<= proc_i 600), 174276#(<= proc_i 588), 174277#(<= proc_i 592), 174282#(<= proc_i 612), 174283#(<= proc_i 616), 174280#(<= proc_i 604), 174281#(<= proc_i 608), 174286#(<= proc_i 628), 174287#(<= proc_i 632), 174284#(<= proc_i 620), 174285#(<= proc_i 624), 174290#(<= proc_i 644), 174291#(<= proc_i 648), 174288#(<= proc_i 636), 174289#(<= proc_i 640), 174294#(<= proc_i 660), 174295#(<= proc_i 664), 174292#(<= proc_i 652), 174293#(<= proc_i 656), 174298#(<= proc_i 676), 174299#(<= proc_i 680), 174296#(<= proc_i 668), 174297#(<= proc_i 672), 174302#(<= proc_i 692), 174303#(<= proc_i 696), 174300#(<= proc_i 684), 174301#(<= proc_i 688), 174306#(<= proc_i 708), 174307#(<= proc_i 712), 174304#(<= proc_i 700), 174305#(<= proc_i 704), 174310#(<= proc_i 724), 174311#(<= proc_i 728), 174308#(<= proc_i 716), 174309#(<= proc_i 720), 174314#(<= proc_i 740), 174315#(<= proc_i 744), 174312#(<= proc_i 732), 174313#(<= proc_i 736), 174318#(<= proc_i 756), 174319#(<= proc_i 760), 174316#(<= proc_i 748), 174317#(<= proc_i 752), 174322#(<= proc_i 772), 174323#(<= proc_i 776), 174320#(<= proc_i 764), 174321#(<= proc_i 768)] [2018-07-23 13:54:21,582 INFO L134 CoverageAnalysis]: Checked inductivity of 37830 backedges. 0 proven. 37830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:21,582 INFO L450 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-07-23 13:54:21,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-07-23 13:54:21,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-07-23 13:54:21,588 INFO L87 Difference]: Start difference. First operand 392 states and 392 transitions. Second operand 197 states. [2018-07-23 13:54:23,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:54:23,410 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2018-07-23 13:54:23,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-07-23 13:54:23,410 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 391 [2018-07-23 13:54:23,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:54:23,411 INFO L225 Difference]: With dead ends: 395 [2018-07-23 13:54:23,411 INFO L226 Difference]: Without dead ends: 394 [2018-07-23 13:54:23,413 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-07-23 13:54:23,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-07-23 13:54:23,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2018-07-23 13:54:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-07-23 13:54:23,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 394 transitions. [2018-07-23 13:54:23,417 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 394 transitions. Word has length 391 [2018-07-23 13:54:23,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:54:23,417 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 394 transitions. [2018-07-23 13:54:23,417 INFO L472 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-07-23 13:54:23,417 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 394 transitions. [2018-07-23 13:54:23,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-07-23 13:54:23,418 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:54:23,418 INFO L357 BasicCegarLoop]: trace histogram [196, 195, 1, 1] [2018-07-23 13:54:23,418 INFO L414 AbstractCegarLoop]: === Iteration 196 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:54:23,419 INFO L82 PathProgramCache]: Analyzing trace with hash -745627226, now seen corresponding path program 195 times [2018-07-23 13:54:23,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:54:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:24,906 INFO L134 CoverageAnalysis]: Checked inductivity of 38220 backedges. 0 proven. 38220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:24,907 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:54:24,907 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [196] total 196 [2018-07-23 13:54:24,907 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:54:24,908 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:54:24,908 INFO L185 omatonBuilderFactory]: Interpolants [175902#true, 175903#false, 175906#(<= proc_i 8), 175907#(<= proc_i 12), 175904#(<= proc_i 0), 175905#(<= proc_i 4), 175910#(<= proc_i 24), 175911#(<= proc_i 28), 175908#(<= proc_i 16), 175909#(<= proc_i 20), 175914#(<= proc_i 40), 175915#(<= proc_i 44), 175912#(<= proc_i 32), 175913#(<= proc_i 36), 175918#(<= proc_i 56), 175919#(<= proc_i 60), 175916#(<= proc_i 48), 175917#(<= proc_i 52), 175922#(<= proc_i 72), 175923#(<= proc_i 76), 175920#(<= proc_i 64), 175921#(<= proc_i 68), 175926#(<= proc_i 88), 175927#(<= proc_i 92), 175924#(<= proc_i 80), 175925#(<= proc_i 84), 175930#(<= proc_i 104), 175931#(<= proc_i 108), 175928#(<= proc_i 96), 175929#(<= proc_i 100), 175934#(<= proc_i 120), 175935#(<= proc_i 124), 175932#(<= proc_i 112), 175933#(<= proc_i 116), 175938#(<= proc_i 136), 175939#(<= proc_i 140), 175936#(<= proc_i 128), 175937#(<= proc_i 132), 175942#(<= proc_i 152), 175943#(<= proc_i 156), 175940#(<= proc_i 144), 175941#(<= proc_i 148), 175946#(<= proc_i 168), 175947#(<= proc_i 172), 175944#(<= proc_i 160), 175945#(<= proc_i 164), 175950#(<= proc_i 184), 175951#(<= proc_i 188), 175948#(<= proc_i 176), 175949#(<= proc_i 180), 175954#(<= proc_i 200), 175955#(<= proc_i 204), 175952#(<= proc_i 192), 175953#(<= proc_i 196), 175958#(<= proc_i 216), 175959#(<= proc_i 220), 175956#(<= proc_i 208), 175957#(<= proc_i 212), 175962#(<= proc_i 232), 175963#(<= proc_i 236), 175960#(<= proc_i 224), 175961#(<= proc_i 228), 175966#(<= proc_i 248), 175967#(<= proc_i 252), 175964#(<= proc_i 240), 175965#(<= proc_i 244), 175970#(<= proc_i 264), 175971#(<= proc_i 268), 175968#(<= proc_i 256), 175969#(<= proc_i 260), 175974#(<= proc_i 280), 175975#(<= proc_i 284), 175972#(<= proc_i 272), 175973#(<= proc_i 276), 175978#(<= proc_i 296), 175979#(<= proc_i 300), 175976#(<= proc_i 288), 175977#(<= proc_i 292), 175982#(<= proc_i 312), 175983#(<= proc_i 316), 175980#(<= proc_i 304), 175981#(<= proc_i 308), 175986#(<= proc_i 328), 175987#(<= proc_i 332), 175984#(<= proc_i 320), 175985#(<= proc_i 324), 175990#(<= proc_i 344), 175991#(<= proc_i 348), 175988#(<= proc_i 336), 175989#(<= proc_i 340), 175994#(<= proc_i 360), 175995#(<= proc_i 364), 175992#(<= proc_i 352), 175993#(<= proc_i 356), 175998#(<= proc_i 376), 175999#(<= proc_i 380), 175996#(<= proc_i 368), 175997#(<= proc_i 372), 176002#(<= proc_i 392), 176003#(<= proc_i 396), 176000#(<= proc_i 384), 176001#(<= proc_i 388), 176006#(<= proc_i 408), 176007#(<= proc_i 412), 176004#(<= proc_i 400), 176005#(<= proc_i 404), 176010#(<= proc_i 424), 176011#(<= proc_i 428), 176008#(<= proc_i 416), 176009#(<= proc_i 420), 176014#(<= proc_i 440), 176015#(<= proc_i 444), 176012#(<= proc_i 432), 176013#(<= proc_i 436), 176018#(<= proc_i 456), 176019#(<= proc_i 460), 176016#(<= proc_i 448), 176017#(<= proc_i 452), 176022#(<= proc_i 472), 176023#(<= proc_i 476), 176020#(<= proc_i 464), 176021#(<= proc_i 468), 176026#(<= proc_i 488), 176027#(<= proc_i 492), 176024#(<= proc_i 480), 176025#(<= proc_i 484), 176030#(<= proc_i 504), 176031#(<= proc_i 508), 176028#(<= proc_i 496), 176029#(<= proc_i 500), 176034#(<= proc_i 520), 176035#(<= proc_i 524), 176032#(<= proc_i 512), 176033#(<= proc_i 516), 176038#(<= proc_i 536), 176039#(<= proc_i 540), 176036#(<= proc_i 528), 176037#(<= proc_i 532), 176042#(<= proc_i 552), 176043#(<= proc_i 556), 176040#(<= proc_i 544), 176041#(<= proc_i 548), 176046#(<= proc_i 568), 176047#(<= proc_i 572), 176044#(<= proc_i 560), 176045#(<= proc_i 564), 176050#(<= proc_i 584), 176051#(<= proc_i 588), 176048#(<= proc_i 576), 176049#(<= proc_i 580), 176054#(<= proc_i 600), 176055#(<= proc_i 604), 176052#(<= proc_i 592), 176053#(<= proc_i 596), 176058#(<= proc_i 616), 176059#(<= proc_i 620), 176056#(<= proc_i 608), 176057#(<= proc_i 612), 176062#(<= proc_i 632), 176063#(<= proc_i 636), 176060#(<= proc_i 624), 176061#(<= proc_i 628), 176066#(<= proc_i 648), 176067#(<= proc_i 652), 176064#(<= proc_i 640), 176065#(<= proc_i 644), 176070#(<= proc_i 664), 176071#(<= proc_i 668), 176068#(<= proc_i 656), 176069#(<= proc_i 660), 176074#(<= proc_i 680), 176075#(<= proc_i 684), 176072#(<= proc_i 672), 176073#(<= proc_i 676), 176078#(<= proc_i 696), 176079#(<= proc_i 700), 176076#(<= proc_i 688), 176077#(<= proc_i 692), 176082#(<= proc_i 712), 176083#(<= proc_i 716), 176080#(<= proc_i 704), 176081#(<= proc_i 708), 176086#(<= proc_i 728), 176087#(<= proc_i 732), 176084#(<= proc_i 720), 176085#(<= proc_i 724), 176090#(<= proc_i 744), 176091#(<= proc_i 748), 176088#(<= proc_i 736), 176089#(<= proc_i 740), 176094#(<= proc_i 760), 176095#(<= proc_i 764), 176092#(<= proc_i 752), 176093#(<= proc_i 756), 176098#(<= proc_i 776), 176099#(<= proc_i 780), 176096#(<= proc_i 768), 176097#(<= proc_i 772)] [2018-07-23 13:54:24,911 INFO L134 CoverageAnalysis]: Checked inductivity of 38220 backedges. 0 proven. 38220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:24,911 INFO L450 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-07-23 13:54:24,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-07-23 13:54:24,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-07-23 13:54:24,916 INFO L87 Difference]: Start difference. First operand 394 states and 394 transitions. Second operand 198 states. [2018-07-23 13:54:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:54:27,309 INFO L93 Difference]: Finished difference Result 397 states and 397 transitions. [2018-07-23 13:54:27,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-07-23 13:54:27,310 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 393 [2018-07-23 13:54:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:54:27,310 INFO L225 Difference]: With dead ends: 397 [2018-07-23 13:54:27,311 INFO L226 Difference]: Without dead ends: 396 [2018-07-23 13:54:27,313 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-07-23 13:54:27,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-07-23 13:54:27,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2018-07-23 13:54:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-07-23 13:54:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 396 transitions. [2018-07-23 13:54:27,318 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 396 transitions. Word has length 393 [2018-07-23 13:54:27,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:54:27,318 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 396 transitions. [2018-07-23 13:54:27,318 INFO L472 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-07-23 13:54:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 396 transitions. [2018-07-23 13:54:27,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-07-23 13:54:27,320 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:54:27,320 INFO L357 BasicCegarLoop]: trace histogram [197, 196, 1, 1] [2018-07-23 13:54:27,320 INFO L414 AbstractCegarLoop]: === Iteration 197 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:54:27,320 INFO L82 PathProgramCache]: Analyzing trace with hash 711775336, now seen corresponding path program 196 times [2018-07-23 13:54:27,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:54:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:29,000 INFO L134 CoverageAnalysis]: Checked inductivity of 38612 backedges. 0 proven. 38612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:29,000 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:54:29,000 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [197] total 197 [2018-07-23 13:54:29,000 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:54:29,001 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:54:29,001 INFO L185 omatonBuilderFactory]: Interpolants [177686#true, 177687#false, 177690#(<= proc_i 8), 177691#(<= proc_i 12), 177688#(<= proc_i 0), 177689#(<= proc_i 4), 177694#(<= proc_i 24), 177695#(<= proc_i 28), 177692#(<= proc_i 16), 177693#(<= proc_i 20), 177698#(<= proc_i 40), 177699#(<= proc_i 44), 177696#(<= proc_i 32), 177697#(<= proc_i 36), 177702#(<= proc_i 56), 177703#(<= proc_i 60), 177700#(<= proc_i 48), 177701#(<= proc_i 52), 177706#(<= proc_i 72), 177707#(<= proc_i 76), 177704#(<= proc_i 64), 177705#(<= proc_i 68), 177710#(<= proc_i 88), 177711#(<= proc_i 92), 177708#(<= proc_i 80), 177709#(<= proc_i 84), 177714#(<= proc_i 104), 177715#(<= proc_i 108), 177712#(<= proc_i 96), 177713#(<= proc_i 100), 177718#(<= proc_i 120), 177719#(<= proc_i 124), 177716#(<= proc_i 112), 177717#(<= proc_i 116), 177722#(<= proc_i 136), 177723#(<= proc_i 140), 177720#(<= proc_i 128), 177721#(<= proc_i 132), 177726#(<= proc_i 152), 177727#(<= proc_i 156), 177724#(<= proc_i 144), 177725#(<= proc_i 148), 177730#(<= proc_i 168), 177731#(<= proc_i 172), 177728#(<= proc_i 160), 177729#(<= proc_i 164), 177734#(<= proc_i 184), 177735#(<= proc_i 188), 177732#(<= proc_i 176), 177733#(<= proc_i 180), 177738#(<= proc_i 200), 177739#(<= proc_i 204), 177736#(<= proc_i 192), 177737#(<= proc_i 196), 177742#(<= proc_i 216), 177743#(<= proc_i 220), 177740#(<= proc_i 208), 177741#(<= proc_i 212), 177746#(<= proc_i 232), 177747#(<= proc_i 236), 177744#(<= proc_i 224), 177745#(<= proc_i 228), 177750#(<= proc_i 248), 177751#(<= proc_i 252), 177748#(<= proc_i 240), 177749#(<= proc_i 244), 177754#(<= proc_i 264), 177755#(<= proc_i 268), 177752#(<= proc_i 256), 177753#(<= proc_i 260), 177758#(<= proc_i 280), 177759#(<= proc_i 284), 177756#(<= proc_i 272), 177757#(<= proc_i 276), 177762#(<= proc_i 296), 177763#(<= proc_i 300), 177760#(<= proc_i 288), 177761#(<= proc_i 292), 177766#(<= proc_i 312), 177767#(<= proc_i 316), 177764#(<= proc_i 304), 177765#(<= proc_i 308), 177770#(<= proc_i 328), 177771#(<= proc_i 332), 177768#(<= proc_i 320), 177769#(<= proc_i 324), 177774#(<= proc_i 344), 177775#(<= proc_i 348), 177772#(<= proc_i 336), 177773#(<= proc_i 340), 177778#(<= proc_i 360), 177779#(<= proc_i 364), 177776#(<= proc_i 352), 177777#(<= proc_i 356), 177782#(<= proc_i 376), 177783#(<= proc_i 380), 177780#(<= proc_i 368), 177781#(<= proc_i 372), 177786#(<= proc_i 392), 177787#(<= proc_i 396), 177784#(<= proc_i 384), 177785#(<= proc_i 388), 177790#(<= proc_i 408), 177791#(<= proc_i 412), 177788#(<= proc_i 400), 177789#(<= proc_i 404), 177794#(<= proc_i 424), 177795#(<= proc_i 428), 177792#(<= proc_i 416), 177793#(<= proc_i 420), 177798#(<= proc_i 440), 177799#(<= proc_i 444), 177796#(<= proc_i 432), 177797#(<= proc_i 436), 177802#(<= proc_i 456), 177803#(<= proc_i 460), 177800#(<= proc_i 448), 177801#(<= proc_i 452), 177806#(<= proc_i 472), 177807#(<= proc_i 476), 177804#(<= proc_i 464), 177805#(<= proc_i 468), 177810#(<= proc_i 488), 177811#(<= proc_i 492), 177808#(<= proc_i 480), 177809#(<= proc_i 484), 177814#(<= proc_i 504), 177815#(<= proc_i 508), 177812#(<= proc_i 496), 177813#(<= proc_i 500), 177818#(<= proc_i 520), 177819#(<= proc_i 524), 177816#(<= proc_i 512), 177817#(<= proc_i 516), 177822#(<= proc_i 536), 177823#(<= proc_i 540), 177820#(<= proc_i 528), 177821#(<= proc_i 532), 177826#(<= proc_i 552), 177827#(<= proc_i 556), 177824#(<= proc_i 544), 177825#(<= proc_i 548), 177830#(<= proc_i 568), 177831#(<= proc_i 572), 177828#(<= proc_i 560), 177829#(<= proc_i 564), 177834#(<= proc_i 584), 177835#(<= proc_i 588), 177832#(<= proc_i 576), 177833#(<= proc_i 580), 177838#(<= proc_i 600), 177839#(<= proc_i 604), 177836#(<= proc_i 592), 177837#(<= proc_i 596), 177842#(<= proc_i 616), 177843#(<= proc_i 620), 177840#(<= proc_i 608), 177841#(<= proc_i 612), 177846#(<= proc_i 632), 177847#(<= proc_i 636), 177844#(<= proc_i 624), 177845#(<= proc_i 628), 177850#(<= proc_i 648), 177851#(<= proc_i 652), 177848#(<= proc_i 640), 177849#(<= proc_i 644), 177854#(<= proc_i 664), 177855#(<= proc_i 668), 177852#(<= proc_i 656), 177853#(<= proc_i 660), 177858#(<= proc_i 680), 177859#(<= proc_i 684), 177856#(<= proc_i 672), 177857#(<= proc_i 676), 177862#(<= proc_i 696), 177863#(<= proc_i 700), 177860#(<= proc_i 688), 177861#(<= proc_i 692), 177866#(<= proc_i 712), 177867#(<= proc_i 716), 177864#(<= proc_i 704), 177865#(<= proc_i 708), 177870#(<= proc_i 728), 177871#(<= proc_i 732), 177868#(<= proc_i 720), 177869#(<= proc_i 724), 177874#(<= proc_i 744), 177875#(<= proc_i 748), 177872#(<= proc_i 736), 177873#(<= proc_i 740), 177878#(<= proc_i 760), 177879#(<= proc_i 764), 177876#(<= proc_i 752), 177877#(<= proc_i 756), 177882#(<= proc_i 776), 177883#(<= proc_i 780), 177880#(<= proc_i 768), 177881#(<= proc_i 772), 177884#(<= proc_i 784)] [2018-07-23 13:54:29,003 INFO L134 CoverageAnalysis]: Checked inductivity of 38612 backedges. 0 proven. 38612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:29,004 INFO L450 AbstractCegarLoop]: Interpolant automaton has 199 states [2018-07-23 13:54:29,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 199 interpolants. [2018-07-23 13:54:29,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-07-23 13:54:29,010 INFO L87 Difference]: Start difference. First operand 396 states and 396 transitions. Second operand 199 states. [2018-07-23 13:54:31,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:54:31,736 INFO L93 Difference]: Finished difference Result 399 states and 399 transitions. [2018-07-23 13:54:31,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-07-23 13:54:31,736 INFO L78 Accepts]: Start accepts. Automaton has 199 states. Word has length 395 [2018-07-23 13:54:31,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:54:31,737 INFO L225 Difference]: With dead ends: 399 [2018-07-23 13:54:31,737 INFO L226 Difference]: Without dead ends: 398 [2018-07-23 13:54:31,739 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-07-23 13:54:31,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-07-23 13:54:31,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2018-07-23 13:54:31,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-07-23 13:54:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 398 transitions. [2018-07-23 13:54:31,744 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 398 transitions. Word has length 395 [2018-07-23 13:54:31,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:54:31,744 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 398 transitions. [2018-07-23 13:54:31,744 INFO L472 AbstractCegarLoop]: Interpolant automaton has 199 states. [2018-07-23 13:54:31,744 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 398 transitions. [2018-07-23 13:54:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-07-23 13:54:31,745 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:54:31,746 INFO L357 BasicCegarLoop]: trace histogram [198, 197, 1, 1] [2018-07-23 13:54:31,746 INFO L414 AbstractCegarLoop]: === Iteration 198 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:54:31,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1116298922, now seen corresponding path program 197 times [2018-07-23 13:54:31,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:54:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 39006 backedges. 0 proven. 39006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:33,347 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:54:33,347 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [198] total 198 [2018-07-23 13:54:33,348 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:54:33,348 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:54:33,348 INFO L185 omatonBuilderFactory]: Interpolants [179479#true, 179482#(<= proc_i 4), 179483#(<= proc_i 8), 179480#false, 179481#(<= proc_i 0), 179486#(<= proc_i 20), 179487#(<= proc_i 24), 179484#(<= proc_i 12), 179485#(<= proc_i 16), 179490#(<= proc_i 36), 179491#(<= proc_i 40), 179488#(<= proc_i 28), 179489#(<= proc_i 32), 179494#(<= proc_i 52), 179495#(<= proc_i 56), 179492#(<= proc_i 44), 179493#(<= proc_i 48), 179498#(<= proc_i 68), 179499#(<= proc_i 72), 179496#(<= proc_i 60), 179497#(<= proc_i 64), 179502#(<= proc_i 84), 179503#(<= proc_i 88), 179500#(<= proc_i 76), 179501#(<= proc_i 80), 179506#(<= proc_i 100), 179507#(<= proc_i 104), 179504#(<= proc_i 92), 179505#(<= proc_i 96), 179510#(<= proc_i 116), 179511#(<= proc_i 120), 179508#(<= proc_i 108), 179509#(<= proc_i 112), 179514#(<= proc_i 132), 179515#(<= proc_i 136), 179512#(<= proc_i 124), 179513#(<= proc_i 128), 179518#(<= proc_i 148), 179519#(<= proc_i 152), 179516#(<= proc_i 140), 179517#(<= proc_i 144), 179522#(<= proc_i 164), 179523#(<= proc_i 168), 179520#(<= proc_i 156), 179521#(<= proc_i 160), 179526#(<= proc_i 180), 179527#(<= proc_i 184), 179524#(<= proc_i 172), 179525#(<= proc_i 176), 179530#(<= proc_i 196), 179531#(<= proc_i 200), 179528#(<= proc_i 188), 179529#(<= proc_i 192), 179534#(<= proc_i 212), 179535#(<= proc_i 216), 179532#(<= proc_i 204), 179533#(<= proc_i 208), 179538#(<= proc_i 228), 179539#(<= proc_i 232), 179536#(<= proc_i 220), 179537#(<= proc_i 224), 179542#(<= proc_i 244), 179543#(<= proc_i 248), 179540#(<= proc_i 236), 179541#(<= proc_i 240), 179546#(<= proc_i 260), 179547#(<= proc_i 264), 179544#(<= proc_i 252), 179545#(<= proc_i 256), 179550#(<= proc_i 276), 179551#(<= proc_i 280), 179548#(<= proc_i 268), 179549#(<= proc_i 272), 179554#(<= proc_i 292), 179555#(<= proc_i 296), 179552#(<= proc_i 284), 179553#(<= proc_i 288), 179558#(<= proc_i 308), 179559#(<= proc_i 312), 179556#(<= proc_i 300), 179557#(<= proc_i 304), 179562#(<= proc_i 324), 179563#(<= proc_i 328), 179560#(<= proc_i 316), 179561#(<= proc_i 320), 179566#(<= proc_i 340), 179567#(<= proc_i 344), 179564#(<= proc_i 332), 179565#(<= proc_i 336), 179570#(<= proc_i 356), 179571#(<= proc_i 360), 179568#(<= proc_i 348), 179569#(<= proc_i 352), 179574#(<= proc_i 372), 179575#(<= proc_i 376), 179572#(<= proc_i 364), 179573#(<= proc_i 368), 179578#(<= proc_i 388), 179579#(<= proc_i 392), 179576#(<= proc_i 380), 179577#(<= proc_i 384), 179582#(<= proc_i 404), 179583#(<= proc_i 408), 179580#(<= proc_i 396), 179581#(<= proc_i 400), 179586#(<= proc_i 420), 179587#(<= proc_i 424), 179584#(<= proc_i 412), 179585#(<= proc_i 416), 179590#(<= proc_i 436), 179591#(<= proc_i 440), 179588#(<= proc_i 428), 179589#(<= proc_i 432), 179594#(<= proc_i 452), 179595#(<= proc_i 456), 179592#(<= proc_i 444), 179593#(<= proc_i 448), 179598#(<= proc_i 468), 179599#(<= proc_i 472), 179596#(<= proc_i 460), 179597#(<= proc_i 464), 179602#(<= proc_i 484), 179603#(<= proc_i 488), 179600#(<= proc_i 476), 179601#(<= proc_i 480), 179606#(<= proc_i 500), 179607#(<= proc_i 504), 179604#(<= proc_i 492), 179605#(<= proc_i 496), 179610#(<= proc_i 516), 179611#(<= proc_i 520), 179608#(<= proc_i 508), 179609#(<= proc_i 512), 179614#(<= proc_i 532), 179615#(<= proc_i 536), 179612#(<= proc_i 524), 179613#(<= proc_i 528), 179618#(<= proc_i 548), 179619#(<= proc_i 552), 179616#(<= proc_i 540), 179617#(<= proc_i 544), 179622#(<= proc_i 564), 179623#(<= proc_i 568), 179620#(<= proc_i 556), 179621#(<= proc_i 560), 179626#(<= proc_i 580), 179627#(<= proc_i 584), 179624#(<= proc_i 572), 179625#(<= proc_i 576), 179630#(<= proc_i 596), 179631#(<= proc_i 600), 179628#(<= proc_i 588), 179629#(<= proc_i 592), 179634#(<= proc_i 612), 179635#(<= proc_i 616), 179632#(<= proc_i 604), 179633#(<= proc_i 608), 179638#(<= proc_i 628), 179639#(<= proc_i 632), 179636#(<= proc_i 620), 179637#(<= proc_i 624), 179642#(<= proc_i 644), 179643#(<= proc_i 648), 179640#(<= proc_i 636), 179641#(<= proc_i 640), 179646#(<= proc_i 660), 179647#(<= proc_i 664), 179644#(<= proc_i 652), 179645#(<= proc_i 656), 179650#(<= proc_i 676), 179651#(<= proc_i 680), 179648#(<= proc_i 668), 179649#(<= proc_i 672), 179654#(<= proc_i 692), 179655#(<= proc_i 696), 179652#(<= proc_i 684), 179653#(<= proc_i 688), 179658#(<= proc_i 708), 179659#(<= proc_i 712), 179656#(<= proc_i 700), 179657#(<= proc_i 704), 179662#(<= proc_i 724), 179663#(<= proc_i 728), 179660#(<= proc_i 716), 179661#(<= proc_i 720), 179666#(<= proc_i 740), 179667#(<= proc_i 744), 179664#(<= proc_i 732), 179665#(<= proc_i 736), 179670#(<= proc_i 756), 179671#(<= proc_i 760), 179668#(<= proc_i 748), 179669#(<= proc_i 752), 179674#(<= proc_i 772), 179675#(<= proc_i 776), 179672#(<= proc_i 764), 179673#(<= proc_i 768), 179678#(<= proc_i 788), 179676#(<= proc_i 780), 179677#(<= proc_i 784)] [2018-07-23 13:54:33,351 INFO L134 CoverageAnalysis]: Checked inductivity of 39006 backedges. 0 proven. 39006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:33,351 INFO L450 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-07-23 13:54:33,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-07-23 13:54:33,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-07-23 13:54:33,356 INFO L87 Difference]: Start difference. First operand 398 states and 398 transitions. Second operand 200 states. [2018-07-23 13:54:35,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:54:35,787 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2018-07-23 13:54:35,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-07-23 13:54:35,788 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 397 [2018-07-23 13:54:35,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:54:35,788 INFO L225 Difference]: With dead ends: 401 [2018-07-23 13:54:35,788 INFO L226 Difference]: Without dead ends: 400 [2018-07-23 13:54:35,790 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-07-23 13:54:35,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-07-23 13:54:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2018-07-23 13:54:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-07-23 13:54:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 400 transitions. [2018-07-23 13:54:35,794 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 400 transitions. Word has length 397 [2018-07-23 13:54:35,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:54:35,795 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 400 transitions. [2018-07-23 13:54:35,795 INFO L472 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-07-23 13:54:35,795 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 400 transitions. [2018-07-23 13:54:35,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-07-23 13:54:35,796 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:54:35,796 INFO L357 BasicCegarLoop]: trace histogram [199, 198, 1, 1] [2018-07-23 13:54:35,796 INFO L414 AbstractCegarLoop]: === Iteration 199 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:54:35,796 INFO L82 PathProgramCache]: Analyzing trace with hash -978558868, now seen corresponding path program 198 times [2018-07-23 13:54:35,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:54:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:37,430 INFO L134 CoverageAnalysis]: Checked inductivity of 39402 backedges. 0 proven. 39402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:37,430 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:54:37,431 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [199] total 199 [2018-07-23 13:54:37,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:54:37,431 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:54:37,431 INFO L185 omatonBuilderFactory]: Interpolants [181282#false, 181283#(<= proc_i 0), 181281#true, 181286#(<= proc_i 12), 181287#(<= proc_i 16), 181284#(<= proc_i 4), 181285#(<= proc_i 8), 181290#(<= proc_i 28), 181291#(<= proc_i 32), 181288#(<= proc_i 20), 181289#(<= proc_i 24), 181294#(<= proc_i 44), 181295#(<= proc_i 48), 181292#(<= proc_i 36), 181293#(<= proc_i 40), 181298#(<= proc_i 60), 181299#(<= proc_i 64), 181296#(<= proc_i 52), 181297#(<= proc_i 56), 181302#(<= proc_i 76), 181303#(<= proc_i 80), 181300#(<= proc_i 68), 181301#(<= proc_i 72), 181306#(<= proc_i 92), 181307#(<= proc_i 96), 181304#(<= proc_i 84), 181305#(<= proc_i 88), 181310#(<= proc_i 108), 181311#(<= proc_i 112), 181308#(<= proc_i 100), 181309#(<= proc_i 104), 181314#(<= proc_i 124), 181315#(<= proc_i 128), 181312#(<= proc_i 116), 181313#(<= proc_i 120), 181318#(<= proc_i 140), 181319#(<= proc_i 144), 181316#(<= proc_i 132), 181317#(<= proc_i 136), 181322#(<= proc_i 156), 181323#(<= proc_i 160), 181320#(<= proc_i 148), 181321#(<= proc_i 152), 181326#(<= proc_i 172), 181327#(<= proc_i 176), 181324#(<= proc_i 164), 181325#(<= proc_i 168), 181330#(<= proc_i 188), 181331#(<= proc_i 192), 181328#(<= proc_i 180), 181329#(<= proc_i 184), 181334#(<= proc_i 204), 181335#(<= proc_i 208), 181332#(<= proc_i 196), 181333#(<= proc_i 200), 181338#(<= proc_i 220), 181339#(<= proc_i 224), 181336#(<= proc_i 212), 181337#(<= proc_i 216), 181342#(<= proc_i 236), 181343#(<= proc_i 240), 181340#(<= proc_i 228), 181341#(<= proc_i 232), 181346#(<= proc_i 252), 181347#(<= proc_i 256), 181344#(<= proc_i 244), 181345#(<= proc_i 248), 181350#(<= proc_i 268), 181351#(<= proc_i 272), 181348#(<= proc_i 260), 181349#(<= proc_i 264), 181354#(<= proc_i 284), 181355#(<= proc_i 288), 181352#(<= proc_i 276), 181353#(<= proc_i 280), 181358#(<= proc_i 300), 181359#(<= proc_i 304), 181356#(<= proc_i 292), 181357#(<= proc_i 296), 181362#(<= proc_i 316), 181363#(<= proc_i 320), 181360#(<= proc_i 308), 181361#(<= proc_i 312), 181366#(<= proc_i 332), 181367#(<= proc_i 336), 181364#(<= proc_i 324), 181365#(<= proc_i 328), 181370#(<= proc_i 348), 181371#(<= proc_i 352), 181368#(<= proc_i 340), 181369#(<= proc_i 344), 181374#(<= proc_i 364), 181375#(<= proc_i 368), 181372#(<= proc_i 356), 181373#(<= proc_i 360), 181378#(<= proc_i 380), 181379#(<= proc_i 384), 181376#(<= proc_i 372), 181377#(<= proc_i 376), 181382#(<= proc_i 396), 181383#(<= proc_i 400), 181380#(<= proc_i 388), 181381#(<= proc_i 392), 181386#(<= proc_i 412), 181387#(<= proc_i 416), 181384#(<= proc_i 404), 181385#(<= proc_i 408), 181390#(<= proc_i 428), 181391#(<= proc_i 432), 181388#(<= proc_i 420), 181389#(<= proc_i 424), 181394#(<= proc_i 444), 181395#(<= proc_i 448), 181392#(<= proc_i 436), 181393#(<= proc_i 440), 181398#(<= proc_i 460), 181399#(<= proc_i 464), 181396#(<= proc_i 452), 181397#(<= proc_i 456), 181402#(<= proc_i 476), 181403#(<= proc_i 480), 181400#(<= proc_i 468), 181401#(<= proc_i 472), 181406#(<= proc_i 492), 181407#(<= proc_i 496), 181404#(<= proc_i 484), 181405#(<= proc_i 488), 181410#(<= proc_i 508), 181411#(<= proc_i 512), 181408#(<= proc_i 500), 181409#(<= proc_i 504), 181414#(<= proc_i 524), 181415#(<= proc_i 528), 181412#(<= proc_i 516), 181413#(<= proc_i 520), 181418#(<= proc_i 540), 181419#(<= proc_i 544), 181416#(<= proc_i 532), 181417#(<= proc_i 536), 181422#(<= proc_i 556), 181423#(<= proc_i 560), 181420#(<= proc_i 548), 181421#(<= proc_i 552), 181426#(<= proc_i 572), 181427#(<= proc_i 576), 181424#(<= proc_i 564), 181425#(<= proc_i 568), 181430#(<= proc_i 588), 181431#(<= proc_i 592), 181428#(<= proc_i 580), 181429#(<= proc_i 584), 181434#(<= proc_i 604), 181435#(<= proc_i 608), 181432#(<= proc_i 596), 181433#(<= proc_i 600), 181438#(<= proc_i 620), 181439#(<= proc_i 624), 181436#(<= proc_i 612), 181437#(<= proc_i 616), 181442#(<= proc_i 636), 181443#(<= proc_i 640), 181440#(<= proc_i 628), 181441#(<= proc_i 632), 181446#(<= proc_i 652), 181447#(<= proc_i 656), 181444#(<= proc_i 644), 181445#(<= proc_i 648), 181450#(<= proc_i 668), 181451#(<= proc_i 672), 181448#(<= proc_i 660), 181449#(<= proc_i 664), 181454#(<= proc_i 684), 181455#(<= proc_i 688), 181452#(<= proc_i 676), 181453#(<= proc_i 680), 181458#(<= proc_i 700), 181459#(<= proc_i 704), 181456#(<= proc_i 692), 181457#(<= proc_i 696), 181462#(<= proc_i 716), 181463#(<= proc_i 720), 181460#(<= proc_i 708), 181461#(<= proc_i 712), 181466#(<= proc_i 732), 181467#(<= proc_i 736), 181464#(<= proc_i 724), 181465#(<= proc_i 728), 181470#(<= proc_i 748), 181471#(<= proc_i 752), 181468#(<= proc_i 740), 181469#(<= proc_i 744), 181474#(<= proc_i 764), 181475#(<= proc_i 768), 181472#(<= proc_i 756), 181473#(<= proc_i 760), 181478#(<= proc_i 780), 181479#(<= proc_i 784), 181476#(<= proc_i 772), 181477#(<= proc_i 776), 181480#(<= proc_i 788), 181481#(<= proc_i 792)] [2018-07-23 13:54:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 39402 backedges. 0 proven. 39402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:37,433 INFO L450 AbstractCegarLoop]: Interpolant automaton has 201 states [2018-07-23 13:54:37,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2018-07-23 13:54:37,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-07-23 13:54:37,435 INFO L87 Difference]: Start difference. First operand 400 states and 400 transitions. Second operand 201 states. [2018-07-23 13:54:39,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:54:39,905 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2018-07-23 13:54:39,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-07-23 13:54:39,906 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 399 [2018-07-23 13:54:39,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:54:39,907 INFO L225 Difference]: With dead ends: 403 [2018-07-23 13:54:39,907 INFO L226 Difference]: Without dead ends: 402 [2018-07-23 13:54:39,908 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-07-23 13:54:39,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-07-23 13:54:39,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2018-07-23 13:54:39,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-07-23 13:54:39,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 402 transitions. [2018-07-23 13:54:39,912 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 402 transitions. Word has length 399 [2018-07-23 13:54:39,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:54:39,912 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 402 transitions. [2018-07-23 13:54:39,912 INFO L472 AbstractCegarLoop]: Interpolant automaton has 201 states. [2018-07-23 13:54:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 402 transitions. [2018-07-23 13:54:39,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-07-23 13:54:39,914 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:54:39,914 INFO L357 BasicCegarLoop]: trace histogram [200, 199, 1, 1] [2018-07-23 13:54:39,914 INFO L414 AbstractCegarLoop]: === Iteration 200 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:54:39,914 INFO L82 PathProgramCache]: Analyzing trace with hash 202766766, now seen corresponding path program 199 times [2018-07-23 13:54:39,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:54:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:41,667 INFO L134 CoverageAnalysis]: Checked inductivity of 39800 backedges. 0 proven. 39800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:41,667 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:54:41,667 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [200] total 200 [2018-07-23 13:54:41,667 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:54:41,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:54:41,668 INFO L185 omatonBuilderFactory]: Interpolants [183094#(<= proc_i 0), 183095#(<= proc_i 4), 183092#true, 183093#false, 183098#(<= proc_i 16), 183099#(<= proc_i 20), 183096#(<= proc_i 8), 183097#(<= proc_i 12), 183102#(<= proc_i 32), 183103#(<= proc_i 36), 183100#(<= proc_i 24), 183101#(<= proc_i 28), 183106#(<= proc_i 48), 183107#(<= proc_i 52), 183104#(<= proc_i 40), 183105#(<= proc_i 44), 183110#(<= proc_i 64), 183111#(<= proc_i 68), 183108#(<= proc_i 56), 183109#(<= proc_i 60), 183114#(<= proc_i 80), 183115#(<= proc_i 84), 183112#(<= proc_i 72), 183113#(<= proc_i 76), 183118#(<= proc_i 96), 183119#(<= proc_i 100), 183116#(<= proc_i 88), 183117#(<= proc_i 92), 183122#(<= proc_i 112), 183123#(<= proc_i 116), 183120#(<= proc_i 104), 183121#(<= proc_i 108), 183126#(<= proc_i 128), 183127#(<= proc_i 132), 183124#(<= proc_i 120), 183125#(<= proc_i 124), 183130#(<= proc_i 144), 183131#(<= proc_i 148), 183128#(<= proc_i 136), 183129#(<= proc_i 140), 183134#(<= proc_i 160), 183135#(<= proc_i 164), 183132#(<= proc_i 152), 183133#(<= proc_i 156), 183138#(<= proc_i 176), 183139#(<= proc_i 180), 183136#(<= proc_i 168), 183137#(<= proc_i 172), 183142#(<= proc_i 192), 183143#(<= proc_i 196), 183140#(<= proc_i 184), 183141#(<= proc_i 188), 183146#(<= proc_i 208), 183147#(<= proc_i 212), 183144#(<= proc_i 200), 183145#(<= proc_i 204), 183150#(<= proc_i 224), 183151#(<= proc_i 228), 183148#(<= proc_i 216), 183149#(<= proc_i 220), 183154#(<= proc_i 240), 183155#(<= proc_i 244), 183152#(<= proc_i 232), 183153#(<= proc_i 236), 183158#(<= proc_i 256), 183159#(<= proc_i 260), 183156#(<= proc_i 248), 183157#(<= proc_i 252), 183162#(<= proc_i 272), 183163#(<= proc_i 276), 183160#(<= proc_i 264), 183161#(<= proc_i 268), 183166#(<= proc_i 288), 183167#(<= proc_i 292), 183164#(<= proc_i 280), 183165#(<= proc_i 284), 183170#(<= proc_i 304), 183171#(<= proc_i 308), 183168#(<= proc_i 296), 183169#(<= proc_i 300), 183174#(<= proc_i 320), 183175#(<= proc_i 324), 183172#(<= proc_i 312), 183173#(<= proc_i 316), 183178#(<= proc_i 336), 183179#(<= proc_i 340), 183176#(<= proc_i 328), 183177#(<= proc_i 332), 183182#(<= proc_i 352), 183183#(<= proc_i 356), 183180#(<= proc_i 344), 183181#(<= proc_i 348), 183186#(<= proc_i 368), 183187#(<= proc_i 372), 183184#(<= proc_i 360), 183185#(<= proc_i 364), 183190#(<= proc_i 384), 183191#(<= proc_i 388), 183188#(<= proc_i 376), 183189#(<= proc_i 380), 183194#(<= proc_i 400), 183195#(<= proc_i 404), 183192#(<= proc_i 392), 183193#(<= proc_i 396), 183198#(<= proc_i 416), 183199#(<= proc_i 420), 183196#(<= proc_i 408), 183197#(<= proc_i 412), 183202#(<= proc_i 432), 183203#(<= proc_i 436), 183200#(<= proc_i 424), 183201#(<= proc_i 428), 183206#(<= proc_i 448), 183207#(<= proc_i 452), 183204#(<= proc_i 440), 183205#(<= proc_i 444), 183210#(<= proc_i 464), 183211#(<= proc_i 468), 183208#(<= proc_i 456), 183209#(<= proc_i 460), 183214#(<= proc_i 480), 183215#(<= proc_i 484), 183212#(<= proc_i 472), 183213#(<= proc_i 476), 183218#(<= proc_i 496), 183219#(<= proc_i 500), 183216#(<= proc_i 488), 183217#(<= proc_i 492), 183222#(<= proc_i 512), 183223#(<= proc_i 516), 183220#(<= proc_i 504), 183221#(<= proc_i 508), 183226#(<= proc_i 528), 183227#(<= proc_i 532), 183224#(<= proc_i 520), 183225#(<= proc_i 524), 183230#(<= proc_i 544), 183231#(<= proc_i 548), 183228#(<= proc_i 536), 183229#(<= proc_i 540), 183234#(<= proc_i 560), 183235#(<= proc_i 564), 183232#(<= proc_i 552), 183233#(<= proc_i 556), 183238#(<= proc_i 576), 183239#(<= proc_i 580), 183236#(<= proc_i 568), 183237#(<= proc_i 572), 183242#(<= proc_i 592), 183243#(<= proc_i 596), 183240#(<= proc_i 584), 183241#(<= proc_i 588), 183246#(<= proc_i 608), 183247#(<= proc_i 612), 183244#(<= proc_i 600), 183245#(<= proc_i 604), 183250#(<= proc_i 624), 183251#(<= proc_i 628), 183248#(<= proc_i 616), 183249#(<= proc_i 620), 183254#(<= proc_i 640), 183255#(<= proc_i 644), 183252#(<= proc_i 632), 183253#(<= proc_i 636), 183258#(<= proc_i 656), 183259#(<= proc_i 660), 183256#(<= proc_i 648), 183257#(<= proc_i 652), 183262#(<= proc_i 672), 183263#(<= proc_i 676), 183260#(<= proc_i 664), 183261#(<= proc_i 668), 183266#(<= proc_i 688), 183267#(<= proc_i 692), 183264#(<= proc_i 680), 183265#(<= proc_i 684), 183270#(<= proc_i 704), 183271#(<= proc_i 708), 183268#(<= proc_i 696), 183269#(<= proc_i 700), 183274#(<= proc_i 720), 183275#(<= proc_i 724), 183272#(<= proc_i 712), 183273#(<= proc_i 716), 183278#(<= proc_i 736), 183279#(<= proc_i 740), 183276#(<= proc_i 728), 183277#(<= proc_i 732), 183282#(<= proc_i 752), 183283#(<= proc_i 756), 183280#(<= proc_i 744), 183281#(<= proc_i 748), 183286#(<= proc_i 768), 183287#(<= proc_i 772), 183284#(<= proc_i 760), 183285#(<= proc_i 764), 183290#(<= proc_i 784), 183291#(<= proc_i 788), 183288#(<= proc_i 776), 183289#(<= proc_i 780), 183292#(<= proc_i 792), 183293#(<= proc_i 796)] [2018-07-23 13:54:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 39800 backedges. 0 proven. 39800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:41,671 INFO L450 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-07-23 13:54:41,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-07-23 13:54:41,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-07-23 13:54:41,677 INFO L87 Difference]: Start difference. First operand 402 states and 402 transitions. Second operand 202 states. [2018-07-23 13:54:44,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:54:44,230 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2018-07-23 13:54:44,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-07-23 13:54:44,231 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 401 [2018-07-23 13:54:44,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:54:44,231 INFO L225 Difference]: With dead ends: 405 [2018-07-23 13:54:44,231 INFO L226 Difference]: Without dead ends: 404 [2018-07-23 13:54:44,234 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-07-23 13:54:44,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-07-23 13:54:44,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2018-07-23 13:54:44,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-07-23 13:54:44,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 404 transitions. [2018-07-23 13:54:44,239 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 404 transitions. Word has length 401 [2018-07-23 13:54:44,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:54:44,239 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 404 transitions. [2018-07-23 13:54:44,239 INFO L472 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-07-23 13:54:44,239 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 404 transitions. [2018-07-23 13:54:44,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-07-23 13:54:44,241 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:54:44,241 INFO L357 BasicCegarLoop]: trace histogram [201, 200, 1, 1] [2018-07-23 13:54:44,241 INFO L414 AbstractCegarLoop]: === Iteration 201 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:54:44,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1585334896, now seen corresponding path program 200 times [2018-07-23 13:54:44,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:54:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:45,857 INFO L134 CoverageAnalysis]: Checked inductivity of 40200 backedges. 0 proven. 40200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:45,858 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:54:45,858 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [201] total 201 [2018-07-23 13:54:45,858 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:54:45,858 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:54:45,859 INFO L185 omatonBuilderFactory]: Interpolants [184914#(<= proc_i 0), 184915#(<= proc_i 4), 184912#true, 184913#false, 184918#(<= proc_i 16), 184919#(<= proc_i 20), 184916#(<= proc_i 8), 184917#(<= proc_i 12), 184922#(<= proc_i 32), 184923#(<= proc_i 36), 184920#(<= proc_i 24), 184921#(<= proc_i 28), 184926#(<= proc_i 48), 184927#(<= proc_i 52), 184924#(<= proc_i 40), 184925#(<= proc_i 44), 184930#(<= proc_i 64), 184931#(<= proc_i 68), 184928#(<= proc_i 56), 184929#(<= proc_i 60), 184934#(<= proc_i 80), 184935#(<= proc_i 84), 184932#(<= proc_i 72), 184933#(<= proc_i 76), 184938#(<= proc_i 96), 184939#(<= proc_i 100), 184936#(<= proc_i 88), 184937#(<= proc_i 92), 184942#(<= proc_i 112), 184943#(<= proc_i 116), 184940#(<= proc_i 104), 184941#(<= proc_i 108), 184946#(<= proc_i 128), 184947#(<= proc_i 132), 184944#(<= proc_i 120), 184945#(<= proc_i 124), 184950#(<= proc_i 144), 184951#(<= proc_i 148), 184948#(<= proc_i 136), 184949#(<= proc_i 140), 184954#(<= proc_i 160), 184955#(<= proc_i 164), 184952#(<= proc_i 152), 184953#(<= proc_i 156), 184958#(<= proc_i 176), 184959#(<= proc_i 180), 184956#(<= proc_i 168), 184957#(<= proc_i 172), 184962#(<= proc_i 192), 184963#(<= proc_i 196), 184960#(<= proc_i 184), 184961#(<= proc_i 188), 184966#(<= proc_i 208), 184967#(<= proc_i 212), 184964#(<= proc_i 200), 184965#(<= proc_i 204), 184970#(<= proc_i 224), 184971#(<= proc_i 228), 184968#(<= proc_i 216), 184969#(<= proc_i 220), 184974#(<= proc_i 240), 184975#(<= proc_i 244), 184972#(<= proc_i 232), 184973#(<= proc_i 236), 184978#(<= proc_i 256), 184979#(<= proc_i 260), 184976#(<= proc_i 248), 184977#(<= proc_i 252), 184982#(<= proc_i 272), 184983#(<= proc_i 276), 184980#(<= proc_i 264), 184981#(<= proc_i 268), 184986#(<= proc_i 288), 184987#(<= proc_i 292), 184984#(<= proc_i 280), 184985#(<= proc_i 284), 184990#(<= proc_i 304), 184991#(<= proc_i 308), 184988#(<= proc_i 296), 184989#(<= proc_i 300), 184994#(<= proc_i 320), 184995#(<= proc_i 324), 184992#(<= proc_i 312), 184993#(<= proc_i 316), 184998#(<= proc_i 336), 184999#(<= proc_i 340), 184996#(<= proc_i 328), 184997#(<= proc_i 332), 185002#(<= proc_i 352), 185003#(<= proc_i 356), 185000#(<= proc_i 344), 185001#(<= proc_i 348), 185006#(<= proc_i 368), 185007#(<= proc_i 372), 185004#(<= proc_i 360), 185005#(<= proc_i 364), 185010#(<= proc_i 384), 185011#(<= proc_i 388), 185008#(<= proc_i 376), 185009#(<= proc_i 380), 185014#(<= proc_i 400), 185015#(<= proc_i 404), 185012#(<= proc_i 392), 185013#(<= proc_i 396), 185018#(<= proc_i 416), 185019#(<= proc_i 420), 185016#(<= proc_i 408), 185017#(<= proc_i 412), 185022#(<= proc_i 432), 185023#(<= proc_i 436), 185020#(<= proc_i 424), 185021#(<= proc_i 428), 185026#(<= proc_i 448), 185027#(<= proc_i 452), 185024#(<= proc_i 440), 185025#(<= proc_i 444), 185030#(<= proc_i 464), 185031#(<= proc_i 468), 185028#(<= proc_i 456), 185029#(<= proc_i 460), 185034#(<= proc_i 480), 185035#(<= proc_i 484), 185032#(<= proc_i 472), 185033#(<= proc_i 476), 185038#(<= proc_i 496), 185039#(<= proc_i 500), 185036#(<= proc_i 488), 185037#(<= proc_i 492), 185042#(<= proc_i 512), 185043#(<= proc_i 516), 185040#(<= proc_i 504), 185041#(<= proc_i 508), 185046#(<= proc_i 528), 185047#(<= proc_i 532), 185044#(<= proc_i 520), 185045#(<= proc_i 524), 185050#(<= proc_i 544), 185051#(<= proc_i 548), 185048#(<= proc_i 536), 185049#(<= proc_i 540), 185054#(<= proc_i 560), 185055#(<= proc_i 564), 185052#(<= proc_i 552), 185053#(<= proc_i 556), 185058#(<= proc_i 576), 185059#(<= proc_i 580), 185056#(<= proc_i 568), 185057#(<= proc_i 572), 185062#(<= proc_i 592), 185063#(<= proc_i 596), 185060#(<= proc_i 584), 185061#(<= proc_i 588), 185066#(<= proc_i 608), 185067#(<= proc_i 612), 185064#(<= proc_i 600), 185065#(<= proc_i 604), 185070#(<= proc_i 624), 185071#(<= proc_i 628), 185068#(<= proc_i 616), 185069#(<= proc_i 620), 185074#(<= proc_i 640), 185075#(<= proc_i 644), 185072#(<= proc_i 632), 185073#(<= proc_i 636), 185078#(<= proc_i 656), 185079#(<= proc_i 660), 185076#(<= proc_i 648), 185077#(<= proc_i 652), 185082#(<= proc_i 672), 185083#(<= proc_i 676), 185080#(<= proc_i 664), 185081#(<= proc_i 668), 185086#(<= proc_i 688), 185087#(<= proc_i 692), 185084#(<= proc_i 680), 185085#(<= proc_i 684), 185090#(<= proc_i 704), 185091#(<= proc_i 708), 185088#(<= proc_i 696), 185089#(<= proc_i 700), 185094#(<= proc_i 720), 185095#(<= proc_i 724), 185092#(<= proc_i 712), 185093#(<= proc_i 716), 185098#(<= proc_i 736), 185099#(<= proc_i 740), 185096#(<= proc_i 728), 185097#(<= proc_i 732), 185102#(<= proc_i 752), 185103#(<= proc_i 756), 185100#(<= proc_i 744), 185101#(<= proc_i 748), 185106#(<= proc_i 768), 185107#(<= proc_i 772), 185104#(<= proc_i 760), 185105#(<= proc_i 764), 185110#(<= proc_i 784), 185111#(<= proc_i 788), 185108#(<= proc_i 776), 185109#(<= proc_i 780), 185114#(<= proc_i 800), 185112#(<= proc_i 792), 185113#(<= proc_i 796)] [2018-07-23 13:54:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 40200 backedges. 0 proven. 40200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:45,861 INFO L450 AbstractCegarLoop]: Interpolant automaton has 203 states [2018-07-23 13:54:45,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2018-07-23 13:54:45,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-07-23 13:54:45,865 INFO L87 Difference]: Start difference. First operand 404 states and 404 transitions. Second operand 203 states. [2018-07-23 13:54:47,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:54:47,738 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2018-07-23 13:54:47,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-07-23 13:54:47,738 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 403 [2018-07-23 13:54:47,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:54:47,739 INFO L225 Difference]: With dead ends: 407 [2018-07-23 13:54:47,739 INFO L226 Difference]: Without dead ends: 406 [2018-07-23 13:54:47,740 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-07-23 13:54:47,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-07-23 13:54:47,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2018-07-23 13:54:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-07-23 13:54:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 406 transitions. [2018-07-23 13:54:47,744 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 406 transitions. Word has length 403 [2018-07-23 13:54:47,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:54:47,744 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 406 transitions. [2018-07-23 13:54:47,744 INFO L472 AbstractCegarLoop]: Interpolant automaton has 203 states. [2018-07-23 13:54:47,744 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 406 transitions. [2018-07-23 13:54:47,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-07-23 13:54:47,745 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:54:47,745 INFO L357 BasicCegarLoop]: trace histogram [202, 201, 1, 1] [2018-07-23 13:54:47,746 INFO L414 AbstractCegarLoop]: === Iteration 202 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:54:47,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1206553934, now seen corresponding path program 201 times [2018-07-23 13:54:47,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:54:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 40602 backedges. 0 proven. 40602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:49,318 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:54:49,319 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [202] total 202 [2018-07-23 13:54:49,319 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:54:49,319 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:54:49,319 INFO L185 omatonBuilderFactory]: Interpolants [186882#(<= proc_i 556), 186883#(<= proc_i 560), 186880#(<= proc_i 548), 186881#(<= proc_i 552), 186886#(<= proc_i 572), 186887#(<= proc_i 576), 186884#(<= proc_i 564), 186885#(<= proc_i 568), 186890#(<= proc_i 588), 186891#(<= proc_i 592), 186888#(<= proc_i 580), 186889#(<= proc_i 584), 186894#(<= proc_i 604), 186895#(<= proc_i 608), 186892#(<= proc_i 596), 186893#(<= proc_i 600), 186898#(<= proc_i 620), 186899#(<= proc_i 624), 186896#(<= proc_i 612), 186897#(<= proc_i 616), 186902#(<= proc_i 636), 186903#(<= proc_i 640), 186900#(<= proc_i 628), 186901#(<= proc_i 632), 186906#(<= proc_i 652), 186907#(<= proc_i 656), 186904#(<= proc_i 644), 186905#(<= proc_i 648), 186910#(<= proc_i 668), 186911#(<= proc_i 672), 186908#(<= proc_i 660), 186909#(<= proc_i 664), 186914#(<= proc_i 684), 186915#(<= proc_i 688), 186912#(<= proc_i 676), 186913#(<= proc_i 680), 186918#(<= proc_i 700), 186919#(<= proc_i 704), 186916#(<= proc_i 692), 186917#(<= proc_i 696), 186922#(<= proc_i 716), 186923#(<= proc_i 720), 186920#(<= proc_i 708), 186921#(<= proc_i 712), 186926#(<= proc_i 732), 186927#(<= proc_i 736), 186924#(<= proc_i 724), 186925#(<= proc_i 728), 186930#(<= proc_i 748), 186931#(<= proc_i 752), 186928#(<= proc_i 740), 186929#(<= proc_i 744), 186934#(<= proc_i 764), 186935#(<= proc_i 768), 186932#(<= proc_i 756), 186933#(<= proc_i 760), 186938#(<= proc_i 780), 186939#(<= proc_i 784), 186936#(<= proc_i 772), 186937#(<= proc_i 776), 186942#(<= proc_i 796), 186943#(<= proc_i 800), 186940#(<= proc_i 788), 186941#(<= proc_i 792), 186944#(<= proc_i 804), 186742#false, 186743#(<= proc_i 0), 186741#true, 186746#(<= proc_i 12), 186747#(<= proc_i 16), 186744#(<= proc_i 4), 186745#(<= proc_i 8), 186750#(<= proc_i 28), 186751#(<= proc_i 32), 186748#(<= proc_i 20), 186749#(<= proc_i 24), 186754#(<= proc_i 44), 186755#(<= proc_i 48), 186752#(<= proc_i 36), 186753#(<= proc_i 40), 186758#(<= proc_i 60), 186759#(<= proc_i 64), 186756#(<= proc_i 52), 186757#(<= proc_i 56), 186762#(<= proc_i 76), 186763#(<= proc_i 80), 186760#(<= proc_i 68), 186761#(<= proc_i 72), 186766#(<= proc_i 92), 186767#(<= proc_i 96), 186764#(<= proc_i 84), 186765#(<= proc_i 88), 186770#(<= proc_i 108), 186771#(<= proc_i 112), 186768#(<= proc_i 100), 186769#(<= proc_i 104), 186774#(<= proc_i 124), 186775#(<= proc_i 128), 186772#(<= proc_i 116), 186773#(<= proc_i 120), 186778#(<= proc_i 140), 186779#(<= proc_i 144), 186776#(<= proc_i 132), 186777#(<= proc_i 136), 186782#(<= proc_i 156), 186783#(<= proc_i 160), 186780#(<= proc_i 148), 186781#(<= proc_i 152), 186786#(<= proc_i 172), 186787#(<= proc_i 176), 186784#(<= proc_i 164), 186785#(<= proc_i 168), 186790#(<= proc_i 188), 186791#(<= proc_i 192), 186788#(<= proc_i 180), 186789#(<= proc_i 184), 186794#(<= proc_i 204), 186795#(<= proc_i 208), 186792#(<= proc_i 196), 186793#(<= proc_i 200), 186798#(<= proc_i 220), 186799#(<= proc_i 224), 186796#(<= proc_i 212), 186797#(<= proc_i 216), 186802#(<= proc_i 236), 186803#(<= proc_i 240), 186800#(<= proc_i 228), 186801#(<= proc_i 232), 186806#(<= proc_i 252), 186807#(<= proc_i 256), 186804#(<= proc_i 244), 186805#(<= proc_i 248), 186810#(<= proc_i 268), 186811#(<= proc_i 272), 186808#(<= proc_i 260), 186809#(<= proc_i 264), 186814#(<= proc_i 284), 186815#(<= proc_i 288), 186812#(<= proc_i 276), 186813#(<= proc_i 280), 186818#(<= proc_i 300), 186819#(<= proc_i 304), 186816#(<= proc_i 292), 186817#(<= proc_i 296), 186822#(<= proc_i 316), 186823#(<= proc_i 320), 186820#(<= proc_i 308), 186821#(<= proc_i 312), 186826#(<= proc_i 332), 186827#(<= proc_i 336), 186824#(<= proc_i 324), 186825#(<= proc_i 328), 186830#(<= proc_i 348), 186831#(<= proc_i 352), 186828#(<= proc_i 340), 186829#(<= proc_i 344), 186834#(<= proc_i 364), 186835#(<= proc_i 368), 186832#(<= proc_i 356), 186833#(<= proc_i 360), 186838#(<= proc_i 380), 186839#(<= proc_i 384), 186836#(<= proc_i 372), 186837#(<= proc_i 376), 186842#(<= proc_i 396), 186843#(<= proc_i 400), 186840#(<= proc_i 388), 186841#(<= proc_i 392), 186846#(<= proc_i 412), 186847#(<= proc_i 416), 186844#(<= proc_i 404), 186845#(<= proc_i 408), 186850#(<= proc_i 428), 186851#(<= proc_i 432), 186848#(<= proc_i 420), 186849#(<= proc_i 424), 186854#(<= proc_i 444), 186855#(<= proc_i 448), 186852#(<= proc_i 436), 186853#(<= proc_i 440), 186858#(<= proc_i 460), 186859#(<= proc_i 464), 186856#(<= proc_i 452), 186857#(<= proc_i 456), 186862#(<= proc_i 476), 186863#(<= proc_i 480), 186860#(<= proc_i 468), 186861#(<= proc_i 472), 186866#(<= proc_i 492), 186867#(<= proc_i 496), 186864#(<= proc_i 484), 186865#(<= proc_i 488), 186870#(<= proc_i 508), 186871#(<= proc_i 512), 186868#(<= proc_i 500), 186869#(<= proc_i 504), 186874#(<= proc_i 524), 186875#(<= proc_i 528), 186872#(<= proc_i 516), 186873#(<= proc_i 520), 186878#(<= proc_i 540), 186879#(<= proc_i 544), 186876#(<= proc_i 532), 186877#(<= proc_i 536)] [2018-07-23 13:54:49,321 INFO L134 CoverageAnalysis]: Checked inductivity of 40602 backedges. 0 proven. 40602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:49,321 INFO L450 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-07-23 13:54:49,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-07-23 13:54:49,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-07-23 13:54:49,326 INFO L87 Difference]: Start difference. First operand 406 states and 406 transitions. Second operand 204 states. [2018-07-23 13:54:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:54:50,214 INFO L93 Difference]: Finished difference Result 409 states and 409 transitions. [2018-07-23 13:54:50,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-07-23 13:54:50,214 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 405 [2018-07-23 13:54:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:54:50,215 INFO L225 Difference]: With dead ends: 409 [2018-07-23 13:54:50,215 INFO L226 Difference]: Without dead ends: 408 [2018-07-23 13:54:50,218 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-07-23 13:54:50,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-07-23 13:54:50,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2018-07-23 13:54:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-07-23 13:54:50,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 408 transitions. [2018-07-23 13:54:50,224 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 408 transitions. Word has length 405 [2018-07-23 13:54:50,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:54:50,225 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 408 transitions. [2018-07-23 13:54:50,225 INFO L472 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-07-23 13:54:50,225 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 408 transitions. [2018-07-23 13:54:50,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-07-23 13:54:50,227 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:54:50,227 INFO L357 BasicCegarLoop]: trace histogram [203, 202, 1, 1] [2018-07-23 13:54:50,227 INFO L414 AbstractCegarLoop]: === Iteration 203 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:54:50,227 INFO L82 PathProgramCache]: Analyzing trace with hash 142840436, now seen corresponding path program 202 times [2018-07-23 13:54:50,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:54:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:51,691 INFO L134 CoverageAnalysis]: Checked inductivity of 41006 backedges. 0 proven. 41006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:51,691 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:54:51,691 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [203] total 203 [2018-07-23 13:54:51,692 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:54:51,692 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:54:51,692 INFO L185 omatonBuilderFactory]: Interpolants [188579#true, 188582#(<= proc_i 4), 188583#(<= proc_i 8), 188580#false, 188581#(<= proc_i 0), 188586#(<= proc_i 20), 188587#(<= proc_i 24), 188584#(<= proc_i 12), 188585#(<= proc_i 16), 188590#(<= proc_i 36), 188591#(<= proc_i 40), 188588#(<= proc_i 28), 188589#(<= proc_i 32), 188594#(<= proc_i 52), 188595#(<= proc_i 56), 188592#(<= proc_i 44), 188593#(<= proc_i 48), 188598#(<= proc_i 68), 188599#(<= proc_i 72), 188596#(<= proc_i 60), 188597#(<= proc_i 64), 188602#(<= proc_i 84), 188603#(<= proc_i 88), 188600#(<= proc_i 76), 188601#(<= proc_i 80), 188606#(<= proc_i 100), 188607#(<= proc_i 104), 188604#(<= proc_i 92), 188605#(<= proc_i 96), 188610#(<= proc_i 116), 188611#(<= proc_i 120), 188608#(<= proc_i 108), 188609#(<= proc_i 112), 188614#(<= proc_i 132), 188615#(<= proc_i 136), 188612#(<= proc_i 124), 188613#(<= proc_i 128), 188618#(<= proc_i 148), 188619#(<= proc_i 152), 188616#(<= proc_i 140), 188617#(<= proc_i 144), 188622#(<= proc_i 164), 188623#(<= proc_i 168), 188620#(<= proc_i 156), 188621#(<= proc_i 160), 188626#(<= proc_i 180), 188627#(<= proc_i 184), 188624#(<= proc_i 172), 188625#(<= proc_i 176), 188630#(<= proc_i 196), 188631#(<= proc_i 200), 188628#(<= proc_i 188), 188629#(<= proc_i 192), 188634#(<= proc_i 212), 188635#(<= proc_i 216), 188632#(<= proc_i 204), 188633#(<= proc_i 208), 188638#(<= proc_i 228), 188639#(<= proc_i 232), 188636#(<= proc_i 220), 188637#(<= proc_i 224), 188642#(<= proc_i 244), 188643#(<= proc_i 248), 188640#(<= proc_i 236), 188641#(<= proc_i 240), 188646#(<= proc_i 260), 188647#(<= proc_i 264), 188644#(<= proc_i 252), 188645#(<= proc_i 256), 188650#(<= proc_i 276), 188651#(<= proc_i 280), 188648#(<= proc_i 268), 188649#(<= proc_i 272), 188654#(<= proc_i 292), 188655#(<= proc_i 296), 188652#(<= proc_i 284), 188653#(<= proc_i 288), 188658#(<= proc_i 308), 188659#(<= proc_i 312), 188656#(<= proc_i 300), 188657#(<= proc_i 304), 188662#(<= proc_i 324), 188663#(<= proc_i 328), 188660#(<= proc_i 316), 188661#(<= proc_i 320), 188666#(<= proc_i 340), 188667#(<= proc_i 344), 188664#(<= proc_i 332), 188665#(<= proc_i 336), 188670#(<= proc_i 356), 188671#(<= proc_i 360), 188668#(<= proc_i 348), 188669#(<= proc_i 352), 188674#(<= proc_i 372), 188675#(<= proc_i 376), 188672#(<= proc_i 364), 188673#(<= proc_i 368), 188678#(<= proc_i 388), 188679#(<= proc_i 392), 188676#(<= proc_i 380), 188677#(<= proc_i 384), 188682#(<= proc_i 404), 188683#(<= proc_i 408), 188680#(<= proc_i 396), 188681#(<= proc_i 400), 188686#(<= proc_i 420), 188687#(<= proc_i 424), 188684#(<= proc_i 412), 188685#(<= proc_i 416), 188690#(<= proc_i 436), 188691#(<= proc_i 440), 188688#(<= proc_i 428), 188689#(<= proc_i 432), 188694#(<= proc_i 452), 188695#(<= proc_i 456), 188692#(<= proc_i 444), 188693#(<= proc_i 448), 188698#(<= proc_i 468), 188699#(<= proc_i 472), 188696#(<= proc_i 460), 188697#(<= proc_i 464), 188702#(<= proc_i 484), 188703#(<= proc_i 488), 188700#(<= proc_i 476), 188701#(<= proc_i 480), 188706#(<= proc_i 500), 188707#(<= proc_i 504), 188704#(<= proc_i 492), 188705#(<= proc_i 496), 188710#(<= proc_i 516), 188711#(<= proc_i 520), 188708#(<= proc_i 508), 188709#(<= proc_i 512), 188714#(<= proc_i 532), 188715#(<= proc_i 536), 188712#(<= proc_i 524), 188713#(<= proc_i 528), 188718#(<= proc_i 548), 188719#(<= proc_i 552), 188716#(<= proc_i 540), 188717#(<= proc_i 544), 188722#(<= proc_i 564), 188723#(<= proc_i 568), 188720#(<= proc_i 556), 188721#(<= proc_i 560), 188726#(<= proc_i 580), 188727#(<= proc_i 584), 188724#(<= proc_i 572), 188725#(<= proc_i 576), 188730#(<= proc_i 596), 188731#(<= proc_i 600), 188728#(<= proc_i 588), 188729#(<= proc_i 592), 188734#(<= proc_i 612), 188735#(<= proc_i 616), 188732#(<= proc_i 604), 188733#(<= proc_i 608), 188738#(<= proc_i 628), 188739#(<= proc_i 632), 188736#(<= proc_i 620), 188737#(<= proc_i 624), 188742#(<= proc_i 644), 188743#(<= proc_i 648), 188740#(<= proc_i 636), 188741#(<= proc_i 640), 188746#(<= proc_i 660), 188747#(<= proc_i 664), 188744#(<= proc_i 652), 188745#(<= proc_i 656), 188750#(<= proc_i 676), 188751#(<= proc_i 680), 188748#(<= proc_i 668), 188749#(<= proc_i 672), 188754#(<= proc_i 692), 188755#(<= proc_i 696), 188752#(<= proc_i 684), 188753#(<= proc_i 688), 188758#(<= proc_i 708), 188759#(<= proc_i 712), 188756#(<= proc_i 700), 188757#(<= proc_i 704), 188762#(<= proc_i 724), 188763#(<= proc_i 728), 188760#(<= proc_i 716), 188761#(<= proc_i 720), 188766#(<= proc_i 740), 188767#(<= proc_i 744), 188764#(<= proc_i 732), 188765#(<= proc_i 736), 188770#(<= proc_i 756), 188771#(<= proc_i 760), 188768#(<= proc_i 748), 188769#(<= proc_i 752), 188774#(<= proc_i 772), 188775#(<= proc_i 776), 188772#(<= proc_i 764), 188773#(<= proc_i 768), 188778#(<= proc_i 788), 188779#(<= proc_i 792), 188776#(<= proc_i 780), 188777#(<= proc_i 784), 188782#(<= proc_i 804), 188783#(<= proc_i 808), 188780#(<= proc_i 796), 188781#(<= proc_i 800)] [2018-07-23 13:54:51,694 INFO L134 CoverageAnalysis]: Checked inductivity of 41006 backedges. 0 proven. 41006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:51,695 INFO L450 AbstractCegarLoop]: Interpolant automaton has 205 states [2018-07-23 13:54:51,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2018-07-23 13:54:51,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-07-23 13:54:51,700 INFO L87 Difference]: Start difference. First operand 408 states and 408 transitions. Second operand 205 states. [2018-07-23 13:54:52,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:54:52,651 INFO L93 Difference]: Finished difference Result 411 states and 411 transitions. [2018-07-23 13:54:52,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-07-23 13:54:52,651 INFO L78 Accepts]: Start accepts. Automaton has 205 states. Word has length 407 [2018-07-23 13:54:52,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:54:52,652 INFO L225 Difference]: With dead ends: 411 [2018-07-23 13:54:52,652 INFO L226 Difference]: Without dead ends: 410 [2018-07-23 13:54:52,654 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-07-23 13:54:52,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-07-23 13:54:52,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2018-07-23 13:54:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-07-23 13:54:52,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 410 transitions. [2018-07-23 13:54:52,658 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 410 transitions. Word has length 407 [2018-07-23 13:54:52,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:54:52,658 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 410 transitions. [2018-07-23 13:54:52,658 INFO L472 AbstractCegarLoop]: Interpolant automaton has 205 states. [2018-07-23 13:54:52,658 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 410 transitions. [2018-07-23 13:54:52,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-07-23 13:54:52,660 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:54:52,660 INFO L357 BasicCegarLoop]: trace histogram [204, 203, 1, 1] [2018-07-23 13:54:52,660 INFO L414 AbstractCegarLoop]: === Iteration 204 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:54:52,660 INFO L82 PathProgramCache]: Analyzing trace with hash -169293386, now seen corresponding path program 203 times [2018-07-23 13:54:52,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:54:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 41412 backedges. 0 proven. 41412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:54,193 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:54:54,193 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [204] total 204 [2018-07-23 13:54:54,194 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:54:54,194 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:54:54,194 INFO L185 omatonBuilderFactory]: Interpolants [190466#(<= proc_i 152), 190467#(<= proc_i 156), 190464#(<= proc_i 144), 190465#(<= proc_i 148), 190470#(<= proc_i 168), 190471#(<= proc_i 172), 190468#(<= proc_i 160), 190469#(<= proc_i 164), 190474#(<= proc_i 184), 190475#(<= proc_i 188), 190472#(<= proc_i 176), 190473#(<= proc_i 180), 190478#(<= proc_i 200), 190479#(<= proc_i 204), 190476#(<= proc_i 192), 190477#(<= proc_i 196), 190482#(<= proc_i 216), 190483#(<= proc_i 220), 190480#(<= proc_i 208), 190481#(<= proc_i 212), 190486#(<= proc_i 232), 190487#(<= proc_i 236), 190484#(<= proc_i 224), 190485#(<= proc_i 228), 190490#(<= proc_i 248), 190491#(<= proc_i 252), 190488#(<= proc_i 240), 190489#(<= proc_i 244), 190494#(<= proc_i 264), 190495#(<= proc_i 268), 190492#(<= proc_i 256), 190493#(<= proc_i 260), 190498#(<= proc_i 280), 190499#(<= proc_i 284), 190496#(<= proc_i 272), 190497#(<= proc_i 276), 190502#(<= proc_i 296), 190503#(<= proc_i 300), 190500#(<= proc_i 288), 190501#(<= proc_i 292), 190506#(<= proc_i 312), 190507#(<= proc_i 316), 190504#(<= proc_i 304), 190505#(<= proc_i 308), 190510#(<= proc_i 328), 190511#(<= proc_i 332), 190508#(<= proc_i 320), 190509#(<= proc_i 324), 190514#(<= proc_i 344), 190515#(<= proc_i 348), 190512#(<= proc_i 336), 190513#(<= proc_i 340), 190518#(<= proc_i 360), 190519#(<= proc_i 364), 190516#(<= proc_i 352), 190517#(<= proc_i 356), 190522#(<= proc_i 376), 190523#(<= proc_i 380), 190520#(<= proc_i 368), 190521#(<= proc_i 372), 190526#(<= proc_i 392), 190527#(<= proc_i 396), 190524#(<= proc_i 384), 190525#(<= proc_i 388), 190530#(<= proc_i 408), 190531#(<= proc_i 412), 190528#(<= proc_i 400), 190529#(<= proc_i 404), 190534#(<= proc_i 424), 190535#(<= proc_i 428), 190532#(<= proc_i 416), 190533#(<= proc_i 420), 190538#(<= proc_i 440), 190539#(<= proc_i 444), 190536#(<= proc_i 432), 190537#(<= proc_i 436), 190542#(<= proc_i 456), 190543#(<= proc_i 460), 190540#(<= proc_i 448), 190541#(<= proc_i 452), 190546#(<= proc_i 472), 190547#(<= proc_i 476), 190544#(<= proc_i 464), 190545#(<= proc_i 468), 190550#(<= proc_i 488), 190551#(<= proc_i 492), 190548#(<= proc_i 480), 190549#(<= proc_i 484), 190554#(<= proc_i 504), 190555#(<= proc_i 508), 190552#(<= proc_i 496), 190553#(<= proc_i 500), 190558#(<= proc_i 520), 190559#(<= proc_i 524), 190556#(<= proc_i 512), 190557#(<= proc_i 516), 190562#(<= proc_i 536), 190563#(<= proc_i 540), 190560#(<= proc_i 528), 190561#(<= proc_i 532), 190566#(<= proc_i 552), 190567#(<= proc_i 556), 190564#(<= proc_i 544), 190565#(<= proc_i 548), 190570#(<= proc_i 568), 190571#(<= proc_i 572), 190568#(<= proc_i 560), 190569#(<= proc_i 564), 190574#(<= proc_i 584), 190575#(<= proc_i 588), 190572#(<= proc_i 576), 190573#(<= proc_i 580), 190578#(<= proc_i 600), 190579#(<= proc_i 604), 190576#(<= proc_i 592), 190577#(<= proc_i 596), 190582#(<= proc_i 616), 190583#(<= proc_i 620), 190580#(<= proc_i 608), 190581#(<= proc_i 612), 190586#(<= proc_i 632), 190587#(<= proc_i 636), 190584#(<= proc_i 624), 190585#(<= proc_i 628), 190590#(<= proc_i 648), 190591#(<= proc_i 652), 190588#(<= proc_i 640), 190589#(<= proc_i 644), 190594#(<= proc_i 664), 190595#(<= proc_i 668), 190592#(<= proc_i 656), 190593#(<= proc_i 660), 190598#(<= proc_i 680), 190599#(<= proc_i 684), 190596#(<= proc_i 672), 190597#(<= proc_i 676), 190602#(<= proc_i 696), 190603#(<= proc_i 700), 190600#(<= proc_i 688), 190601#(<= proc_i 692), 190606#(<= proc_i 712), 190607#(<= proc_i 716), 190604#(<= proc_i 704), 190605#(<= proc_i 708), 190610#(<= proc_i 728), 190611#(<= proc_i 732), 190608#(<= proc_i 720), 190609#(<= proc_i 724), 190614#(<= proc_i 744), 190615#(<= proc_i 748), 190612#(<= proc_i 736), 190613#(<= proc_i 740), 190618#(<= proc_i 760), 190619#(<= proc_i 764), 190616#(<= proc_i 752), 190617#(<= proc_i 756), 190622#(<= proc_i 776), 190623#(<= proc_i 780), 190620#(<= proc_i 768), 190621#(<= proc_i 772), 190626#(<= proc_i 792), 190627#(<= proc_i 796), 190624#(<= proc_i 784), 190625#(<= proc_i 788), 190630#(<= proc_i 808), 190631#(<= proc_i 812), 190628#(<= proc_i 800), 190629#(<= proc_i 804), 190426#true, 190427#false, 190430#(<= proc_i 8), 190431#(<= proc_i 12), 190428#(<= proc_i 0), 190429#(<= proc_i 4), 190434#(<= proc_i 24), 190435#(<= proc_i 28), 190432#(<= proc_i 16), 190433#(<= proc_i 20), 190438#(<= proc_i 40), 190439#(<= proc_i 44), 190436#(<= proc_i 32), 190437#(<= proc_i 36), 190442#(<= proc_i 56), 190443#(<= proc_i 60), 190440#(<= proc_i 48), 190441#(<= proc_i 52), 190446#(<= proc_i 72), 190447#(<= proc_i 76), 190444#(<= proc_i 64), 190445#(<= proc_i 68), 190450#(<= proc_i 88), 190451#(<= proc_i 92), 190448#(<= proc_i 80), 190449#(<= proc_i 84), 190454#(<= proc_i 104), 190455#(<= proc_i 108), 190452#(<= proc_i 96), 190453#(<= proc_i 100), 190458#(<= proc_i 120), 190459#(<= proc_i 124), 190456#(<= proc_i 112), 190457#(<= proc_i 116), 190462#(<= proc_i 136), 190463#(<= proc_i 140), 190460#(<= proc_i 128), 190461#(<= proc_i 132)] [2018-07-23 13:54:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 41412 backedges. 0 proven. 41412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:54,196 INFO L450 AbstractCegarLoop]: Interpolant automaton has 206 states [2018-07-23 13:54:54,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2018-07-23 13:54:54,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-07-23 13:54:54,198 INFO L87 Difference]: Start difference. First operand 410 states and 410 transitions. Second operand 206 states. [2018-07-23 13:54:55,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:54:55,779 INFO L93 Difference]: Finished difference Result 413 states and 413 transitions. [2018-07-23 13:54:55,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-07-23 13:54:55,779 INFO L78 Accepts]: Start accepts. Automaton has 206 states. Word has length 409 [2018-07-23 13:54:55,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:54:55,780 INFO L225 Difference]: With dead ends: 413 [2018-07-23 13:54:55,780 INFO L226 Difference]: Without dead ends: 412 [2018-07-23 13:54:55,781 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-07-23 13:54:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-07-23 13:54:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2018-07-23 13:54:55,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-07-23 13:54:55,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 412 transitions. [2018-07-23 13:54:55,786 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 412 transitions. Word has length 409 [2018-07-23 13:54:55,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:54:55,786 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 412 transitions. [2018-07-23 13:54:55,786 INFO L472 AbstractCegarLoop]: Interpolant automaton has 206 states. [2018-07-23 13:54:55,786 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 412 transitions. [2018-07-23 13:54:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-07-23 13:54:55,787 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:54:55,787 INFO L357 BasicCegarLoop]: trace histogram [205, 204, 1, 1] [2018-07-23 13:54:55,788 INFO L414 AbstractCegarLoop]: === Iteration 205 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:54:55,788 INFO L82 PathProgramCache]: Analyzing trace with hash 517814392, now seen corresponding path program 204 times [2018-07-23 13:54:55,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:54:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 41820 backedges. 0 proven. 41820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:57,294 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:54:57,294 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [205] total 205 [2018-07-23 13:54:57,294 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:54:57,295 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:54:57,295 INFO L185 omatonBuilderFactory]: Interpolants [192282#true, 192283#false, 192286#(<= proc_i 8), 192287#(<= proc_i 12), 192284#(<= proc_i 0), 192285#(<= proc_i 4), 192290#(<= proc_i 24), 192291#(<= proc_i 28), 192288#(<= proc_i 16), 192289#(<= proc_i 20), 192294#(<= proc_i 40), 192295#(<= proc_i 44), 192292#(<= proc_i 32), 192293#(<= proc_i 36), 192298#(<= proc_i 56), 192299#(<= proc_i 60), 192296#(<= proc_i 48), 192297#(<= proc_i 52), 192302#(<= proc_i 72), 192303#(<= proc_i 76), 192300#(<= proc_i 64), 192301#(<= proc_i 68), 192306#(<= proc_i 88), 192307#(<= proc_i 92), 192304#(<= proc_i 80), 192305#(<= proc_i 84), 192310#(<= proc_i 104), 192311#(<= proc_i 108), 192308#(<= proc_i 96), 192309#(<= proc_i 100), 192314#(<= proc_i 120), 192315#(<= proc_i 124), 192312#(<= proc_i 112), 192313#(<= proc_i 116), 192318#(<= proc_i 136), 192319#(<= proc_i 140), 192316#(<= proc_i 128), 192317#(<= proc_i 132), 192322#(<= proc_i 152), 192323#(<= proc_i 156), 192320#(<= proc_i 144), 192321#(<= proc_i 148), 192326#(<= proc_i 168), 192327#(<= proc_i 172), 192324#(<= proc_i 160), 192325#(<= proc_i 164), 192330#(<= proc_i 184), 192331#(<= proc_i 188), 192328#(<= proc_i 176), 192329#(<= proc_i 180), 192334#(<= proc_i 200), 192335#(<= proc_i 204), 192332#(<= proc_i 192), 192333#(<= proc_i 196), 192338#(<= proc_i 216), 192339#(<= proc_i 220), 192336#(<= proc_i 208), 192337#(<= proc_i 212), 192342#(<= proc_i 232), 192343#(<= proc_i 236), 192340#(<= proc_i 224), 192341#(<= proc_i 228), 192346#(<= proc_i 248), 192347#(<= proc_i 252), 192344#(<= proc_i 240), 192345#(<= proc_i 244), 192350#(<= proc_i 264), 192351#(<= proc_i 268), 192348#(<= proc_i 256), 192349#(<= proc_i 260), 192354#(<= proc_i 280), 192355#(<= proc_i 284), 192352#(<= proc_i 272), 192353#(<= proc_i 276), 192358#(<= proc_i 296), 192359#(<= proc_i 300), 192356#(<= proc_i 288), 192357#(<= proc_i 292), 192362#(<= proc_i 312), 192363#(<= proc_i 316), 192360#(<= proc_i 304), 192361#(<= proc_i 308), 192366#(<= proc_i 328), 192367#(<= proc_i 332), 192364#(<= proc_i 320), 192365#(<= proc_i 324), 192370#(<= proc_i 344), 192371#(<= proc_i 348), 192368#(<= proc_i 336), 192369#(<= proc_i 340), 192374#(<= proc_i 360), 192375#(<= proc_i 364), 192372#(<= proc_i 352), 192373#(<= proc_i 356), 192378#(<= proc_i 376), 192379#(<= proc_i 380), 192376#(<= proc_i 368), 192377#(<= proc_i 372), 192382#(<= proc_i 392), 192383#(<= proc_i 396), 192380#(<= proc_i 384), 192381#(<= proc_i 388), 192386#(<= proc_i 408), 192387#(<= proc_i 412), 192384#(<= proc_i 400), 192385#(<= proc_i 404), 192390#(<= proc_i 424), 192391#(<= proc_i 428), 192388#(<= proc_i 416), 192389#(<= proc_i 420), 192394#(<= proc_i 440), 192395#(<= proc_i 444), 192392#(<= proc_i 432), 192393#(<= proc_i 436), 192398#(<= proc_i 456), 192399#(<= proc_i 460), 192396#(<= proc_i 448), 192397#(<= proc_i 452), 192402#(<= proc_i 472), 192403#(<= proc_i 476), 192400#(<= proc_i 464), 192401#(<= proc_i 468), 192406#(<= proc_i 488), 192407#(<= proc_i 492), 192404#(<= proc_i 480), 192405#(<= proc_i 484), 192410#(<= proc_i 504), 192411#(<= proc_i 508), 192408#(<= proc_i 496), 192409#(<= proc_i 500), 192414#(<= proc_i 520), 192415#(<= proc_i 524), 192412#(<= proc_i 512), 192413#(<= proc_i 516), 192418#(<= proc_i 536), 192419#(<= proc_i 540), 192416#(<= proc_i 528), 192417#(<= proc_i 532), 192422#(<= proc_i 552), 192423#(<= proc_i 556), 192420#(<= proc_i 544), 192421#(<= proc_i 548), 192426#(<= proc_i 568), 192427#(<= proc_i 572), 192424#(<= proc_i 560), 192425#(<= proc_i 564), 192430#(<= proc_i 584), 192431#(<= proc_i 588), 192428#(<= proc_i 576), 192429#(<= proc_i 580), 192434#(<= proc_i 600), 192435#(<= proc_i 604), 192432#(<= proc_i 592), 192433#(<= proc_i 596), 192438#(<= proc_i 616), 192439#(<= proc_i 620), 192436#(<= proc_i 608), 192437#(<= proc_i 612), 192442#(<= proc_i 632), 192443#(<= proc_i 636), 192440#(<= proc_i 624), 192441#(<= proc_i 628), 192446#(<= proc_i 648), 192447#(<= proc_i 652), 192444#(<= proc_i 640), 192445#(<= proc_i 644), 192450#(<= proc_i 664), 192451#(<= proc_i 668), 192448#(<= proc_i 656), 192449#(<= proc_i 660), 192454#(<= proc_i 680), 192455#(<= proc_i 684), 192452#(<= proc_i 672), 192453#(<= proc_i 676), 192458#(<= proc_i 696), 192459#(<= proc_i 700), 192456#(<= proc_i 688), 192457#(<= proc_i 692), 192462#(<= proc_i 712), 192463#(<= proc_i 716), 192460#(<= proc_i 704), 192461#(<= proc_i 708), 192466#(<= proc_i 728), 192467#(<= proc_i 732), 192464#(<= proc_i 720), 192465#(<= proc_i 724), 192470#(<= proc_i 744), 192471#(<= proc_i 748), 192468#(<= proc_i 736), 192469#(<= proc_i 740), 192474#(<= proc_i 760), 192475#(<= proc_i 764), 192472#(<= proc_i 752), 192473#(<= proc_i 756), 192478#(<= proc_i 776), 192479#(<= proc_i 780), 192476#(<= proc_i 768), 192477#(<= proc_i 772), 192482#(<= proc_i 792), 192483#(<= proc_i 796), 192480#(<= proc_i 784), 192481#(<= proc_i 788), 192486#(<= proc_i 808), 192487#(<= proc_i 812), 192484#(<= proc_i 800), 192485#(<= proc_i 804), 192488#(<= proc_i 816)] [2018-07-23 13:54:57,298 INFO L134 CoverageAnalysis]: Checked inductivity of 41820 backedges. 0 proven. 41820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:57,298 INFO L450 AbstractCegarLoop]: Interpolant automaton has 207 states [2018-07-23 13:54:57,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 207 interpolants. [2018-07-23 13:54:57,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-07-23 13:54:57,303 INFO L87 Difference]: Start difference. First operand 412 states and 412 transitions. Second operand 207 states. [2018-07-23 13:54:59,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:54:59,666 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2018-07-23 13:54:59,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-07-23 13:54:59,666 INFO L78 Accepts]: Start accepts. Automaton has 207 states. Word has length 411 [2018-07-23 13:54:59,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:54:59,667 INFO L225 Difference]: With dead ends: 415 [2018-07-23 13:54:59,667 INFO L226 Difference]: Without dead ends: 414 [2018-07-23 13:54:59,669 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-07-23 13:54:59,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-07-23 13:54:59,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2018-07-23 13:54:59,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-07-23 13:54:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 414 transitions. [2018-07-23 13:54:59,673 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 414 transitions. Word has length 411 [2018-07-23 13:54:59,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:54:59,674 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 414 transitions. [2018-07-23 13:54:59,674 INFO L472 AbstractCegarLoop]: Interpolant automaton has 207 states. [2018-07-23 13:54:59,674 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 414 transitions. [2018-07-23 13:54:59,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-07-23 13:54:59,675 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:54:59,675 INFO L357 BasicCegarLoop]: trace histogram [206, 205, 1, 1] [2018-07-23 13:54:59,675 INFO L414 AbstractCegarLoop]: === Iteration 206 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:54:59,675 INFO L82 PathProgramCache]: Analyzing trace with hash -596574534, now seen corresponding path program 205 times [2018-07-23 13:54:59,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:55:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:55:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 42230 backedges. 0 proven. 42230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:01,219 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:55:01,219 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [206] total 206 [2018-07-23 13:55:01,219 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:55:01,219 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:55:01,220 INFO L185 omatonBuilderFactory]: Interpolants [194147#true, 194150#(<= proc_i 4), 194151#(<= proc_i 8), 194148#false, 194149#(<= proc_i 0), 194154#(<= proc_i 20), 194155#(<= proc_i 24), 194152#(<= proc_i 12), 194153#(<= proc_i 16), 194158#(<= proc_i 36), 194159#(<= proc_i 40), 194156#(<= proc_i 28), 194157#(<= proc_i 32), 194162#(<= proc_i 52), 194163#(<= proc_i 56), 194160#(<= proc_i 44), 194161#(<= proc_i 48), 194166#(<= proc_i 68), 194167#(<= proc_i 72), 194164#(<= proc_i 60), 194165#(<= proc_i 64), 194170#(<= proc_i 84), 194171#(<= proc_i 88), 194168#(<= proc_i 76), 194169#(<= proc_i 80), 194174#(<= proc_i 100), 194175#(<= proc_i 104), 194172#(<= proc_i 92), 194173#(<= proc_i 96), 194178#(<= proc_i 116), 194179#(<= proc_i 120), 194176#(<= proc_i 108), 194177#(<= proc_i 112), 194182#(<= proc_i 132), 194183#(<= proc_i 136), 194180#(<= proc_i 124), 194181#(<= proc_i 128), 194186#(<= proc_i 148), 194187#(<= proc_i 152), 194184#(<= proc_i 140), 194185#(<= proc_i 144), 194190#(<= proc_i 164), 194191#(<= proc_i 168), 194188#(<= proc_i 156), 194189#(<= proc_i 160), 194194#(<= proc_i 180), 194195#(<= proc_i 184), 194192#(<= proc_i 172), 194193#(<= proc_i 176), 194198#(<= proc_i 196), 194199#(<= proc_i 200), 194196#(<= proc_i 188), 194197#(<= proc_i 192), 194202#(<= proc_i 212), 194203#(<= proc_i 216), 194200#(<= proc_i 204), 194201#(<= proc_i 208), 194206#(<= proc_i 228), 194207#(<= proc_i 232), 194204#(<= proc_i 220), 194205#(<= proc_i 224), 194210#(<= proc_i 244), 194211#(<= proc_i 248), 194208#(<= proc_i 236), 194209#(<= proc_i 240), 194214#(<= proc_i 260), 194215#(<= proc_i 264), 194212#(<= proc_i 252), 194213#(<= proc_i 256), 194218#(<= proc_i 276), 194219#(<= proc_i 280), 194216#(<= proc_i 268), 194217#(<= proc_i 272), 194222#(<= proc_i 292), 194223#(<= proc_i 296), 194220#(<= proc_i 284), 194221#(<= proc_i 288), 194226#(<= proc_i 308), 194227#(<= proc_i 312), 194224#(<= proc_i 300), 194225#(<= proc_i 304), 194230#(<= proc_i 324), 194231#(<= proc_i 328), 194228#(<= proc_i 316), 194229#(<= proc_i 320), 194234#(<= proc_i 340), 194235#(<= proc_i 344), 194232#(<= proc_i 332), 194233#(<= proc_i 336), 194238#(<= proc_i 356), 194239#(<= proc_i 360), 194236#(<= proc_i 348), 194237#(<= proc_i 352), 194242#(<= proc_i 372), 194243#(<= proc_i 376), 194240#(<= proc_i 364), 194241#(<= proc_i 368), 194246#(<= proc_i 388), 194247#(<= proc_i 392), 194244#(<= proc_i 380), 194245#(<= proc_i 384), 194250#(<= proc_i 404), 194251#(<= proc_i 408), 194248#(<= proc_i 396), 194249#(<= proc_i 400), 194254#(<= proc_i 420), 194255#(<= proc_i 424), 194252#(<= proc_i 412), 194253#(<= proc_i 416), 194258#(<= proc_i 436), 194259#(<= proc_i 440), 194256#(<= proc_i 428), 194257#(<= proc_i 432), 194262#(<= proc_i 452), 194263#(<= proc_i 456), 194260#(<= proc_i 444), 194261#(<= proc_i 448), 194266#(<= proc_i 468), 194267#(<= proc_i 472), 194264#(<= proc_i 460), 194265#(<= proc_i 464), 194270#(<= proc_i 484), 194271#(<= proc_i 488), 194268#(<= proc_i 476), 194269#(<= proc_i 480), 194274#(<= proc_i 500), 194275#(<= proc_i 504), 194272#(<= proc_i 492), 194273#(<= proc_i 496), 194278#(<= proc_i 516), 194279#(<= proc_i 520), 194276#(<= proc_i 508), 194277#(<= proc_i 512), 194282#(<= proc_i 532), 194283#(<= proc_i 536), 194280#(<= proc_i 524), 194281#(<= proc_i 528), 194286#(<= proc_i 548), 194287#(<= proc_i 552), 194284#(<= proc_i 540), 194285#(<= proc_i 544), 194290#(<= proc_i 564), 194291#(<= proc_i 568), 194288#(<= proc_i 556), 194289#(<= proc_i 560), 194294#(<= proc_i 580), 194295#(<= proc_i 584), 194292#(<= proc_i 572), 194293#(<= proc_i 576), 194298#(<= proc_i 596), 194299#(<= proc_i 600), 194296#(<= proc_i 588), 194297#(<= proc_i 592), 194302#(<= proc_i 612), 194303#(<= proc_i 616), 194300#(<= proc_i 604), 194301#(<= proc_i 608), 194306#(<= proc_i 628), 194307#(<= proc_i 632), 194304#(<= proc_i 620), 194305#(<= proc_i 624), 194310#(<= proc_i 644), 194311#(<= proc_i 648), 194308#(<= proc_i 636), 194309#(<= proc_i 640), 194314#(<= proc_i 660), 194315#(<= proc_i 664), 194312#(<= proc_i 652), 194313#(<= proc_i 656), 194318#(<= proc_i 676), 194319#(<= proc_i 680), 194316#(<= proc_i 668), 194317#(<= proc_i 672), 194322#(<= proc_i 692), 194323#(<= proc_i 696), 194320#(<= proc_i 684), 194321#(<= proc_i 688), 194326#(<= proc_i 708), 194327#(<= proc_i 712), 194324#(<= proc_i 700), 194325#(<= proc_i 704), 194330#(<= proc_i 724), 194331#(<= proc_i 728), 194328#(<= proc_i 716), 194329#(<= proc_i 720), 194334#(<= proc_i 740), 194335#(<= proc_i 744), 194332#(<= proc_i 732), 194333#(<= proc_i 736), 194338#(<= proc_i 756), 194339#(<= proc_i 760), 194336#(<= proc_i 748), 194337#(<= proc_i 752), 194342#(<= proc_i 772), 194343#(<= proc_i 776), 194340#(<= proc_i 764), 194341#(<= proc_i 768), 194346#(<= proc_i 788), 194347#(<= proc_i 792), 194344#(<= proc_i 780), 194345#(<= proc_i 784), 194350#(<= proc_i 804), 194351#(<= proc_i 808), 194348#(<= proc_i 796), 194349#(<= proc_i 800), 194354#(<= proc_i 820), 194352#(<= proc_i 812), 194353#(<= proc_i 816)] [2018-07-23 13:55:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 42230 backedges. 0 proven. 42230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:01,222 INFO L450 AbstractCegarLoop]: Interpolant automaton has 208 states [2018-07-23 13:55:01,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 208 interpolants. [2018-07-23 13:55:01,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-07-23 13:55:01,226 INFO L87 Difference]: Start difference. First operand 414 states and 414 transitions. Second operand 208 states. [2018-07-23 13:55:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:55:02,780 INFO L93 Difference]: Finished difference Result 417 states and 417 transitions. [2018-07-23 13:55:02,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2018-07-23 13:55:02,780 INFO L78 Accepts]: Start accepts. Automaton has 208 states. Word has length 413 [2018-07-23 13:55:02,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:55:02,781 INFO L225 Difference]: With dead ends: 417 [2018-07-23 13:55:02,781 INFO L226 Difference]: Without dead ends: 416 [2018-07-23 13:55:02,783 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-07-23 13:55:02,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-07-23 13:55:02,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2018-07-23 13:55:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-07-23 13:55:02,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2018-07-23 13:55:02,788 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 413 [2018-07-23 13:55:02,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:55:02,788 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2018-07-23 13:55:02,788 INFO L472 AbstractCegarLoop]: Interpolant automaton has 208 states. [2018-07-23 13:55:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2018-07-23 13:55:02,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-07-23 13:55:02,789 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:55:02,789 INFO L357 BasicCegarLoop]: trace histogram [207, 206, 1, 1] [2018-07-23 13:55:02,790 INFO L414 AbstractCegarLoop]: === Iteration 207 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:55:02,790 INFO L82 PathProgramCache]: Analyzing trace with hash -2077475716, now seen corresponding path program 206 times [2018-07-23 13:55:02,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:55:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:55:04,590 INFO L134 CoverageAnalysis]: Checked inductivity of 42642 backedges. 0 proven. 42642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:04,590 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:55:04,590 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [207] total 207 [2018-07-23 13:55:04,590 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:55:04,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:55:04,591 INFO L185 omatonBuilderFactory]: Interpolants [196098#(<= proc_i 300), 196099#(<= proc_i 304), 196096#(<= proc_i 292), 196097#(<= proc_i 296), 196102#(<= proc_i 316), 196103#(<= proc_i 320), 196100#(<= proc_i 308), 196101#(<= proc_i 312), 196106#(<= proc_i 332), 196107#(<= proc_i 336), 196104#(<= proc_i 324), 196105#(<= proc_i 328), 196110#(<= proc_i 348), 196111#(<= proc_i 352), 196108#(<= proc_i 340), 196109#(<= proc_i 344), 196114#(<= proc_i 364), 196115#(<= proc_i 368), 196112#(<= proc_i 356), 196113#(<= proc_i 360), 196118#(<= proc_i 380), 196119#(<= proc_i 384), 196116#(<= proc_i 372), 196117#(<= proc_i 376), 196122#(<= proc_i 396), 196123#(<= proc_i 400), 196120#(<= proc_i 388), 196121#(<= proc_i 392), 196126#(<= proc_i 412), 196127#(<= proc_i 416), 196124#(<= proc_i 404), 196125#(<= proc_i 408), 196130#(<= proc_i 428), 196131#(<= proc_i 432), 196128#(<= proc_i 420), 196129#(<= proc_i 424), 196134#(<= proc_i 444), 196135#(<= proc_i 448), 196132#(<= proc_i 436), 196133#(<= proc_i 440), 196138#(<= proc_i 460), 196139#(<= proc_i 464), 196136#(<= proc_i 452), 196137#(<= proc_i 456), 196142#(<= proc_i 476), 196143#(<= proc_i 480), 196140#(<= proc_i 468), 196141#(<= proc_i 472), 196146#(<= proc_i 492), 196147#(<= proc_i 496), 196144#(<= proc_i 484), 196145#(<= proc_i 488), 196150#(<= proc_i 508), 196151#(<= proc_i 512), 196148#(<= proc_i 500), 196149#(<= proc_i 504), 196154#(<= proc_i 524), 196155#(<= proc_i 528), 196152#(<= proc_i 516), 196153#(<= proc_i 520), 196158#(<= proc_i 540), 196159#(<= proc_i 544), 196156#(<= proc_i 532), 196157#(<= proc_i 536), 196162#(<= proc_i 556), 196163#(<= proc_i 560), 196160#(<= proc_i 548), 196161#(<= proc_i 552), 196166#(<= proc_i 572), 196167#(<= proc_i 576), 196164#(<= proc_i 564), 196165#(<= proc_i 568), 196170#(<= proc_i 588), 196171#(<= proc_i 592), 196168#(<= proc_i 580), 196169#(<= proc_i 584), 196174#(<= proc_i 604), 196175#(<= proc_i 608), 196172#(<= proc_i 596), 196173#(<= proc_i 600), 196178#(<= proc_i 620), 196179#(<= proc_i 624), 196176#(<= proc_i 612), 196177#(<= proc_i 616), 196182#(<= proc_i 636), 196183#(<= proc_i 640), 196180#(<= proc_i 628), 196181#(<= proc_i 632), 196186#(<= proc_i 652), 196187#(<= proc_i 656), 196184#(<= proc_i 644), 196185#(<= proc_i 648), 196190#(<= proc_i 668), 196191#(<= proc_i 672), 196188#(<= proc_i 660), 196189#(<= proc_i 664), 196194#(<= proc_i 684), 196195#(<= proc_i 688), 196192#(<= proc_i 676), 196193#(<= proc_i 680), 196198#(<= proc_i 700), 196199#(<= proc_i 704), 196196#(<= proc_i 692), 196197#(<= proc_i 696), 196202#(<= proc_i 716), 196203#(<= proc_i 720), 196200#(<= proc_i 708), 196201#(<= proc_i 712), 196206#(<= proc_i 732), 196207#(<= proc_i 736), 196204#(<= proc_i 724), 196205#(<= proc_i 728), 196210#(<= proc_i 748), 196211#(<= proc_i 752), 196208#(<= proc_i 740), 196209#(<= proc_i 744), 196214#(<= proc_i 764), 196215#(<= proc_i 768), 196212#(<= proc_i 756), 196213#(<= proc_i 760), 196218#(<= proc_i 780), 196219#(<= proc_i 784), 196216#(<= proc_i 772), 196217#(<= proc_i 776), 196222#(<= proc_i 796), 196223#(<= proc_i 800), 196220#(<= proc_i 788), 196221#(<= proc_i 792), 196226#(<= proc_i 812), 196227#(<= proc_i 816), 196224#(<= proc_i 804), 196225#(<= proc_i 808), 196228#(<= proc_i 820), 196229#(<= proc_i 824), 196022#false, 196023#(<= proc_i 0), 196021#true, 196026#(<= proc_i 12), 196027#(<= proc_i 16), 196024#(<= proc_i 4), 196025#(<= proc_i 8), 196030#(<= proc_i 28), 196031#(<= proc_i 32), 196028#(<= proc_i 20), 196029#(<= proc_i 24), 196034#(<= proc_i 44), 196035#(<= proc_i 48), 196032#(<= proc_i 36), 196033#(<= proc_i 40), 196038#(<= proc_i 60), 196039#(<= proc_i 64), 196036#(<= proc_i 52), 196037#(<= proc_i 56), 196042#(<= proc_i 76), 196043#(<= proc_i 80), 196040#(<= proc_i 68), 196041#(<= proc_i 72), 196046#(<= proc_i 92), 196047#(<= proc_i 96), 196044#(<= proc_i 84), 196045#(<= proc_i 88), 196050#(<= proc_i 108), 196051#(<= proc_i 112), 196048#(<= proc_i 100), 196049#(<= proc_i 104), 196054#(<= proc_i 124), 196055#(<= proc_i 128), 196052#(<= proc_i 116), 196053#(<= proc_i 120), 196058#(<= proc_i 140), 196059#(<= proc_i 144), 196056#(<= proc_i 132), 196057#(<= proc_i 136), 196062#(<= proc_i 156), 196063#(<= proc_i 160), 196060#(<= proc_i 148), 196061#(<= proc_i 152), 196066#(<= proc_i 172), 196067#(<= proc_i 176), 196064#(<= proc_i 164), 196065#(<= proc_i 168), 196070#(<= proc_i 188), 196071#(<= proc_i 192), 196068#(<= proc_i 180), 196069#(<= proc_i 184), 196074#(<= proc_i 204), 196075#(<= proc_i 208), 196072#(<= proc_i 196), 196073#(<= proc_i 200), 196078#(<= proc_i 220), 196079#(<= proc_i 224), 196076#(<= proc_i 212), 196077#(<= proc_i 216), 196082#(<= proc_i 236), 196083#(<= proc_i 240), 196080#(<= proc_i 228), 196081#(<= proc_i 232), 196086#(<= proc_i 252), 196087#(<= proc_i 256), 196084#(<= proc_i 244), 196085#(<= proc_i 248), 196090#(<= proc_i 268), 196091#(<= proc_i 272), 196088#(<= proc_i 260), 196089#(<= proc_i 264), 196094#(<= proc_i 284), 196095#(<= proc_i 288), 196092#(<= proc_i 276), 196093#(<= proc_i 280)] [2018-07-23 13:55:04,593 INFO L134 CoverageAnalysis]: Checked inductivity of 42642 backedges. 0 proven. 42642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:04,593 INFO L450 AbstractCegarLoop]: Interpolant automaton has 209 states [2018-07-23 13:55:04,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 209 interpolants. [2018-07-23 13:55:04,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-07-23 13:55:04,597 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 209 states. [2018-07-23 13:55:05,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:55:05,849 INFO L93 Difference]: Finished difference Result 419 states and 419 transitions. [2018-07-23 13:55:05,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-07-23 13:55:05,849 INFO L78 Accepts]: Start accepts. Automaton has 209 states. Word has length 415 [2018-07-23 13:55:05,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:55:05,850 INFO L225 Difference]: With dead ends: 419 [2018-07-23 13:55:05,850 INFO L226 Difference]: Without dead ends: 418 [2018-07-23 13:55:05,852 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-07-23 13:55:05,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-07-23 13:55:05,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2018-07-23 13:55:05,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-07-23 13:55:05,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 418 transitions. [2018-07-23 13:55:05,856 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 418 transitions. Word has length 415 [2018-07-23 13:55:05,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:55:05,856 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 418 transitions. [2018-07-23 13:55:05,857 INFO L472 AbstractCegarLoop]: Interpolant automaton has 209 states. [2018-07-23 13:55:05,857 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 418 transitions. [2018-07-23 13:55:05,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-07-23 13:55:05,858 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:55:05,858 INFO L357 BasicCegarLoop]: trace histogram [208, 207, 1, 1] [2018-07-23 13:55:05,858 INFO L414 AbstractCegarLoop]: === Iteration 208 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:55:05,858 INFO L82 PathProgramCache]: Analyzing trace with hash 705630654, now seen corresponding path program 207 times [2018-07-23 13:55:05,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:55:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:55:07,317 INFO L134 CoverageAnalysis]: Checked inductivity of 43056 backedges. 0 proven. 43056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:07,317 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:55:07,317 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [208] total 208 [2018-07-23 13:55:07,318 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:55:07,318 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:55:07,318 INFO L185 omatonBuilderFactory]: Interpolants [197907#(<= proc_i 4), 197906#(<= proc_i 0), 197905#false, 197904#true, 197911#(<= proc_i 20), 197910#(<= proc_i 16), 197909#(<= proc_i 12), 197908#(<= proc_i 8), 197915#(<= proc_i 36), 197914#(<= proc_i 32), 197913#(<= proc_i 28), 197912#(<= proc_i 24), 197919#(<= proc_i 52), 197918#(<= proc_i 48), 197917#(<= proc_i 44), 197916#(<= proc_i 40), 197923#(<= proc_i 68), 197922#(<= proc_i 64), 197921#(<= proc_i 60), 197920#(<= proc_i 56), 197927#(<= proc_i 84), 197926#(<= proc_i 80), 197925#(<= proc_i 76), 197924#(<= proc_i 72), 197931#(<= proc_i 100), 197930#(<= proc_i 96), 197929#(<= proc_i 92), 197928#(<= proc_i 88), 197935#(<= proc_i 116), 197934#(<= proc_i 112), 197933#(<= proc_i 108), 197932#(<= proc_i 104), 197939#(<= proc_i 132), 197938#(<= proc_i 128), 197937#(<= proc_i 124), 197936#(<= proc_i 120), 197943#(<= proc_i 148), 197942#(<= proc_i 144), 197941#(<= proc_i 140), 197940#(<= proc_i 136), 197947#(<= proc_i 164), 197946#(<= proc_i 160), 197945#(<= proc_i 156), 197944#(<= proc_i 152), 197951#(<= proc_i 180), 197950#(<= proc_i 176), 197949#(<= proc_i 172), 197948#(<= proc_i 168), 197955#(<= proc_i 196), 197954#(<= proc_i 192), 197953#(<= proc_i 188), 197952#(<= proc_i 184), 197959#(<= proc_i 212), 197958#(<= proc_i 208), 197957#(<= proc_i 204), 197956#(<= proc_i 200), 197963#(<= proc_i 228), 197962#(<= proc_i 224), 197961#(<= proc_i 220), 197960#(<= proc_i 216), 197967#(<= proc_i 244), 197966#(<= proc_i 240), 197965#(<= proc_i 236), 197964#(<= proc_i 232), 197971#(<= proc_i 260), 197970#(<= proc_i 256), 197969#(<= proc_i 252), 197968#(<= proc_i 248), 197975#(<= proc_i 276), 197974#(<= proc_i 272), 197973#(<= proc_i 268), 197972#(<= proc_i 264), 197979#(<= proc_i 292), 197978#(<= proc_i 288), 197977#(<= proc_i 284), 197976#(<= proc_i 280), 197983#(<= proc_i 308), 197982#(<= proc_i 304), 197981#(<= proc_i 300), 197980#(<= proc_i 296), 197987#(<= proc_i 324), 197986#(<= proc_i 320), 197985#(<= proc_i 316), 197984#(<= proc_i 312), 197991#(<= proc_i 340), 197990#(<= proc_i 336), 197989#(<= proc_i 332), 197988#(<= proc_i 328), 197995#(<= proc_i 356), 197994#(<= proc_i 352), 197993#(<= proc_i 348), 197992#(<= proc_i 344), 197999#(<= proc_i 372), 197998#(<= proc_i 368), 197997#(<= proc_i 364), 197996#(<= proc_i 360), 198003#(<= proc_i 388), 198002#(<= proc_i 384), 198001#(<= proc_i 380), 198000#(<= proc_i 376), 198007#(<= proc_i 404), 198006#(<= proc_i 400), 198005#(<= proc_i 396), 198004#(<= proc_i 392), 198011#(<= proc_i 420), 198010#(<= proc_i 416), 198009#(<= proc_i 412), 198008#(<= proc_i 408), 198015#(<= proc_i 436), 198014#(<= proc_i 432), 198013#(<= proc_i 428), 198012#(<= proc_i 424), 198019#(<= proc_i 452), 198018#(<= proc_i 448), 198017#(<= proc_i 444), 198016#(<= proc_i 440), 198023#(<= proc_i 468), 198022#(<= proc_i 464), 198021#(<= proc_i 460), 198020#(<= proc_i 456), 198027#(<= proc_i 484), 198026#(<= proc_i 480), 198025#(<= proc_i 476), 198024#(<= proc_i 472), 198031#(<= proc_i 500), 198030#(<= proc_i 496), 198029#(<= proc_i 492), 198028#(<= proc_i 488), 198035#(<= proc_i 516), 198034#(<= proc_i 512), 198033#(<= proc_i 508), 198032#(<= proc_i 504), 198039#(<= proc_i 532), 198038#(<= proc_i 528), 198037#(<= proc_i 524), 198036#(<= proc_i 520), 198043#(<= proc_i 548), 198042#(<= proc_i 544), 198041#(<= proc_i 540), 198040#(<= proc_i 536), 198047#(<= proc_i 564), 198046#(<= proc_i 560), 198045#(<= proc_i 556), 198044#(<= proc_i 552), 198051#(<= proc_i 580), 198050#(<= proc_i 576), 198049#(<= proc_i 572), 198048#(<= proc_i 568), 198055#(<= proc_i 596), 198054#(<= proc_i 592), 198053#(<= proc_i 588), 198052#(<= proc_i 584), 198059#(<= proc_i 612), 198058#(<= proc_i 608), 198057#(<= proc_i 604), 198056#(<= proc_i 600), 198063#(<= proc_i 628), 198062#(<= proc_i 624), 198061#(<= proc_i 620), 198060#(<= proc_i 616), 198067#(<= proc_i 644), 198066#(<= proc_i 640), 198065#(<= proc_i 636), 198064#(<= proc_i 632), 198071#(<= proc_i 660), 198070#(<= proc_i 656), 198069#(<= proc_i 652), 198068#(<= proc_i 648), 198075#(<= proc_i 676), 198074#(<= proc_i 672), 198073#(<= proc_i 668), 198072#(<= proc_i 664), 198079#(<= proc_i 692), 198078#(<= proc_i 688), 198077#(<= proc_i 684), 198076#(<= proc_i 680), 198083#(<= proc_i 708), 198082#(<= proc_i 704), 198081#(<= proc_i 700), 198080#(<= proc_i 696), 198087#(<= proc_i 724), 198086#(<= proc_i 720), 198085#(<= proc_i 716), 198084#(<= proc_i 712), 198091#(<= proc_i 740), 198090#(<= proc_i 736), 198089#(<= proc_i 732), 198088#(<= proc_i 728), 198095#(<= proc_i 756), 198094#(<= proc_i 752), 198093#(<= proc_i 748), 198092#(<= proc_i 744), 198099#(<= proc_i 772), 198098#(<= proc_i 768), 198097#(<= proc_i 764), 198096#(<= proc_i 760), 198103#(<= proc_i 788), 198102#(<= proc_i 784), 198101#(<= proc_i 780), 198100#(<= proc_i 776), 198107#(<= proc_i 804), 198106#(<= proc_i 800), 198105#(<= proc_i 796), 198104#(<= proc_i 792), 198111#(<= proc_i 820), 198110#(<= proc_i 816), 198109#(<= proc_i 812), 198108#(<= proc_i 808), 198113#(<= proc_i 828), 198112#(<= proc_i 824)] [2018-07-23 13:55:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 43056 backedges. 0 proven. 43056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:07,321 INFO L450 AbstractCegarLoop]: Interpolant automaton has 210 states [2018-07-23 13:55:07,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2018-07-23 13:55:07,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-07-23 13:55:07,327 INFO L87 Difference]: Start difference. First operand 418 states and 418 transitions. Second operand 210 states. [2018-07-23 13:55:09,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:55:09,783 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2018-07-23 13:55:09,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-07-23 13:55:09,784 INFO L78 Accepts]: Start accepts. Automaton has 210 states. Word has length 417 [2018-07-23 13:55:09,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:55:09,784 INFO L225 Difference]: With dead ends: 421 [2018-07-23 13:55:09,784 INFO L226 Difference]: Without dead ends: 420 [2018-07-23 13:55:09,786 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-07-23 13:55:09,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-07-23 13:55:09,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2018-07-23 13:55:09,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-07-23 13:55:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 420 transitions. [2018-07-23 13:55:09,790 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 420 transitions. Word has length 417 [2018-07-23 13:55:09,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:55:09,790 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 420 transitions. [2018-07-23 13:55:09,790 INFO L472 AbstractCegarLoop]: Interpolant automaton has 210 states. [2018-07-23 13:55:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 420 transitions. [2018-07-23 13:55:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-07-23 13:55:09,792 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:55:09,792 INFO L357 BasicCegarLoop]: trace histogram [209, 208, 1, 1] [2018-07-23 13:55:09,792 INFO L414 AbstractCegarLoop]: === Iteration 209 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:55:09,792 INFO L82 PathProgramCache]: Analyzing trace with hash -493773184, now seen corresponding path program 208 times [2018-07-23 13:55:09,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:55:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:55:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 43472 backedges. 0 proven. 43472 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:11,301 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:55:11,302 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [209] total 209 [2018-07-23 13:55:11,302 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:55:11,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:55:11,302 INFO L185 omatonBuilderFactory]: Interpolants [199799#(<= proc_i 4), 199798#(<= proc_i 0), 199797#false, 199796#true, 199803#(<= proc_i 20), 199802#(<= proc_i 16), 199801#(<= proc_i 12), 199800#(<= proc_i 8), 199807#(<= proc_i 36), 199806#(<= proc_i 32), 199805#(<= proc_i 28), 199804#(<= proc_i 24), 199811#(<= proc_i 52), 199810#(<= proc_i 48), 199809#(<= proc_i 44), 199808#(<= proc_i 40), 199815#(<= proc_i 68), 199814#(<= proc_i 64), 199813#(<= proc_i 60), 199812#(<= proc_i 56), 199819#(<= proc_i 84), 199818#(<= proc_i 80), 199817#(<= proc_i 76), 199816#(<= proc_i 72), 199823#(<= proc_i 100), 199822#(<= proc_i 96), 199821#(<= proc_i 92), 199820#(<= proc_i 88), 199827#(<= proc_i 116), 199826#(<= proc_i 112), 199825#(<= proc_i 108), 199824#(<= proc_i 104), 199831#(<= proc_i 132), 199830#(<= proc_i 128), 199829#(<= proc_i 124), 199828#(<= proc_i 120), 199835#(<= proc_i 148), 199834#(<= proc_i 144), 199833#(<= proc_i 140), 199832#(<= proc_i 136), 199839#(<= proc_i 164), 199838#(<= proc_i 160), 199837#(<= proc_i 156), 199836#(<= proc_i 152), 199843#(<= proc_i 180), 199842#(<= proc_i 176), 199841#(<= proc_i 172), 199840#(<= proc_i 168), 199847#(<= proc_i 196), 199846#(<= proc_i 192), 199845#(<= proc_i 188), 199844#(<= proc_i 184), 199851#(<= proc_i 212), 199850#(<= proc_i 208), 199849#(<= proc_i 204), 199848#(<= proc_i 200), 199855#(<= proc_i 228), 199854#(<= proc_i 224), 199853#(<= proc_i 220), 199852#(<= proc_i 216), 199859#(<= proc_i 244), 199858#(<= proc_i 240), 199857#(<= proc_i 236), 199856#(<= proc_i 232), 199863#(<= proc_i 260), 199862#(<= proc_i 256), 199861#(<= proc_i 252), 199860#(<= proc_i 248), 199867#(<= proc_i 276), 199866#(<= proc_i 272), 199865#(<= proc_i 268), 199864#(<= proc_i 264), 199871#(<= proc_i 292), 199870#(<= proc_i 288), 199869#(<= proc_i 284), 199868#(<= proc_i 280), 199875#(<= proc_i 308), 199874#(<= proc_i 304), 199873#(<= proc_i 300), 199872#(<= proc_i 296), 199879#(<= proc_i 324), 199878#(<= proc_i 320), 199877#(<= proc_i 316), 199876#(<= proc_i 312), 199883#(<= proc_i 340), 199882#(<= proc_i 336), 199881#(<= proc_i 332), 199880#(<= proc_i 328), 199887#(<= proc_i 356), 199886#(<= proc_i 352), 199885#(<= proc_i 348), 199884#(<= proc_i 344), 199891#(<= proc_i 372), 199890#(<= proc_i 368), 199889#(<= proc_i 364), 199888#(<= proc_i 360), 199895#(<= proc_i 388), 199894#(<= proc_i 384), 199893#(<= proc_i 380), 199892#(<= proc_i 376), 199899#(<= proc_i 404), 199898#(<= proc_i 400), 199897#(<= proc_i 396), 199896#(<= proc_i 392), 199903#(<= proc_i 420), 199902#(<= proc_i 416), 199901#(<= proc_i 412), 199900#(<= proc_i 408), 199907#(<= proc_i 436), 199906#(<= proc_i 432), 199905#(<= proc_i 428), 199904#(<= proc_i 424), 199911#(<= proc_i 452), 199910#(<= proc_i 448), 199909#(<= proc_i 444), 199908#(<= proc_i 440), 199915#(<= proc_i 468), 199914#(<= proc_i 464), 199913#(<= proc_i 460), 199912#(<= proc_i 456), 199919#(<= proc_i 484), 199918#(<= proc_i 480), 199917#(<= proc_i 476), 199916#(<= proc_i 472), 199923#(<= proc_i 500), 199922#(<= proc_i 496), 199921#(<= proc_i 492), 199920#(<= proc_i 488), 199927#(<= proc_i 516), 199926#(<= proc_i 512), 199925#(<= proc_i 508), 199924#(<= proc_i 504), 199931#(<= proc_i 532), 199930#(<= proc_i 528), 199929#(<= proc_i 524), 199928#(<= proc_i 520), 199935#(<= proc_i 548), 199934#(<= proc_i 544), 199933#(<= proc_i 540), 199932#(<= proc_i 536), 199939#(<= proc_i 564), 199938#(<= proc_i 560), 199937#(<= proc_i 556), 199936#(<= proc_i 552), 199943#(<= proc_i 580), 199942#(<= proc_i 576), 199941#(<= proc_i 572), 199940#(<= proc_i 568), 199947#(<= proc_i 596), 199946#(<= proc_i 592), 199945#(<= proc_i 588), 199944#(<= proc_i 584), 199951#(<= proc_i 612), 199950#(<= proc_i 608), 199949#(<= proc_i 604), 199948#(<= proc_i 600), 199955#(<= proc_i 628), 199954#(<= proc_i 624), 199953#(<= proc_i 620), 199952#(<= proc_i 616), 199959#(<= proc_i 644), 199958#(<= proc_i 640), 199957#(<= proc_i 636), 199956#(<= proc_i 632), 199963#(<= proc_i 660), 199962#(<= proc_i 656), 199961#(<= proc_i 652), 199960#(<= proc_i 648), 199967#(<= proc_i 676), 199966#(<= proc_i 672), 199965#(<= proc_i 668), 199964#(<= proc_i 664), 199971#(<= proc_i 692), 199970#(<= proc_i 688), 199969#(<= proc_i 684), 199968#(<= proc_i 680), 199975#(<= proc_i 708), 199974#(<= proc_i 704), 199973#(<= proc_i 700), 199972#(<= proc_i 696), 199979#(<= proc_i 724), 199978#(<= proc_i 720), 199977#(<= proc_i 716), 199976#(<= proc_i 712), 199983#(<= proc_i 740), 199982#(<= proc_i 736), 199981#(<= proc_i 732), 199980#(<= proc_i 728), 199987#(<= proc_i 756), 199986#(<= proc_i 752), 199985#(<= proc_i 748), 199984#(<= proc_i 744), 199991#(<= proc_i 772), 199990#(<= proc_i 768), 199989#(<= proc_i 764), 199988#(<= proc_i 760), 199995#(<= proc_i 788), 199994#(<= proc_i 784), 199993#(<= proc_i 780), 199992#(<= proc_i 776), 199999#(<= proc_i 804), 199998#(<= proc_i 800), 199997#(<= proc_i 796), 199996#(<= proc_i 792), 200003#(<= proc_i 820), 200002#(<= proc_i 816), 200001#(<= proc_i 812), 200000#(<= proc_i 808), 200006#(<= proc_i 832), 200005#(<= proc_i 828), 200004#(<= proc_i 824)] [2018-07-23 13:55:11,304 INFO L134 CoverageAnalysis]: Checked inductivity of 43472 backedges. 0 proven. 43472 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:11,304 INFO L450 AbstractCegarLoop]: Interpolant automaton has 211 states [2018-07-23 13:55:11,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 211 interpolants. [2018-07-23 13:55:11,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-07-23 13:55:11,307 INFO L87 Difference]: Start difference. First operand 420 states and 420 transitions. Second operand 211 states. [2018-07-23 13:55:12,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:55:12,536 INFO L93 Difference]: Finished difference Result 423 states and 423 transitions. [2018-07-23 13:55:12,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-07-23 13:55:12,536 INFO L78 Accepts]: Start accepts. Automaton has 211 states. Word has length 419 [2018-07-23 13:55:12,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:55:12,537 INFO L225 Difference]: With dead ends: 423 [2018-07-23 13:55:12,537 INFO L226 Difference]: Without dead ends: 422 [2018-07-23 13:55:12,538 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-07-23 13:55:12,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-07-23 13:55:12,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2018-07-23 13:55:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-07-23 13:55:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 422 transitions. [2018-07-23 13:55:12,542 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 422 transitions. Word has length 419 [2018-07-23 13:55:12,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:55:12,542 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 422 transitions. [2018-07-23 13:55:12,542 INFO L472 AbstractCegarLoop]: Interpolant automaton has 211 states. [2018-07-23 13:55:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 422 transitions. [2018-07-23 13:55:12,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2018-07-23 13:55:12,543 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:55:12,544 INFO L357 BasicCegarLoop]: trace histogram [210, 209, 1, 1] [2018-07-23 13:55:12,544 INFO L414 AbstractCegarLoop]: === Iteration 210 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:55:12,544 INFO L82 PathProgramCache]: Analyzing trace with hash -2069626174, now seen corresponding path program 209 times [2018-07-23 13:55:12,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:55:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:55:14,161 INFO L134 CoverageAnalysis]: Checked inductivity of 43890 backedges. 0 proven. 43890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:14,161 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:55:14,161 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [210] total 210 [2018-07-23 13:55:14,161 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:55:14,162 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:55:14,162 INFO L185 omatonBuilderFactory]: Interpolants [201731#(<= proc_i 128), 201730#(<= proc_i 124), 201729#(<= proc_i 120), 201728#(<= proc_i 116), 201735#(<= proc_i 144), 201734#(<= proc_i 140), 201733#(<= proc_i 136), 201732#(<= proc_i 132), 201739#(<= proc_i 160), 201738#(<= proc_i 156), 201737#(<= proc_i 152), 201736#(<= proc_i 148), 201743#(<= proc_i 176), 201742#(<= proc_i 172), 201741#(<= proc_i 168), 201740#(<= proc_i 164), 201747#(<= proc_i 192), 201746#(<= proc_i 188), 201745#(<= proc_i 184), 201744#(<= proc_i 180), 201751#(<= proc_i 208), 201750#(<= proc_i 204), 201749#(<= proc_i 200), 201748#(<= proc_i 196), 201755#(<= proc_i 224), 201754#(<= proc_i 220), 201753#(<= proc_i 216), 201752#(<= proc_i 212), 201759#(<= proc_i 240), 201758#(<= proc_i 236), 201757#(<= proc_i 232), 201756#(<= proc_i 228), 201763#(<= proc_i 256), 201762#(<= proc_i 252), 201761#(<= proc_i 248), 201760#(<= proc_i 244), 201767#(<= proc_i 272), 201766#(<= proc_i 268), 201765#(<= proc_i 264), 201764#(<= proc_i 260), 201771#(<= proc_i 288), 201770#(<= proc_i 284), 201769#(<= proc_i 280), 201768#(<= proc_i 276), 201775#(<= proc_i 304), 201774#(<= proc_i 300), 201773#(<= proc_i 296), 201772#(<= proc_i 292), 201779#(<= proc_i 320), 201778#(<= proc_i 316), 201777#(<= proc_i 312), 201776#(<= proc_i 308), 201783#(<= proc_i 336), 201782#(<= proc_i 332), 201781#(<= proc_i 328), 201780#(<= proc_i 324), 201787#(<= proc_i 352), 201786#(<= proc_i 348), 201785#(<= proc_i 344), 201784#(<= proc_i 340), 201791#(<= proc_i 368), 201790#(<= proc_i 364), 201789#(<= proc_i 360), 201788#(<= proc_i 356), 201795#(<= proc_i 384), 201794#(<= proc_i 380), 201793#(<= proc_i 376), 201792#(<= proc_i 372), 201799#(<= proc_i 400), 201798#(<= proc_i 396), 201797#(<= proc_i 392), 201796#(<= proc_i 388), 201803#(<= proc_i 416), 201802#(<= proc_i 412), 201801#(<= proc_i 408), 201800#(<= proc_i 404), 201807#(<= proc_i 432), 201806#(<= proc_i 428), 201805#(<= proc_i 424), 201804#(<= proc_i 420), 201811#(<= proc_i 448), 201810#(<= proc_i 444), 201809#(<= proc_i 440), 201808#(<= proc_i 436), 201815#(<= proc_i 464), 201814#(<= proc_i 460), 201813#(<= proc_i 456), 201812#(<= proc_i 452), 201819#(<= proc_i 480), 201818#(<= proc_i 476), 201817#(<= proc_i 472), 201816#(<= proc_i 468), 201823#(<= proc_i 496), 201822#(<= proc_i 492), 201821#(<= proc_i 488), 201820#(<= proc_i 484), 201827#(<= proc_i 512), 201826#(<= proc_i 508), 201825#(<= proc_i 504), 201824#(<= proc_i 500), 201831#(<= proc_i 528), 201830#(<= proc_i 524), 201829#(<= proc_i 520), 201828#(<= proc_i 516), 201835#(<= proc_i 544), 201834#(<= proc_i 540), 201833#(<= proc_i 536), 201832#(<= proc_i 532), 201839#(<= proc_i 560), 201838#(<= proc_i 556), 201837#(<= proc_i 552), 201836#(<= proc_i 548), 201843#(<= proc_i 576), 201842#(<= proc_i 572), 201841#(<= proc_i 568), 201840#(<= proc_i 564), 201847#(<= proc_i 592), 201846#(<= proc_i 588), 201845#(<= proc_i 584), 201844#(<= proc_i 580), 201851#(<= proc_i 608), 201850#(<= proc_i 604), 201849#(<= proc_i 600), 201848#(<= proc_i 596), 201855#(<= proc_i 624), 201854#(<= proc_i 620), 201853#(<= proc_i 616), 201852#(<= proc_i 612), 201859#(<= proc_i 640), 201858#(<= proc_i 636), 201857#(<= proc_i 632), 201856#(<= proc_i 628), 201863#(<= proc_i 656), 201862#(<= proc_i 652), 201861#(<= proc_i 648), 201860#(<= proc_i 644), 201867#(<= proc_i 672), 201866#(<= proc_i 668), 201865#(<= proc_i 664), 201864#(<= proc_i 660), 201871#(<= proc_i 688), 201870#(<= proc_i 684), 201869#(<= proc_i 680), 201868#(<= proc_i 676), 201875#(<= proc_i 704), 201874#(<= proc_i 700), 201873#(<= proc_i 696), 201872#(<= proc_i 692), 201879#(<= proc_i 720), 201878#(<= proc_i 716), 201877#(<= proc_i 712), 201876#(<= proc_i 708), 201883#(<= proc_i 736), 201882#(<= proc_i 732), 201881#(<= proc_i 728), 201880#(<= proc_i 724), 201887#(<= proc_i 752), 201886#(<= proc_i 748), 201885#(<= proc_i 744), 201884#(<= proc_i 740), 201891#(<= proc_i 768), 201890#(<= proc_i 764), 201889#(<= proc_i 760), 201888#(<= proc_i 756), 201895#(<= proc_i 784), 201894#(<= proc_i 780), 201893#(<= proc_i 776), 201892#(<= proc_i 772), 201899#(<= proc_i 800), 201898#(<= proc_i 796), 201897#(<= proc_i 792), 201896#(<= proc_i 788), 201903#(<= proc_i 816), 201902#(<= proc_i 812), 201901#(<= proc_i 808), 201900#(<= proc_i 804), 201907#(<= proc_i 832), 201906#(<= proc_i 828), 201905#(<= proc_i 824), 201904#(<= proc_i 820), 201908#(<= proc_i 836), 201699#(<= proc_i 0), 201698#false, 201697#true, 201703#(<= proc_i 16), 201702#(<= proc_i 12), 201701#(<= proc_i 8), 201700#(<= proc_i 4), 201707#(<= proc_i 32), 201706#(<= proc_i 28), 201705#(<= proc_i 24), 201704#(<= proc_i 20), 201711#(<= proc_i 48), 201710#(<= proc_i 44), 201709#(<= proc_i 40), 201708#(<= proc_i 36), 201715#(<= proc_i 64), 201714#(<= proc_i 60), 201713#(<= proc_i 56), 201712#(<= proc_i 52), 201719#(<= proc_i 80), 201718#(<= proc_i 76), 201717#(<= proc_i 72), 201716#(<= proc_i 68), 201723#(<= proc_i 96), 201722#(<= proc_i 92), 201721#(<= proc_i 88), 201720#(<= proc_i 84), 201727#(<= proc_i 112), 201726#(<= proc_i 108), 201725#(<= proc_i 104), 201724#(<= proc_i 100)] [2018-07-23 13:55:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 43890 backedges. 0 proven. 43890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:14,164 INFO L450 AbstractCegarLoop]: Interpolant automaton has 212 states [2018-07-23 13:55:14,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2018-07-23 13:55:14,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-07-23 13:55:14,170 INFO L87 Difference]: Start difference. First operand 422 states and 422 transitions. Second operand 212 states. [2018-07-23 13:55:16,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:55:16,679 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2018-07-23 13:55:16,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-07-23 13:55:16,680 INFO L78 Accepts]: Start accepts. Automaton has 212 states. Word has length 421 [2018-07-23 13:55:16,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:55:16,681 INFO L225 Difference]: With dead ends: 425 [2018-07-23 13:55:16,681 INFO L226 Difference]: Without dead ends: 424 [2018-07-23 13:55:16,683 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-07-23 13:55:16,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-07-23 13:55:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2018-07-23 13:55:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-07-23 13:55:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 424 transitions. [2018-07-23 13:55:16,687 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 424 transitions. Word has length 421 [2018-07-23 13:55:16,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:55:16,688 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 424 transitions. [2018-07-23 13:55:16,688 INFO L472 AbstractCegarLoop]: Interpolant automaton has 212 states. [2018-07-23 13:55:16,688 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 424 transitions. [2018-07-23 13:55:16,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-07-23 13:55:16,689 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:55:16,689 INFO L357 BasicCegarLoop]: trace histogram [211, 210, 1, 1] [2018-07-23 13:55:16,689 INFO L414 AbstractCegarLoop]: === Iteration 211 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:55:16,689 INFO L82 PathProgramCache]: Analyzing trace with hash -340894076, now seen corresponding path program 210 times [2018-07-23 13:55:16,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:55:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:55:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 44310 backedges. 0 proven. 44310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:18,405 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:55:18,405 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [211] total 211 [2018-07-23 13:55:18,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:55:18,405 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:55:18,406 INFO L185 omatonBuilderFactory]: Interpolants [203779#(<= proc_i 680), 203778#(<= proc_i 676), 203777#(<= proc_i 672), 203776#(<= proc_i 668), 203783#(<= proc_i 696), 203782#(<= proc_i 692), 203781#(<= proc_i 688), 203780#(<= proc_i 684), 203787#(<= proc_i 712), 203786#(<= proc_i 708), 203785#(<= proc_i 704), 203784#(<= proc_i 700), 203791#(<= proc_i 728), 203790#(<= proc_i 724), 203789#(<= proc_i 720), 203788#(<= proc_i 716), 203795#(<= proc_i 744), 203794#(<= proc_i 740), 203793#(<= proc_i 736), 203792#(<= proc_i 732), 203799#(<= proc_i 760), 203798#(<= proc_i 756), 203797#(<= proc_i 752), 203796#(<= proc_i 748), 203803#(<= proc_i 776), 203802#(<= proc_i 772), 203801#(<= proc_i 768), 203800#(<= proc_i 764), 203807#(<= proc_i 792), 203806#(<= proc_i 788), 203805#(<= proc_i 784), 203804#(<= proc_i 780), 203811#(<= proc_i 808), 203810#(<= proc_i 804), 203809#(<= proc_i 800), 203808#(<= proc_i 796), 203815#(<= proc_i 824), 203814#(<= proc_i 820), 203813#(<= proc_i 816), 203812#(<= proc_i 812), 203819#(<= proc_i 840), 203818#(<= proc_i 836), 203817#(<= proc_i 832), 203816#(<= proc_i 828), 203607#true, 203611#(<= proc_i 8), 203610#(<= proc_i 4), 203609#(<= proc_i 0), 203608#false, 203615#(<= proc_i 24), 203614#(<= proc_i 20), 203613#(<= proc_i 16), 203612#(<= proc_i 12), 203619#(<= proc_i 40), 203618#(<= proc_i 36), 203617#(<= proc_i 32), 203616#(<= proc_i 28), 203623#(<= proc_i 56), 203622#(<= proc_i 52), 203621#(<= proc_i 48), 203620#(<= proc_i 44), 203627#(<= proc_i 72), 203626#(<= proc_i 68), 203625#(<= proc_i 64), 203624#(<= proc_i 60), 203631#(<= proc_i 88), 203630#(<= proc_i 84), 203629#(<= proc_i 80), 203628#(<= proc_i 76), 203635#(<= proc_i 104), 203634#(<= proc_i 100), 203633#(<= proc_i 96), 203632#(<= proc_i 92), 203639#(<= proc_i 120), 203638#(<= proc_i 116), 203637#(<= proc_i 112), 203636#(<= proc_i 108), 203643#(<= proc_i 136), 203642#(<= proc_i 132), 203641#(<= proc_i 128), 203640#(<= proc_i 124), 203647#(<= proc_i 152), 203646#(<= proc_i 148), 203645#(<= proc_i 144), 203644#(<= proc_i 140), 203651#(<= proc_i 168), 203650#(<= proc_i 164), 203649#(<= proc_i 160), 203648#(<= proc_i 156), 203655#(<= proc_i 184), 203654#(<= proc_i 180), 203653#(<= proc_i 176), 203652#(<= proc_i 172), 203659#(<= proc_i 200), 203658#(<= proc_i 196), 203657#(<= proc_i 192), 203656#(<= proc_i 188), 203663#(<= proc_i 216), 203662#(<= proc_i 212), 203661#(<= proc_i 208), 203660#(<= proc_i 204), 203667#(<= proc_i 232), 203666#(<= proc_i 228), 203665#(<= proc_i 224), 203664#(<= proc_i 220), 203671#(<= proc_i 248), 203670#(<= proc_i 244), 203669#(<= proc_i 240), 203668#(<= proc_i 236), 203675#(<= proc_i 264), 203674#(<= proc_i 260), 203673#(<= proc_i 256), 203672#(<= proc_i 252), 203679#(<= proc_i 280), 203678#(<= proc_i 276), 203677#(<= proc_i 272), 203676#(<= proc_i 268), 203683#(<= proc_i 296), 203682#(<= proc_i 292), 203681#(<= proc_i 288), 203680#(<= proc_i 284), 203687#(<= proc_i 312), 203686#(<= proc_i 308), 203685#(<= proc_i 304), 203684#(<= proc_i 300), 203691#(<= proc_i 328), 203690#(<= proc_i 324), 203689#(<= proc_i 320), 203688#(<= proc_i 316), 203695#(<= proc_i 344), 203694#(<= proc_i 340), 203693#(<= proc_i 336), 203692#(<= proc_i 332), 203699#(<= proc_i 360), 203698#(<= proc_i 356), 203697#(<= proc_i 352), 203696#(<= proc_i 348), 203703#(<= proc_i 376), 203702#(<= proc_i 372), 203701#(<= proc_i 368), 203700#(<= proc_i 364), 203707#(<= proc_i 392), 203706#(<= proc_i 388), 203705#(<= proc_i 384), 203704#(<= proc_i 380), 203711#(<= proc_i 408), 203710#(<= proc_i 404), 203709#(<= proc_i 400), 203708#(<= proc_i 396), 203715#(<= proc_i 424), 203714#(<= proc_i 420), 203713#(<= proc_i 416), 203712#(<= proc_i 412), 203719#(<= proc_i 440), 203718#(<= proc_i 436), 203717#(<= proc_i 432), 203716#(<= proc_i 428), 203723#(<= proc_i 456), 203722#(<= proc_i 452), 203721#(<= proc_i 448), 203720#(<= proc_i 444), 203727#(<= proc_i 472), 203726#(<= proc_i 468), 203725#(<= proc_i 464), 203724#(<= proc_i 460), 203731#(<= proc_i 488), 203730#(<= proc_i 484), 203729#(<= proc_i 480), 203728#(<= proc_i 476), 203735#(<= proc_i 504), 203734#(<= proc_i 500), 203733#(<= proc_i 496), 203732#(<= proc_i 492), 203739#(<= proc_i 520), 203738#(<= proc_i 516), 203737#(<= proc_i 512), 203736#(<= proc_i 508), 203743#(<= proc_i 536), 203742#(<= proc_i 532), 203741#(<= proc_i 528), 203740#(<= proc_i 524), 203747#(<= proc_i 552), 203746#(<= proc_i 548), 203745#(<= proc_i 544), 203744#(<= proc_i 540), 203751#(<= proc_i 568), 203750#(<= proc_i 564), 203749#(<= proc_i 560), 203748#(<= proc_i 556), 203755#(<= proc_i 584), 203754#(<= proc_i 580), 203753#(<= proc_i 576), 203752#(<= proc_i 572), 203759#(<= proc_i 600), 203758#(<= proc_i 596), 203757#(<= proc_i 592), 203756#(<= proc_i 588), 203763#(<= proc_i 616), 203762#(<= proc_i 612), 203761#(<= proc_i 608), 203760#(<= proc_i 604), 203767#(<= proc_i 632), 203766#(<= proc_i 628), 203765#(<= proc_i 624), 203764#(<= proc_i 620), 203771#(<= proc_i 648), 203770#(<= proc_i 644), 203769#(<= proc_i 640), 203768#(<= proc_i 636), 203775#(<= proc_i 664), 203774#(<= proc_i 660), 203773#(<= proc_i 656), 203772#(<= proc_i 652)] [2018-07-23 13:55:18,408 INFO L134 CoverageAnalysis]: Checked inductivity of 44310 backedges. 0 proven. 44310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:18,408 INFO L450 AbstractCegarLoop]: Interpolant automaton has 213 states [2018-07-23 13:55:18,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 213 interpolants. [2018-07-23 13:55:18,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-07-23 13:55:18,415 INFO L87 Difference]: Start difference. First operand 424 states and 424 transitions. Second operand 213 states. [2018-07-23 13:55:19,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:55:19,890 INFO L93 Difference]: Finished difference Result 427 states and 427 transitions. [2018-07-23 13:55:19,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-07-23 13:55:19,890 INFO L78 Accepts]: Start accepts. Automaton has 213 states. Word has length 423 [2018-07-23 13:55:19,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:55:19,891 INFO L225 Difference]: With dead ends: 427 [2018-07-23 13:55:19,891 INFO L226 Difference]: Without dead ends: 426 [2018-07-23 13:55:19,893 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-07-23 13:55:19,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-07-23 13:55:19,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2018-07-23 13:55:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-07-23 13:55:19,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 426 transitions. [2018-07-23 13:55:19,898 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 426 transitions. Word has length 423 [2018-07-23 13:55:19,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:55:19,898 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 426 transitions. [2018-07-23 13:55:19,898 INFO L472 AbstractCegarLoop]: Interpolant automaton has 213 states. [2018-07-23 13:55:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 426 transitions. [2018-07-23 13:55:19,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-07-23 13:55:19,900 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:55:19,900 INFO L357 BasicCegarLoop]: trace histogram [212, 211, 1, 1] [2018-07-23 13:55:19,900 INFO L414 AbstractCegarLoop]: === Iteration 212 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:55:19,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1181691450, now seen corresponding path program 211 times [2018-07-23 13:55:19,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:55:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:55:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 44732 backedges. 0 proven. 44732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:21,727 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:55:21,727 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [212] total 212 [2018-07-23 13:55:21,727 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:55:21,727 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:55:21,728 INFO L185 omatonBuilderFactory]: Interpolants [205527#false, 205526#true, 205531#(<= proc_i 12), 205530#(<= proc_i 8), 205529#(<= proc_i 4), 205528#(<= proc_i 0), 205535#(<= proc_i 28), 205534#(<= proc_i 24), 205533#(<= proc_i 20), 205532#(<= proc_i 16), 205539#(<= proc_i 44), 205538#(<= proc_i 40), 205537#(<= proc_i 36), 205536#(<= proc_i 32), 205543#(<= proc_i 60), 205542#(<= proc_i 56), 205541#(<= proc_i 52), 205540#(<= proc_i 48), 205547#(<= proc_i 76), 205546#(<= proc_i 72), 205545#(<= proc_i 68), 205544#(<= proc_i 64), 205551#(<= proc_i 92), 205550#(<= proc_i 88), 205549#(<= proc_i 84), 205548#(<= proc_i 80), 205555#(<= proc_i 108), 205554#(<= proc_i 104), 205553#(<= proc_i 100), 205552#(<= proc_i 96), 205559#(<= proc_i 124), 205558#(<= proc_i 120), 205557#(<= proc_i 116), 205556#(<= proc_i 112), 205563#(<= proc_i 140), 205562#(<= proc_i 136), 205561#(<= proc_i 132), 205560#(<= proc_i 128), 205567#(<= proc_i 156), 205566#(<= proc_i 152), 205565#(<= proc_i 148), 205564#(<= proc_i 144), 205571#(<= proc_i 172), 205570#(<= proc_i 168), 205569#(<= proc_i 164), 205568#(<= proc_i 160), 205575#(<= proc_i 188), 205574#(<= proc_i 184), 205573#(<= proc_i 180), 205572#(<= proc_i 176), 205579#(<= proc_i 204), 205578#(<= proc_i 200), 205577#(<= proc_i 196), 205576#(<= proc_i 192), 205583#(<= proc_i 220), 205582#(<= proc_i 216), 205581#(<= proc_i 212), 205580#(<= proc_i 208), 205587#(<= proc_i 236), 205586#(<= proc_i 232), 205585#(<= proc_i 228), 205584#(<= proc_i 224), 205591#(<= proc_i 252), 205590#(<= proc_i 248), 205589#(<= proc_i 244), 205588#(<= proc_i 240), 205595#(<= proc_i 268), 205594#(<= proc_i 264), 205593#(<= proc_i 260), 205592#(<= proc_i 256), 205599#(<= proc_i 284), 205598#(<= proc_i 280), 205597#(<= proc_i 276), 205596#(<= proc_i 272), 205603#(<= proc_i 300), 205602#(<= proc_i 296), 205601#(<= proc_i 292), 205600#(<= proc_i 288), 205607#(<= proc_i 316), 205606#(<= proc_i 312), 205605#(<= proc_i 308), 205604#(<= proc_i 304), 205611#(<= proc_i 332), 205610#(<= proc_i 328), 205609#(<= proc_i 324), 205608#(<= proc_i 320), 205615#(<= proc_i 348), 205614#(<= proc_i 344), 205613#(<= proc_i 340), 205612#(<= proc_i 336), 205619#(<= proc_i 364), 205618#(<= proc_i 360), 205617#(<= proc_i 356), 205616#(<= proc_i 352), 205623#(<= proc_i 380), 205622#(<= proc_i 376), 205621#(<= proc_i 372), 205620#(<= proc_i 368), 205627#(<= proc_i 396), 205626#(<= proc_i 392), 205625#(<= proc_i 388), 205624#(<= proc_i 384), 205631#(<= proc_i 412), 205630#(<= proc_i 408), 205629#(<= proc_i 404), 205628#(<= proc_i 400), 205635#(<= proc_i 428), 205634#(<= proc_i 424), 205633#(<= proc_i 420), 205632#(<= proc_i 416), 205639#(<= proc_i 444), 205638#(<= proc_i 440), 205637#(<= proc_i 436), 205636#(<= proc_i 432), 205643#(<= proc_i 460), 205642#(<= proc_i 456), 205641#(<= proc_i 452), 205640#(<= proc_i 448), 205647#(<= proc_i 476), 205646#(<= proc_i 472), 205645#(<= proc_i 468), 205644#(<= proc_i 464), 205651#(<= proc_i 492), 205650#(<= proc_i 488), 205649#(<= proc_i 484), 205648#(<= proc_i 480), 205655#(<= proc_i 508), 205654#(<= proc_i 504), 205653#(<= proc_i 500), 205652#(<= proc_i 496), 205659#(<= proc_i 524), 205658#(<= proc_i 520), 205657#(<= proc_i 516), 205656#(<= proc_i 512), 205663#(<= proc_i 540), 205662#(<= proc_i 536), 205661#(<= proc_i 532), 205660#(<= proc_i 528), 205667#(<= proc_i 556), 205666#(<= proc_i 552), 205665#(<= proc_i 548), 205664#(<= proc_i 544), 205671#(<= proc_i 572), 205670#(<= proc_i 568), 205669#(<= proc_i 564), 205668#(<= proc_i 560), 205675#(<= proc_i 588), 205674#(<= proc_i 584), 205673#(<= proc_i 580), 205672#(<= proc_i 576), 205679#(<= proc_i 604), 205678#(<= proc_i 600), 205677#(<= proc_i 596), 205676#(<= proc_i 592), 205683#(<= proc_i 620), 205682#(<= proc_i 616), 205681#(<= proc_i 612), 205680#(<= proc_i 608), 205687#(<= proc_i 636), 205686#(<= proc_i 632), 205685#(<= proc_i 628), 205684#(<= proc_i 624), 205691#(<= proc_i 652), 205690#(<= proc_i 648), 205689#(<= proc_i 644), 205688#(<= proc_i 640), 205695#(<= proc_i 668), 205694#(<= proc_i 664), 205693#(<= proc_i 660), 205692#(<= proc_i 656), 205699#(<= proc_i 684), 205698#(<= proc_i 680), 205697#(<= proc_i 676), 205696#(<= proc_i 672), 205703#(<= proc_i 700), 205702#(<= proc_i 696), 205701#(<= proc_i 692), 205700#(<= proc_i 688), 205707#(<= proc_i 716), 205706#(<= proc_i 712), 205705#(<= proc_i 708), 205704#(<= proc_i 704), 205711#(<= proc_i 732), 205710#(<= proc_i 728), 205709#(<= proc_i 724), 205708#(<= proc_i 720), 205715#(<= proc_i 748), 205714#(<= proc_i 744), 205713#(<= proc_i 740), 205712#(<= proc_i 736), 205719#(<= proc_i 764), 205718#(<= proc_i 760), 205717#(<= proc_i 756), 205716#(<= proc_i 752), 205723#(<= proc_i 780), 205722#(<= proc_i 776), 205721#(<= proc_i 772), 205720#(<= proc_i 768), 205727#(<= proc_i 796), 205726#(<= proc_i 792), 205725#(<= proc_i 788), 205724#(<= proc_i 784), 205731#(<= proc_i 812), 205730#(<= proc_i 808), 205729#(<= proc_i 804), 205728#(<= proc_i 800), 205735#(<= proc_i 828), 205734#(<= proc_i 824), 205733#(<= proc_i 820), 205732#(<= proc_i 816), 205739#(<= proc_i 844), 205738#(<= proc_i 840), 205737#(<= proc_i 836), 205736#(<= proc_i 832)] [2018-07-23 13:55:21,729 INFO L134 CoverageAnalysis]: Checked inductivity of 44732 backedges. 0 proven. 44732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:21,729 INFO L450 AbstractCegarLoop]: Interpolant automaton has 214 states [2018-07-23 13:55:21,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 214 interpolants. [2018-07-23 13:55:21,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-07-23 13:55:21,732 INFO L87 Difference]: Start difference. First operand 426 states and 426 transitions. Second operand 214 states. [2018-07-23 13:55:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:55:24,097 INFO L93 Difference]: Finished difference Result 429 states and 429 transitions. [2018-07-23 13:55:24,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-07-23 13:55:24,097 INFO L78 Accepts]: Start accepts. Automaton has 214 states. Word has length 425 [2018-07-23 13:55:24,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:55:24,098 INFO L225 Difference]: With dead ends: 429 [2018-07-23 13:55:24,098 INFO L226 Difference]: Without dead ends: 428 [2018-07-23 13:55:24,099 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-07-23 13:55:24,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-07-23 13:55:24,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2018-07-23 13:55:24,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-07-23 13:55:24,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 428 transitions. [2018-07-23 13:55:24,104 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 428 transitions. Word has length 425 [2018-07-23 13:55:24,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:55:24,104 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 428 transitions. [2018-07-23 13:55:24,104 INFO L472 AbstractCegarLoop]: Interpolant automaton has 214 states. [2018-07-23 13:55:24,104 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 428 transitions. [2018-07-23 13:55:24,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-07-23 13:55:24,105 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:55:24,106 INFO L357 BasicCegarLoop]: trace histogram [213, 212, 1, 1] [2018-07-23 13:55:24,106 INFO L414 AbstractCegarLoop]: === Iteration 213 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:55:24,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1734116216, now seen corresponding path program 212 times [2018-07-23 13:55:24,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:55:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:55:25,906 INFO L134 CoverageAnalysis]: Checked inductivity of 45156 backedges. 0 proven. 45156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:25,907 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:55:25,907 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [213] total 213 [2018-07-23 13:55:25,907 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:55:25,907 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:55:25,908 INFO L185 omatonBuilderFactory]: Interpolants [207455#false, 207454#true, 207459#(<= proc_i 12), 207458#(<= proc_i 8), 207457#(<= proc_i 4), 207456#(<= proc_i 0), 207463#(<= proc_i 28), 207462#(<= proc_i 24), 207461#(<= proc_i 20), 207460#(<= proc_i 16), 207467#(<= proc_i 44), 207466#(<= proc_i 40), 207465#(<= proc_i 36), 207464#(<= proc_i 32), 207471#(<= proc_i 60), 207470#(<= proc_i 56), 207469#(<= proc_i 52), 207468#(<= proc_i 48), 207475#(<= proc_i 76), 207474#(<= proc_i 72), 207473#(<= proc_i 68), 207472#(<= proc_i 64), 207479#(<= proc_i 92), 207478#(<= proc_i 88), 207477#(<= proc_i 84), 207476#(<= proc_i 80), 207483#(<= proc_i 108), 207482#(<= proc_i 104), 207481#(<= proc_i 100), 207480#(<= proc_i 96), 207487#(<= proc_i 124), 207486#(<= proc_i 120), 207485#(<= proc_i 116), 207484#(<= proc_i 112), 207491#(<= proc_i 140), 207490#(<= proc_i 136), 207489#(<= proc_i 132), 207488#(<= proc_i 128), 207495#(<= proc_i 156), 207494#(<= proc_i 152), 207493#(<= proc_i 148), 207492#(<= proc_i 144), 207499#(<= proc_i 172), 207498#(<= proc_i 168), 207497#(<= proc_i 164), 207496#(<= proc_i 160), 207503#(<= proc_i 188), 207502#(<= proc_i 184), 207501#(<= proc_i 180), 207500#(<= proc_i 176), 207507#(<= proc_i 204), 207506#(<= proc_i 200), 207505#(<= proc_i 196), 207504#(<= proc_i 192), 207511#(<= proc_i 220), 207510#(<= proc_i 216), 207509#(<= proc_i 212), 207508#(<= proc_i 208), 207515#(<= proc_i 236), 207514#(<= proc_i 232), 207513#(<= proc_i 228), 207512#(<= proc_i 224), 207519#(<= proc_i 252), 207518#(<= proc_i 248), 207517#(<= proc_i 244), 207516#(<= proc_i 240), 207523#(<= proc_i 268), 207522#(<= proc_i 264), 207521#(<= proc_i 260), 207520#(<= proc_i 256), 207527#(<= proc_i 284), 207526#(<= proc_i 280), 207525#(<= proc_i 276), 207524#(<= proc_i 272), 207531#(<= proc_i 300), 207530#(<= proc_i 296), 207529#(<= proc_i 292), 207528#(<= proc_i 288), 207535#(<= proc_i 316), 207534#(<= proc_i 312), 207533#(<= proc_i 308), 207532#(<= proc_i 304), 207539#(<= proc_i 332), 207538#(<= proc_i 328), 207537#(<= proc_i 324), 207536#(<= proc_i 320), 207543#(<= proc_i 348), 207542#(<= proc_i 344), 207541#(<= proc_i 340), 207540#(<= proc_i 336), 207547#(<= proc_i 364), 207546#(<= proc_i 360), 207545#(<= proc_i 356), 207544#(<= proc_i 352), 207551#(<= proc_i 380), 207550#(<= proc_i 376), 207549#(<= proc_i 372), 207548#(<= proc_i 368), 207555#(<= proc_i 396), 207554#(<= proc_i 392), 207553#(<= proc_i 388), 207552#(<= proc_i 384), 207559#(<= proc_i 412), 207558#(<= proc_i 408), 207557#(<= proc_i 404), 207556#(<= proc_i 400), 207563#(<= proc_i 428), 207562#(<= proc_i 424), 207561#(<= proc_i 420), 207560#(<= proc_i 416), 207567#(<= proc_i 444), 207566#(<= proc_i 440), 207565#(<= proc_i 436), 207564#(<= proc_i 432), 207571#(<= proc_i 460), 207570#(<= proc_i 456), 207569#(<= proc_i 452), 207568#(<= proc_i 448), 207575#(<= proc_i 476), 207574#(<= proc_i 472), 207573#(<= proc_i 468), 207572#(<= proc_i 464), 207579#(<= proc_i 492), 207578#(<= proc_i 488), 207577#(<= proc_i 484), 207576#(<= proc_i 480), 207583#(<= proc_i 508), 207582#(<= proc_i 504), 207581#(<= proc_i 500), 207580#(<= proc_i 496), 207587#(<= proc_i 524), 207586#(<= proc_i 520), 207585#(<= proc_i 516), 207584#(<= proc_i 512), 207591#(<= proc_i 540), 207590#(<= proc_i 536), 207589#(<= proc_i 532), 207588#(<= proc_i 528), 207595#(<= proc_i 556), 207594#(<= proc_i 552), 207593#(<= proc_i 548), 207592#(<= proc_i 544), 207599#(<= proc_i 572), 207598#(<= proc_i 568), 207597#(<= proc_i 564), 207596#(<= proc_i 560), 207603#(<= proc_i 588), 207602#(<= proc_i 584), 207601#(<= proc_i 580), 207600#(<= proc_i 576), 207607#(<= proc_i 604), 207606#(<= proc_i 600), 207605#(<= proc_i 596), 207604#(<= proc_i 592), 207611#(<= proc_i 620), 207610#(<= proc_i 616), 207609#(<= proc_i 612), 207608#(<= proc_i 608), 207615#(<= proc_i 636), 207614#(<= proc_i 632), 207613#(<= proc_i 628), 207612#(<= proc_i 624), 207619#(<= proc_i 652), 207618#(<= proc_i 648), 207617#(<= proc_i 644), 207616#(<= proc_i 640), 207623#(<= proc_i 668), 207622#(<= proc_i 664), 207621#(<= proc_i 660), 207620#(<= proc_i 656), 207627#(<= proc_i 684), 207626#(<= proc_i 680), 207625#(<= proc_i 676), 207624#(<= proc_i 672), 207631#(<= proc_i 700), 207630#(<= proc_i 696), 207629#(<= proc_i 692), 207628#(<= proc_i 688), 207635#(<= proc_i 716), 207634#(<= proc_i 712), 207633#(<= proc_i 708), 207632#(<= proc_i 704), 207639#(<= proc_i 732), 207638#(<= proc_i 728), 207637#(<= proc_i 724), 207636#(<= proc_i 720), 207643#(<= proc_i 748), 207642#(<= proc_i 744), 207641#(<= proc_i 740), 207640#(<= proc_i 736), 207647#(<= proc_i 764), 207646#(<= proc_i 760), 207645#(<= proc_i 756), 207644#(<= proc_i 752), 207651#(<= proc_i 780), 207650#(<= proc_i 776), 207649#(<= proc_i 772), 207648#(<= proc_i 768), 207655#(<= proc_i 796), 207654#(<= proc_i 792), 207653#(<= proc_i 788), 207652#(<= proc_i 784), 207659#(<= proc_i 812), 207658#(<= proc_i 808), 207657#(<= proc_i 804), 207656#(<= proc_i 800), 207663#(<= proc_i 828), 207662#(<= proc_i 824), 207661#(<= proc_i 820), 207660#(<= proc_i 816), 207667#(<= proc_i 844), 207666#(<= proc_i 840), 207665#(<= proc_i 836), 207664#(<= proc_i 832), 207668#(<= proc_i 848)] [2018-07-23 13:55:25,910 INFO L134 CoverageAnalysis]: Checked inductivity of 45156 backedges. 0 proven. 45156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:25,911 INFO L450 AbstractCegarLoop]: Interpolant automaton has 215 states [2018-07-23 13:55:25,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 215 interpolants. [2018-07-23 13:55:25,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-07-23 13:55:25,917 INFO L87 Difference]: Start difference. First operand 428 states and 428 transitions. Second operand 215 states. [2018-07-23 13:55:28,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:55:28,086 INFO L93 Difference]: Finished difference Result 431 states and 431 transitions. [2018-07-23 13:55:28,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-07-23 13:55:28,086 INFO L78 Accepts]: Start accepts. Automaton has 215 states. Word has length 427 [2018-07-23 13:55:28,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:55:28,087 INFO L225 Difference]: With dead ends: 431 [2018-07-23 13:55:28,087 INFO L226 Difference]: Without dead ends: 430 [2018-07-23 13:55:28,089 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-07-23 13:55:28,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-07-23 13:55:28,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2018-07-23 13:55:28,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-07-23 13:55:28,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 430 transitions. [2018-07-23 13:55:28,094 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 430 transitions. Word has length 427 [2018-07-23 13:55:28,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:55:28,094 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 430 transitions. [2018-07-23 13:55:28,094 INFO L472 AbstractCegarLoop]: Interpolant automaton has 215 states. [2018-07-23 13:55:28,094 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 430 transitions. [2018-07-23 13:55:28,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-07-23 13:55:28,096 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:55:28,096 INFO L357 BasicCegarLoop]: trace histogram [214, 213, 1, 1] [2018-07-23 13:55:28,096 INFO L414 AbstractCegarLoop]: === Iteration 214 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:55:28,096 INFO L82 PathProgramCache]: Analyzing trace with hash -38371638, now seen corresponding path program 213 times [2018-07-23 13:55:28,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:55:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:55:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 45582 backedges. 0 proven. 45582 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:29,986 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:55:29,986 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [214] total 214 [2018-07-23 13:55:29,986 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:55:29,986 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:55:29,987 INFO L185 omatonBuilderFactory]: Interpolants [209411#(<= proc_i 72), 209410#(<= proc_i 68), 209409#(<= proc_i 64), 209408#(<= proc_i 60), 209415#(<= proc_i 88), 209414#(<= proc_i 84), 209413#(<= proc_i 80), 209412#(<= proc_i 76), 209419#(<= proc_i 104), 209418#(<= proc_i 100), 209417#(<= proc_i 96), 209416#(<= proc_i 92), 209423#(<= proc_i 120), 209422#(<= proc_i 116), 209421#(<= proc_i 112), 209420#(<= proc_i 108), 209427#(<= proc_i 136), 209426#(<= proc_i 132), 209425#(<= proc_i 128), 209424#(<= proc_i 124), 209431#(<= proc_i 152), 209430#(<= proc_i 148), 209429#(<= proc_i 144), 209428#(<= proc_i 140), 209435#(<= proc_i 168), 209434#(<= proc_i 164), 209433#(<= proc_i 160), 209432#(<= proc_i 156), 209439#(<= proc_i 184), 209438#(<= proc_i 180), 209437#(<= proc_i 176), 209436#(<= proc_i 172), 209443#(<= proc_i 200), 209442#(<= proc_i 196), 209441#(<= proc_i 192), 209440#(<= proc_i 188), 209447#(<= proc_i 216), 209446#(<= proc_i 212), 209445#(<= proc_i 208), 209444#(<= proc_i 204), 209451#(<= proc_i 232), 209450#(<= proc_i 228), 209449#(<= proc_i 224), 209448#(<= proc_i 220), 209455#(<= proc_i 248), 209454#(<= proc_i 244), 209453#(<= proc_i 240), 209452#(<= proc_i 236), 209459#(<= proc_i 264), 209458#(<= proc_i 260), 209457#(<= proc_i 256), 209456#(<= proc_i 252), 209463#(<= proc_i 280), 209462#(<= proc_i 276), 209461#(<= proc_i 272), 209460#(<= proc_i 268), 209467#(<= proc_i 296), 209466#(<= proc_i 292), 209465#(<= proc_i 288), 209464#(<= proc_i 284), 209471#(<= proc_i 312), 209470#(<= proc_i 308), 209469#(<= proc_i 304), 209468#(<= proc_i 300), 209475#(<= proc_i 328), 209474#(<= proc_i 324), 209473#(<= proc_i 320), 209472#(<= proc_i 316), 209479#(<= proc_i 344), 209478#(<= proc_i 340), 209477#(<= proc_i 336), 209476#(<= proc_i 332), 209483#(<= proc_i 360), 209482#(<= proc_i 356), 209481#(<= proc_i 352), 209480#(<= proc_i 348), 209487#(<= proc_i 376), 209486#(<= proc_i 372), 209485#(<= proc_i 368), 209484#(<= proc_i 364), 209491#(<= proc_i 392), 209490#(<= proc_i 388), 209489#(<= proc_i 384), 209488#(<= proc_i 380), 209495#(<= proc_i 408), 209494#(<= proc_i 404), 209493#(<= proc_i 400), 209492#(<= proc_i 396), 209499#(<= proc_i 424), 209498#(<= proc_i 420), 209497#(<= proc_i 416), 209496#(<= proc_i 412), 209503#(<= proc_i 440), 209502#(<= proc_i 436), 209501#(<= proc_i 432), 209500#(<= proc_i 428), 209507#(<= proc_i 456), 209506#(<= proc_i 452), 209505#(<= proc_i 448), 209504#(<= proc_i 444), 209511#(<= proc_i 472), 209510#(<= proc_i 468), 209509#(<= proc_i 464), 209508#(<= proc_i 460), 209515#(<= proc_i 488), 209514#(<= proc_i 484), 209513#(<= proc_i 480), 209512#(<= proc_i 476), 209519#(<= proc_i 504), 209518#(<= proc_i 500), 209517#(<= proc_i 496), 209516#(<= proc_i 492), 209523#(<= proc_i 520), 209522#(<= proc_i 516), 209521#(<= proc_i 512), 209520#(<= proc_i 508), 209527#(<= proc_i 536), 209526#(<= proc_i 532), 209525#(<= proc_i 528), 209524#(<= proc_i 524), 209531#(<= proc_i 552), 209530#(<= proc_i 548), 209529#(<= proc_i 544), 209528#(<= proc_i 540), 209535#(<= proc_i 568), 209534#(<= proc_i 564), 209533#(<= proc_i 560), 209532#(<= proc_i 556), 209539#(<= proc_i 584), 209538#(<= proc_i 580), 209537#(<= proc_i 576), 209536#(<= proc_i 572), 209543#(<= proc_i 600), 209542#(<= proc_i 596), 209541#(<= proc_i 592), 209540#(<= proc_i 588), 209547#(<= proc_i 616), 209546#(<= proc_i 612), 209545#(<= proc_i 608), 209544#(<= proc_i 604), 209551#(<= proc_i 632), 209550#(<= proc_i 628), 209549#(<= proc_i 624), 209548#(<= proc_i 620), 209555#(<= proc_i 648), 209554#(<= proc_i 644), 209553#(<= proc_i 640), 209552#(<= proc_i 636), 209559#(<= proc_i 664), 209558#(<= proc_i 660), 209557#(<= proc_i 656), 209556#(<= proc_i 652), 209563#(<= proc_i 680), 209562#(<= proc_i 676), 209561#(<= proc_i 672), 209560#(<= proc_i 668), 209567#(<= proc_i 696), 209566#(<= proc_i 692), 209565#(<= proc_i 688), 209564#(<= proc_i 684), 209571#(<= proc_i 712), 209570#(<= proc_i 708), 209569#(<= proc_i 704), 209568#(<= proc_i 700), 209575#(<= proc_i 728), 209574#(<= proc_i 724), 209573#(<= proc_i 720), 209572#(<= proc_i 716), 209579#(<= proc_i 744), 209578#(<= proc_i 740), 209577#(<= proc_i 736), 209576#(<= proc_i 732), 209583#(<= proc_i 760), 209582#(<= proc_i 756), 209581#(<= proc_i 752), 209580#(<= proc_i 748), 209587#(<= proc_i 776), 209586#(<= proc_i 772), 209585#(<= proc_i 768), 209584#(<= proc_i 764), 209591#(<= proc_i 792), 209590#(<= proc_i 788), 209589#(<= proc_i 784), 209588#(<= proc_i 780), 209595#(<= proc_i 808), 209594#(<= proc_i 804), 209593#(<= proc_i 800), 209592#(<= proc_i 796), 209599#(<= proc_i 824), 209598#(<= proc_i 820), 209597#(<= proc_i 816), 209596#(<= proc_i 812), 209603#(<= proc_i 840), 209602#(<= proc_i 836), 209601#(<= proc_i 832), 209600#(<= proc_i 828), 209606#(<= proc_i 852), 209605#(<= proc_i 848), 209604#(<= proc_i 844), 209391#true, 209395#(<= proc_i 8), 209394#(<= proc_i 4), 209393#(<= proc_i 0), 209392#false, 209399#(<= proc_i 24), 209398#(<= proc_i 20), 209397#(<= proc_i 16), 209396#(<= proc_i 12), 209403#(<= proc_i 40), 209402#(<= proc_i 36), 209401#(<= proc_i 32), 209400#(<= proc_i 28), 209407#(<= proc_i 56), 209406#(<= proc_i 52), 209405#(<= proc_i 48), 209404#(<= proc_i 44)] [2018-07-23 13:55:29,989 INFO L134 CoverageAnalysis]: Checked inductivity of 45582 backedges. 0 proven. 45582 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:29,990 INFO L450 AbstractCegarLoop]: Interpolant automaton has 216 states [2018-07-23 13:55:29,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2018-07-23 13:55:29,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-07-23 13:55:29,996 INFO L87 Difference]: Start difference. First operand 430 states and 430 transitions. Second operand 216 states. [2018-07-23 13:55:33,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:55:33,236 INFO L93 Difference]: Finished difference Result 433 states and 433 transitions. [2018-07-23 13:55:33,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-07-23 13:55:33,237 INFO L78 Accepts]: Start accepts. Automaton has 216 states. Word has length 429 [2018-07-23 13:55:33,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:55:33,238 INFO L225 Difference]: With dead ends: 433 [2018-07-23 13:55:33,238 INFO L226 Difference]: Without dead ends: 432 [2018-07-23 13:55:33,241 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-07-23 13:55:33,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-07-23 13:55:33,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2018-07-23 13:55:33,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-07-23 13:55:33,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 432 transitions. [2018-07-23 13:55:33,245 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 432 transitions. Word has length 429 [2018-07-23 13:55:33,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:55:33,246 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 432 transitions. [2018-07-23 13:55:33,246 INFO L472 AbstractCegarLoop]: Interpolant automaton has 216 states. [2018-07-23 13:55:33,246 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 432 transitions. [2018-07-23 13:55:33,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2018-07-23 13:55:33,247 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:55:33,247 INFO L357 BasicCegarLoop]: trace histogram [215, 214, 1, 1] [2018-07-23 13:55:33,247 INFO L414 AbstractCegarLoop]: === Iteration 215 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:55:33,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1779562636, now seen corresponding path program 214 times [2018-07-23 13:55:33,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:55:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:55:35,204 INFO L134 CoverageAnalysis]: Checked inductivity of 46010 backedges. 0 proven. 46010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:35,204 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:55:35,204 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [215] total 215 [2018-07-23 13:55:35,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:55:35,205 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:55:35,205 INFO L185 omatonBuilderFactory]: Interpolants [211459#(<= proc_i 480), 211458#(<= proc_i 476), 211457#(<= proc_i 472), 211456#(<= proc_i 468), 211463#(<= proc_i 496), 211462#(<= proc_i 492), 211461#(<= proc_i 488), 211460#(<= proc_i 484), 211467#(<= proc_i 512), 211466#(<= proc_i 508), 211465#(<= proc_i 504), 211464#(<= proc_i 500), 211471#(<= proc_i 528), 211470#(<= proc_i 524), 211469#(<= proc_i 520), 211468#(<= proc_i 516), 211475#(<= proc_i 544), 211474#(<= proc_i 540), 211473#(<= proc_i 536), 211472#(<= proc_i 532), 211479#(<= proc_i 560), 211478#(<= proc_i 556), 211477#(<= proc_i 552), 211476#(<= proc_i 548), 211483#(<= proc_i 576), 211482#(<= proc_i 572), 211481#(<= proc_i 568), 211480#(<= proc_i 564), 211487#(<= proc_i 592), 211486#(<= proc_i 588), 211485#(<= proc_i 584), 211484#(<= proc_i 580), 211491#(<= proc_i 608), 211490#(<= proc_i 604), 211489#(<= proc_i 600), 211488#(<= proc_i 596), 211495#(<= proc_i 624), 211494#(<= proc_i 620), 211493#(<= proc_i 616), 211492#(<= proc_i 612), 211499#(<= proc_i 640), 211498#(<= proc_i 636), 211497#(<= proc_i 632), 211496#(<= proc_i 628), 211503#(<= proc_i 656), 211502#(<= proc_i 652), 211501#(<= proc_i 648), 211500#(<= proc_i 644), 211507#(<= proc_i 672), 211506#(<= proc_i 668), 211505#(<= proc_i 664), 211504#(<= proc_i 660), 211511#(<= proc_i 688), 211510#(<= proc_i 684), 211509#(<= proc_i 680), 211508#(<= proc_i 676), 211515#(<= proc_i 704), 211514#(<= proc_i 700), 211513#(<= proc_i 696), 211512#(<= proc_i 692), 211519#(<= proc_i 720), 211518#(<= proc_i 716), 211517#(<= proc_i 712), 211516#(<= proc_i 708), 211523#(<= proc_i 736), 211522#(<= proc_i 732), 211521#(<= proc_i 728), 211520#(<= proc_i 724), 211527#(<= proc_i 752), 211526#(<= proc_i 748), 211525#(<= proc_i 744), 211524#(<= proc_i 740), 211531#(<= proc_i 768), 211530#(<= proc_i 764), 211529#(<= proc_i 760), 211528#(<= proc_i 756), 211535#(<= proc_i 784), 211534#(<= proc_i 780), 211533#(<= proc_i 776), 211532#(<= proc_i 772), 211539#(<= proc_i 800), 211538#(<= proc_i 796), 211537#(<= proc_i 792), 211536#(<= proc_i 788), 211543#(<= proc_i 816), 211542#(<= proc_i 812), 211541#(<= proc_i 808), 211540#(<= proc_i 804), 211547#(<= proc_i 832), 211546#(<= proc_i 828), 211545#(<= proc_i 824), 211544#(<= proc_i 820), 211551#(<= proc_i 848), 211550#(<= proc_i 844), 211549#(<= proc_i 840), 211548#(<= proc_i 836), 211553#(<= proc_i 856), 211552#(<= proc_i 852), 211339#(<= proc_i 0), 211338#false, 211337#true, 211343#(<= proc_i 16), 211342#(<= proc_i 12), 211341#(<= proc_i 8), 211340#(<= proc_i 4), 211347#(<= proc_i 32), 211346#(<= proc_i 28), 211345#(<= proc_i 24), 211344#(<= proc_i 20), 211351#(<= proc_i 48), 211350#(<= proc_i 44), 211349#(<= proc_i 40), 211348#(<= proc_i 36), 211355#(<= proc_i 64), 211354#(<= proc_i 60), 211353#(<= proc_i 56), 211352#(<= proc_i 52), 211359#(<= proc_i 80), 211358#(<= proc_i 76), 211357#(<= proc_i 72), 211356#(<= proc_i 68), 211363#(<= proc_i 96), 211362#(<= proc_i 92), 211361#(<= proc_i 88), 211360#(<= proc_i 84), 211367#(<= proc_i 112), 211366#(<= proc_i 108), 211365#(<= proc_i 104), 211364#(<= proc_i 100), 211371#(<= proc_i 128), 211370#(<= proc_i 124), 211369#(<= proc_i 120), 211368#(<= proc_i 116), 211375#(<= proc_i 144), 211374#(<= proc_i 140), 211373#(<= proc_i 136), 211372#(<= proc_i 132), 211379#(<= proc_i 160), 211378#(<= proc_i 156), 211377#(<= proc_i 152), 211376#(<= proc_i 148), 211383#(<= proc_i 176), 211382#(<= proc_i 172), 211381#(<= proc_i 168), 211380#(<= proc_i 164), 211387#(<= proc_i 192), 211386#(<= proc_i 188), 211385#(<= proc_i 184), 211384#(<= proc_i 180), 211391#(<= proc_i 208), 211390#(<= proc_i 204), 211389#(<= proc_i 200), 211388#(<= proc_i 196), 211395#(<= proc_i 224), 211394#(<= proc_i 220), 211393#(<= proc_i 216), 211392#(<= proc_i 212), 211399#(<= proc_i 240), 211398#(<= proc_i 236), 211397#(<= proc_i 232), 211396#(<= proc_i 228), 211403#(<= proc_i 256), 211402#(<= proc_i 252), 211401#(<= proc_i 248), 211400#(<= proc_i 244), 211407#(<= proc_i 272), 211406#(<= proc_i 268), 211405#(<= proc_i 264), 211404#(<= proc_i 260), 211411#(<= proc_i 288), 211410#(<= proc_i 284), 211409#(<= proc_i 280), 211408#(<= proc_i 276), 211415#(<= proc_i 304), 211414#(<= proc_i 300), 211413#(<= proc_i 296), 211412#(<= proc_i 292), 211419#(<= proc_i 320), 211418#(<= proc_i 316), 211417#(<= proc_i 312), 211416#(<= proc_i 308), 211423#(<= proc_i 336), 211422#(<= proc_i 332), 211421#(<= proc_i 328), 211420#(<= proc_i 324), 211427#(<= proc_i 352), 211426#(<= proc_i 348), 211425#(<= proc_i 344), 211424#(<= proc_i 340), 211431#(<= proc_i 368), 211430#(<= proc_i 364), 211429#(<= proc_i 360), 211428#(<= proc_i 356), 211435#(<= proc_i 384), 211434#(<= proc_i 380), 211433#(<= proc_i 376), 211432#(<= proc_i 372), 211439#(<= proc_i 400), 211438#(<= proc_i 396), 211437#(<= proc_i 392), 211436#(<= proc_i 388), 211443#(<= proc_i 416), 211442#(<= proc_i 412), 211441#(<= proc_i 408), 211440#(<= proc_i 404), 211447#(<= proc_i 432), 211446#(<= proc_i 428), 211445#(<= proc_i 424), 211444#(<= proc_i 420), 211451#(<= proc_i 448), 211450#(<= proc_i 444), 211449#(<= proc_i 440), 211448#(<= proc_i 436), 211455#(<= proc_i 464), 211454#(<= proc_i 460), 211453#(<= proc_i 456), 211452#(<= proc_i 452)] [2018-07-23 13:55:35,207 INFO L134 CoverageAnalysis]: Checked inductivity of 46010 backedges. 0 proven. 46010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:35,207 INFO L450 AbstractCegarLoop]: Interpolant automaton has 217 states [2018-07-23 13:55:35,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 217 interpolants. [2018-07-23 13:55:35,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23436, Invalid=23436, Unknown=0, NotChecked=0, Total=46872 [2018-07-23 13:55:35,210 INFO L87 Difference]: Start difference. First operand 432 states and 432 transitions. Second operand 217 states. [2018-07-23 13:55:35,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:55:35,989 INFO L93 Difference]: Finished difference Result 435 states and 435 transitions. [2018-07-23 13:55:35,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2018-07-23 13:55:35,989 INFO L78 Accepts]: Start accepts. Automaton has 217 states. Word has length 431 [2018-07-23 13:55:35,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:55:35,990 INFO L225 Difference]: With dead ends: 435 [2018-07-23 13:55:35,990 INFO L226 Difference]: Without dead ends: 434 [2018-07-23 13:55:35,991 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=23436, Invalid=23436, Unknown=0, NotChecked=0, Total=46872 [2018-07-23 13:55:35,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-07-23 13:55:35,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-07-23 13:55:35,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-07-23 13:55:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 434 transitions. [2018-07-23 13:55:35,995 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 434 transitions. Word has length 431 [2018-07-23 13:55:35,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:55:35,995 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 434 transitions. [2018-07-23 13:55:35,995 INFO L472 AbstractCegarLoop]: Interpolant automaton has 217 states. [2018-07-23 13:55:35,995 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 434 transitions. [2018-07-23 13:55:35,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-07-23 13:55:35,996 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:55:35,996 INFO L357 BasicCegarLoop]: trace histogram [216, 215, 1, 1] [2018-07-23 13:55:35,996 INFO L414 AbstractCegarLoop]: === Iteration 216 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:55:35,997 INFO L82 PathProgramCache]: Analyzing trace with hash 762710478, now seen corresponding path program 215 times [2018-07-23 13:55:35,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:55:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:55:37,670 INFO L134 CoverageAnalysis]: Checked inductivity of 46440 backedges. 0 proven. 46440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:37,670 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:55:37,670 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [216] total 216 [2018-07-23 13:55:37,671 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:55:37,671 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:55:37,671 INFO L185 omatonBuilderFactory]: Interpolants [213507#(<= proc_i 852), 213506#(<= proc_i 848), 213505#(<= proc_i 844), 213504#(<= proc_i 840), 213509#(<= proc_i 860), 213508#(<= proc_i 856), 213295#(<= proc_i 4), 213294#(<= proc_i 0), 213293#false, 213292#true, 213299#(<= proc_i 20), 213298#(<= proc_i 16), 213297#(<= proc_i 12), 213296#(<= proc_i 8), 213303#(<= proc_i 36), 213302#(<= proc_i 32), 213301#(<= proc_i 28), 213300#(<= proc_i 24), 213307#(<= proc_i 52), 213306#(<= proc_i 48), 213305#(<= proc_i 44), 213304#(<= proc_i 40), 213311#(<= proc_i 68), 213310#(<= proc_i 64), 213309#(<= proc_i 60), 213308#(<= proc_i 56), 213315#(<= proc_i 84), 213314#(<= proc_i 80), 213313#(<= proc_i 76), 213312#(<= proc_i 72), 213319#(<= proc_i 100), 213318#(<= proc_i 96), 213317#(<= proc_i 92), 213316#(<= proc_i 88), 213323#(<= proc_i 116), 213322#(<= proc_i 112), 213321#(<= proc_i 108), 213320#(<= proc_i 104), 213327#(<= proc_i 132), 213326#(<= proc_i 128), 213325#(<= proc_i 124), 213324#(<= proc_i 120), 213331#(<= proc_i 148), 213330#(<= proc_i 144), 213329#(<= proc_i 140), 213328#(<= proc_i 136), 213335#(<= proc_i 164), 213334#(<= proc_i 160), 213333#(<= proc_i 156), 213332#(<= proc_i 152), 213339#(<= proc_i 180), 213338#(<= proc_i 176), 213337#(<= proc_i 172), 213336#(<= proc_i 168), 213343#(<= proc_i 196), 213342#(<= proc_i 192), 213341#(<= proc_i 188), 213340#(<= proc_i 184), 213347#(<= proc_i 212), 213346#(<= proc_i 208), 213345#(<= proc_i 204), 213344#(<= proc_i 200), 213351#(<= proc_i 228), 213350#(<= proc_i 224), 213349#(<= proc_i 220), 213348#(<= proc_i 216), 213355#(<= proc_i 244), 213354#(<= proc_i 240), 213353#(<= proc_i 236), 213352#(<= proc_i 232), 213359#(<= proc_i 260), 213358#(<= proc_i 256), 213357#(<= proc_i 252), 213356#(<= proc_i 248), 213363#(<= proc_i 276), 213362#(<= proc_i 272), 213361#(<= proc_i 268), 213360#(<= proc_i 264), 213367#(<= proc_i 292), 213366#(<= proc_i 288), 213365#(<= proc_i 284), 213364#(<= proc_i 280), 213371#(<= proc_i 308), 213370#(<= proc_i 304), 213369#(<= proc_i 300), 213368#(<= proc_i 296), 213375#(<= proc_i 324), 213374#(<= proc_i 320), 213373#(<= proc_i 316), 213372#(<= proc_i 312), 213379#(<= proc_i 340), 213378#(<= proc_i 336), 213377#(<= proc_i 332), 213376#(<= proc_i 328), 213383#(<= proc_i 356), 213382#(<= proc_i 352), 213381#(<= proc_i 348), 213380#(<= proc_i 344), 213387#(<= proc_i 372), 213386#(<= proc_i 368), 213385#(<= proc_i 364), 213384#(<= proc_i 360), 213391#(<= proc_i 388), 213390#(<= proc_i 384), 213389#(<= proc_i 380), 213388#(<= proc_i 376), 213395#(<= proc_i 404), 213394#(<= proc_i 400), 213393#(<= proc_i 396), 213392#(<= proc_i 392), 213399#(<= proc_i 420), 213398#(<= proc_i 416), 213397#(<= proc_i 412), 213396#(<= proc_i 408), 213403#(<= proc_i 436), 213402#(<= proc_i 432), 213401#(<= proc_i 428), 213400#(<= proc_i 424), 213407#(<= proc_i 452), 213406#(<= proc_i 448), 213405#(<= proc_i 444), 213404#(<= proc_i 440), 213411#(<= proc_i 468), 213410#(<= proc_i 464), 213409#(<= proc_i 460), 213408#(<= proc_i 456), 213415#(<= proc_i 484), 213414#(<= proc_i 480), 213413#(<= proc_i 476), 213412#(<= proc_i 472), 213419#(<= proc_i 500), 213418#(<= proc_i 496), 213417#(<= proc_i 492), 213416#(<= proc_i 488), 213423#(<= proc_i 516), 213422#(<= proc_i 512), 213421#(<= proc_i 508), 213420#(<= proc_i 504), 213427#(<= proc_i 532), 213426#(<= proc_i 528), 213425#(<= proc_i 524), 213424#(<= proc_i 520), 213431#(<= proc_i 548), 213430#(<= proc_i 544), 213429#(<= proc_i 540), 213428#(<= proc_i 536), 213435#(<= proc_i 564), 213434#(<= proc_i 560), 213433#(<= proc_i 556), 213432#(<= proc_i 552), 213439#(<= proc_i 580), 213438#(<= proc_i 576), 213437#(<= proc_i 572), 213436#(<= proc_i 568), 213443#(<= proc_i 596), 213442#(<= proc_i 592), 213441#(<= proc_i 588), 213440#(<= proc_i 584), 213447#(<= proc_i 612), 213446#(<= proc_i 608), 213445#(<= proc_i 604), 213444#(<= proc_i 600), 213451#(<= proc_i 628), 213450#(<= proc_i 624), 213449#(<= proc_i 620), 213448#(<= proc_i 616), 213455#(<= proc_i 644), 213454#(<= proc_i 640), 213453#(<= proc_i 636), 213452#(<= proc_i 632), 213459#(<= proc_i 660), 213458#(<= proc_i 656), 213457#(<= proc_i 652), 213456#(<= proc_i 648), 213463#(<= proc_i 676), 213462#(<= proc_i 672), 213461#(<= proc_i 668), 213460#(<= proc_i 664), 213467#(<= proc_i 692), 213466#(<= proc_i 688), 213465#(<= proc_i 684), 213464#(<= proc_i 680), 213471#(<= proc_i 708), 213470#(<= proc_i 704), 213469#(<= proc_i 700), 213468#(<= proc_i 696), 213475#(<= proc_i 724), 213474#(<= proc_i 720), 213473#(<= proc_i 716), 213472#(<= proc_i 712), 213479#(<= proc_i 740), 213478#(<= proc_i 736), 213477#(<= proc_i 732), 213476#(<= proc_i 728), 213483#(<= proc_i 756), 213482#(<= proc_i 752), 213481#(<= proc_i 748), 213480#(<= proc_i 744), 213487#(<= proc_i 772), 213486#(<= proc_i 768), 213485#(<= proc_i 764), 213484#(<= proc_i 760), 213491#(<= proc_i 788), 213490#(<= proc_i 784), 213489#(<= proc_i 780), 213488#(<= proc_i 776), 213495#(<= proc_i 804), 213494#(<= proc_i 800), 213493#(<= proc_i 796), 213492#(<= proc_i 792), 213499#(<= proc_i 820), 213498#(<= proc_i 816), 213497#(<= proc_i 812), 213496#(<= proc_i 808), 213503#(<= proc_i 836), 213502#(<= proc_i 832), 213501#(<= proc_i 828), 213500#(<= proc_i 824)] [2018-07-23 13:55:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 46440 backedges. 0 proven. 46440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:37,674 INFO L450 AbstractCegarLoop]: Interpolant automaton has 218 states [2018-07-23 13:55:37,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 218 interpolants. [2018-07-23 13:55:37,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-07-23 13:55:37,679 INFO L87 Difference]: Start difference. First operand 434 states and 434 transitions. Second operand 218 states. [2018-07-23 13:55:40,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:55:40,158 INFO L93 Difference]: Finished difference Result 437 states and 437 transitions. [2018-07-23 13:55:40,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2018-07-23 13:55:40,158 INFO L78 Accepts]: Start accepts. Automaton has 218 states. Word has length 433 [2018-07-23 13:55:40,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:55:40,159 INFO L225 Difference]: With dead ends: 437 [2018-07-23 13:55:40,159 INFO L226 Difference]: Without dead ends: 436 [2018-07-23 13:55:40,161 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-07-23 13:55:40,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-07-23 13:55:40,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2018-07-23 13:55:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-07-23 13:55:40,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 436 transitions. [2018-07-23 13:55:40,165 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 436 transitions. Word has length 433 [2018-07-23 13:55:40,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:55:40,165 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 436 transitions. [2018-07-23 13:55:40,165 INFO L472 AbstractCegarLoop]: Interpolant automaton has 218 states. [2018-07-23 13:55:40,165 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 436 transitions. [2018-07-23 13:55:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-07-23 13:55:40,167 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:55:40,167 INFO L357 BasicCegarLoop]: trace histogram [217, 216, 1, 1] [2018-07-23 13:55:40,167 INFO L414 AbstractCegarLoop]: === Iteration 217 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:55:40,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1474637168, now seen corresponding path program 216 times [2018-07-23 13:55:40,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:55:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:55:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 46872 backedges. 0 proven. 46872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:41,899 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:55:41,899 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [217] total 217 [2018-07-23 13:55:41,899 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:55:41,900 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:55:41,900 INFO L185 omatonBuilderFactory]: Interpolants [215259#(<= proc_i 4), 215258#(<= proc_i 0), 215257#false, 215256#true, 215263#(<= proc_i 20), 215262#(<= proc_i 16), 215261#(<= proc_i 12), 215260#(<= proc_i 8), 215267#(<= proc_i 36), 215266#(<= proc_i 32), 215265#(<= proc_i 28), 215264#(<= proc_i 24), 215271#(<= proc_i 52), 215270#(<= proc_i 48), 215269#(<= proc_i 44), 215268#(<= proc_i 40), 215275#(<= proc_i 68), 215274#(<= proc_i 64), 215273#(<= proc_i 60), 215272#(<= proc_i 56), 215279#(<= proc_i 84), 215278#(<= proc_i 80), 215277#(<= proc_i 76), 215276#(<= proc_i 72), 215283#(<= proc_i 100), 215282#(<= proc_i 96), 215281#(<= proc_i 92), 215280#(<= proc_i 88), 215287#(<= proc_i 116), 215286#(<= proc_i 112), 215285#(<= proc_i 108), 215284#(<= proc_i 104), 215291#(<= proc_i 132), 215290#(<= proc_i 128), 215289#(<= proc_i 124), 215288#(<= proc_i 120), 215295#(<= proc_i 148), 215294#(<= proc_i 144), 215293#(<= proc_i 140), 215292#(<= proc_i 136), 215299#(<= proc_i 164), 215298#(<= proc_i 160), 215297#(<= proc_i 156), 215296#(<= proc_i 152), 215303#(<= proc_i 180), 215302#(<= proc_i 176), 215301#(<= proc_i 172), 215300#(<= proc_i 168), 215307#(<= proc_i 196), 215306#(<= proc_i 192), 215305#(<= proc_i 188), 215304#(<= proc_i 184), 215311#(<= proc_i 212), 215310#(<= proc_i 208), 215309#(<= proc_i 204), 215308#(<= proc_i 200), 215315#(<= proc_i 228), 215314#(<= proc_i 224), 215313#(<= proc_i 220), 215312#(<= proc_i 216), 215319#(<= proc_i 244), 215318#(<= proc_i 240), 215317#(<= proc_i 236), 215316#(<= proc_i 232), 215323#(<= proc_i 260), 215322#(<= proc_i 256), 215321#(<= proc_i 252), 215320#(<= proc_i 248), 215327#(<= proc_i 276), 215326#(<= proc_i 272), 215325#(<= proc_i 268), 215324#(<= proc_i 264), 215331#(<= proc_i 292), 215330#(<= proc_i 288), 215329#(<= proc_i 284), 215328#(<= proc_i 280), 215335#(<= proc_i 308), 215334#(<= proc_i 304), 215333#(<= proc_i 300), 215332#(<= proc_i 296), 215339#(<= proc_i 324), 215338#(<= proc_i 320), 215337#(<= proc_i 316), 215336#(<= proc_i 312), 215343#(<= proc_i 340), 215342#(<= proc_i 336), 215341#(<= proc_i 332), 215340#(<= proc_i 328), 215347#(<= proc_i 356), 215346#(<= proc_i 352), 215345#(<= proc_i 348), 215344#(<= proc_i 344), 215351#(<= proc_i 372), 215350#(<= proc_i 368), 215349#(<= proc_i 364), 215348#(<= proc_i 360), 215355#(<= proc_i 388), 215354#(<= proc_i 384), 215353#(<= proc_i 380), 215352#(<= proc_i 376), 215359#(<= proc_i 404), 215358#(<= proc_i 400), 215357#(<= proc_i 396), 215356#(<= proc_i 392), 215363#(<= proc_i 420), 215362#(<= proc_i 416), 215361#(<= proc_i 412), 215360#(<= proc_i 408), 215367#(<= proc_i 436), 215366#(<= proc_i 432), 215365#(<= proc_i 428), 215364#(<= proc_i 424), 215371#(<= proc_i 452), 215370#(<= proc_i 448), 215369#(<= proc_i 444), 215368#(<= proc_i 440), 215375#(<= proc_i 468), 215374#(<= proc_i 464), 215373#(<= proc_i 460), 215372#(<= proc_i 456), 215379#(<= proc_i 484), 215378#(<= proc_i 480), 215377#(<= proc_i 476), 215376#(<= proc_i 472), 215383#(<= proc_i 500), 215382#(<= proc_i 496), 215381#(<= proc_i 492), 215380#(<= proc_i 488), 215387#(<= proc_i 516), 215386#(<= proc_i 512), 215385#(<= proc_i 508), 215384#(<= proc_i 504), 215391#(<= proc_i 532), 215390#(<= proc_i 528), 215389#(<= proc_i 524), 215388#(<= proc_i 520), 215395#(<= proc_i 548), 215394#(<= proc_i 544), 215393#(<= proc_i 540), 215392#(<= proc_i 536), 215399#(<= proc_i 564), 215398#(<= proc_i 560), 215397#(<= proc_i 556), 215396#(<= proc_i 552), 215403#(<= proc_i 580), 215402#(<= proc_i 576), 215401#(<= proc_i 572), 215400#(<= proc_i 568), 215407#(<= proc_i 596), 215406#(<= proc_i 592), 215405#(<= proc_i 588), 215404#(<= proc_i 584), 215411#(<= proc_i 612), 215410#(<= proc_i 608), 215409#(<= proc_i 604), 215408#(<= proc_i 600), 215415#(<= proc_i 628), 215414#(<= proc_i 624), 215413#(<= proc_i 620), 215412#(<= proc_i 616), 215419#(<= proc_i 644), 215418#(<= proc_i 640), 215417#(<= proc_i 636), 215416#(<= proc_i 632), 215423#(<= proc_i 660), 215422#(<= proc_i 656), 215421#(<= proc_i 652), 215420#(<= proc_i 648), 215427#(<= proc_i 676), 215426#(<= proc_i 672), 215425#(<= proc_i 668), 215424#(<= proc_i 664), 215431#(<= proc_i 692), 215430#(<= proc_i 688), 215429#(<= proc_i 684), 215428#(<= proc_i 680), 215435#(<= proc_i 708), 215434#(<= proc_i 704), 215433#(<= proc_i 700), 215432#(<= proc_i 696), 215439#(<= proc_i 724), 215438#(<= proc_i 720), 215437#(<= proc_i 716), 215436#(<= proc_i 712), 215443#(<= proc_i 740), 215442#(<= proc_i 736), 215441#(<= proc_i 732), 215440#(<= proc_i 728), 215447#(<= proc_i 756), 215446#(<= proc_i 752), 215445#(<= proc_i 748), 215444#(<= proc_i 744), 215451#(<= proc_i 772), 215450#(<= proc_i 768), 215449#(<= proc_i 764), 215448#(<= proc_i 760), 215455#(<= proc_i 788), 215454#(<= proc_i 784), 215453#(<= proc_i 780), 215452#(<= proc_i 776), 215459#(<= proc_i 804), 215458#(<= proc_i 800), 215457#(<= proc_i 796), 215456#(<= proc_i 792), 215463#(<= proc_i 820), 215462#(<= proc_i 816), 215461#(<= proc_i 812), 215460#(<= proc_i 808), 215467#(<= proc_i 836), 215466#(<= proc_i 832), 215465#(<= proc_i 828), 215464#(<= proc_i 824), 215471#(<= proc_i 852), 215470#(<= proc_i 848), 215469#(<= proc_i 844), 215468#(<= proc_i 840), 215474#(<= proc_i 864), 215473#(<= proc_i 860), 215472#(<= proc_i 856)] [2018-07-23 13:55:41,902 INFO L134 CoverageAnalysis]: Checked inductivity of 46872 backedges. 0 proven. 46872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:41,902 INFO L450 AbstractCegarLoop]: Interpolant automaton has 219 states [2018-07-23 13:55:41,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 219 interpolants. [2018-07-23 13:55:41,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23871, Invalid=23871, Unknown=0, NotChecked=0, Total=47742 [2018-07-23 13:55:41,908 INFO L87 Difference]: Start difference. First operand 436 states and 436 transitions. Second operand 219 states. [2018-07-23 13:55:44,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:55:44,730 INFO L93 Difference]: Finished difference Result 439 states and 439 transitions. [2018-07-23 13:55:44,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-07-23 13:55:44,730 INFO L78 Accepts]: Start accepts. Automaton has 219 states. Word has length 435 [2018-07-23 13:55:44,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:55:44,730 INFO L225 Difference]: With dead ends: 439 [2018-07-23 13:55:44,731 INFO L226 Difference]: Without dead ends: 438 [2018-07-23 13:55:44,733 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23871, Invalid=23871, Unknown=0, NotChecked=0, Total=47742 [2018-07-23 13:55:44,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-07-23 13:55:44,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2018-07-23 13:55:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-07-23 13:55:44,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 438 transitions. [2018-07-23 13:55:44,738 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 438 transitions. Word has length 435 [2018-07-23 13:55:44,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:55:44,738 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 438 transitions. [2018-07-23 13:55:44,738 INFO L472 AbstractCegarLoop]: Interpolant automaton has 219 states. [2018-07-23 13:55:44,738 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 438 transitions. [2018-07-23 13:55:44,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-07-23 13:55:44,740 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:55:44,740 INFO L357 BasicCegarLoop]: trace histogram [218, 217, 1, 1] [2018-07-23 13:55:44,740 INFO L414 AbstractCegarLoop]: === Iteration 218 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:55:44,740 INFO L82 PathProgramCache]: Analyzing trace with hash 212890322, now seen corresponding path program 217 times [2018-07-23 13:55:44,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:55:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:55:46,536 INFO L134 CoverageAnalysis]: Checked inductivity of 47306 backedges. 0 proven. 47306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:46,536 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:55:46,536 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [218] total 218 [2018-07-23 13:55:46,537 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:55:46,537 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:55:46,537 INFO L185 omatonBuilderFactory]: Interpolants [217231#(<= proc_i 0), 217230#false, 217229#true, 217235#(<= proc_i 16), 217234#(<= proc_i 12), 217233#(<= proc_i 8), 217232#(<= proc_i 4), 217239#(<= proc_i 32), 217238#(<= proc_i 28), 217237#(<= proc_i 24), 217236#(<= proc_i 20), 217243#(<= proc_i 48), 217242#(<= proc_i 44), 217241#(<= proc_i 40), 217240#(<= proc_i 36), 217247#(<= proc_i 64), 217246#(<= proc_i 60), 217245#(<= proc_i 56), 217244#(<= proc_i 52), 217251#(<= proc_i 80), 217250#(<= proc_i 76), 217249#(<= proc_i 72), 217248#(<= proc_i 68), 217255#(<= proc_i 96), 217254#(<= proc_i 92), 217253#(<= proc_i 88), 217252#(<= proc_i 84), 217259#(<= proc_i 112), 217258#(<= proc_i 108), 217257#(<= proc_i 104), 217256#(<= proc_i 100), 217263#(<= proc_i 128), 217262#(<= proc_i 124), 217261#(<= proc_i 120), 217260#(<= proc_i 116), 217267#(<= proc_i 144), 217266#(<= proc_i 140), 217265#(<= proc_i 136), 217264#(<= proc_i 132), 217271#(<= proc_i 160), 217270#(<= proc_i 156), 217269#(<= proc_i 152), 217268#(<= proc_i 148), 217275#(<= proc_i 176), 217274#(<= proc_i 172), 217273#(<= proc_i 168), 217272#(<= proc_i 164), 217279#(<= proc_i 192), 217278#(<= proc_i 188), 217277#(<= proc_i 184), 217276#(<= proc_i 180), 217283#(<= proc_i 208), 217282#(<= proc_i 204), 217281#(<= proc_i 200), 217280#(<= proc_i 196), 217287#(<= proc_i 224), 217286#(<= proc_i 220), 217285#(<= proc_i 216), 217284#(<= proc_i 212), 217291#(<= proc_i 240), 217290#(<= proc_i 236), 217289#(<= proc_i 232), 217288#(<= proc_i 228), 217295#(<= proc_i 256), 217294#(<= proc_i 252), 217293#(<= proc_i 248), 217292#(<= proc_i 244), 217299#(<= proc_i 272), 217298#(<= proc_i 268), 217297#(<= proc_i 264), 217296#(<= proc_i 260), 217303#(<= proc_i 288), 217302#(<= proc_i 284), 217301#(<= proc_i 280), 217300#(<= proc_i 276), 217307#(<= proc_i 304), 217306#(<= proc_i 300), 217305#(<= proc_i 296), 217304#(<= proc_i 292), 217311#(<= proc_i 320), 217310#(<= proc_i 316), 217309#(<= proc_i 312), 217308#(<= proc_i 308), 217315#(<= proc_i 336), 217314#(<= proc_i 332), 217313#(<= proc_i 328), 217312#(<= proc_i 324), 217319#(<= proc_i 352), 217318#(<= proc_i 348), 217317#(<= proc_i 344), 217316#(<= proc_i 340), 217323#(<= proc_i 368), 217322#(<= proc_i 364), 217321#(<= proc_i 360), 217320#(<= proc_i 356), 217327#(<= proc_i 384), 217326#(<= proc_i 380), 217325#(<= proc_i 376), 217324#(<= proc_i 372), 217331#(<= proc_i 400), 217330#(<= proc_i 396), 217329#(<= proc_i 392), 217328#(<= proc_i 388), 217335#(<= proc_i 416), 217334#(<= proc_i 412), 217333#(<= proc_i 408), 217332#(<= proc_i 404), 217339#(<= proc_i 432), 217338#(<= proc_i 428), 217337#(<= proc_i 424), 217336#(<= proc_i 420), 217343#(<= proc_i 448), 217342#(<= proc_i 444), 217341#(<= proc_i 440), 217340#(<= proc_i 436), 217347#(<= proc_i 464), 217346#(<= proc_i 460), 217345#(<= proc_i 456), 217344#(<= proc_i 452), 217351#(<= proc_i 480), 217350#(<= proc_i 476), 217349#(<= proc_i 472), 217348#(<= proc_i 468), 217355#(<= proc_i 496), 217354#(<= proc_i 492), 217353#(<= proc_i 488), 217352#(<= proc_i 484), 217359#(<= proc_i 512), 217358#(<= proc_i 508), 217357#(<= proc_i 504), 217356#(<= proc_i 500), 217363#(<= proc_i 528), 217362#(<= proc_i 524), 217361#(<= proc_i 520), 217360#(<= proc_i 516), 217367#(<= proc_i 544), 217366#(<= proc_i 540), 217365#(<= proc_i 536), 217364#(<= proc_i 532), 217371#(<= proc_i 560), 217370#(<= proc_i 556), 217369#(<= proc_i 552), 217368#(<= proc_i 548), 217375#(<= proc_i 576), 217374#(<= proc_i 572), 217373#(<= proc_i 568), 217372#(<= proc_i 564), 217379#(<= proc_i 592), 217378#(<= proc_i 588), 217377#(<= proc_i 584), 217376#(<= proc_i 580), 217383#(<= proc_i 608), 217382#(<= proc_i 604), 217381#(<= proc_i 600), 217380#(<= proc_i 596), 217387#(<= proc_i 624), 217386#(<= proc_i 620), 217385#(<= proc_i 616), 217384#(<= proc_i 612), 217391#(<= proc_i 640), 217390#(<= proc_i 636), 217389#(<= proc_i 632), 217388#(<= proc_i 628), 217395#(<= proc_i 656), 217394#(<= proc_i 652), 217393#(<= proc_i 648), 217392#(<= proc_i 644), 217399#(<= proc_i 672), 217398#(<= proc_i 668), 217397#(<= proc_i 664), 217396#(<= proc_i 660), 217403#(<= proc_i 688), 217402#(<= proc_i 684), 217401#(<= proc_i 680), 217400#(<= proc_i 676), 217407#(<= proc_i 704), 217406#(<= proc_i 700), 217405#(<= proc_i 696), 217404#(<= proc_i 692), 217411#(<= proc_i 720), 217410#(<= proc_i 716), 217409#(<= proc_i 712), 217408#(<= proc_i 708), 217415#(<= proc_i 736), 217414#(<= proc_i 732), 217413#(<= proc_i 728), 217412#(<= proc_i 724), 217419#(<= proc_i 752), 217418#(<= proc_i 748), 217417#(<= proc_i 744), 217416#(<= proc_i 740), 217423#(<= proc_i 768), 217422#(<= proc_i 764), 217421#(<= proc_i 760), 217420#(<= proc_i 756), 217427#(<= proc_i 784), 217426#(<= proc_i 780), 217425#(<= proc_i 776), 217424#(<= proc_i 772), 217431#(<= proc_i 800), 217430#(<= proc_i 796), 217429#(<= proc_i 792), 217428#(<= proc_i 788), 217435#(<= proc_i 816), 217434#(<= proc_i 812), 217433#(<= proc_i 808), 217432#(<= proc_i 804), 217439#(<= proc_i 832), 217438#(<= proc_i 828), 217437#(<= proc_i 824), 217436#(<= proc_i 820), 217443#(<= proc_i 848), 217442#(<= proc_i 844), 217441#(<= proc_i 840), 217440#(<= proc_i 836), 217447#(<= proc_i 864), 217446#(<= proc_i 860), 217445#(<= proc_i 856), 217444#(<= proc_i 852), 217448#(<= proc_i 868)] [2018-07-23 13:55:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 47306 backedges. 0 proven. 47306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:46,539 INFO L450 AbstractCegarLoop]: Interpolant automaton has 220 states [2018-07-23 13:55:46,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 220 interpolants. [2018-07-23 13:55:46,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-07-23 13:55:46,542 INFO L87 Difference]: Start difference. First operand 438 states and 438 transitions. Second operand 220 states. [2018-07-23 13:55:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:55:48,004 INFO L93 Difference]: Finished difference Result 441 states and 441 transitions. [2018-07-23 13:55:48,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-07-23 13:55:48,004 INFO L78 Accepts]: Start accepts. Automaton has 220 states. Word has length 437 [2018-07-23 13:55:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:55:48,005 INFO L225 Difference]: With dead ends: 441 [2018-07-23 13:55:48,005 INFO L226 Difference]: Without dead ends: 440 [2018-07-23 13:55:48,006 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-07-23 13:55:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-07-23 13:55:48,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2018-07-23 13:55:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-07-23 13:55:48,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 440 transitions. [2018-07-23 13:55:48,011 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 440 transitions. Word has length 437 [2018-07-23 13:55:48,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:55:48,011 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 440 transitions. [2018-07-23 13:55:48,011 INFO L472 AbstractCegarLoop]: Interpolant automaton has 220 states. [2018-07-23 13:55:48,011 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 440 transitions. [2018-07-23 13:55:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-07-23 13:55:48,013 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:55:48,013 INFO L357 BasicCegarLoop]: trace histogram [219, 218, 1, 1] [2018-07-23 13:55:48,013 INFO L414 AbstractCegarLoop]: === Iteration 219 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:55:48,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1570829676, now seen corresponding path program 218 times [2018-07-23 13:55:48,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:55:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:55:50,052 INFO L134 CoverageAnalysis]: Checked inductivity of 47742 backedges. 0 proven. 47742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:50,052 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:55:50,052 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [219] total 219 [2018-07-23 13:55:50,053 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:55:50,053 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:55:50,053 INFO L185 omatonBuilderFactory]: Interpolants [219211#true, 219215#(<= proc_i 8), 219214#(<= proc_i 4), 219213#(<= proc_i 0), 219212#false, 219219#(<= proc_i 24), 219218#(<= proc_i 20), 219217#(<= proc_i 16), 219216#(<= proc_i 12), 219223#(<= proc_i 40), 219222#(<= proc_i 36), 219221#(<= proc_i 32), 219220#(<= proc_i 28), 219227#(<= proc_i 56), 219226#(<= proc_i 52), 219225#(<= proc_i 48), 219224#(<= proc_i 44), 219231#(<= proc_i 72), 219230#(<= proc_i 68), 219229#(<= proc_i 64), 219228#(<= proc_i 60), 219235#(<= proc_i 88), 219234#(<= proc_i 84), 219233#(<= proc_i 80), 219232#(<= proc_i 76), 219239#(<= proc_i 104), 219238#(<= proc_i 100), 219237#(<= proc_i 96), 219236#(<= proc_i 92), 219243#(<= proc_i 120), 219242#(<= proc_i 116), 219241#(<= proc_i 112), 219240#(<= proc_i 108), 219247#(<= proc_i 136), 219246#(<= proc_i 132), 219245#(<= proc_i 128), 219244#(<= proc_i 124), 219251#(<= proc_i 152), 219250#(<= proc_i 148), 219249#(<= proc_i 144), 219248#(<= proc_i 140), 219255#(<= proc_i 168), 219254#(<= proc_i 164), 219253#(<= proc_i 160), 219252#(<= proc_i 156), 219259#(<= proc_i 184), 219258#(<= proc_i 180), 219257#(<= proc_i 176), 219256#(<= proc_i 172), 219263#(<= proc_i 200), 219262#(<= proc_i 196), 219261#(<= proc_i 192), 219260#(<= proc_i 188), 219267#(<= proc_i 216), 219266#(<= proc_i 212), 219265#(<= proc_i 208), 219264#(<= proc_i 204), 219271#(<= proc_i 232), 219270#(<= proc_i 228), 219269#(<= proc_i 224), 219268#(<= proc_i 220), 219275#(<= proc_i 248), 219274#(<= proc_i 244), 219273#(<= proc_i 240), 219272#(<= proc_i 236), 219279#(<= proc_i 264), 219278#(<= proc_i 260), 219277#(<= proc_i 256), 219276#(<= proc_i 252), 219283#(<= proc_i 280), 219282#(<= proc_i 276), 219281#(<= proc_i 272), 219280#(<= proc_i 268), 219287#(<= proc_i 296), 219286#(<= proc_i 292), 219285#(<= proc_i 288), 219284#(<= proc_i 284), 219291#(<= proc_i 312), 219290#(<= proc_i 308), 219289#(<= proc_i 304), 219288#(<= proc_i 300), 219295#(<= proc_i 328), 219294#(<= proc_i 324), 219293#(<= proc_i 320), 219292#(<= proc_i 316), 219299#(<= proc_i 344), 219298#(<= proc_i 340), 219297#(<= proc_i 336), 219296#(<= proc_i 332), 219303#(<= proc_i 360), 219302#(<= proc_i 356), 219301#(<= proc_i 352), 219300#(<= proc_i 348), 219307#(<= proc_i 376), 219306#(<= proc_i 372), 219305#(<= proc_i 368), 219304#(<= proc_i 364), 219311#(<= proc_i 392), 219310#(<= proc_i 388), 219309#(<= proc_i 384), 219308#(<= proc_i 380), 219315#(<= proc_i 408), 219314#(<= proc_i 404), 219313#(<= proc_i 400), 219312#(<= proc_i 396), 219319#(<= proc_i 424), 219318#(<= proc_i 420), 219317#(<= proc_i 416), 219316#(<= proc_i 412), 219323#(<= proc_i 440), 219322#(<= proc_i 436), 219321#(<= proc_i 432), 219320#(<= proc_i 428), 219327#(<= proc_i 456), 219326#(<= proc_i 452), 219325#(<= proc_i 448), 219324#(<= proc_i 444), 219331#(<= proc_i 472), 219330#(<= proc_i 468), 219329#(<= proc_i 464), 219328#(<= proc_i 460), 219335#(<= proc_i 488), 219334#(<= proc_i 484), 219333#(<= proc_i 480), 219332#(<= proc_i 476), 219339#(<= proc_i 504), 219338#(<= proc_i 500), 219337#(<= proc_i 496), 219336#(<= proc_i 492), 219343#(<= proc_i 520), 219342#(<= proc_i 516), 219341#(<= proc_i 512), 219340#(<= proc_i 508), 219347#(<= proc_i 536), 219346#(<= proc_i 532), 219345#(<= proc_i 528), 219344#(<= proc_i 524), 219351#(<= proc_i 552), 219350#(<= proc_i 548), 219349#(<= proc_i 544), 219348#(<= proc_i 540), 219355#(<= proc_i 568), 219354#(<= proc_i 564), 219353#(<= proc_i 560), 219352#(<= proc_i 556), 219359#(<= proc_i 584), 219358#(<= proc_i 580), 219357#(<= proc_i 576), 219356#(<= proc_i 572), 219363#(<= proc_i 600), 219362#(<= proc_i 596), 219361#(<= proc_i 592), 219360#(<= proc_i 588), 219367#(<= proc_i 616), 219366#(<= proc_i 612), 219365#(<= proc_i 608), 219364#(<= proc_i 604), 219371#(<= proc_i 632), 219370#(<= proc_i 628), 219369#(<= proc_i 624), 219368#(<= proc_i 620), 219375#(<= proc_i 648), 219374#(<= proc_i 644), 219373#(<= proc_i 640), 219372#(<= proc_i 636), 219379#(<= proc_i 664), 219378#(<= proc_i 660), 219377#(<= proc_i 656), 219376#(<= proc_i 652), 219383#(<= proc_i 680), 219382#(<= proc_i 676), 219381#(<= proc_i 672), 219380#(<= proc_i 668), 219387#(<= proc_i 696), 219386#(<= proc_i 692), 219385#(<= proc_i 688), 219384#(<= proc_i 684), 219391#(<= proc_i 712), 219390#(<= proc_i 708), 219389#(<= proc_i 704), 219388#(<= proc_i 700), 219395#(<= proc_i 728), 219394#(<= proc_i 724), 219393#(<= proc_i 720), 219392#(<= proc_i 716), 219399#(<= proc_i 744), 219398#(<= proc_i 740), 219397#(<= proc_i 736), 219396#(<= proc_i 732), 219403#(<= proc_i 760), 219402#(<= proc_i 756), 219401#(<= proc_i 752), 219400#(<= proc_i 748), 219407#(<= proc_i 776), 219406#(<= proc_i 772), 219405#(<= proc_i 768), 219404#(<= proc_i 764), 219411#(<= proc_i 792), 219410#(<= proc_i 788), 219409#(<= proc_i 784), 219408#(<= proc_i 780), 219415#(<= proc_i 808), 219414#(<= proc_i 804), 219413#(<= proc_i 800), 219412#(<= proc_i 796), 219419#(<= proc_i 824), 219418#(<= proc_i 820), 219417#(<= proc_i 816), 219416#(<= proc_i 812), 219423#(<= proc_i 840), 219422#(<= proc_i 836), 219421#(<= proc_i 832), 219420#(<= proc_i 828), 219427#(<= proc_i 856), 219426#(<= proc_i 852), 219425#(<= proc_i 848), 219424#(<= proc_i 844), 219431#(<= proc_i 872), 219430#(<= proc_i 868), 219429#(<= proc_i 864), 219428#(<= proc_i 860)] [2018-07-23 13:55:50,056 INFO L134 CoverageAnalysis]: Checked inductivity of 47742 backedges. 0 proven. 47742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:50,056 INFO L450 AbstractCegarLoop]: Interpolant automaton has 221 states [2018-07-23 13:55:50,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 221 interpolants. [2018-07-23 13:55:50,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24310, Invalid=24310, Unknown=0, NotChecked=0, Total=48620 [2018-07-23 13:55:50,061 INFO L87 Difference]: Start difference. First operand 440 states and 440 transitions. Second operand 221 states. [2018-07-23 13:55:52,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:55:52,427 INFO L93 Difference]: Finished difference Result 443 states and 443 transitions. [2018-07-23 13:55:52,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-07-23 13:55:52,427 INFO L78 Accepts]: Start accepts. Automaton has 221 states. Word has length 439 [2018-07-23 13:55:52,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:55:52,428 INFO L225 Difference]: With dead ends: 443 [2018-07-23 13:55:52,428 INFO L226 Difference]: Without dead ends: 442 [2018-07-23 13:55:52,431 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=24310, Invalid=24310, Unknown=0, NotChecked=0, Total=48620 [2018-07-23 13:55:52,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-07-23 13:55:52,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2018-07-23 13:55:52,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-07-23 13:55:52,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 442 transitions. [2018-07-23 13:55:52,435 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 442 transitions. Word has length 439 [2018-07-23 13:55:52,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:55:52,435 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 442 transitions. [2018-07-23 13:55:52,435 INFO L472 AbstractCegarLoop]: Interpolant automaton has 221 states. [2018-07-23 13:55:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 442 transitions. [2018-07-23 13:55:52,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2018-07-23 13:55:52,436 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:55:52,437 INFO L357 BasicCegarLoop]: trace histogram [220, 219, 1, 1] [2018-07-23 13:55:52,437 INFO L414 AbstractCegarLoop]: === Iteration 220 === [procErr0AssertViolationASSERT]=== [2018-07-23 13:55:52,437 INFO L82 PathProgramCache]: Analyzing trace with hash -2033796650, now seen corresponding path program 219 times [2018-07-23 13:55:52,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:55:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:55:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 48180 backedges. 0 proven. 48180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:54,394 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:55:54,394 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [220] total 220 [2018-07-23 13:55:54,395 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:55:54,395 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:55:54,395 INFO L185 omatonBuilderFactory]: Interpolants [221203#false, 221202#true, 221207#(<= proc_i 12), 221206#(<= proc_i 8), 221205#(<= proc_i 4), 221204#(<= proc_i 0), 221211#(<= proc_i 28), 221210#(<= proc_i 24), 221209#(<= proc_i 20), 221208#(<= proc_i 16), 221215#(<= proc_i 44), 221214#(<= proc_i 40), 221213#(<= proc_i 36), 221212#(<= proc_i 32), 221219#(<= proc_i 60), 221218#(<= proc_i 56), 221217#(<= proc_i 52), 221216#(<= proc_i 48), 221223#(<= proc_i 76), 221222#(<= proc_i 72), 221221#(<= proc_i 68), 221220#(<= proc_i 64), 221227#(<= proc_i 92), 221226#(<= proc_i 88), 221225#(<= proc_i 84), 221224#(<= proc_i 80), 221231#(<= proc_i 108), 221230#(<= proc_i 104), 221229#(<= proc_i 100), 221228#(<= proc_i 96), 221235#(<= proc_i 124), 221234#(<= proc_i 120), 221233#(<= proc_i 116), 221232#(<= proc_i 112), 221239#(<= proc_i 140), 221238#(<= proc_i 136), 221237#(<= proc_i 132), 221236#(<= proc_i 128), 221243#(<= proc_i 156), 221242#(<= proc_i 152), 221241#(<= proc_i 148), 221240#(<= proc_i 144), 221247#(<= proc_i 172), 221246#(<= proc_i 168), 221245#(<= proc_i 164), 221244#(<= proc_i 160), 221251#(<= proc_i 188), 221250#(<= proc_i 184), 221249#(<= proc_i 180), 221248#(<= proc_i 176), 221255#(<= proc_i 204), 221254#(<= proc_i 200), 221253#(<= proc_i 196), 221252#(<= proc_i 192), 221259#(<= proc_i 220), 221258#(<= proc_i 216), 221257#(<= proc_i 212), 221256#(<= proc_i 208), 221263#(<= proc_i 236), 221262#(<= proc_i 232), 221261#(<= proc_i 228), 221260#(<= proc_i 224), 221267#(<= proc_i 252), 221266#(<= proc_i 248), 221265#(<= proc_i 244), 221264#(<= proc_i 240), 221271#(<= proc_i 268), 221270#(<= proc_i 264), 221269#(<= proc_i 260), 221268#(<= proc_i 256), 221275#(<= proc_i 284), 221274#(<= proc_i 280), 221273#(<= proc_i 276), 221272#(<= proc_i 272), 221279#(<= proc_i 300), 221278#(<= proc_i 296), 221277#(<= proc_i 292), 221276#(<= proc_i 288), 221283#(<= proc_i 316), 221282#(<= proc_i 312), 221281#(<= proc_i 308), 221280#(<= proc_i 304), 221287#(<= proc_i 332), 221286#(<= proc_i 328), 221285#(<= proc_i 324), 221284#(<= proc_i 320), 221291#(<= proc_i 348), 221290#(<= proc_i 344), 221289#(<= proc_i 340), 221288#(<= proc_i 336), 221295#(<= proc_i 364), 221294#(<= proc_i 360), 221293#(<= proc_i 356), 221292#(<= proc_i 352), 221299#(<= proc_i 380), 221298#(<= proc_i 376), 221297#(<= proc_i 372), 221296#(<= proc_i 368), 221303#(<= proc_i 396), 221302#(<= proc_i 392), 221301#(<= proc_i 388), 221300#(<= proc_i 384), 221307#(<= proc_i 412), 221306#(<= proc_i 408), 221305#(<= proc_i 404), 221304#(<= proc_i 400), 221311#(<= proc_i 428), 221310#(<= proc_i 424), 221309#(<= proc_i 420), 221308#(<= proc_i 416), 221315#(<= proc_i 444), 221314#(<= proc_i 440), 221313#(<= proc_i 436), 221312#(<= proc_i 432), 221319#(<= proc_i 460), 221318#(<= proc_i 456), 221317#(<= proc_i 452), 221316#(<= proc_i 448), 221323#(<= proc_i 476), 221322#(<= proc_i 472), 221321#(<= proc_i 468), 221320#(<= proc_i 464), 221327#(<= proc_i 492), 221326#(<= proc_i 488), 221325#(<= proc_i 484), 221324#(<= proc_i 480), 221331#(<= proc_i 508), 221330#(<= proc_i 504), 221329#(<= proc_i 500), 221328#(<= proc_i 496), 221335#(<= proc_i 524), 221334#(<= proc_i 520), 221333#(<= proc_i 516), 221332#(<= proc_i 512), 221339#(<= proc_i 540), 221338#(<= proc_i 536), 221337#(<= proc_i 532), 221336#(<= proc_i 528), 221343#(<= proc_i 556), 221342#(<= proc_i 552), 221341#(<= proc_i 548), 221340#(<= proc_i 544), 221347#(<= proc_i 572), 221346#(<= proc_i 568), 221345#(<= proc_i 564), 221344#(<= proc_i 560), 221351#(<= proc_i 588), 221350#(<= proc_i 584), 221349#(<= proc_i 580), 221348#(<= proc_i 576), 221355#(<= proc_i 604), 221354#(<= proc_i 600), 221353#(<= proc_i 596), 221352#(<= proc_i 592), 221359#(<= proc_i 620), 221358#(<= proc_i 616), 221357#(<= proc_i 612), 221356#(<= proc_i 608), 221363#(<= proc_i 636), 221362#(<= proc_i 632), 221361#(<= proc_i 628), 221360#(<= proc_i 624), 221367#(<= proc_i 652), 221366#(<= proc_i 648), 221365#(<= proc_i 644), 221364#(<= proc_i 640), 221371#(<= proc_i 668), 221370#(<= proc_i 664), 221369#(<= proc_i 660), 221368#(<= proc_i 656), 221375#(<= proc_i 684), 221374#(<= proc_i 680), 221373#(<= proc_i 676), 221372#(<= proc_i 672), 221379#(<= proc_i 700), 221378#(<= proc_i 696), 221377#(<= proc_i 692), 221376#(<= proc_i 688), 221383#(<= proc_i 716), 221382#(<= proc_i 712), 221381#(<= proc_i 708), 221380#(<= proc_i 704), 221387#(<= proc_i 732), 221386#(<= proc_i 728), 221385#(<= proc_i 724), 221384#(<= proc_i 720), 221391#(<= proc_i 748), 221390#(<= proc_i 744), 221389#(<= proc_i 740), 221388#(<= proc_i 736), 221395#(<= proc_i 764), 221394#(<= proc_i 760), 221393#(<= proc_i 756), 221392#(<= proc_i 752), 221399#(<= proc_i 780), 221398#(<= proc_i 776), 221397#(<= proc_i 772), 221396#(<= proc_i 768), 221403#(<= proc_i 796), 221402#(<= proc_i 792), 221401#(<= proc_i 788), 221400#(<= proc_i 784), 221407#(<= proc_i 812), 221406#(<= proc_i 808), 221405#(<= proc_i 804), 221404#(<= proc_i 800), 221411#(<= proc_i 828), 221410#(<= proc_i 824), 221409#(<= proc_i 820), 221408#(<= proc_i 816), 221415#(<= proc_i 844), 221414#(<= proc_i 840), 221413#(<= proc_i 836), 221412#(<= proc_i 832), 221419#(<= proc_i 860), 221418#(<= proc_i 856), 221417#(<= proc_i 852), 221416#(<= proc_i 848), 221423#(<= proc_i 876), 221422#(<= proc_i 872), 221421#(<= proc_i 868), 221420#(<= proc_i 864)] [2018-07-23 13:55:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 48180 backedges. 0 proven. 48180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:55:54,398 INFO L450 AbstractCegarLoop]: Interpolant automaton has 222 states [2018-07-23 13:55:54,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 222 interpolants. [2018-07-23 13:55:54,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-07-23 13:55:54,405 INFO L87 Difference]: Start difference. First operand 442 states and 442 transitions. Second operand 222 states. Received shutdown request... [2018-07-23 13:55:56,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-07-23 13:55:56,929 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-23 13:55:56,936 WARN L202 ceAbstractionStarter]: Timeout [2018-07-23 13:55:56,936 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:55:56 BoogieIcfgContainer [2018-07-23 13:55:56,936 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:55:56,937 INFO L168 Benchmark]: Toolchain (without parser) took 259965.89 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 371.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-07-23 13:55:56,938 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:55:56,939 INFO L168 Benchmark]: Boogie Preprocessor took 52.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:55:56,939 INFO L168 Benchmark]: RCFGBuilder took 213.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 13:55:56,939 INFO L168 Benchmark]: TraceAbstraction took 259695.66 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 360.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-07-23 13:55:56,941 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 213.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 259695.66 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 360.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (442states) and interpolant automaton (currently 194 states, 222 states before enhancement), while ReachableStatesComputation was computing reachable states (383 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 259.6s OverallTime, 220 OverallIterations, 220 TraceHistogramMax, 118.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 660 SDtfs, 1 SDslu, 24281 SDs, 0 SdLazy, 35783 SolverSat, 447 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24310 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 87.6s Time, 0.4s BasicInterpolantAutomatonTime, BiggestAbstraction: size=442occurred in iteration=219, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/3549260 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 219 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 28.1s SatisfiabilityAnalysisTime, 100.3s InterpolantComputationTime, 48840 NumberOfCodeBlocks, 48840 NumberOfCodeBlocksAsserted, 220 NumberOfCheckSat, 48620 ConstructedInterpolants, 0 QuantifiedInterpolants, 42882840 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 220 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3549260 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/LargeConstant-ForwardSuccess.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-55-56-950.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/LargeConstant-ForwardSuccess.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-55-56-950.csv Completed graceful shutdown