java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:24:42,022 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:24:42,024 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:24:42,037 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:24:42,038 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:24:42,039 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:24:42,040 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:24:42,042 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:24:42,043 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:24:42,044 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:24:42,045 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:24:42,046 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:24:42,047 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:24:42,048 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:24:42,049 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:24:42,050 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:24:42,051 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:24:42,053 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:24:42,055 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:24:42,056 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:24:42,058 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:24:42,059 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:24:42,061 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:24:42,062 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:24:42,062 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:24:42,063 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:24:42,064 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:24:42,065 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:24:42,066 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:24:42,067 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:24:42,067 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:24:42,068 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:24:42,068 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:24:42,068 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:24:42,069 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:24:42,070 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:24:42,074 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:24:42,089 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:24:42,089 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:24:42,091 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:24:42,091 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:24:42,091 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:24:42,093 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:24:42,093 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:24:42,093 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:24:42,148 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:24:42,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:24:42,173 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:24:42,174 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:24:42,175 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:24:42,175 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2018-09-26 08:24:42,176 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2018-09-26 08:24:42,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:24:42,239 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:24:42,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:24:42,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:24:42,241 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:24:42,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:42" (1/1) ... [2018-09-26 08:24:42,277 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:42" (1/1) ... [2018-09-26 08:24:42,283 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:24:42,283 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:24:42,283 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:24:42,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:24:42,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:24:42,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:24:42,300 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:24:42,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:42" (1/1) ... [2018-09-26 08:24:42,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:42" (1/1) ... [2018-09-26 08:24:42,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:42" (1/1) ... [2018-09-26 08:24:42,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:42" (1/1) ... [2018-09-26 08:24:42,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:42" (1/1) ... [2018-09-26 08:24:42,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:42" (1/1) ... [2018-09-26 08:24:42,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:42" (1/1) ... [2018-09-26 08:24:42,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:24:42,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:24:42,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:24:42,323 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:24:42,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:42" (1/1) ... [2018-09-26 08:24:42,414 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-26 08:24:42,415 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-26 08:24:42,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-26 08:24:42,415 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-09-26 08:24:42,642 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:24:42,643 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:24:42 BoogieIcfgContainer [2018-09-26 08:24:42,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:24:42,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:24:42,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:24:42,648 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:24:42,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:42" (1/2) ... [2018-09-26 08:24:42,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e5d7ddb and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:24:42, skipping insertion in model container [2018-09-26 08:24:42,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:24:42" (2/2) ... [2018-09-26 08:24:42,653 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2018-09-26 08:24:42,665 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:24:42,677 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-09-26 08:24:42,740 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:24:42,741 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:24:42,741 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:24:42,742 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:24:42,742 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:24:42,742 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:24:42,742 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:24:42,742 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:24:42,743 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:24:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-09-26 08:24:42,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:24:42,777 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:42,778 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:24:42,783 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:42,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:42,792 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-09-26 08:24:42,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:42,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-09-26 08:24:42,918 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:24:42,918 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:24:42,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:24:42,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:24:42,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:24:42,940 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 4 states. [2018-09-26 08:24:43,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:43,004 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-09-26 08:24:43,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:24:43,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-26 08:24:43,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:43,022 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:24:43,022 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:24:43,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:24:43,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:24:43,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2018-09-26 08:24:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:24:43,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-09-26 08:24:43,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2018-09-26 08:24:43,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:43,068 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-09-26 08:24:43,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:24:43,068 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-09-26 08:24:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:24:43,069 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:43,069 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 08:24:43,070 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:43,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:43,070 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2018-09-26 08:24:43,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:43,154 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:24:43,154 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:24:43,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:24:43,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:24:43,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:24:43,160 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2018-09-26 08:24:43,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:43,295 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-09-26 08:24:43,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:24:43,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-26 08:24:43,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:43,298 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:24:43,299 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:24:43,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:24:43,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:24:43,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-09-26 08:24:43,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:24:43,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-09-26 08:24:43,311 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2018-09-26 08:24:43,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:43,312 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-09-26 08:24:43,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:24:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-09-26 08:24:43,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:24:43,313 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:43,313 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:24:43,314 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:43,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:43,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2018-09-26 08:24:43,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:43,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:43,331 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:24:43,331 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:24:43,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:24:43,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:24:43,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:24:43,333 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2018-09-26 08:24:43,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:43,349 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-09-26 08:24:43,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:24:43,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-09-26 08:24:43,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:43,350 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:24:43,350 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:24:43,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:24:43,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:24:43,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:24:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:24:43,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:24:43,358 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-09-26 08:24:43,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:43,359 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:24:43,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:24:43,359 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:24:43,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:24:43,360 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:43,360 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2018-09-26 08:24:43,360 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:43,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:43,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2018-09-26 08:24:43,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:43,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:43,454 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:43,454 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:24:43,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:24:43,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:24:43,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:24:43,455 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 5 states. [2018-09-26 08:24:43,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:43,577 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-26 08:24:43,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:24:43,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-09-26 08:24:43,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:43,578 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:24:43,578 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:24:43,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:24:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:24:43,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-09-26 08:24:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:24:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-26 08:24:43,590 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2018-09-26 08:24:43,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:43,590 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-26 08:24:43,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:24:43,590 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-26 08:24:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:24:43,591 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:43,591 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2018-09-26 08:24:43,592 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:43,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:43,592 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2018-09-26 08:24:43,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:43,701 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:43,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:24:43,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:24:43,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:24:43,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:24:43,703 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 7 states. [2018-09-26 08:24:43,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:43,819 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-26 08:24:43,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:24:43,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-09-26 08:24:43,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:43,821 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:24:43,821 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 08:24:43,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:24:43,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 08:24:43,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-09-26 08:24:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:24:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 08:24:43,848 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2018-09-26 08:24:43,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:43,851 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 08:24:43,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:24:43,851 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 08:24:43,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:24:43,852 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:43,852 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2018-09-26 08:24:43,853 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:43,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:43,853 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2018-09-26 08:24:43,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:43,965 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:43,965 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:24:43,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:24:43,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:24:43,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:24:43,969 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2018-09-26 08:24:44,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:44,148 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-26 08:24:44,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:24:44,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-09-26 08:24:44,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:44,151 INFO L225 Difference]: With dead ends: 30 [2018-09-26 08:24:44,151 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:24:44,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:24:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:24:44,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-09-26 08:24:44,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 08:24:44,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-26 08:24:44,180 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2018-09-26 08:24:44,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:44,180 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-26 08:24:44,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:24:44,181 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-26 08:24:44,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:24:44,182 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:44,182 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2018-09-26 08:24:44,182 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:44,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:44,183 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2018-09-26 08:24:44,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:44,250 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:44,251 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:24:44,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:24:44,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:24:44,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:24:44,253 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 9 states. [2018-09-26 08:24:44,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:44,352 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 08:24:44,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:24:44,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-09-26 08:24:44,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:44,353 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:24:44,354 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 08:24:44,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:24:44,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 08:24:44,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-09-26 08:24:44,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:24:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 08:24:44,370 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2018-09-26 08:24:44,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:44,372 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 08:24:44,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:24:44,373 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 08:24:44,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:24:44,374 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:44,374 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2018-09-26 08:24:44,374 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:44,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:44,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2018-09-26 08:24:44,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:44,461 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:44,461 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:24:44,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:24:44,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:24:44,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:24:44,463 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 10 states. [2018-09-26 08:24:44,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:44,610 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-26 08:24:44,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:24:44,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-09-26 08:24:44,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:44,615 INFO L225 Difference]: With dead ends: 40 [2018-09-26 08:24:44,615 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:24:44,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:24:44,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:24:44,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-09-26 08:24:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 08:24:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-26 08:24:44,642 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2018-09-26 08:24:44,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:44,643 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-26 08:24:44,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:24:44,643 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-26 08:24:44,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 08:24:44,644 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:44,644 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2018-09-26 08:24:44,648 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:44,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:44,649 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2018-09-26 08:24:44,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:44,720 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:44,721 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:44,721 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:24:44,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:24:44,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:24:44,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:24:44,723 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 11 states. [2018-09-26 08:24:44,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:44,841 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 08:24:44,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:24:44,842 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-09-26 08:24:44,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:44,843 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:24:44,843 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 08:24:44,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=188, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:24:44,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 08:24:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-09-26 08:24:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:24:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:24:44,866 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2018-09-26 08:24:44,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:44,867 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:24:44,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:24:44,867 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:24:44,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:24:44,868 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:44,869 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2018-09-26 08:24:44,869 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:44,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:44,869 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2018-09-26 08:24:44,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:44,946 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:44,946 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:24:44,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:24:44,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:24:44,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:24:44,948 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 12 states. [2018-09-26 08:24:45,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:45,091 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-26 08:24:45,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:24:45,091 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-09-26 08:24:45,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:45,092 INFO L225 Difference]: With dead ends: 50 [2018-09-26 08:24:45,093 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:24:45,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:24:45,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:24:45,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-09-26 08:24:45,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 08:24:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-26 08:24:45,122 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2018-09-26 08:24:45,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:45,122 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-26 08:24:45,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:24:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-26 08:24:45,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 08:24:45,124 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:45,124 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2018-09-26 08:24:45,125 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:45,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:45,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2018-09-26 08:24:45,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:45,235 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:45,236 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:45,236 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:24:45,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:24:45,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:24:45,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:24:45,238 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 13 states. [2018-09-26 08:24:45,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:45,438 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-26 08:24:45,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:24:45,439 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-09-26 08:24:45,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:45,440 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:24:45,440 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 08:24:45,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:24:45,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 08:24:45,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-09-26 08:24:45,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:24:45,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-26 08:24:45,485 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2018-09-26 08:24:45,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:45,487 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-26 08:24:45,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:24:45,487 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-26 08:24:45,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:24:45,488 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:45,489 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2018-09-26 08:24:45,489 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:45,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:45,492 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2018-09-26 08:24:45,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:45,628 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:45,628 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:24:45,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:24:45,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:24:45,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=103, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:24:45,633 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 14 states. [2018-09-26 08:24:45,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:45,821 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-26 08:24:45,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:24:45,821 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-09-26 08:24:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:45,822 INFO L225 Difference]: With dead ends: 60 [2018-09-26 08:24:45,823 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:24:45,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:24:45,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:24:45,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-09-26 08:24:45,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-26 08:24:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-26 08:24:45,859 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2018-09-26 08:24:45,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:45,859 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-26 08:24:45,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:24:45,860 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-26 08:24:45,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-26 08:24:45,861 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:45,861 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2018-09-26 08:24:45,861 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:45,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:45,862 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2018-09-26 08:24:45,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:45,975 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:45,975 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:24:45,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:24:45,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:24:45,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=118, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:24:45,978 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 15 states. [2018-09-26 08:24:46,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:46,178 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-26 08:24:46,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:24:46,179 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-09-26 08:24:46,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:46,180 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:24:46,180 INFO L226 Difference]: Without dead ends: 64 [2018-09-26 08:24:46,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:24:46,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-26 08:24:46,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-09-26 08:24:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:24:46,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 08:24:46,238 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2018-09-26 08:24:46,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:46,238 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 08:24:46,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:24:46,238 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 08:24:46,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:24:46,239 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:46,240 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2018-09-26 08:24:46,240 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:46,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:46,243 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2018-09-26 08:24:46,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:46,390 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:46,391 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:24:46,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:24:46,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:24:46,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=134, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:24:46,392 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 16 states. [2018-09-26 08:24:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:46,619 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-26 08:24:46,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:24:46,619 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-09-26 08:24:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:46,620 INFO L225 Difference]: With dead ends: 70 [2018-09-26 08:24:46,620 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:24:46,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=288, Invalid=468, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:24:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:24:46,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-09-26 08:24:46,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-26 08:24:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-26 08:24:46,662 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2018-09-26 08:24:46,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:46,663 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-26 08:24:46,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:24:46,663 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-26 08:24:46,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 08:24:46,664 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:46,664 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2018-09-26 08:24:46,665 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:46,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:46,665 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2018-09-26 08:24:46,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:46,797 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:46,798 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:46,798 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:24:46,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:24:46,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:24:46,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=151, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:24:46,799 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 17 states. [2018-09-26 08:24:47,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:47,109 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-26 08:24:47,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:24:47,110 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2018-09-26 08:24:47,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:47,111 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:24:47,111 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 08:24:47,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=331, Invalid=539, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:24:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 08:24:47,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2018-09-26 08:24:47,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:24:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 08:24:47,161 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2018-09-26 08:24:47,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:47,161 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 08:24:47,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:24:47,161 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 08:24:47,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:24:47,162 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:47,162 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2018-09-26 08:24:47,163 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:47,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:47,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2018-09-26 08:24:47,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:47,300 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:47,300 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:24:47,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:24:47,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:24:47,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=169, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:24:47,304 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 18 states. [2018-09-26 08:24:47,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:47,531 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-26 08:24:47,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:24:47,531 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-09-26 08:24:47,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:47,532 INFO L225 Difference]: With dead ends: 80 [2018-09-26 08:24:47,532 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:24:47,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=377, Invalid=615, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:24:47,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:24:47,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-09-26 08:24:47,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:24:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-26 08:24:47,579 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2018-09-26 08:24:47,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:47,580 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-26 08:24:47,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:24:47,580 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-26 08:24:47,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 08:24:47,582 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:47,583 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2018-09-26 08:24:47,583 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:47,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:47,585 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2018-09-26 08:24:47,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:47,727 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:47,727 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:24:47,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:24:47,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:24:47,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=188, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:24:47,728 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 19 states. [2018-09-26 08:24:47,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:47,975 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-26 08:24:47,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:24:47,976 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2018-09-26 08:24:47,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:47,977 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:24:47,977 INFO L226 Difference]: Without dead ends: 84 [2018-09-26 08:24:47,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=426, Invalid=696, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:24:47,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-26 08:24:48,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-09-26 08:24:48,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:24:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 08:24:48,034 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2018-09-26 08:24:48,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:48,034 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 08:24:48,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:24:48,034 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 08:24:48,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:24:48,038 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:48,038 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2018-09-26 08:24:48,038 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:48,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:48,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2018-09-26 08:24:48,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:48,173 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:48,174 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:24:48,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:24:48,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:24:48,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=208, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:24:48,175 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 20 states. [2018-09-26 08:24:48,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:48,410 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-26 08:24:48,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:24:48,410 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 80 [2018-09-26 08:24:48,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:48,411 INFO L225 Difference]: With dead ends: 90 [2018-09-26 08:24:48,411 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:24:48,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=478, Invalid=782, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:24:48,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:24:48,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-09-26 08:24:48,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 08:24:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-26 08:24:48,466 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2018-09-26 08:24:48,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:48,467 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-26 08:24:48,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:24:48,467 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-26 08:24:48,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-26 08:24:48,467 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:48,468 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2018-09-26 08:24:48,468 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:48,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:48,468 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2018-09-26 08:24:48,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:48,613 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:48,613 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:48,613 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:24:48,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:24:48,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:24:48,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=229, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:24:48,615 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 21 states. [2018-09-26 08:24:48,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:48,895 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-26 08:24:48,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:24:48,896 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 85 [2018-09-26 08:24:48,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:48,896 INFO L225 Difference]: With dead ends: 95 [2018-09-26 08:24:48,897 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 08:24:48,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=533, Invalid=873, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:24:48,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 08:24:48,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-09-26 08:24:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:24:48,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-26 08:24:48,959 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2018-09-26 08:24:48,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:48,959 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-26 08:24:48,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:24:48,960 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-26 08:24:48,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:24:48,960 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:48,960 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2018-09-26 08:24:48,961 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:48,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:48,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2018-09-26 08:24:48,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:49,171 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:49,171 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:49,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:24:49,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:24:49,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:24:49,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=251, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:24:49,173 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 22 states. [2018-09-26 08:24:49,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:49,477 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-26 08:24:49,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:24:49,477 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 90 [2018-09-26 08:24:49,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:49,478 INFO L225 Difference]: With dead ends: 100 [2018-09-26 08:24:49,478 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:24:49,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=591, Invalid=969, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:24:49,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:24:49,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-09-26 08:24:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-26 08:24:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-26 08:24:49,555 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2018-09-26 08:24:49,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:49,555 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-26 08:24:49,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:24:49,555 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-26 08:24:49,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-26 08:24:49,556 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:49,556 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2018-09-26 08:24:49,557 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:49,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:49,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2018-09-26 08:24:49,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:49,772 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:49,772 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:24:49,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:24:49,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:24:49,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:24:49,776 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 23 states. [2018-09-26 08:24:50,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:50,142 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-26 08:24:50,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:24:50,143 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 95 [2018-09-26 08:24:50,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:50,144 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:24:50,144 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 08:24:50,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=652, Invalid=1070, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:24:50,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 08:24:50,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-09-26 08:24:50,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:24:50,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 08:24:50,212 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2018-09-26 08:24:50,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:50,213 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 08:24:50,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:24:50,213 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 08:24:50,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:24:50,214 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:50,214 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2018-09-26 08:24:50,214 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:50,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:50,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2018-09-26 08:24:50,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:50,371 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:50,371 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:24:50,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:24:50,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:24:50,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=298, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:24:50,372 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 24 states. [2018-09-26 08:24:50,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:50,673 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-09-26 08:24:50,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:24:50,673 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-09-26 08:24:50,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:50,674 INFO L225 Difference]: With dead ends: 110 [2018-09-26 08:24:50,674 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 08:24:50,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=716, Invalid=1176, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:24:50,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 08:24:50,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-09-26 08:24:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-26 08:24:50,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-09-26 08:24:50,744 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2018-09-26 08:24:50,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:50,744 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-09-26 08:24:50,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:24:50,745 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-09-26 08:24:50,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-26 08:24:50,746 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:50,746 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2018-09-26 08:24:50,746 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:50,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:50,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2018-09-26 08:24:50,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:50,908 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:50,908 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:24:50,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:24:50,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:24:50,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=323, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:24:50,910 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 25 states. [2018-09-26 08:24:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:51,212 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-26 08:24:51,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:24:51,213 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 105 [2018-09-26 08:24:51,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:51,214 INFO L225 Difference]: With dead ends: 115 [2018-09-26 08:24:51,214 INFO L226 Difference]: Without dead ends: 114 [2018-09-26 08:24:51,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=783, Invalid=1287, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:24:51,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-26 08:24:51,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-09-26 08:24:51,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:24:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-09-26 08:24:51,290 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2018-09-26 08:24:51,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:51,290 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-09-26 08:24:51,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:24:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-09-26 08:24:51,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:24:51,292 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:51,292 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2018-09-26 08:24:51,293 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:51,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:51,293 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2018-09-26 08:24:51,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:51,470 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:51,470 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:24:51,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:24:51,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:24:51,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=349, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:24:51,472 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 26 states. [2018-09-26 08:24:51,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:51,785 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-09-26 08:24:51,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:24:51,786 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 110 [2018-09-26 08:24:51,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:51,787 INFO L225 Difference]: With dead ends: 120 [2018-09-26 08:24:51,787 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 08:24:51,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=853, Invalid=1403, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:24:51,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 08:24:51,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-09-26 08:24:51,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-26 08:24:51,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-09-26 08:24:51,858 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2018-09-26 08:24:51,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:51,859 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-09-26 08:24:51,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:24:51,859 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-09-26 08:24:51,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-26 08:24:51,860 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:51,860 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2018-09-26 08:24:51,861 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:51,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:51,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2018-09-26 08:24:51,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:52,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:52,042 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:52,042 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:24:52,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:24:52,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:24:52,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=376, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:24:52,044 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 27 states. [2018-09-26 08:24:52,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:52,404 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-09-26 08:24:52,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:24:52,405 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 115 [2018-09-26 08:24:52,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:52,406 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:24:52,406 INFO L226 Difference]: Without dead ends: 124 [2018-09-26 08:24:52,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=926, Invalid=1524, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:24:52,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-26 08:24:52,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-09-26 08:24:52,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:24:52,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-26 08:24:52,509 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2018-09-26 08:24:52,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:52,510 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-26 08:24:52,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:24:52,510 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-26 08:24:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 08:24:52,511 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:52,512 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2018-09-26 08:24:52,512 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:52,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:52,512 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2018-09-26 08:24:52,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:52,755 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:52,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:24:52,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:24:52,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:24:52,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=404, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:24:52,757 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 28 states. [2018-09-26 08:24:53,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:53,152 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-09-26 08:24:53,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:24:53,152 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 120 [2018-09-26 08:24:53,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:53,154 INFO L225 Difference]: With dead ends: 130 [2018-09-26 08:24:53,154 INFO L226 Difference]: Without dead ends: 129 [2018-09-26 08:24:53,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1002, Invalid=1650, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:24:53,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-26 08:24:53,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-09-26 08:24:53,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-09-26 08:24:53,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-09-26 08:24:53,234 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2018-09-26 08:24:53,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:53,234 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-09-26 08:24:53,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:24:53,235 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-09-26 08:24:53,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-26 08:24:53,236 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:53,236 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2018-09-26 08:24:53,236 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:53,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:53,237 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2018-09-26 08:24:53,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:53,429 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:53,429 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:24:53,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:24:53,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:24:53,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=433, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:24:53,431 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 29 states. [2018-09-26 08:24:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:53,782 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-26 08:24:53,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:24:53,782 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 125 [2018-09-26 08:24:53,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:53,783 INFO L225 Difference]: With dead ends: 135 [2018-09-26 08:24:53,783 INFO L226 Difference]: Without dead ends: 134 [2018-09-26 08:24:53,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1081, Invalid=1781, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:24:53,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-26 08:24:53,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2018-09-26 08:24:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:24:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-09-26 08:24:53,873 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2018-09-26 08:24:53,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:53,873 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-09-26 08:24:53,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:24:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-09-26 08:24:53,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:24:53,875 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:53,875 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2018-09-26 08:24:53,875 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:53,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:53,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2018-09-26 08:24:53,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:54,078 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:54,078 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:24:54,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:24:54,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:24:54,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=463, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:24:54,080 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 30 states. [2018-09-26 08:24:54,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:54,463 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-09-26 08:24:54,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:24:54,464 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 130 [2018-09-26 08:24:54,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:54,465 INFO L225 Difference]: With dead ends: 140 [2018-09-26 08:24:54,465 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:24:54,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1163, Invalid=1917, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:24:54,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:24:54,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2018-09-26 08:24:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-09-26 08:24:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-09-26 08:24:54,570 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2018-09-26 08:24:54,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:54,570 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-09-26 08:24:54,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:24:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-09-26 08:24:54,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-09-26 08:24:54,572 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:54,572 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2018-09-26 08:24:54,572 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:54,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:54,573 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2018-09-26 08:24:54,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:54,790 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:54,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:24:54,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:24:54,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:24:54,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=494, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:24:54,792 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 31 states. [2018-09-26 08:24:55,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:55,209 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-09-26 08:24:55,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:24:55,210 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 135 [2018-09-26 08:24:55,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:55,211 INFO L225 Difference]: With dead ends: 145 [2018-09-26 08:24:55,211 INFO L226 Difference]: Without dead ends: 144 [2018-09-26 08:24:55,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1248, Invalid=2058, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:24:55,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-09-26 08:24:55,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2018-09-26 08:24:55,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 08:24:55,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-26 08:24:55,322 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2018-09-26 08:24:55,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:55,322 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-26 08:24:55,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:24:55,323 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-26 08:24:55,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:24:55,324 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:55,324 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2018-09-26 08:24:55,324 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:55,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:55,325 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2018-09-26 08:24:55,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:55,569 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:55,569 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:24:55,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:24:55,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:24:55,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=526, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:24:55,571 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 32 states. [2018-09-26 08:24:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:56,041 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-09-26 08:24:56,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:24:56,041 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 140 [2018-09-26 08:24:56,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:56,043 INFO L225 Difference]: With dead ends: 150 [2018-09-26 08:24:56,043 INFO L226 Difference]: Without dead ends: 149 [2018-09-26 08:24:56,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1336, Invalid=2204, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:24:56,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-26 08:24:56,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-09-26 08:24:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-26 08:24:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-09-26 08:24:56,184 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2018-09-26 08:24:56,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:56,185 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-09-26 08:24:56,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:24:56,185 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-09-26 08:24:56,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-26 08:24:56,186 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:56,187 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2018-09-26 08:24:56,187 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:56,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:56,187 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2018-09-26 08:24:56,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:56,398 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:56,398 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:24:56,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:24:56,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:24:56,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=497, Invalid=559, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:24:56,400 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 33 states. [2018-09-26 08:24:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:56,797 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-26 08:24:56,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:24:56,797 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 145 [2018-09-26 08:24:56,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:56,798 INFO L225 Difference]: With dead ends: 155 [2018-09-26 08:24:56,798 INFO L226 Difference]: Without dead ends: 154 [2018-09-26 08:24:56,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1427, Invalid=2355, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:24:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-26 08:24:56,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2018-09-26 08:24:56,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:24:56,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-09-26 08:24:56,909 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2018-09-26 08:24:56,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:56,910 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-09-26 08:24:56,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:24:56,910 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-09-26 08:24:56,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:24:56,911 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:56,911 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2018-09-26 08:24:56,912 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:56,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:56,912 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2018-09-26 08:24:56,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:57,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:57,132 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:57,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:24:57,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:24:57,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:24:57,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=593, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:24:57,134 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 34 states. [2018-09-26 08:24:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:57,544 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-09-26 08:24:57,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:24:57,545 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 150 [2018-09-26 08:24:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:57,546 INFO L225 Difference]: With dead ends: 160 [2018-09-26 08:24:57,546 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 08:24:57,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1521, Invalid=2511, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:24:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 08:24:57,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2018-09-26 08:24:57,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-09-26 08:24:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-09-26 08:24:57,663 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2018-09-26 08:24:57,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:57,664 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-09-26 08:24:57,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:24:57,665 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-09-26 08:24:57,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-09-26 08:24:57,666 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:57,666 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2018-09-26 08:24:57,667 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:57,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:57,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2018-09-26 08:24:57,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:57,878 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:57,878 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:24:57,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:24:57,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:24:57,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=562, Invalid=628, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:24:57,880 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 35 states. [2018-09-26 08:24:58,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:58,312 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-09-26 08:24:58,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:24:58,313 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 155 [2018-09-26 08:24:58,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:58,314 INFO L225 Difference]: With dead ends: 165 [2018-09-26 08:24:58,314 INFO L226 Difference]: Without dead ends: 164 [2018-09-26 08:24:58,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1618, Invalid=2672, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:24:58,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-26 08:24:58,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2018-09-26 08:24:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:24:58,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-26 08:24:58,448 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2018-09-26 08:24:58,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:58,448 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-26 08:24:58,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:24:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-26 08:24:58,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:24:58,451 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:58,451 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2018-09-26 08:24:58,451 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:58,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:58,452 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2018-09-26 08:24:58,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:58,797 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:58,797 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:24:58,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:24:58,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:24:58,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=596, Invalid=664, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:24:58,801 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 36 states. [2018-09-26 08:24:59,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:59,243 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-09-26 08:24:59,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:24:59,243 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 160 [2018-09-26 08:24:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:59,245 INFO L225 Difference]: With dead ends: 170 [2018-09-26 08:24:59,245 INFO L226 Difference]: Without dead ends: 169 [2018-09-26 08:24:59,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1718, Invalid=2838, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:24:59,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-26 08:24:59,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2018-09-26 08:24:59,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-26 08:24:59,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-09-26 08:24:59,392 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2018-09-26 08:24:59,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:59,392 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-09-26 08:24:59,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:24:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-09-26 08:24:59,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-26 08:24:59,394 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:59,395 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2018-09-26 08:24:59,395 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:24:59,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:59,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2018-09-26 08:24:59,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:59,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:59,636 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:59,636 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:24:59,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:24:59,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:24:59,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=631, Invalid=701, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:24:59,637 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 37 states. [2018-09-26 08:25:00,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:00,093 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-26 08:25:00,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:25:00,094 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 165 [2018-09-26 08:25:00,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:00,096 INFO L225 Difference]: With dead ends: 175 [2018-09-26 08:25:00,096 INFO L226 Difference]: Without dead ends: 174 [2018-09-26 08:25:00,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1821, Invalid=3009, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:25:00,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-26 08:25:00,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2018-09-26 08:25:00,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 08:25:00,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-09-26 08:25:00,246 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2018-09-26 08:25:00,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:00,246 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-09-26 08:25:00,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:25:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-09-26 08:25:00,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 08:25:00,248 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:00,248 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2018-09-26 08:25:00,248 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:00,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:00,249 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2018-09-26 08:25:00,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:00,502 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:00,503 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:25:00,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:25:00,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:25:00,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=739, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:25:00,504 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 38 states. [2018-09-26 08:25:01,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:01,009 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-09-26 08:25:01,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:25:01,009 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 170 [2018-09-26 08:25:01,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:01,011 INFO L225 Difference]: With dead ends: 180 [2018-09-26 08:25:01,011 INFO L226 Difference]: Without dead ends: 179 [2018-09-26 08:25:01,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1927, Invalid=3185, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:25:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-26 08:25:01,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2018-09-26 08:25:01,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-09-26 08:25:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-09-26 08:25:01,182 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2018-09-26 08:25:01,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:01,183 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-09-26 08:25:01,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:25:01,183 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-09-26 08:25:01,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-26 08:25:01,185 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:01,185 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2018-09-26 08:25:01,186 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:01,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:01,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2018-09-26 08:25:01,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:01,505 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:01,506 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:25:01,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:25:01,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:25:01,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=778, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:25:01,507 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 39 states. [2018-09-26 08:25:02,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:02,125 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-09-26 08:25:02,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:25:02,125 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 175 [2018-09-26 08:25:02,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:02,127 INFO L225 Difference]: With dead ends: 185 [2018-09-26 08:25:02,127 INFO L226 Difference]: Without dead ends: 184 [2018-09-26 08:25:02,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2036, Invalid=3366, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:25:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-26 08:25:02,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-09-26 08:25:02,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 08:25:02,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-26 08:25:02,305 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2018-09-26 08:25:02,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:02,305 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-26 08:25:02,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:25:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-26 08:25:02,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 08:25:02,310 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:02,310 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2018-09-26 08:25:02,310 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:02,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:02,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2018-09-26 08:25:02,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:02,617 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:02,617 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:25:02,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:25:02,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:25:02,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=818, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:25:02,619 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 40 states. [2018-09-26 08:25:03,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:03,132 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-09-26 08:25:03,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:25:03,133 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 180 [2018-09-26 08:25:03,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:03,134 INFO L225 Difference]: With dead ends: 190 [2018-09-26 08:25:03,134 INFO L226 Difference]: Without dead ends: 189 [2018-09-26 08:25:03,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2148, Invalid=3552, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:25:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-09-26 08:25:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2018-09-26 08:25:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-09-26 08:25:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-09-26 08:25:03,308 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2018-09-26 08:25:03,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:03,309 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-09-26 08:25:03,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:25:03,309 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-09-26 08:25:03,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-26 08:25:03,311 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:03,312 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2018-09-26 08:25:03,312 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:03,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:03,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2018-09-26 08:25:03,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:03,624 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:03,624 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:25:03,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:25:03,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:25:03,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=781, Invalid=859, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:25:03,626 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 41 states. [2018-09-26 08:25:04,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:04,190 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-26 08:25:04,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:25:04,191 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 185 [2018-09-26 08:25:04,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:04,192 INFO L225 Difference]: With dead ends: 195 [2018-09-26 08:25:04,192 INFO L226 Difference]: Without dead ends: 194 [2018-09-26 08:25:04,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2263, Invalid=3743, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:25:04,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-26 08:25:04,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-09-26 08:25:04,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-26 08:25:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-09-26 08:25:04,396 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2018-09-26 08:25:04,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:04,396 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-09-26 08:25:04,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:25:04,397 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-09-26 08:25:04,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-26 08:25:04,399 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:04,399 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2018-09-26 08:25:04,399 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:04,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:04,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2018-09-26 08:25:04,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:04,719 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:04,720 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:25:04,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:25:04,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:25:04,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=821, Invalid=901, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:25:04,721 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 42 states. [2018-09-26 08:25:05,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:05,305 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-09-26 08:25:05,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:25:05,306 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 190 [2018-09-26 08:25:05,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:05,307 INFO L225 Difference]: With dead ends: 200 [2018-09-26 08:25:05,307 INFO L226 Difference]: Without dead ends: 199 [2018-09-26 08:25:05,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2381, Invalid=3939, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:25:05,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-26 08:25:05,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2018-09-26 08:25:05,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-09-26 08:25:05,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-09-26 08:25:05,480 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2018-09-26 08:25:05,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:05,480 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-09-26 08:25:05,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:25:05,480 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-09-26 08:25:05,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-26 08:25:05,482 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:05,483 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2018-09-26 08:25:05,483 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:05,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:05,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2018-09-26 08:25:05,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:05,805 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:05,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:25:05,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:25:05,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:25:05,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=862, Invalid=944, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:25:05,807 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 43 states. [2018-09-26 08:25:06,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:06,405 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-09-26 08:25:06,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:25:06,405 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 195 [2018-09-26 08:25:06,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:06,407 INFO L225 Difference]: With dead ends: 205 [2018-09-26 08:25:06,407 INFO L226 Difference]: Without dead ends: 204 [2018-09-26 08:25:06,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2502, Invalid=4140, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:25:06,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-09-26 08:25:06,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2018-09-26 08:25:06,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 08:25:06,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-26 08:25:06,609 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2018-09-26 08:25:06,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:06,610 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-26 08:25:06,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:25:06,610 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-26 08:25:06,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-26 08:25:06,614 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:06,614 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2018-09-26 08:25:06,615 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:06,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:06,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2018-09-26 08:25:06,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:06,931 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:06,931 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:25:06,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:25:06,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:25:06,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=904, Invalid=988, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:25:06,933 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 44 states. [2018-09-26 08:25:07,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:07,509 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-09-26 08:25:07,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:25:07,509 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 200 [2018-09-26 08:25:07,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:07,511 INFO L225 Difference]: With dead ends: 210 [2018-09-26 08:25:07,511 INFO L226 Difference]: Without dead ends: 209 [2018-09-26 08:25:07,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2626, Invalid=4346, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:25:07,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-26 08:25:07,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2018-09-26 08:25:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-09-26 08:25:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-09-26 08:25:07,709 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2018-09-26 08:25:07,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:07,709 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-09-26 08:25:07,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:25:07,709 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-09-26 08:25:07,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-26 08:25:07,712 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:07,712 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2018-09-26 08:25:07,712 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:07,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:07,713 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2018-09-26 08:25:07,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:08,008 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:08,009 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:25:08,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:25:08,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:25:08,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=947, Invalid=1033, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:25:08,010 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 45 states. [2018-09-26 08:25:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:08,732 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-09-26 08:25:08,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:25:08,732 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 205 [2018-09-26 08:25:08,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:08,734 INFO L225 Difference]: With dead ends: 215 [2018-09-26 08:25:08,734 INFO L226 Difference]: Without dead ends: 214 [2018-09-26 08:25:08,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=2753, Invalid=4557, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:25:08,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-26 08:25:08,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2018-09-26 08:25:08,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-26 08:25:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-09-26 08:25:08,978 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2018-09-26 08:25:08,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:08,979 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-09-26 08:25:08,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:25:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-09-26 08:25:08,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-26 08:25:08,980 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:08,980 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2018-09-26 08:25:08,980 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:08,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:08,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2018-09-26 08:25:08,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:09,285 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:09,285 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:25:09,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:25:09,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:25:09,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=1079, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:25:09,286 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 46 states. [2018-09-26 08:25:09,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:09,825 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-09-26 08:25:09,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:25:09,826 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 210 [2018-09-26 08:25:09,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:09,828 INFO L225 Difference]: With dead ends: 220 [2018-09-26 08:25:09,828 INFO L226 Difference]: Without dead ends: 219 [2018-09-26 08:25:09,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2883, Invalid=4773, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:25:09,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-26 08:25:09,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2018-09-26 08:25:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-09-26 08:25:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-09-26 08:25:09,993 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2018-09-26 08:25:09,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:09,994 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-09-26 08:25:09,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:25:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-09-26 08:25:09,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-09-26 08:25:09,994 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:09,995 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2018-09-26 08:25:09,995 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:09,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:09,995 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2018-09-26 08:25:09,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:10,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:10,325 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:10,325 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:25:10,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:25:10,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:25:10,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1036, Invalid=1126, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:25:10,327 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 47 states. [2018-09-26 08:25:10,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:10,799 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-09-26 08:25:10,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:25:10,800 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 215 [2018-09-26 08:25:10,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:10,801 INFO L225 Difference]: With dead ends: 225 [2018-09-26 08:25:10,801 INFO L226 Difference]: Without dead ends: 224 [2018-09-26 08:25:10,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3016, Invalid=4994, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:25:10,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-09-26 08:25:10,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2018-09-26 08:25:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-26 08:25:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-26 08:25:10,961 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2018-09-26 08:25:10,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:10,961 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-26 08:25:10,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:25:10,961 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-26 08:25:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-26 08:25:10,962 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:10,962 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2018-09-26 08:25:10,963 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:10,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:10,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2018-09-26 08:25:10,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:11,328 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:11,328 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:25:11,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:25:11,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:25:11,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1082, Invalid=1174, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:25:11,330 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 48 states. [2018-09-26 08:25:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:12,036 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-09-26 08:25:12,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:25:12,037 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 220 [2018-09-26 08:25:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:12,038 INFO L225 Difference]: With dead ends: 230 [2018-09-26 08:25:12,038 INFO L226 Difference]: Without dead ends: 229 [2018-09-26 08:25:12,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3152, Invalid=5220, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:25:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-26 08:25:12,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-09-26 08:25:12,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-09-26 08:25:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-09-26 08:25:12,297 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2018-09-26 08:25:12,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:12,297 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-09-26 08:25:12,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:25:12,298 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-09-26 08:25:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-26 08:25:12,299 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:12,299 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2018-09-26 08:25:12,299 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:12,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:12,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2018-09-26 08:25:12,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:12,622 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:12,622 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:25:12,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:25:12,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:25:12,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1129, Invalid=1223, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:25:12,623 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 49 states. [2018-09-26 08:25:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:13,057 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-09-26 08:25:13,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:25:13,058 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 225 [2018-09-26 08:25:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:13,059 INFO L225 Difference]: With dead ends: 235 [2018-09-26 08:25:13,059 INFO L226 Difference]: Without dead ends: 234 [2018-09-26 08:25:13,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3291, Invalid=5451, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:25:13,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-26 08:25:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-09-26 08:25:13,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-09-26 08:25:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-09-26 08:25:13,210 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2018-09-26 08:25:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:13,211 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-09-26 08:25:13,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:25:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-09-26 08:25:13,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-26 08:25:13,211 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:13,212 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2018-09-26 08:25:13,212 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:13,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:13,212 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2018-09-26 08:25:13,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:13,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:13,535 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:13,535 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:25:13,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:25:13,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:25:13,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1177, Invalid=1273, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:25:13,536 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 50 states. [2018-09-26 08:25:14,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:14,004 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-09-26 08:25:14,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:25:14,005 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 230 [2018-09-26 08:25:14,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:14,006 INFO L225 Difference]: With dead ends: 240 [2018-09-26 08:25:14,007 INFO L226 Difference]: Without dead ends: 239 [2018-09-26 08:25:14,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3433, Invalid=5687, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:25:14,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-26 08:25:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2018-09-26 08:25:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-09-26 08:25:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-09-26 08:25:14,168 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2018-09-26 08:25:14,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:14,169 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-09-26 08:25:14,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:25:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-09-26 08:25:14,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-09-26 08:25:14,170 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:14,170 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2018-09-26 08:25:14,170 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:14,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:14,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2018-09-26 08:25:14,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:14,641 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:14,641 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:25:14,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:25:14,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:25:14,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1226, Invalid=1324, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:25:14,642 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 51 states. [2018-09-26 08:25:15,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:15,106 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-09-26 08:25:15,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:25:15,106 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 235 [2018-09-26 08:25:15,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:15,107 INFO L225 Difference]: With dead ends: 245 [2018-09-26 08:25:15,107 INFO L226 Difference]: Without dead ends: 244 [2018-09-26 08:25:15,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3578, Invalid=5928, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:25:15,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-09-26 08:25:15,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2018-09-26 08:25:15,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-26 08:25:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-09-26 08:25:15,331 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2018-09-26 08:25:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:15,331 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-09-26 08:25:15,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:25:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-09-26 08:25:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-26 08:25:15,333 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:15,333 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2018-09-26 08:25:15,333 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:15,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:15,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2018-09-26 08:25:15,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:15,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:15,728 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:15,728 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:25:15,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:25:15,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:25:15,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1276, Invalid=1376, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:25:15,729 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 52 states. [2018-09-26 08:25:16,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:16,339 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-09-26 08:25:16,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:25:16,339 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 240 [2018-09-26 08:25:16,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:16,341 INFO L225 Difference]: With dead ends: 250 [2018-09-26 08:25:16,341 INFO L226 Difference]: Without dead ends: 249 [2018-09-26 08:25:16,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3726, Invalid=6174, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:25:16,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-09-26 08:25:16,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2018-09-26 08:25:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-09-26 08:25:16,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-09-26 08:25:16,556 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2018-09-26 08:25:16,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:16,556 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-09-26 08:25:16,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:25:16,556 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-09-26 08:25:16,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-09-26 08:25:16,558 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:16,558 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2018-09-26 08:25:16,559 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:16,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:16,559 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2018-09-26 08:25:16,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:16,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:16,974 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:16,974 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:25:16,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:25:16,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:25:16,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1327, Invalid=1429, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:25:16,976 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 53 states. [2018-09-26 08:25:17,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:17,632 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-09-26 08:25:17,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:25:17,632 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 245 [2018-09-26 08:25:17,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:17,634 INFO L225 Difference]: With dead ends: 255 [2018-09-26 08:25:17,634 INFO L226 Difference]: Without dead ends: 254 [2018-09-26 08:25:17,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3877, Invalid=6425, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:25:17,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-09-26 08:25:17,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2018-09-26 08:25:17,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-26 08:25:17,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-09-26 08:25:17,841 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2018-09-26 08:25:17,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:17,842 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-09-26 08:25:17,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:25:17,842 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-09-26 08:25:17,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-26 08:25:17,843 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:17,844 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2018-09-26 08:25:17,844 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:17,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:17,844 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2018-09-26 08:25:17,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:18,142 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:18,142 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:25:18,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:25:18,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:25:18,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1379, Invalid=1483, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:25:18,144 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 54 states. [2018-09-26 08:25:18,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:18,816 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-09-26 08:25:18,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:25:18,816 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 250 [2018-09-26 08:25:18,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:18,818 INFO L225 Difference]: With dead ends: 260 [2018-09-26 08:25:18,818 INFO L226 Difference]: Without dead ends: 259 [2018-09-26 08:25:18,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4031, Invalid=6681, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:25:18,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-26 08:25:19,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2018-09-26 08:25:19,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-09-26 08:25:19,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-09-26 08:25:19,034 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2018-09-26 08:25:19,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:19,034 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-09-26 08:25:19,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:25:19,034 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-09-26 08:25:19,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-09-26 08:25:19,035 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:19,035 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2018-09-26 08:25:19,036 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:19,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:19,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2018-09-26 08:25:19,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:19,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:19,329 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:19,329 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:25:19,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:25:19,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:25:19,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1432, Invalid=1538, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:25:19,331 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 55 states. [2018-09-26 08:25:19,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:19,932 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-09-26 08:25:19,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:25:19,933 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 255 [2018-09-26 08:25:19,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:19,934 INFO L225 Difference]: With dead ends: 265 [2018-09-26 08:25:19,935 INFO L226 Difference]: Without dead ends: 264 [2018-09-26 08:25:19,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1474 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4188, Invalid=6942, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:25:19,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-09-26 08:25:20,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2018-09-26 08:25:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-26 08:25:20,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-09-26 08:25:20,137 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2018-09-26 08:25:20,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:20,137 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-09-26 08:25:20,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:25:20,137 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-09-26 08:25:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-26 08:25:20,138 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:20,139 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2018-09-26 08:25:20,139 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:20,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:20,139 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2018-09-26 08:25:20,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:20,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:20,547 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:20,547 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:25:20,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:25:20,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:25:20,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1486, Invalid=1594, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:25:20,548 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 56 states. [2018-09-26 08:25:21,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:21,109 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-09-26 08:25:21,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:25:21,110 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 260 [2018-09-26 08:25:21,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:21,111 INFO L225 Difference]: With dead ends: 270 [2018-09-26 08:25:21,112 INFO L226 Difference]: Without dead ends: 269 [2018-09-26 08:25:21,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1529 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4348, Invalid=7208, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:25:21,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-09-26 08:25:21,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2018-09-26 08:25:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-09-26 08:25:21,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-09-26 08:25:21,367 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2018-09-26 08:25:21,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:21,368 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-09-26 08:25:21,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:25:21,368 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-09-26 08:25:21,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-09-26 08:25:21,369 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:21,369 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2018-09-26 08:25:21,369 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:21,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:21,369 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2018-09-26 08:25:21,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:21,666 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:21,666 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:25:21,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:25:21,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:25:21,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1541, Invalid=1651, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:25:21,667 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 57 states. [2018-09-26 08:25:22,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:22,285 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-09-26 08:25:22,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:25:22,285 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 265 [2018-09-26 08:25:22,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:22,286 INFO L225 Difference]: With dead ends: 275 [2018-09-26 08:25:22,286 INFO L226 Difference]: Without dead ends: 274 [2018-09-26 08:25:22,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4511, Invalid=7479, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:25:22,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-26 08:25:22,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2018-09-26 08:25:22,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-09-26 08:25:22,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-09-26 08:25:22,497 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2018-09-26 08:25:22,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:22,497 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-09-26 08:25:22,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:25:22,497 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-09-26 08:25:22,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-09-26 08:25:22,499 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:22,499 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2018-09-26 08:25:22,499 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:22,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:22,499 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2018-09-26 08:25:22,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:22,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:22,866 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:22,866 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:25:22,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:25:22,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:25:22,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1597, Invalid=1709, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:25:22,867 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 58 states. [2018-09-26 08:25:23,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:23,746 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-09-26 08:25:23,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:25:23,746 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 270 [2018-09-26 08:25:23,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:23,748 INFO L225 Difference]: With dead ends: 280 [2018-09-26 08:25:23,748 INFO L226 Difference]: Without dead ends: 279 [2018-09-26 08:25:23,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1642 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4677, Invalid=7755, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:25:23,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-09-26 08:25:24,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2018-09-26 08:25:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-09-26 08:25:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-09-26 08:25:24,158 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2018-09-26 08:25:24,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:24,158 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-09-26 08:25:24,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:25:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-09-26 08:25:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-09-26 08:25:24,160 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:24,160 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2018-09-26 08:25:24,161 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:24,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:24,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2018-09-26 08:25:24,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:24,627 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:24,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:25:24,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:25:24,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:25:24,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1654, Invalid=1768, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:25:24,628 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 59 states. [2018-09-26 08:25:25,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:25,218 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-09-26 08:25:25,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:25:25,218 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 275 [2018-09-26 08:25:25,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:25,220 INFO L225 Difference]: With dead ends: 285 [2018-09-26 08:25:25,220 INFO L226 Difference]: Without dead ends: 284 [2018-09-26 08:25:25,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1700 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4846, Invalid=8036, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:25:25,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-09-26 08:25:25,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2018-09-26 08:25:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-26 08:25:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-09-26 08:25:25,621 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2018-09-26 08:25:25,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:25,622 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-09-26 08:25:25,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:25:25,622 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-09-26 08:25:25,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-26 08:25:25,624 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:25,624 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2018-09-26 08:25:25,624 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:25,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:25,625 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2018-09-26 08:25:25,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:26,043 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:26,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:25:26,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:25:26,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:25:26,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1712, Invalid=1828, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:25:26,044 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 60 states. [2018-09-26 08:25:26,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:26,713 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-09-26 08:25:26,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:25:26,713 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 280 [2018-09-26 08:25:26,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:26,715 INFO L225 Difference]: With dead ends: 290 [2018-09-26 08:25:26,715 INFO L226 Difference]: Without dead ends: 289 [2018-09-26 08:25:26,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1759 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5018, Invalid=8322, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:25:26,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-09-26 08:25:27,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2018-09-26 08:25:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-09-26 08:25:27,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2018-09-26 08:25:27,056 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2018-09-26 08:25:27,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:27,057 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2018-09-26 08:25:27,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:25:27,057 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2018-09-26 08:25:27,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-09-26 08:25:27,058 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:27,059 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2018-09-26 08:25:27,059 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:27,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:27,059 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2018-09-26 08:25:27,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:27,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:27,481 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:27,481 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:25:27,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:25:27,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:25:27,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1771, Invalid=1889, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:25:27,483 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 61 states. [2018-09-26 08:25:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:28,159 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-09-26 08:25:28,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:25:28,160 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 285 [2018-09-26 08:25:28,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:28,161 INFO L225 Difference]: With dead ends: 295 [2018-09-26 08:25:28,161 INFO L226 Difference]: Without dead ends: 294 [2018-09-26 08:25:28,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5193, Invalid=8613, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:25:28,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-09-26 08:25:28,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2018-09-26 08:25:28,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-09-26 08:25:28,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-09-26 08:25:28,399 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2018-09-26 08:25:28,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:28,399 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-09-26 08:25:28,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:25:28,399 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-09-26 08:25:28,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-09-26 08:25:28,401 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:28,401 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2018-09-26 08:25:28,401 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:28,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:28,401 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2018-09-26 08:25:28,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:28,750 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:28,750 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:25:28,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:25:28,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:25:28,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1831, Invalid=1951, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:25:28,751 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 62 states. [2018-09-26 08:25:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:29,483 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-09-26 08:25:29,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:25:29,483 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 290 [2018-09-26 08:25:29,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:29,485 INFO L225 Difference]: With dead ends: 300 [2018-09-26 08:25:29,485 INFO L226 Difference]: Without dead ends: 299 [2018-09-26 08:25:29,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5371, Invalid=8909, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:25:29,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-09-26 08:25:29,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2018-09-26 08:25:29,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-09-26 08:25:29,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-09-26 08:25:29,730 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2018-09-26 08:25:29,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:29,730 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-09-26 08:25:29,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:25:29,731 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-09-26 08:25:29,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-09-26 08:25:29,732 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:29,732 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2018-09-26 08:25:29,732 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:29,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:29,732 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2018-09-26 08:25:29,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:30,141 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:30,141 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:25:30,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:25:30,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:25:30,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=2014, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:25:30,142 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 63 states. [2018-09-26 08:25:30,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:30,838 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-09-26 08:25:30,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:25:30,838 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 295 [2018-09-26 08:25:30,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:30,840 INFO L225 Difference]: With dead ends: 305 [2018-09-26 08:25:30,840 INFO L226 Difference]: Without dead ends: 304 [2018-09-26 08:25:30,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1942 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5552, Invalid=9210, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:25:30,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-09-26 08:25:31,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2018-09-26 08:25:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-26 08:25:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-09-26 08:25:31,103 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2018-09-26 08:25:31,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:31,104 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-09-26 08:25:31,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:25:31,104 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-09-26 08:25:31,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-26 08:25:31,105 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:31,106 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2018-09-26 08:25:31,106 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:31,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:31,106 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2018-09-26 08:25:31,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:31,504 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:31,505 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:25:31,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:25:31,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:25:31,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1954, Invalid=2078, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:25:31,506 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 64 states. [2018-09-26 08:25:32,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:32,195 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2018-09-26 08:25:32,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:25:32,195 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 300 [2018-09-26 08:25:32,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:32,196 INFO L225 Difference]: With dead ends: 310 [2018-09-26 08:25:32,196 INFO L226 Difference]: Without dead ends: 309 [2018-09-26 08:25:32,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2005 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5736, Invalid=9516, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:25:32,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-09-26 08:25:32,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2018-09-26 08:25:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-09-26 08:25:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2018-09-26 08:25:32,454 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2018-09-26 08:25:32,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:32,454 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2018-09-26 08:25:32,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:25:32,454 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2018-09-26 08:25:32,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-09-26 08:25:32,456 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:32,456 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2018-09-26 08:25:32,456 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:32,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:32,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1323673213, now seen corresponding path program 60 times [2018-09-26 08:25:32,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:32,893 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:32,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:25:32,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:25:32,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:25:32,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:25:32,895 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 65 states. [2018-09-26 08:25:33,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:33,807 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-09-26 08:25:33,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:25:33,808 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 305 [2018-09-26 08:25:33,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:33,809 INFO L225 Difference]: With dead ends: 315 [2018-09-26 08:25:33,809 INFO L226 Difference]: Without dead ends: 314 [2018-09-26 08:25:33,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2069 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=5923, Invalid=9827, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:25:33,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-09-26 08:25:34,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 311. [2018-09-26 08:25:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-09-26 08:25:34,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-09-26 08:25:34,081 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 305 [2018-09-26 08:25:34,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:34,081 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-09-26 08:25:34,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:25:34,081 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-09-26 08:25:34,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-09-26 08:25:34,082 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:34,082 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1] [2018-09-26 08:25:34,083 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:34,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:34,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1329421197, now seen corresponding path program 61 times [2018-09-26 08:25:34,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:34,554 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:34,554 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:25:34,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:25:34,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:25:34,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:25:34,557 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 66 states. [2018-09-26 08:25:35,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:35,296 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2018-09-26 08:25:35,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:25:35,296 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 310 [2018-09-26 08:25:35,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:35,298 INFO L225 Difference]: With dead ends: 320 [2018-09-26 08:25:35,298 INFO L226 Difference]: Without dead ends: 319 [2018-09-26 08:25:35,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6113, Invalid=10143, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:25:35,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-09-26 08:25:35,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2018-09-26 08:25:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-09-26 08:25:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2018-09-26 08:25:35,571 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 310 [2018-09-26 08:25:35,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:35,572 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2018-09-26 08:25:35,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:25:35,572 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2018-09-26 08:25:35,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-09-26 08:25:35,573 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:35,574 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1] [2018-09-26 08:25:35,574 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:35,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:35,574 INFO L82 PathProgramCache]: Analyzing trace with hash 440643459, now seen corresponding path program 62 times [2018-09-26 08:25:35,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:36,016 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:36,016 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:25:36,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:25:36,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:25:36,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2146, Invalid=2276, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:25:36,018 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 67 states. [2018-09-26 08:25:36,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:36,817 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-09-26 08:25:36,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:25:36,818 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 315 [2018-09-26 08:25:36,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:36,819 INFO L225 Difference]: With dead ends: 325 [2018-09-26 08:25:36,819 INFO L226 Difference]: Without dead ends: 324 [2018-09-26 08:25:36,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2200 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6306, Invalid=10464, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:25:36,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-09-26 08:25:37,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 321. [2018-09-26 08:25:37,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-09-26 08:25:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-09-26 08:25:37,106 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 315 [2018-09-26 08:25:37,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:37,106 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-09-26 08:25:37,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:25:37,106 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-09-26 08:25:37,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-09-26 08:25:37,108 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:37,108 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1] [2018-09-26 08:25:37,108 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:37,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:37,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1509887603, now seen corresponding path program 63 times [2018-09-26 08:25:37,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:37,523 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:37,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:25:37,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:25:37,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:25:37,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2212, Invalid=2344, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:25:37,524 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 68 states. [2018-09-26 08:25:38,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:38,313 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2018-09-26 08:25:38,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:25:38,313 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 320 [2018-09-26 08:25:38,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:38,315 INFO L225 Difference]: With dead ends: 330 [2018-09-26 08:25:38,315 INFO L226 Difference]: Without dead ends: 329 [2018-09-26 08:25:38,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6502, Invalid=10790, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:25:38,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-09-26 08:25:38,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2018-09-26 08:25:38,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-09-26 08:25:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2018-09-26 08:25:38,608 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 320 [2018-09-26 08:25:38,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:38,609 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2018-09-26 08:25:38,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:25:38,609 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2018-09-26 08:25:38,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-09-26 08:25:38,610 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:38,610 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1] [2018-09-26 08:25:38,610 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:38,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:38,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1204189821, now seen corresponding path program 64 times [2018-09-26 08:25:38,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:39,112 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:39,112 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:25:39,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:25:39,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:25:39,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2279, Invalid=2413, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:25:39,114 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 69 states. [2018-09-26 08:25:39,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:39,967 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-09-26 08:25:39,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:25:39,967 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 325 [2018-09-26 08:25:39,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:39,969 INFO L225 Difference]: With dead ends: 335 [2018-09-26 08:25:39,969 INFO L226 Difference]: Without dead ends: 334 [2018-09-26 08:25:39,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2335 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6701, Invalid=11121, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:25:39,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-09-26 08:25:40,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2018-09-26 08:25:40,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-09-26 08:25:40,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-09-26 08:25:40,393 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 325 [2018-09-26 08:25:40,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:40,393 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-09-26 08:25:40,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:25:40,394 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-09-26 08:25:40,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-09-26 08:25:40,395 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:40,396 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1] [2018-09-26 08:25:40,396 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:40,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:40,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1514076275, now seen corresponding path program 65 times [2018-09-26 08:25:40,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:40,951 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:40,951 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:25:40,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:25:40,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:25:40,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2347, Invalid=2483, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:25:40,952 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 70 states. [2018-09-26 08:25:41,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:41,776 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2018-09-26 08:25:41,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:25:41,776 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 330 [2018-09-26 08:25:41,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:41,778 INFO L225 Difference]: With dead ends: 340 [2018-09-26 08:25:41,778 INFO L226 Difference]: Without dead ends: 339 [2018-09-26 08:25:41,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2404 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6903, Invalid=11457, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:25:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-09-26 08:25:42,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2018-09-26 08:25:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-09-26 08:25:42,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2018-09-26 08:25:42,125 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 330 [2018-09-26 08:25:42,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:42,125 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2018-09-26 08:25:42,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:25:42,125 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2018-09-26 08:25:42,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-09-26 08:25:42,127 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:42,127 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1] [2018-09-26 08:25:42,127 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:42,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:42,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1432083331, now seen corresponding path program 66 times [2018-09-26 08:25:42,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:42,600 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:42,600 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:25:42,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:25:42,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:25:42,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2416, Invalid=2554, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:25:42,602 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 71 states. [2018-09-26 08:25:43,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:43,484 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-09-26 08:25:43,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:25:43,484 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 335 [2018-09-26 08:25:43,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:43,486 INFO L225 Difference]: With dead ends: 345 [2018-09-26 08:25:43,486 INFO L226 Difference]: Without dead ends: 344 [2018-09-26 08:25:43,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2474 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7108, Invalid=11798, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:25:43,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-09-26 08:25:43,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2018-09-26 08:25:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-09-26 08:25:43,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2018-09-26 08:25:43,817 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 335 [2018-09-26 08:25:43,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:43,818 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2018-09-26 08:25:43,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:25:43,818 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2018-09-26 08:25:43,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-09-26 08:25:43,819 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:43,820 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1] [2018-09-26 08:25:43,820 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:43,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:43,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1663197811, now seen corresponding path program 67 times [2018-09-26 08:25:43,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:44,362 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:44,362 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:25:44,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:25:44,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:25:44,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2486, Invalid=2626, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:25:44,364 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 72 states. [2018-09-26 08:25:45,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:45,236 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2018-09-26 08:25:45,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:25:45,237 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 340 [2018-09-26 08:25:45,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:45,238 INFO L225 Difference]: With dead ends: 350 [2018-09-26 08:25:45,238 INFO L226 Difference]: Without dead ends: 349 [2018-09-26 08:25:45,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2545 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7316, Invalid=12144, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:25:45,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-26 08:25:45,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2018-09-26 08:25:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-09-26 08:25:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2018-09-26 08:25:45,582 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 340 [2018-09-26 08:25:45,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:45,582 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2018-09-26 08:25:45,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:25:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2018-09-26 08:25:45,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-09-26 08:25:45,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:45,585 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1] [2018-09-26 08:25:45,585 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:45,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:45,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1141551491, now seen corresponding path program 68 times [2018-09-26 08:25:45,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:46,064 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:46,064 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:25:46,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:25:46,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:25:46,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2557, Invalid=2699, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:25:46,065 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 73 states. [2018-09-26 08:25:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:46,974 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-09-26 08:25:46,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:25:46,974 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 345 [2018-09-26 08:25:46,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:46,976 INFO L225 Difference]: With dead ends: 355 [2018-09-26 08:25:46,976 INFO L226 Difference]: Without dead ends: 354 [2018-09-26 08:25:46,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2617 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7527, Invalid=12495, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:25:46,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-09-26 08:25:47,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2018-09-26 08:25:47,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-09-26 08:25:47,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2018-09-26 08:25:47,334 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 345 [2018-09-26 08:25:47,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:47,334 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2018-09-26 08:25:47,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:25:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2018-09-26 08:25:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-09-26 08:25:47,336 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:47,336 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1] [2018-09-26 08:25:47,336 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:47,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:47,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1639363469, now seen corresponding path program 69 times [2018-09-26 08:25:47,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:47,913 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:47,913 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:25:47,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:25:47,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:25:47,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2629, Invalid=2773, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:25:47,915 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 74 states. [2018-09-26 08:25:48,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:48,826 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2018-09-26 08:25:48,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:25:48,826 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 350 [2018-09-26 08:25:48,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:48,828 INFO L225 Difference]: With dead ends: 360 [2018-09-26 08:25:48,829 INFO L226 Difference]: Without dead ends: 359 [2018-09-26 08:25:48,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2690 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=7741, Invalid=12851, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:25:48,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-09-26 08:25:49,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2018-09-26 08:25:49,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-26 08:25:49,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2018-09-26 08:25:49,189 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 350 [2018-09-26 08:25:49,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:49,189 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2018-09-26 08:25:49,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:25:49,190 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2018-09-26 08:25:49,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-09-26 08:25:49,191 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:49,192 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1] [2018-09-26 08:25:49,192 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:49,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:49,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1587939203, now seen corresponding path program 70 times [2018-09-26 08:25:49,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:49,923 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:49,923 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:25:49,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:25:49,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:25:49,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2702, Invalid=2848, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:25:49,924 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 75 states. [2018-09-26 08:25:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:50,933 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-09-26 08:25:50,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:25:50,933 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 355 [2018-09-26 08:25:50,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:50,934 INFO L225 Difference]: With dead ends: 365 [2018-09-26 08:25:50,935 INFO L226 Difference]: Without dead ends: 364 [2018-09-26 08:25:50,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2764 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=7958, Invalid=13212, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:25:50,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-09-26 08:25:51,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2018-09-26 08:25:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-09-26 08:25:51,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2018-09-26 08:25:51,334 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 355 [2018-09-26 08:25:51,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:51,334 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2018-09-26 08:25:51,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:25:51,335 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2018-09-26 08:25:51,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-09-26 08:25:51,336 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:51,337 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1] [2018-09-26 08:25:51,337 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:51,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:51,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1387022733, now seen corresponding path program 71 times [2018-09-26 08:25:51,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:51,903 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:51,903 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:51,903 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:25:51,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:25:51,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:25:51,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2776, Invalid=2924, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:25:51,905 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 76 states. [2018-09-26 08:25:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:52,856 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2018-09-26 08:25:52,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:25:52,857 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 360 [2018-09-26 08:25:52,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:52,858 INFO L225 Difference]: With dead ends: 370 [2018-09-26 08:25:52,858 INFO L226 Difference]: Without dead ends: 369 [2018-09-26 08:25:52,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2839 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=8178, Invalid=13578, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:25:52,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-09-26 08:25:53,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2018-09-26 08:25:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-09-26 08:25:53,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2018-09-26 08:25:53,244 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 360 [2018-09-26 08:25:53,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:53,245 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2018-09-26 08:25:53,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:25:53,245 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2018-09-26 08:25:53,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-09-26 08:25:53,246 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:53,247 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1] [2018-09-26 08:25:53,247 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:53,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:53,247 INFO L82 PathProgramCache]: Analyzing trace with hash 126737795, now seen corresponding path program 72 times [2018-09-26 08:25:53,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:53,790 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:53,790 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:53,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:25:53,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:25:53,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:25:53,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2851, Invalid=3001, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:25:53,792 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 77 states. [2018-09-26 08:25:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:54,832 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2018-09-26 08:25:54,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:25:54,832 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 365 [2018-09-26 08:25:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:54,833 INFO L225 Difference]: With dead ends: 375 [2018-09-26 08:25:54,833 INFO L226 Difference]: Without dead ends: 374 [2018-09-26 08:25:54,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2915 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=8401, Invalid=13949, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:25:54,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-09-26 08:25:55,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2018-09-26 08:25:55,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-09-26 08:25:55,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2018-09-26 08:25:55,259 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 365 [2018-09-26 08:25:55,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:55,260 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2018-09-26 08:25:55,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:25:55,260 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2018-09-26 08:25:55,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-09-26 08:25:55,261 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:55,262 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1] [2018-09-26 08:25:55,262 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:55,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:55,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1444831117, now seen corresponding path program 73 times [2018-09-26 08:25:55,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:55,837 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:55,837 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:25:55,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:25:55,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:25:55,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2927, Invalid=3079, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:25:55,838 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 78 states. [2018-09-26 08:25:56,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:56,881 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2018-09-26 08:25:56,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:25:56,882 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 370 [2018-09-26 08:25:56,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:56,883 INFO L225 Difference]: With dead ends: 380 [2018-09-26 08:25:56,883 INFO L226 Difference]: Without dead ends: 379 [2018-09-26 08:25:56,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=8627, Invalid=14325, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:25:56,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-09-26 08:25:57,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2018-09-26 08:25:57,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-09-26 08:25:57,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2018-09-26 08:25:57,280 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 370 [2018-09-26 08:25:57,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:57,280 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2018-09-26 08:25:57,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:25:57,280 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2018-09-26 08:25:57,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-09-26 08:25:57,281 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:57,281 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1] [2018-09-26 08:25:57,282 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:57,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:57,282 INFO L82 PathProgramCache]: Analyzing trace with hash 690107267, now seen corresponding path program 74 times [2018-09-26 08:25:57,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:57,829 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:57,829 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:57,829 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:25:57,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:25:57,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:25:57,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3004, Invalid=3158, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:25:57,831 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 79 states. [2018-09-26 08:25:58,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:58,933 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2018-09-26 08:25:58,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:25:58,934 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 375 [2018-09-26 08:25:58,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:58,935 INFO L225 Difference]: With dead ends: 385 [2018-09-26 08:25:58,935 INFO L226 Difference]: Without dead ends: 384 [2018-09-26 08:25:58,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3070 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=8856, Invalid=14706, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:25:58,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-09-26 08:25:59,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2018-09-26 08:25:59,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-26 08:25:59,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2018-09-26 08:25:59,352 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 375 [2018-09-26 08:25:59,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:59,352 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2018-09-26 08:25:59,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:25:59,352 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2018-09-26 08:25:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-09-26 08:25:59,354 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:59,354 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1] [2018-09-26 08:25:59,354 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:25:59,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:59,355 INFO L82 PathProgramCache]: Analyzing trace with hash 630393459, now seen corresponding path program 75 times [2018-09-26 08:25:59,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:59,915 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:59,915 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:59,915 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:25:59,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:25:59,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:25:59,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3082, Invalid=3238, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:25:59,916 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 80 states. [2018-09-26 08:26:00,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:00,995 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2018-09-26 08:26:00,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:26:00,995 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 380 [2018-09-26 08:26:00,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:00,997 INFO L225 Difference]: With dead ends: 390 [2018-09-26 08:26:00,997 INFO L226 Difference]: Without dead ends: 389 [2018-09-26 08:26:00,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3149 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9088, Invalid=15092, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:26:00,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-09-26 08:26:01,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2018-09-26 08:26:01,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-09-26 08:26:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2018-09-26 08:26:01,417 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 380 [2018-09-26 08:26:01,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:01,417 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2018-09-26 08:26:01,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:26:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2018-09-26 08:26:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-09-26 08:26:01,418 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:01,419 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1] [2018-09-26 08:26:01,419 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:26:01,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:01,419 INFO L82 PathProgramCache]: Analyzing trace with hash 901974403, now seen corresponding path program 76 times [2018-09-26 08:26:01,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:02,009 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:02,009 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:26:02,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:26:02,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:26:02,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3161, Invalid=3319, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:26:02,010 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 81 states. [2018-09-26 08:26:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:03,327 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2018-09-26 08:26:03,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:26:03,327 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 385 [2018-09-26 08:26:03,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:03,329 INFO L225 Difference]: With dead ends: 395 [2018-09-26 08:26:03,329 INFO L226 Difference]: Without dead ends: 394 [2018-09-26 08:26:03,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3229 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=9323, Invalid=15483, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:26:03,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-09-26 08:26:03,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2018-09-26 08:26:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-09-26 08:26:03,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2018-09-26 08:26:03,771 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 385 [2018-09-26 08:26:03,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:03,771 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2018-09-26 08:26:03,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:26:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2018-09-26 08:26:03,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-09-26 08:26:03,773 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:03,773 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1] [2018-09-26 08:26:03,773 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:26:03,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:03,774 INFO L82 PathProgramCache]: Analyzing trace with hash 705164403, now seen corresponding path program 77 times [2018-09-26 08:26:03,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:04,440 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:04,440 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:26:04,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:26:04,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:26:04,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3241, Invalid=3401, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:26:04,442 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 82 states. [2018-09-26 08:26:05,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:05,718 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2018-09-26 08:26:05,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:26:05,718 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 390 [2018-09-26 08:26:05,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:05,720 INFO L225 Difference]: With dead ends: 400 [2018-09-26 08:26:05,720 INFO L226 Difference]: Without dead ends: 399 [2018-09-26 08:26:05,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3310 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=9561, Invalid=15879, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:26:05,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-09-26 08:26:06,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2018-09-26 08:26:06,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-09-26 08:26:06,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 396 transitions. [2018-09-26 08:26:06,170 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 396 transitions. Word has length 390 [2018-09-26 08:26:06,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:06,170 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 396 transitions. [2018-09-26 08:26:06,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:26:06,170 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 396 transitions. [2018-09-26 08:26:06,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-09-26 08:26:06,172 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:06,172 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1] [2018-09-26 08:26:06,172 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:26:06,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:06,172 INFO L82 PathProgramCache]: Analyzing trace with hash 667967363, now seen corresponding path program 78 times [2018-09-26 08:26:06,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:06,839 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:06,840 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:06,840 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:26:06,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:26:06,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:26:06,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3322, Invalid=3484, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:26:06,841 INFO L87 Difference]: Start difference. First operand 396 states and 396 transitions. Second operand 83 states. [2018-09-26 08:26:08,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:08,017 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2018-09-26 08:26:08,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:26:08,018 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 395 [2018-09-26 08:26:08,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:08,019 INFO L225 Difference]: With dead ends: 405 [2018-09-26 08:26:08,019 INFO L226 Difference]: Without dead ends: 404 [2018-09-26 08:26:08,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3392 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9802, Invalid=16280, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:26:08,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-09-26 08:26:08,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2018-09-26 08:26:08,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-09-26 08:26:08,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2018-09-26 08:26:08,475 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 395 [2018-09-26 08:26:08,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:08,476 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2018-09-26 08:26:08,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:26:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2018-09-26 08:26:08,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-09-26 08:26:08,477 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:08,477 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1] [2018-09-26 08:26:08,477 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:26:08,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:08,478 INFO L82 PathProgramCache]: Analyzing trace with hash 954228339, now seen corresponding path program 79 times [2018-09-26 08:26:08,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:09,109 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:09,109 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:26:09,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:26:09,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:26:09,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3404, Invalid=3568, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:26:09,111 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 84 states. [2018-09-26 08:26:10,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:10,318 INFO L93 Difference]: Finished difference Result 410 states and 410 transitions. [2018-09-26 08:26:10,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:26:10,318 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 400 [2018-09-26 08:26:10,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:10,320 INFO L225 Difference]: With dead ends: 410 [2018-09-26 08:26:10,320 INFO L226 Difference]: Without dead ends: 409 [2018-09-26 08:26:10,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3475 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=10046, Invalid=16686, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:26:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-09-26 08:26:10,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2018-09-26 08:26:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-09-26 08:26:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 406 transitions. [2018-09-26 08:26:10,792 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 406 transitions. Word has length 400 [2018-09-26 08:26:10,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:10,792 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 406 transitions. [2018-09-26 08:26:10,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:26:10,792 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 406 transitions. [2018-09-26 08:26:10,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-09-26 08:26:10,793 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:10,794 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1] [2018-09-26 08:26:10,794 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:26:10,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:10,794 INFO L82 PathProgramCache]: Analyzing trace with hash -2119551613, now seen corresponding path program 80 times [2018-09-26 08:26:10,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:11,420 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:11,421 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:26:11,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:26:11,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:26:11,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3487, Invalid=3653, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:26:11,422 INFO L87 Difference]: Start difference. First operand 406 states and 406 transitions. Second operand 85 states. [2018-09-26 08:26:12,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:12,662 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2018-09-26 08:26:12,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:26:12,663 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 405 [2018-09-26 08:26:12,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:12,664 INFO L225 Difference]: With dead ends: 415 [2018-09-26 08:26:12,664 INFO L226 Difference]: Without dead ends: 414 [2018-09-26 08:26:12,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3559 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=10293, Invalid=17097, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:26:12,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-09-26 08:26:13,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2018-09-26 08:26:13,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-09-26 08:26:13,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2018-09-26 08:26:13,145 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 405 [2018-09-26 08:26:13,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:13,145 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2018-09-26 08:26:13,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:26:13,145 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2018-09-26 08:26:13,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-09-26 08:26:13,147 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:13,147 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1] [2018-09-26 08:26:13,147 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:26:13,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:13,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1270630515, now seen corresponding path program 81 times [2018-09-26 08:26:13,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:13,905 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:13,905 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:13,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:26:13,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:26:13,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:26:13,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3571, Invalid=3739, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:26:13,907 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 86 states. [2018-09-26 08:26:15,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:15,150 INFO L93 Difference]: Finished difference Result 420 states and 420 transitions. [2018-09-26 08:26:15,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:26:15,150 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 410 [2018-09-26 08:26:15,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:15,152 INFO L225 Difference]: With dead ends: 420 [2018-09-26 08:26:15,152 INFO L226 Difference]: Without dead ends: 419 [2018-09-26 08:26:15,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3644 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=10543, Invalid=17513, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:26:15,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-09-26 08:26:15,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 416. [2018-09-26 08:26:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-09-26 08:26:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2018-09-26 08:26:15,645 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 410 [2018-09-26 08:26:15,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:15,645 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2018-09-26 08:26:15,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:26:15,646 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2018-09-26 08:26:15,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-09-26 08:26:15,647 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:15,647 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 1, 1] [2018-09-26 08:26:15,647 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:26:15,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:15,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1303415683, now seen corresponding path program 82 times [2018-09-26 08:26:15,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:16,343 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:16,343 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:16,343 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:26:16,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:26:16,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:26:16,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3656, Invalid=3826, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:26:16,345 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 87 states. [2018-09-26 08:26:17,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:17,639 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2018-09-26 08:26:17,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:26:17,640 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 415 [2018-09-26 08:26:17,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:17,641 INFO L225 Difference]: With dead ends: 425 [2018-09-26 08:26:17,641 INFO L226 Difference]: Without dead ends: 424 [2018-09-26 08:26:17,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3730 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=10796, Invalid=17934, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:26:17,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-09-26 08:26:18,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2018-09-26 08:26:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-26 08:26:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 421 transitions. [2018-09-26 08:26:18,146 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 421 transitions. Word has length 415 [2018-09-26 08:26:18,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:18,146 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 421 transitions. [2018-09-26 08:26:18,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:26:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 421 transitions. [2018-09-26 08:26:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-09-26 08:26:18,148 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:18,148 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 1, 1] [2018-09-26 08:26:18,149 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:26:18,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:18,149 INFO L82 PathProgramCache]: Analyzing trace with hash -734285197, now seen corresponding path program 83 times [2018-09-26 08:26:18,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:18,830 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:18,831 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:18,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:26:18,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:26:18,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:26:18,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3742, Invalid=3914, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:26:18,833 INFO L87 Difference]: Start difference. First operand 421 states and 421 transitions. Second operand 88 states. [2018-09-26 08:26:20,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:20,162 INFO L93 Difference]: Finished difference Result 430 states and 430 transitions. [2018-09-26 08:26:20,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:26:20,162 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 420 [2018-09-26 08:26:20,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:20,164 INFO L225 Difference]: With dead ends: 430 [2018-09-26 08:26:20,164 INFO L226 Difference]: Without dead ends: 429 [2018-09-26 08:26:20,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3817 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=11052, Invalid=18360, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:26:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-09-26 08:26:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 426. [2018-09-26 08:26:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-09-26 08:26:20,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 426 transitions. [2018-09-26 08:26:20,724 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 426 transitions. Word has length 420 [2018-09-26 08:26:20,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:20,724 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 426 transitions. [2018-09-26 08:26:20,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:26:20,724 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 426 transitions. [2018-09-26 08:26:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-09-26 08:26:20,726 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:20,726 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 85, 84, 84, 1, 1] [2018-09-26 08:26:20,726 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:26:20,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:20,727 INFO L82 PathProgramCache]: Analyzing trace with hash 507732355, now seen corresponding path program 84 times [2018-09-26 08:26:20,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:21,455 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:21,455 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:26:21,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:26:21,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:26:21,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3829, Invalid=4003, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:26:21,458 INFO L87 Difference]: Start difference. First operand 426 states and 426 transitions. Second operand 89 states. [2018-09-26 08:26:22,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:22,815 INFO L93 Difference]: Finished difference Result 435 states and 435 transitions. [2018-09-26 08:26:22,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:26:22,816 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 425 [2018-09-26 08:26:22,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:22,817 INFO L225 Difference]: With dead ends: 435 [2018-09-26 08:26:22,818 INFO L226 Difference]: Without dead ends: 434 [2018-09-26 08:26:22,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3905 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=11311, Invalid=18791, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:26:22,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-09-26 08:26:23,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2018-09-26 08:26:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-09-26 08:26:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 431 transitions. [2018-09-26 08:26:23,356 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 431 transitions. Word has length 425 [2018-09-26 08:26:23,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:23,356 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 431 transitions. [2018-09-26 08:26:23,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:26:23,356 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 431 transitions. [2018-09-26 08:26:23,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-09-26 08:26:23,358 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:23,358 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 86, 85, 85, 1, 1] [2018-09-26 08:26:23,358 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:26:23,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:23,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1140941709, now seen corresponding path program 85 times [2018-09-26 08:26:23,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:24,196 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:24,196 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:26:24,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:26:24,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:26:24,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3917, Invalid=4093, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:26:24,197 INFO L87 Difference]: Start difference. First operand 431 states and 431 transitions. Second operand 90 states. [2018-09-26 08:26:25,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:25,582 INFO L93 Difference]: Finished difference Result 440 states and 440 transitions. [2018-09-26 08:26:25,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:26:25,582 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 430 [2018-09-26 08:26:25,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:25,584 INFO L225 Difference]: With dead ends: 440 [2018-09-26 08:26:25,584 INFO L226 Difference]: Without dead ends: 439 [2018-09-26 08:26:25,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3994 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=11573, Invalid=19227, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:26:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-09-26 08:26:26,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 436. [2018-09-26 08:26:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-09-26 08:26:26,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 436 transitions. [2018-09-26 08:26:26,143 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 436 transitions. Word has length 430 [2018-09-26 08:26:26,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:26,143 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 436 transitions. [2018-09-26 08:26:26,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:26:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 436 transitions. [2018-09-26 08:26:26,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-09-26 08:26:26,145 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:26,145 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 87, 86, 86, 1, 1] [2018-09-26 08:26:26,145 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:26:26,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:26,145 INFO L82 PathProgramCache]: Analyzing trace with hash 230864771, now seen corresponding path program 86 times [2018-09-26 08:26:26,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:26,891 INFO L134 CoverageAnalysis]: Checked inductivity of 18619 backedges. 0 proven. 18619 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:26,891 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:26,891 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:26:26,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:26:26,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:26:26,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4006, Invalid=4184, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:26:26,893 INFO L87 Difference]: Start difference. First operand 436 states and 436 transitions. Second operand 91 states. [2018-09-26 08:26:28,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:28,303 INFO L93 Difference]: Finished difference Result 445 states and 445 transitions. [2018-09-26 08:26:28,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:26:28,303 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 435 [2018-09-26 08:26:28,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:28,305 INFO L225 Difference]: With dead ends: 445 [2018-09-26 08:26:28,305 INFO L226 Difference]: Without dead ends: 444 [2018-09-26 08:26:28,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4084 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=11838, Invalid=19668, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:26:28,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-09-26 08:26:28,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 441. [2018-09-26 08:26:28,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-09-26 08:26:28,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 441 transitions. [2018-09-26 08:26:28,863 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 441 transitions. Word has length 435 [2018-09-26 08:26:28,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:28,863 INFO L480 AbstractCegarLoop]: Abstraction has 441 states and 441 transitions. [2018-09-26 08:26:28,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:26:28,863 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 441 transitions. [2018-09-26 08:26:28,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-09-26 08:26:28,865 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:28,865 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 88, 87, 87, 1, 1] [2018-09-26 08:26:28,865 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:26:28,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:28,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1688536691, now seen corresponding path program 87 times [2018-09-26 08:26:28,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 19053 backedges. 0 proven. 19053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:29,642 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:29,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:26:29,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:26:29,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:26:29,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4096, Invalid=4276, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:26:29,644 INFO L87 Difference]: Start difference. First operand 441 states and 441 transitions. Second operand 92 states. [2018-09-26 08:26:31,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:31,149 INFO L93 Difference]: Finished difference Result 450 states and 450 transitions. [2018-09-26 08:26:31,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:26:31,149 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 440 [2018-09-26 08:26:31,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:31,151 INFO L225 Difference]: With dead ends: 450 [2018-09-26 08:26:31,151 INFO L226 Difference]: Without dead ends: 449 [2018-09-26 08:26:31,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4175 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=12106, Invalid=20114, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 08:26:31,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-09-26 08:26:31,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 446. [2018-09-26 08:26:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-09-26 08:26:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 446 transitions. [2018-09-26 08:26:31,759 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 446 transitions. Word has length 440 [2018-09-26 08:26:31,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:31,759 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 446 transitions. [2018-09-26 08:26:31,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:26:31,759 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 446 transitions. [2018-09-26 08:26:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-09-26 08:26:31,760 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:31,761 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 89, 88, 88, 1, 1] [2018-09-26 08:26:31,761 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:26:31,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:31,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1097953917, now seen corresponding path program 88 times [2018-09-26 08:26:31,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:32,730 INFO L134 CoverageAnalysis]: Checked inductivity of 19492 backedges. 0 proven. 19492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:32,731 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:32,731 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:26:32,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:26:32,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:26:32,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4187, Invalid=4369, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:26:32,732 INFO L87 Difference]: Start difference. First operand 446 states and 446 transitions. Second operand 93 states. [2018-09-26 08:26:34,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:34,208 INFO L93 Difference]: Finished difference Result 455 states and 455 transitions. [2018-09-26 08:26:34,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:26:34,208 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 445 [2018-09-26 08:26:34,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:34,210 INFO L225 Difference]: With dead ends: 455 [2018-09-26 08:26:34,210 INFO L226 Difference]: Without dead ends: 454 [2018-09-26 08:26:34,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4267 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=12377, Invalid=20565, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:26:34,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-09-26 08:26:34,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 451. [2018-09-26 08:26:34,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-09-26 08:26:34,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 451 transitions. [2018-09-26 08:26:34,818 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 451 transitions. Word has length 445 [2018-09-26 08:26:34,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:34,818 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 451 transitions. [2018-09-26 08:26:34,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:26:34,818 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 451 transitions. [2018-09-26 08:26:34,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-09-26 08:26:34,820 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:34,820 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 89, 89, 1, 1] [2018-09-26 08:26:34,820 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:26:34,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:34,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1479610253, now seen corresponding path program 89 times [2018-09-26 08:26:34,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:35,646 INFO L134 CoverageAnalysis]: Checked inductivity of 19936 backedges. 0 proven. 19936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:35,646 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:35,647 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:26:35,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:26:35,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:26:35,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4279, Invalid=4463, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:26:35,648 INFO L87 Difference]: Start difference. First operand 451 states and 451 transitions. Second operand 94 states. [2018-09-26 08:26:37,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:37,129 INFO L93 Difference]: Finished difference Result 460 states and 460 transitions. [2018-09-26 08:26:37,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:26:37,130 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 450 [2018-09-26 08:26:37,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:37,131 INFO L225 Difference]: With dead ends: 460 [2018-09-26 08:26:37,131 INFO L226 Difference]: Without dead ends: 459 [2018-09-26 08:26:37,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4360 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=12651, Invalid=21021, Unknown=0, NotChecked=0, Total=33672 [2018-09-26 08:26:37,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-09-26 08:26:37,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 456. [2018-09-26 08:26:37,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-09-26 08:26:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 456 transitions. [2018-09-26 08:26:37,732 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 456 transitions. Word has length 450 [2018-09-26 08:26:37,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:37,732 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 456 transitions. [2018-09-26 08:26:37,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:26:37,732 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 456 transitions. [2018-09-26 08:26:37,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2018-09-26 08:26:37,734 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:37,734 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 91, 90, 90, 1, 1] [2018-09-26 08:26:37,734 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:26:37,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:37,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1527178115, now seen corresponding path program 90 times [2018-09-26 08:26:37,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 20385 backedges. 0 proven. 20385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:38,685 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:38,685 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:26:38,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:26:38,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:26:38,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4372, Invalid=4558, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:26:38,687 INFO L87 Difference]: Start difference. First operand 456 states and 456 transitions. Second operand 95 states. [2018-09-26 08:26:40,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:40,188 INFO L93 Difference]: Finished difference Result 465 states and 465 transitions. [2018-09-26 08:26:40,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:26:40,188 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 455 [2018-09-26 08:26:40,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:40,190 INFO L225 Difference]: With dead ends: 465 [2018-09-26 08:26:40,190 INFO L226 Difference]: Without dead ends: 464 [2018-09-26 08:26:40,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4454 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=12928, Invalid=21482, Unknown=0, NotChecked=0, Total=34410 [2018-09-26 08:26:40,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-09-26 08:26:40,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 461. [2018-09-26 08:26:40,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-09-26 08:26:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 461 transitions. [2018-09-26 08:26:40,811 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 461 transitions. Word has length 455 [2018-09-26 08:26:40,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:40,811 INFO L480 AbstractCegarLoop]: Abstraction has 461 states and 461 transitions. [2018-09-26 08:26:40,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:26:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 461 transitions. [2018-09-26 08:26:40,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2018-09-26 08:26:40,813 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:40,813 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 92, 91, 91, 1, 1] [2018-09-26 08:26:40,814 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:26:40,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:40,814 INFO L82 PathProgramCache]: Analyzing trace with hash -686007693, now seen corresponding path program 91 times [2018-09-26 08:26:40,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:41,643 INFO L134 CoverageAnalysis]: Checked inductivity of 20839 backedges. 0 proven. 20839 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:41,643 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:41,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:26:41,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:26:41,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:26:41,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4466, Invalid=4654, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:26:41,645 INFO L87 Difference]: Start difference. First operand 461 states and 461 transitions. Second operand 96 states. [2018-09-26 08:26:43,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:43,234 INFO L93 Difference]: Finished difference Result 470 states and 470 transitions. [2018-09-26 08:26:43,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:26:43,234 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 460 [2018-09-26 08:26:43,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:43,235 INFO L225 Difference]: With dead ends: 470 [2018-09-26 08:26:43,236 INFO L226 Difference]: Without dead ends: 469 [2018-09-26 08:26:43,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4549 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=13208, Invalid=21948, Unknown=0, NotChecked=0, Total=35156 [2018-09-26 08:26:43,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-09-26 08:26:43,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 466. [2018-09-26 08:26:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-09-26 08:26:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 466 transitions. [2018-09-26 08:26:43,864 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 466 transitions. Word has length 460 [2018-09-26 08:26:43,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:43,864 INFO L480 AbstractCegarLoop]: Abstraction has 466 states and 466 transitions. [2018-09-26 08:26:43,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:26:43,864 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 466 transitions. [2018-09-26 08:26:43,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2018-09-26 08:26:43,866 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:43,866 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 93, 92, 92, 1, 1] [2018-09-26 08:26:43,866 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:26:43,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:43,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1786005117, now seen corresponding path program 92 times [2018-09-26 08:26:43,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 21298 backedges. 0 proven. 21298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:44,732 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:44,732 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:26:44,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:26:44,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:26:44,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4561, Invalid=4751, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:26:44,733 INFO L87 Difference]: Start difference. First operand 466 states and 466 transitions. Second operand 97 states. [2018-09-26 08:26:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:46,386 INFO L93 Difference]: Finished difference Result 475 states and 475 transitions. [2018-09-26 08:26:46,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:26:46,387 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 465 [2018-09-26 08:26:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:46,388 INFO L225 Difference]: With dead ends: 475 [2018-09-26 08:26:46,388 INFO L226 Difference]: Without dead ends: 474 [2018-09-26 08:26:46,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4645 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=13491, Invalid=22419, Unknown=0, NotChecked=0, Total=35910 [2018-09-26 08:26:46,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-09-26 08:26:47,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 471. [2018-09-26 08:26:47,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-09-26 08:26:47,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 471 transitions. [2018-09-26 08:26:47,032 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 471 transitions. Word has length 465 [2018-09-26 08:26:47,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:47,033 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 471 transitions. [2018-09-26 08:26:47,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:26:47,033 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 471 transitions. [2018-09-26 08:26:47,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-09-26 08:26:47,035 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:47,035 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 94, 93, 93, 1, 1] [2018-09-26 08:26:47,035 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:26:47,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:47,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1137884045, now seen corresponding path program 93 times [2018-09-26 08:26:47,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 21762 backedges. 0 proven. 21762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:48,010 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:48,010 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:26:48,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:26:48,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:26:48,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4657, Invalid=4849, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:26:48,012 INFO L87 Difference]: Start difference. First operand 471 states and 471 transitions. Second operand 98 states. [2018-09-26 08:26:49,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:49,659 INFO L93 Difference]: Finished difference Result 480 states and 480 transitions. [2018-09-26 08:26:49,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:26:49,659 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 470 [2018-09-26 08:26:49,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:49,661 INFO L225 Difference]: With dead ends: 480 [2018-09-26 08:26:49,661 INFO L226 Difference]: Without dead ends: 479 [2018-09-26 08:26:49,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4742 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=13777, Invalid=22895, Unknown=0, NotChecked=0, Total=36672 [2018-09-26 08:26:49,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-09-26 08:26:50,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 476. [2018-09-26 08:26:50,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2018-09-26 08:26:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 476 transitions. [2018-09-26 08:26:50,374 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 476 transitions. Word has length 470 [2018-09-26 08:26:50,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:50,374 INFO L480 AbstractCegarLoop]: Abstraction has 476 states and 476 transitions. [2018-09-26 08:26:50,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:26:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 476 transitions. [2018-09-26 08:26:50,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2018-09-26 08:26:50,376 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:50,376 INFO L375 BasicCegarLoop]: trace histogram [95, 95, 95, 94, 94, 1, 1] [2018-09-26 08:26:50,376 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:26:50,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:50,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1468199037, now seen corresponding path program 94 times [2018-09-26 08:26:50,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 22231 backedges. 0 proven. 22231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:51,270 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:51,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:26:51,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:26:51,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:26:51,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4754, Invalid=4948, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:26:51,271 INFO L87 Difference]: Start difference. First operand 476 states and 476 transitions. Second operand 99 states. [2018-09-26 08:26:52,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:52,979 INFO L93 Difference]: Finished difference Result 485 states and 485 transitions. [2018-09-26 08:26:52,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:26:52,979 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 475 [2018-09-26 08:26:52,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:52,981 INFO L225 Difference]: With dead ends: 485 [2018-09-26 08:26:52,981 INFO L226 Difference]: Without dead ends: 484 [2018-09-26 08:26:52,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4840 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=14066, Invalid=23376, Unknown=0, NotChecked=0, Total=37442 [2018-09-26 08:26:52,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-09-26 08:26:53,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 481. [2018-09-26 08:26:53,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-09-26 08:26:53,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 481 transitions. [2018-09-26 08:26:53,704 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 481 transitions. Word has length 475 [2018-09-26 08:26:53,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:53,704 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 481 transitions. [2018-09-26 08:26:53,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:26:53,704 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 481 transitions. [2018-09-26 08:26:53,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2018-09-26 08:26:53,706 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:53,706 INFO L375 BasicCegarLoop]: trace histogram [96, 96, 96, 95, 95, 1, 1] [2018-09-26 08:26:53,707 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:26:53,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:53,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1734234509, now seen corresponding path program 95 times [2018-09-26 08:26:53,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 22705 backedges. 0 proven. 22705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:54,597 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:54,597 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:26:54,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:26:54,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:26:54,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4852, Invalid=5048, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:26:54,599 INFO L87 Difference]: Start difference. First operand 481 states and 481 transitions. Second operand 100 states. [2018-09-26 08:26:56,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:56,358 INFO L93 Difference]: Finished difference Result 490 states and 490 transitions. [2018-09-26 08:26:56,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:26:56,358 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 480 [2018-09-26 08:26:56,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:56,360 INFO L225 Difference]: With dead ends: 490 [2018-09-26 08:26:56,360 INFO L226 Difference]: Without dead ends: 489 [2018-09-26 08:26:56,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4939 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=14358, Invalid=23862, Unknown=0, NotChecked=0, Total=38220 [2018-09-26 08:26:56,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-09-26 08:26:57,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 486. [2018-09-26 08:26:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2018-09-26 08:26:57,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 486 transitions. [2018-09-26 08:26:57,059 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 486 transitions. Word has length 480 [2018-09-26 08:26:57,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:57,059 INFO L480 AbstractCegarLoop]: Abstraction has 486 states and 486 transitions. [2018-09-26 08:26:57,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:26:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 486 transitions. [2018-09-26 08:26:57,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2018-09-26 08:26:57,061 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:57,061 INFO L375 BasicCegarLoop]: trace histogram [97, 97, 97, 96, 96, 1, 1] [2018-09-26 08:26:57,062 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:26:57,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:57,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1446700419, now seen corresponding path program 96 times [2018-09-26 08:26:57,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 23184 backedges. 0 proven. 23184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:58,002 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:58,002 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:26:58,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:26:58,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:26:58,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4951, Invalid=5149, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:26:58,004 INFO L87 Difference]: Start difference. First operand 486 states and 486 transitions. Second operand 101 states. [2018-09-26 08:26:59,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:59,747 INFO L93 Difference]: Finished difference Result 495 states and 495 transitions. [2018-09-26 08:26:59,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:26:59,748 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 485 [2018-09-26 08:26:59,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:59,749 INFO L225 Difference]: With dead ends: 495 [2018-09-26 08:26:59,749 INFO L226 Difference]: Without dead ends: 494 [2018-09-26 08:26:59,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5039 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=14653, Invalid=24353, Unknown=0, NotChecked=0, Total=39006 [2018-09-26 08:26:59,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-09-26 08:27:00,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 491. [2018-09-26 08:27:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-09-26 08:27:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 491 transitions. [2018-09-26 08:27:00,469 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 491 transitions. Word has length 485 [2018-09-26 08:27:00,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:00,469 INFO L480 AbstractCegarLoop]: Abstraction has 491 states and 491 transitions. [2018-09-26 08:27:00,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:27:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 491 transitions. [2018-09-26 08:27:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2018-09-26 08:27:00,471 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:00,471 INFO L375 BasicCegarLoop]: trace histogram [98, 98, 98, 97, 97, 1, 1] [2018-09-26 08:27:00,472 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:27:00,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:00,472 INFO L82 PathProgramCache]: Analyzing trace with hash 639211635, now seen corresponding path program 97 times [2018-09-26 08:27:00,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:01,433 INFO L134 CoverageAnalysis]: Checked inductivity of 23668 backedges. 0 proven. 23668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:01,433 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:01,434 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:27:01,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:27:01,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:27:01,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5051, Invalid=5251, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:27:01,436 INFO L87 Difference]: Start difference. First operand 491 states and 491 transitions. Second operand 102 states. [2018-09-26 08:27:03,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:03,235 INFO L93 Difference]: Finished difference Result 500 states and 500 transitions. [2018-09-26 08:27:03,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:27:03,235 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 490 [2018-09-26 08:27:03,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:03,237 INFO L225 Difference]: With dead ends: 500 [2018-09-26 08:27:03,237 INFO L226 Difference]: Without dead ends: 499 [2018-09-26 08:27:03,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5140 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=14951, Invalid=24849, Unknown=0, NotChecked=0, Total=39800 [2018-09-26 08:27:03,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-09-26 08:27:03,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 496. [2018-09-26 08:27:03,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-09-26 08:27:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 496 transitions. [2018-09-26 08:27:03,966 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 496 transitions. Word has length 490 [2018-09-26 08:27:03,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:03,966 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 496 transitions. [2018-09-26 08:27:03,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:27:03,966 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 496 transitions. [2018-09-26 08:27:03,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-09-26 08:27:03,969 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:03,969 INFO L375 BasicCegarLoop]: trace histogram [99, 99, 99, 98, 98, 1, 1] [2018-09-26 08:27:03,969 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:27:03,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:03,970 INFO L82 PathProgramCache]: Analyzing trace with hash -383435901, now seen corresponding path program 98 times [2018-09-26 08:27:03,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:04,972 INFO L134 CoverageAnalysis]: Checked inductivity of 24157 backedges. 0 proven. 24157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:04,972 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:04,973 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:27:04,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:27:04,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:27:04,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5152, Invalid=5354, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:27:04,975 INFO L87 Difference]: Start difference. First operand 496 states and 496 transitions. Second operand 103 states. [2018-09-26 08:27:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:06,822 INFO L93 Difference]: Finished difference Result 505 states and 505 transitions. [2018-09-26 08:27:06,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:27:06,823 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 495 [2018-09-26 08:27:06,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:06,825 INFO L225 Difference]: With dead ends: 505 [2018-09-26 08:27:06,825 INFO L226 Difference]: Without dead ends: 504 [2018-09-26 08:27:06,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5242 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=15252, Invalid=25350, Unknown=0, NotChecked=0, Total=40602 [2018-09-26 08:27:06,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-09-26 08:27:07,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 501. [2018-09-26 08:27:07,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-09-26 08:27:07,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 501 transitions. [2018-09-26 08:27:07,576 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 501 transitions. Word has length 495 [2018-09-26 08:27:07,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:07,576 INFO L480 AbstractCegarLoop]: Abstraction has 501 states and 501 transitions. [2018-09-26 08:27:07,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:27:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 501 transitions. [2018-09-26 08:27:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2018-09-26 08:27:07,578 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:07,578 INFO L375 BasicCegarLoop]: trace histogram [100, 100, 100, 99, 99, 1, 1] [2018-09-26 08:27:07,579 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:27:07,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:07,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1774910861, now seen corresponding path program 99 times [2018-09-26 08:27:07,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:08,656 INFO L134 CoverageAnalysis]: Checked inductivity of 24651 backedges. 0 proven. 24651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:08,656 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:08,656 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:27:08,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:27:08,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:27:08,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5254, Invalid=5458, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:27:08,659 INFO L87 Difference]: Start difference. First operand 501 states and 501 transitions. Second operand 104 states. [2018-09-26 08:27:10,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:10,497 INFO L93 Difference]: Finished difference Result 508 states and 508 transitions. [2018-09-26 08:27:10,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:27:10,498 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 500 [2018-09-26 08:27:10,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:10,499 INFO L225 Difference]: With dead ends: 508 [2018-09-26 08:27:10,499 INFO L226 Difference]: Without dead ends: 507 [2018-09-26 08:27:10,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5345 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=15556, Invalid=25856, Unknown=0, NotChecked=0, Total=41412 [2018-09-26 08:27:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-09-26 08:27:11,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 506. [2018-09-26 08:27:11,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-09-26 08:27:11,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 506 transitions. [2018-09-26 08:27:11,271 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 506 transitions. Word has length 500 [2018-09-26 08:27:11,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:11,272 INFO L480 AbstractCegarLoop]: Abstraction has 506 states and 506 transitions. [2018-09-26 08:27:11,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:27:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 506 transitions. [2018-09-26 08:27:11,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-09-26 08:27:11,274 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:11,274 INFO L375 BasicCegarLoop]: trace histogram [101, 101, 101, 100, 100, 1, 1] [2018-09-26 08:27:11,275 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 08:27:11,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:11,275 INFO L82 PathProgramCache]: Analyzing trace with hash 865866115, now seen corresponding path program 100 times [2018-09-26 08:27:11,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 25150 backedges. 24554 proven. 596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:12,278 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:12,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:27:12,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:27:12,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:27:12,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5155, Invalid=5557, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:27:12,280 INFO L87 Difference]: Start difference. First operand 506 states and 506 transitions. Second operand 104 states. [2018-09-26 08:27:13,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:13,341 INFO L93 Difference]: Finished difference Result 509 states and 509 transitions. [2018-09-26 08:27:13,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:27:13,341 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 505 [2018-09-26 08:27:13,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:13,341 INFO L225 Difference]: With dead ends: 509 [2018-09-26 08:27:13,342 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:27:13,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5258, Invalid=5662, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:27:13,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:27:13,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:27:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:27:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:27:13,345 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 505 [2018-09-26 08:27:13,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:13,345 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:27:13,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:27:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:27:13,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:27:13,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:27:27,506 WARN L178 SmtUtils]: Spent 14.15 s on a formula simplification. DAG size of input: 1016 DAG size of output: 813 [2018-09-26 08:27:28,407 WARN L178 SmtUtils]: Spent 895.00 ms on a formula simplification that was a NOOP. DAG size: 814 [2018-09-26 08:27:41,193 WARN L178 SmtUtils]: Spent 12.78 s on a formula simplification. DAG size of input: 1022 DAG size of output: 812 [2018-09-26 08:27:42,056 WARN L178 SmtUtils]: Spent 859.00 ms on a formula simplification that was a NOOP. DAG size: 814 [2018-09-26 08:27:53,294 WARN L178 SmtUtils]: Spent 11.23 s on a formula simplification. DAG size of input: 1018 DAG size of output: 815 [2018-09-26 08:27:56,813 WARN L178 SmtUtils]: Spent 3.50 s on a formula simplification. DAG size of input: 813 DAG size of output: 812 [2018-09-26 08:28:00,788 WARN L178 SmtUtils]: Spent 3.96 s on a formula simplification. DAG size of input: 814 DAG size of output: 813 [2018-09-26 08:28:04,092 WARN L178 SmtUtils]: Spent 3.30 s on a formula simplification. DAG size of input: 811 DAG size of output: 811 [2018-09-26 08:28:07,561 WARN L178 SmtUtils]: Spent 3.46 s on a formula simplification. DAG size of input: 814 DAG size of output: 813 [2018-09-26 08:28:10,738 WARN L178 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 815 DAG size of output: 814 [2018-09-26 08:28:10,744 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 1 34) the Hoare annotation is: true [2018-09-26 08:28:10,744 INFO L422 ceAbstractionStarter]: At program point mainEXIT(lines 1 34) the Hoare annotation is: (select |#valid| main_~q~1.base) [2018-09-26 08:28:10,744 INFO L422 ceAbstractionStarter]: At program point mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT(line 41) the Hoare annotation is: false [2018-09-26 08:28:10,745 INFO L422 ceAbstractionStarter]: At program point mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT(lines 41 42) the Hoare annotation is: false [2018-09-26 08:28:10,754 INFO L422 ceAbstractionStarter]: At program point L19(lines 15 27) the Hoare annotation is: (let ((.cse2 (select |#length| |main_read~int_#ptr.base|))) (let ((.cse3 (= |main_read~int_#ptr.base| main_~q~1.base)) (.cse4 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType|) .cse2)) (.cse0 (select |#valid| main_~q~1.base)) (.cse1 (select |#length| main_~q~1.base))) (or (and (<= (+ main_~p~1.offset 172) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 228) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 220) .cse2)) (and (<= (+ main_~q~1.offset 352) .cse1) (<= (+ main_~p~1.offset 48) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 344) .cse2)) (and (<= (+ main_~p~1.offset 60) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 332) .cse2) .cse0 (<= (+ main_~q~1.offset 340) .cse1)) (and (<= (+ main_~p~1.offset 168) main_~q~1.offset) (<= (+ main_~q~1.offset 232) .cse1) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 224) .cse2)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 24) .cse2) (<= (+ main_~q~1.offset 32) .cse1) .cse0 (<= (+ main_~p~1.offset 368) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 256) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 136) .cse2) .cse0 (<= (+ main_~q~1.offset 144) .cse1)) (and (<= (+ main_~q~1.offset 108) .cse1) .cse0 (<= (+ main_~p~1.offset 292) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 100) .cse2)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 376) .cse2) (<= (+ main_~q~1.offset 384) .cse1) (<= (+ main_~p~1.offset 16) main_~q~1.offset) .cse0) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 232) .cse2) .cse0 (<= (+ main_~q~1.offset 240) .cse1) (<= (+ main_~p~1.offset 160) main_~q~1.offset)) (and .cse3 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 392) .cse2) (<= (+ main_~p~1.offset 400) .cse1) .cse0 (= main_~p~1.offset main_~q~1.offset)) (and (<= (+ main_~p~1.offset 72) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 320) .cse2) .cse0 (<= (+ main_~q~1.offset 328) .cse1)) (and (<= (+ main_~q~1.offset 388) .cse1) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 380) .cse2) (<= (+ main_~p~1.offset 12) main_~q~1.offset)) (and .cse0 (<= (+ main_~q~1.offset 128) .cse1) (<= (+ main_~p~1.offset 272) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 120) .cse2)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 216) .cse2) (<= (+ main_~q~1.offset 224) .cse1) .cse0 (<= (+ main_~p~1.offset 176) main_~q~1.offset)) (and .cse3 (<= (+ main_~p~1.offset 4) main_~q~1.offset) (<= (+ main_~q~1.offset 396) .cse2) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 388) .cse2) .cse0) (and (<= (+ main_~q~1.offset 368) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 360) .cse2) .cse0 (<= (+ main_~p~1.offset 32) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 4) .cse2) .cse0 (<= (+ main_~p~1.offset 388) main_~q~1.offset) (<= (+ main_~q~1.offset 12) .cse1)) (and (<= (+ main_~p~1.offset 228) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 172) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 164) .cse2)) (and .cse0 (<= (+ main_~q~1.offset 292) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 284) .cse2) (<= (+ main_~p~1.offset 108) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 48) .cse1) (<= (+ main_~p~1.offset 352) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 40) .cse2)) (and .cse0 (<= (+ main_~q~1.offset 192) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 184) .cse2) (<= (+ main_~p~1.offset 208) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 384) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 8) .cse2) .cse0 (<= (+ main_~q~1.offset 16) .cse1)) (and (<= (+ main_~p~1.offset 192) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 200) .cse2) .cse0 (<= (+ main_~q~1.offset 208) .cse1)) (and (<= (+ main_~p~1.offset 76) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 316) .cse2) (<= (+ main_~q~1.offset 324) .cse1) .cse0) (and (<= (+ main_~q~1.offset 260) .cse1) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 252) .cse2) (<= (+ main_~p~1.offset 140) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 52) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 44) .cse2) .cse0 (<= (+ main_~p~1.offset 348) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 300) .cse2) (<= (+ main_~p~1.offset 92) main_~q~1.offset) (<= (+ main_~q~1.offset 308) .cse1) .cse0) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 348) .cse2) (<= (+ main_~p~1.offset 44) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 356) .cse1)) (and (<= (+ main_~p~1.offset 304) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 88) .cse2) (<= (+ main_~q~1.offset 96) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 372) .cse2) (<= (+ main_~p~1.offset 20) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 380) .cse1)) (and (<= (+ main_~p~1.offset 8) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 384) .cse2) (<= (+ main_~q~1.offset 392) .cse1) .cse0) (and (<= (+ main_~p~1.offset 80) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 320) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 312) .cse2)) (and .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 160) .cse2) (<= (+ main_~q~1.offset 168) .cse1) (<= (+ main_~p~1.offset 232) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 164) .cse1) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 156) .cse2) (<= (+ main_~p~1.offset 236) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 360) .cse1) (<= (+ main_~p~1.offset 40) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 352) .cse2)) (and (<= (+ main_~q~1.offset 88) .cse1) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 80) .cse2) (<= (+ main_~p~1.offset 312) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 120) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 272) .cse2) .cse0 (<= (+ main_~q~1.offset 280) .cse1)) (and (<= (+ main_~p~1.offset 380) main_~q~1.offset) (<= (+ main_~q~1.offset 20) .cse1) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 12) .cse2)) (and (<= (+ main_~q~1.offset 76) .cse1) (<= (+ main_~p~1.offset 324) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 68) .cse2)) (and (<= (+ main_~q~1.offset 272) .cse1) (<= (+ main_~p~1.offset 128) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 264) .cse2)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 188) .cse2) (<= (+ main_~q~1.offset 196) .cse1) .cse0 (<= (+ main_~p~1.offset 204) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 316) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 76) .cse2) (<= (+ main_~q~1.offset 84) .cse1)) (and (<= (+ main_~p~1.offset 116) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 284) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 276) .cse2)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 304) .cse2) (<= (+ main_~q~1.offset 312) .cse1) .cse0 (<= (+ main_~p~1.offset 88) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 288) .cse2) (<= (+ main_~p~1.offset 104) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 296) .cse1)) (and (<= (+ main_~q~1.offset 268) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 260) .cse2) .cse0 (<= (+ main_~p~1.offset 132) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 20) .cse2) (<= (+ main_~p~1.offset 372) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 28) .cse1)) (and (<= (+ main_~q~1.offset 316) .cse1) (<= (+ main_~p~1.offset 84) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 308) .cse2)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 96) .cse2) .cse0 (<= (+ main_~p~1.offset 296) main_~q~1.offset) (<= (+ main_~q~1.offset 104) .cse1)) (and (<= (+ main_~p~1.offset 240) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 152) .cse2) (<= (+ main_~q~1.offset 160) .cse1)) (and (<= (+ main_~p~1.offset 392) main_~q~1.offset) .cse4 (<= (+ main_~q~1.offset 8) .cse1) .cse0) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 132) .cse2) .cse0 (<= (+ main_~q~1.offset 140) .cse1) (<= (+ main_~p~1.offset 260) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 300) .cse1) .cse0 (<= (+ main_~p~1.offset 100) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 292) .cse2)) (and (<= (+ main_~p~1.offset 188) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 204) .cse2) .cse0 (<= (+ main_~q~1.offset 212) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 84) .cse2) (<= (+ main_~q~1.offset 92) .cse1) .cse0 (<= (+ main_~p~1.offset 308) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 236) .cse2) (<= (+ main_~p~1.offset 156) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 244) .cse1)) (and (<= (+ main_~q~1.offset 288) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 280) .cse2) .cse0 (<= (+ main_~p~1.offset 112) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 360) main_~q~1.offset) (<= (+ main_~q~1.offset 40) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 32) .cse2) .cse0) (and (<= (+ main_~q~1.offset 44) .cse1) .cse0 (<= (+ main_~p~1.offset 356) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 36) .cse2)) (and (<= (+ main_~p~1.offset 284) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 116) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 108) .cse2)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 248) .cse2) (<= (+ main_~q~1.offset 256) .cse1) .cse0 (<= (+ main_~p~1.offset 144) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 244) .cse2) (<= (+ main_~q~1.offset 252) .cse1) .cse0 (<= (+ main_~p~1.offset 148) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 56) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 336) .cse2) (<= (+ main_~q~1.offset 344) .cse1)) (and .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 104) .cse2) (<= (+ main_~q~1.offset 112) .cse1) (<= (+ main_~p~1.offset 288) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 52) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 348) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 340) .cse2)) (and .cse0 (<= (+ main_~p~1.offset 344) main_~q~1.offset) (<= (+ main_~q~1.offset 56) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 48) .cse2)) (and .cse0 (<= (+ main_~p~1.offset 340) main_~q~1.offset) (<= (+ main_~q~1.offset 60) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 52) .cse2)) (and (<= (+ main_~q~1.offset 276) .cse1) (<= (+ main_~p~1.offset 124) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 268) .cse2) .cse0) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 180) .cse2) (<= (+ main_~p~1.offset 212) main_~q~1.offset) (<= (+ main_~q~1.offset 188) .cse1) .cse0) (and (<= (+ main_~q~1.offset 148) .cse1) (<= (+ main_~p~1.offset 252) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 140) .cse2)) (and (<= (+ main_~p~1.offset 336) main_~q~1.offset) (<= (+ main_~q~1.offset 64) .cse1) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 56) .cse2)) (and .cse0 (<= (+ main_~q~1.offset 124) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 116) .cse2) (<= (+ main_~p~1.offset 276) main_~q~1.offset)) (and .cse0 (<= (+ main_~p~1.offset 268) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 124) .cse2) (<= (+ main_~q~1.offset 132) .cse1)) (and (<= (+ main_~p~1.offset 24) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 368) .cse2) (<= (+ main_~q~1.offset 376) .cse1) .cse0) (and (<= (+ main_~p~1.offset 328) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 72) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 64) .cse2)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 196) .cse2) (<= (+ main_~p~1.offset 196) main_~q~1.offset) (<= (+ main_~q~1.offset 204) .cse1) .cse0) (and .cse0 (<= (+ main_~p~1.offset 224) main_~q~1.offset) (<= (+ main_~q~1.offset 176) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 168) .cse2)) (and .cse4 (<= (+ main_~p~1.offset 396) main_~q~1.offset) .cse0) (and (<= (+ main_~p~1.offset 220) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 180) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 172) .cse2)) (and (<= (+ main_~q~1.offset 264) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 256) .cse2) .cse0 (<= (+ main_~p~1.offset 136) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 356) .cse2) (<= (+ main_~p~1.offset 36) main_~q~1.offset) (<= (+ main_~q~1.offset 364) .cse1) .cse0) (and (<= (+ main_~q~1.offset 332) .cse1) (<= (+ main_~p~1.offset 68) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 324) .cse2) .cse0) (and (<= (+ main_~p~1.offset 364) main_~q~1.offset) (<= (+ main_~q~1.offset 36) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 28) .cse2) .cse0) (and .cse0 (<= (+ main_~p~1.offset 332) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 60) .cse2) (<= (+ main_~q~1.offset 68) .cse1)) (and (<= (+ main_~q~1.offset 136) .cse1) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 128) .cse2) (<= (+ main_~p~1.offset 264) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 184) .cse1) .cse0 (<= (+ main_~p~1.offset 216) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 176) .cse2)) (and (<= (+ main_~q~1.offset 152) .cse1) .cse0 (<= (+ main_~p~1.offset 248) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 144) .cse2)) (and (<= (+ main_~q~1.offset 372) .cse1) (<= (+ main_~p~1.offset 28) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 364) .cse2)) (and (<= (+ main_~p~1.offset 320) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 80) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 72) .cse2)) (and (<= (+ main_~p~1.offset 200) main_~q~1.offset) (<= (+ main_~q~1.offset 200) .cse1) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 192) .cse2)) (and .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 92) .cse2) (<= (+ main_~q~1.offset 100) .cse1) (<= (+ main_~p~1.offset 300) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 164) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 228) .cse2) (<= (+ main_~q~1.offset 236) .cse1)) (and (<= (+ main_~q~1.offset 248) .cse1) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 240) .cse2) (<= (+ main_~p~1.offset 152) main_~q~1.offset)) (and (not |main_#t~short2|) .cse0) (and (<= (+ main_~q~1.offset 156) .cse1) .cse0 (<= (+ main_~p~1.offset 244) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 148) .cse2)) (and (<= (+ main_~q~1.offset 24) .cse1) (<= (+ main_~p~1.offset 376) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 16) .cse2) .cse0) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 296) .cse2) (<= (+ main_~p~1.offset 96) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 304) .cse1)) (and (<= (+ main_~p~1.offset 180) main_~q~1.offset) (<= (+ main_~q~1.offset 220) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 212) .cse2) .cse0) (and .cse0 (<= (+ main_~q~1.offset 120) .cse1) (<= (+ main_~p~1.offset 280) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 112) .cse2)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 208) .cse2) (<= (+ main_~q~1.offset 216) .cse1) .cse0 (<= (+ main_~p~1.offset 184) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 328) .cse2) .cse0 (<= (+ main_~q~1.offset 336) .cse1) (<= (+ main_~p~1.offset 64) main_~q~1.offset))))) [2018-09-26 08:28:10,770 INFO L422 ceAbstractionStarter]: At program point L15(lines 15 18) the Hoare annotation is: (let ((.cse0 (select |#length| |main_read~int_#ptr.base|))) (let ((.cse3 (+ main_~p~1.offset 400)) (.cse4 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType|) .cse0)) (.cse1 (select |#length| main_~q~1.base)) (.cse2 (select |#valid| main_~q~1.base))) (or (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 296) .cse0) (<= (+ main_~q~1.offset 300) .cse1) .cse2 (<= (+ main_~p~1.offset 100) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 336) main_~q~1.offset) (<= (+ main_~q~1.offset 64) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 60) .cse0)) (and (<= (+ main_~p~1.offset 72) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 324) .cse0) .cse2 (<= (+ main_~q~1.offset 328) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 288) .cse0) .cse2 (<= (+ main_~q~1.offset 292) .cse1) (<= (+ main_~p~1.offset 108) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 248) .cse0) (<= (+ main_~q~1.offset 252) .cse1) (<= (+ main_~p~1.offset 148) main_~q~1.offset) .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 376) .cse0) (<= (+ main_~p~1.offset 20) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 380) .cse1)) (and (<= (+ main_~p~1.offset 80) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 316) .cse0) .cse2 (<= (+ main_~q~1.offset 320) .cse1)) (and .cse2 (<= (+ main_~q~1.offset 112) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 108) .cse0) (<= (+ main_~p~1.offset 288) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 256) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 252) .cse0) (<= (+ main_~p~1.offset 144) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 212) main_~q~1.offset) (<= (+ main_~q~1.offset 188) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 184) .cse0)) (and .cse2 (<= (+ main_~q~1.offset 124) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 120) .cse0) (<= (+ main_~p~1.offset 276) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 96) .cse0) .cse2 (<= (+ main_~q~1.offset 100) .cse1) (<= (+ main_~p~1.offset 300) main_~q~1.offset)) (and (= |main_read~int_#ptr.base| main_~q~1.base) (<= (+ main_~p~1.offset 4) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 392) .cse0) (<= (+ main_~q~1.offset 396) .cse1) .cse2) (and .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 52) .cse0) (<= (+ main_~p~1.offset 344) main_~q~1.offset) (<= (+ main_~q~1.offset 56) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 196) .cse0) (<= (+ main_~p~1.offset 200) main_~q~1.offset) (<= (+ main_~q~1.offset 200) .cse1) .cse2) (and (<= (+ main_~q~1.offset 216) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 212) .cse0) .cse2 (<= (+ main_~p~1.offset 184) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 220) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 180) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 176) .cse0)) (and (<= (+ main_~q~1.offset 248) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 244) .cse0) .cse2 (<= (+ main_~p~1.offset 152) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 384) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 12) .cse0) (<= (+ main_~q~1.offset 16) .cse1)) (and (<= (+ main_~p~1.offset 120) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 276) .cse0) (<= (+ main_~q~1.offset 280) .cse1)) (and (= main_~p~1.offset main_~q~1.offset) .cse2 (<= .cse3 .cse1)) (and (<= (+ main_~p~1.offset 196) main_~q~1.offset) (<= (+ main_~q~1.offset 204) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 200) .cse0) .cse2) (and (<= (+ main_~q~1.offset 48) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 44) .cse0) (<= (+ main_~p~1.offset 352) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 368) .cse1) (<= (+ main_~p~1.offset 32) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 364) .cse0)) (and (<= (+ main_~p~1.offset 192) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 204) .cse0) .cse2 (<= (+ main_~q~1.offset 208) .cse1)) (and (<= (+ main_~q~1.offset 352) .cse1) (<= (+ main_~p~1.offset 48) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 348) .cse0) .cse2) (and (<= (+ main_~q~1.offset 384) .cse1) (<= (+ main_~p~1.offset 16) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 380) .cse0)) (and .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 164) .cse0) (<= (+ main_~q~1.offset 168) .cse1) (<= (+ main_~p~1.offset 232) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 304) .cse0) (<= (+ main_~p~1.offset 92) main_~q~1.offset) (<= (+ main_~q~1.offset 308) .cse1) .cse2) (and (not |main_#t~short2|) .cse4 .cse2 (<= .cse3 main_~q~1.offset)) (and (<= (+ main_~p~1.offset 156) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 244) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 240) .cse0)) (and (<= (+ main_~q~1.offset 272) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 268) .cse0) (<= (+ main_~p~1.offset 128) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 24) .cse1) (<= (+ main_~p~1.offset 376) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 20) .cse0) .cse2) (and .cse2 (<= (+ main_~p~1.offset 224) main_~q~1.offset) (<= (+ main_~q~1.offset 176) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 172) .cse0)) (and (<= (+ main_~q~1.offset 332) .cse1) (<= (+ main_~p~1.offset 68) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 328) .cse0) .cse2) (and (<= (+ main_~p~1.offset 76) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 320) .cse0) (<= (+ main_~q~1.offset 324) .cse1) .cse2) (and (<= (+ main_~p~1.offset 36) main_~q~1.offset) (<= (+ main_~q~1.offset 364) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 360) .cse0) .cse2) (and (<= (+ main_~q~1.offset 372) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 368) .cse0) (<= (+ main_~p~1.offset 28) main_~q~1.offset) .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 272) .cse0) (<= (+ main_~q~1.offset 276) .cse1) (<= (+ main_~p~1.offset 124) main_~q~1.offset) .cse2) (and .cse2 (<= (+ main_~q~1.offset 120) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 116) .cse0) (<= (+ main_~p~1.offset 280) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 8) main_~q~1.offset) (<= (+ main_~q~1.offset 392) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 388) .cse0) .cse2) (and (<= (+ main_~q~1.offset 44) .cse1) .cse2 (<= (+ main_~p~1.offset 356) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 40) .cse0)) (and (<= (+ main_~p~1.offset 56) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 340) .cse0) (<= (+ main_~q~1.offset 344) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 256) .cse0) (<= (+ main_~q~1.offset 260) .cse1) .cse2 (<= (+ main_~p~1.offset 140) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 288) .cse1) .cse2 (<= (+ main_~p~1.offset 112) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 284) .cse0)) (and (<= (+ main_~q~1.offset 224) .cse1) .cse2 (<= (+ main_~p~1.offset 176) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 220) .cse0)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 188) .cse0) .cse2 (<= (+ main_~q~1.offset 192) .cse1) (<= (+ main_~p~1.offset 208) main_~q~1.offset)) (and .cse2 (<= (+ main_~p~1.offset 296) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 100) .cse0) (<= (+ main_~q~1.offset 104) .cse1)) (and (<= (+ main_~q~1.offset 312) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 308) .cse0) (<= (+ main_~p~1.offset 88) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 228) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 172) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 168) .cse0)) (and (<= (+ main_~q~1.offset 316) .cse1) (<= (+ main_~p~1.offset 84) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 312) .cse0)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 232) .cse0) (<= (+ main_~p~1.offset 164) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 236) .cse1)) (and (<= (+ main_~p~1.offset 168) main_~q~1.offset) (<= (+ main_~q~1.offset 232) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 228) .cse0)) (and (<= (+ main_~p~1.offset 52) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 348) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 344) .cse0)) (and (<= (+ main_~q~1.offset 92) .cse1) .cse2 (<= (+ main_~p~1.offset 308) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 88) .cse0)) (and (<= (+ main_~q~1.offset 4) .cse1) .cse4 (<= (+ main_~p~1.offset 396) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 172) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 224) .cse0) (<= (+ main_~q~1.offset 228) .cse1)) (and (<= (+ main_~p~1.offset 320) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 76) .cse0) (<= (+ main_~q~1.offset 80) .cse1)) (and (<= (+ main_~p~1.offset 44) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 352) .cse0) (<= (+ main_~q~1.offset 356) .cse1)) (and (<= (+ main_~q~1.offset 152) .cse1) .cse2 (<= (+ main_~p~1.offset 248) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 148) .cse0)) (and (<= (+ main_~p~1.offset 380) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 16) .cse0) (<= (+ main_~q~1.offset 20) .cse1) .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 300) .cse0) (<= (+ main_~p~1.offset 96) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 304) .cse1)) (and (<= (+ main_~q~1.offset 196) .cse1) .cse2 (<= (+ main_~p~1.offset 204) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 192) .cse0)) (and .cse2 (<= (+ main_~p~1.offset 332) main_~q~1.offset) (<= (+ main_~q~1.offset 68) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 64) .cse0)) (and (<= (+ main_~p~1.offset 256) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 140) .cse0) (<= (+ main_~q~1.offset 144) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 8) .cse0) .cse2 (<= (+ main_~p~1.offset 388) main_~q~1.offset) (<= (+ main_~q~1.offset 12) .cse1)) (and .cse2 (<= (+ main_~q~1.offset 128) .cse1) (<= (+ main_~p~1.offset 272) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 124) .cse0)) (and (<= (+ main_~p~1.offset 284) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 112) .cse0) (<= (+ main_~q~1.offset 116) .cse1)) (and (<= (+ main_~p~1.offset 304) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 92) .cse0) (<= (+ main_~q~1.offset 96) .cse1)) (and .cse2 (<= (+ main_~p~1.offset 340) main_~q~1.offset) (<= (+ main_~q~1.offset 60) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 56) .cse0)) (and (<= (+ main_~q~1.offset 164) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 160) .cse0) (<= (+ main_~p~1.offset 236) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 148) .cse1) (<= (+ main_~p~1.offset 252) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 144) .cse0)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 180) .cse0) (<= (+ main_~q~1.offset 184) .cse1) .cse2 (<= (+ main_~p~1.offset 216) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 108) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 104) .cse0) (<= (+ main_~p~1.offset 292) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 316) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 80) .cse0) (<= (+ main_~q~1.offset 84) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 384) .cse0) (<= (+ main_~q~1.offset 388) .cse1) .cse2 (<= (+ main_~p~1.offset 12) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 76) .cse1) (<= (+ main_~p~1.offset 324) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 72) .cse0)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 132) .cse0) (<= (+ main_~q~1.offset 136) .cse1) .cse2 (<= (+ main_~p~1.offset 264) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 208) .cse0) (<= (+ main_~p~1.offset 188) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 212) .cse1)) (and (<= (+ main_~p~1.offset 60) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 340) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 336) .cse0)) (and (<= (+ main_~q~1.offset 264) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 260) .cse0) .cse2 (<= (+ main_~p~1.offset 136) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 392) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 4) .cse0) (<= (+ main_~q~1.offset 8) .cse1) .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 236) .cse0) .cse2 (<= (+ main_~q~1.offset 240) .cse1) (<= (+ main_~p~1.offset 160) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 268) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 264) .cse0) (<= (+ main_~p~1.offset 132) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 52) .cse1) .cse2 (<= (+ main_~p~1.offset 348) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 48) .cse0)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 136) .cse0) .cse2 (<= (+ main_~q~1.offset 140) .cse1) (<= (+ main_~p~1.offset 260) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 88) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 84) .cse0) .cse2 (<= (+ main_~p~1.offset 312) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 104) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 296) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 292) .cse0)) (and (<= (+ main_~p~1.offset 116) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 280) .cse0) .cse2 (<= (+ main_~q~1.offset 284) .cse1)) (and (<= (+ main_~p~1.offset 24) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 372) .cse0) (<= (+ main_~q~1.offset 376) .cse1) .cse2) (and (<= (+ main_~q~1.offset 32) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 28) .cse0) (<= (+ main_~p~1.offset 368) main_~q~1.offset) .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 332) .cse0) .cse2 (<= (+ main_~q~1.offset 336) .cse1) (<= (+ main_~p~1.offset 64) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 356) .cse0) (<= (+ main_~q~1.offset 360) .cse1) (<= (+ main_~p~1.offset 40) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 156) .cse1) .cse2 (<= (+ main_~p~1.offset 244) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 152) .cse0)) (and (<= (+ main_~p~1.offset 240) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 156) .cse0) (<= (+ main_~q~1.offset 160) .cse1)) (and (<= (+ main_~p~1.offset 328) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 68) .cse0) (<= (+ main_~q~1.offset 72) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 24) .cse0) (<= (+ main_~p~1.offset 372) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 28) .cse1)) (and .cse2 (<= (+ main_~p~1.offset 268) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 128) .cse0) (<= (+ main_~q~1.offset 132) .cse1)) (and (<= (+ main_~p~1.offset 364) main_~q~1.offset) (<= (+ main_~q~1.offset 36) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 32) .cse0) .cse2) (and (<= (+ main_~q~1.offset 40) .cse1) .cse2 (<= (+ main_~p~1.offset 360) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 36) .cse0)) (and (<= (+ main_~p~1.offset 180) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 216) .cse0) (<= (+ main_~q~1.offset 220) .cse1) .cse2)))) [2018-09-26 08:28:10,770 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 1 34) no Hoare annotation was computed. [2018-09-26 08:28:10,776 INFO L422 ceAbstractionStarter]: At program point L12-1(lines 12 31) the Hoare annotation is: (let ((.cse0 (select |#length| |main_read~int_#ptr.base|))) (let ((.cse3 (+ main_~p~1.offset 400)) (.cse4 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType|) .cse0)) (.cse1 (select |#length| main_~q~1.base)) (.cse2 (select |#valid| main_~q~1.base))) (or (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 296) .cse0) (<= (+ main_~q~1.offset 300) .cse1) .cse2 (<= (+ main_~p~1.offset 100) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 336) main_~q~1.offset) (<= (+ main_~q~1.offset 64) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 60) .cse0)) (and (<= (+ main_~p~1.offset 72) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 324) .cse0) .cse2 (<= (+ main_~q~1.offset 328) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 288) .cse0) .cse2 (<= (+ main_~q~1.offset 292) .cse1) (<= (+ main_~p~1.offset 108) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 248) .cse0) (<= (+ main_~q~1.offset 252) .cse1) (<= (+ main_~p~1.offset 148) main_~q~1.offset) .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 376) .cse0) (<= (+ main_~p~1.offset 20) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 380) .cse1)) (and (<= (+ main_~p~1.offset 80) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 316) .cse0) .cse2 (<= (+ main_~q~1.offset 320) .cse1)) (and .cse2 (<= (+ main_~q~1.offset 112) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 108) .cse0) (<= (+ main_~p~1.offset 288) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 256) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 252) .cse0) (<= (+ main_~p~1.offset 144) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 212) main_~q~1.offset) (<= (+ main_~q~1.offset 188) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 184) .cse0)) (and .cse2 (<= (+ main_~q~1.offset 124) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 120) .cse0) (<= (+ main_~p~1.offset 276) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 96) .cse0) .cse2 (<= (+ main_~q~1.offset 100) .cse1) (<= (+ main_~p~1.offset 300) main_~q~1.offset)) (and (= |main_read~int_#ptr.base| main_~q~1.base) (<= (+ main_~p~1.offset 4) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 392) .cse0) (<= (+ main_~q~1.offset 396) .cse1) .cse2) (and .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 52) .cse0) (<= (+ main_~p~1.offset 344) main_~q~1.offset) (<= (+ main_~q~1.offset 56) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 196) .cse0) (<= (+ main_~p~1.offset 200) main_~q~1.offset) (<= (+ main_~q~1.offset 200) .cse1) .cse2) (and (<= (+ main_~q~1.offset 216) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 212) .cse0) .cse2 (<= (+ main_~p~1.offset 184) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 220) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 180) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 176) .cse0)) (and (<= (+ main_~q~1.offset 248) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 244) .cse0) .cse2 (<= (+ main_~p~1.offset 152) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 384) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 12) .cse0) (<= (+ main_~q~1.offset 16) .cse1)) (and (<= (+ main_~p~1.offset 120) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 276) .cse0) (<= (+ main_~q~1.offset 280) .cse1)) (and (= main_~p~1.offset main_~q~1.offset) .cse2 (<= .cse3 .cse1)) (and (<= (+ main_~p~1.offset 196) main_~q~1.offset) (<= (+ main_~q~1.offset 204) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 200) .cse0) .cse2) (and (<= (+ main_~q~1.offset 48) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 44) .cse0) (<= (+ main_~p~1.offset 352) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 368) .cse1) (<= (+ main_~p~1.offset 32) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 364) .cse0)) (and (<= (+ main_~p~1.offset 192) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 204) .cse0) .cse2 (<= (+ main_~q~1.offset 208) .cse1)) (and (<= (+ main_~q~1.offset 352) .cse1) (<= (+ main_~p~1.offset 48) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 348) .cse0) .cse2) (and (<= (+ main_~q~1.offset 384) .cse1) (<= (+ main_~p~1.offset 16) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 380) .cse0)) (and .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 164) .cse0) (<= (+ main_~q~1.offset 168) .cse1) (<= (+ main_~p~1.offset 232) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 304) .cse0) (<= (+ main_~p~1.offset 92) main_~q~1.offset) (<= (+ main_~q~1.offset 308) .cse1) .cse2) (and (<= (+ main_~p~1.offset 156) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 244) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 240) .cse0)) (and (<= (+ main_~q~1.offset 272) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 268) .cse0) (<= (+ main_~p~1.offset 128) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 24) .cse1) (<= (+ main_~p~1.offset 376) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 20) .cse0) .cse2) (and .cse2 (<= (+ main_~p~1.offset 224) main_~q~1.offset) (<= (+ main_~q~1.offset 176) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 172) .cse0)) (and (<= (+ main_~q~1.offset 332) .cse1) (<= (+ main_~p~1.offset 68) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 328) .cse0) .cse2) (and (<= (+ main_~p~1.offset 76) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 320) .cse0) (<= (+ main_~q~1.offset 324) .cse1) .cse2) (and (<= (+ main_~p~1.offset 36) main_~q~1.offset) (<= (+ main_~q~1.offset 364) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 360) .cse0) .cse2) (and (<= (+ main_~q~1.offset 372) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 368) .cse0) (<= (+ main_~p~1.offset 28) main_~q~1.offset) .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 272) .cse0) (<= (+ main_~q~1.offset 276) .cse1) (<= (+ main_~p~1.offset 124) main_~q~1.offset) .cse2) (and .cse2 (<= (+ main_~q~1.offset 120) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 116) .cse0) (<= (+ main_~p~1.offset 280) main_~q~1.offset)) (and .cse4 .cse2 (<= .cse3 main_~q~1.offset)) (and (<= (+ main_~p~1.offset 8) main_~q~1.offset) (<= (+ main_~q~1.offset 392) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 388) .cse0) .cse2) (and (<= (+ main_~q~1.offset 44) .cse1) .cse2 (<= (+ main_~p~1.offset 356) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 40) .cse0)) (and (<= (+ main_~p~1.offset 56) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 340) .cse0) (<= (+ main_~q~1.offset 344) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 256) .cse0) (<= (+ main_~q~1.offset 260) .cse1) .cse2 (<= (+ main_~p~1.offset 140) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 288) .cse1) .cse2 (<= (+ main_~p~1.offset 112) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 284) .cse0)) (and (<= (+ main_~q~1.offset 224) .cse1) .cse2 (<= (+ main_~p~1.offset 176) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 220) .cse0)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 188) .cse0) .cse2 (<= (+ main_~q~1.offset 192) .cse1) (<= (+ main_~p~1.offset 208) main_~q~1.offset)) (and .cse2 (<= (+ main_~p~1.offset 296) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 100) .cse0) (<= (+ main_~q~1.offset 104) .cse1)) (and (<= (+ main_~q~1.offset 312) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 308) .cse0) (<= (+ main_~p~1.offset 88) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 228) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 172) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 168) .cse0)) (and (<= (+ main_~q~1.offset 316) .cse1) (<= (+ main_~p~1.offset 84) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 312) .cse0)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 232) .cse0) (<= (+ main_~p~1.offset 164) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 236) .cse1)) (and (<= (+ main_~p~1.offset 168) main_~q~1.offset) (<= (+ main_~q~1.offset 232) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 228) .cse0)) (and (<= (+ main_~p~1.offset 52) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 348) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 344) .cse0)) (and (<= (+ main_~q~1.offset 92) .cse1) .cse2 (<= (+ main_~p~1.offset 308) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 88) .cse0)) (and (<= (+ main_~q~1.offset 4) .cse1) .cse4 (<= (+ main_~p~1.offset 396) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 172) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 224) .cse0) (<= (+ main_~q~1.offset 228) .cse1)) (and (<= (+ main_~p~1.offset 320) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 76) .cse0) (<= (+ main_~q~1.offset 80) .cse1)) (and (<= (+ main_~p~1.offset 44) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 352) .cse0) (<= (+ main_~q~1.offset 356) .cse1)) (and (<= (+ main_~q~1.offset 152) .cse1) .cse2 (<= (+ main_~p~1.offset 248) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 148) .cse0)) (and (<= (+ main_~p~1.offset 380) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 16) .cse0) (<= (+ main_~q~1.offset 20) .cse1) .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 300) .cse0) (<= (+ main_~p~1.offset 96) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 304) .cse1)) (and (<= (+ main_~q~1.offset 196) .cse1) .cse2 (<= (+ main_~p~1.offset 204) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 192) .cse0)) (and .cse2 (<= (+ main_~p~1.offset 332) main_~q~1.offset) (<= (+ main_~q~1.offset 68) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 64) .cse0)) (and (<= (+ main_~p~1.offset 256) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 140) .cse0) (<= (+ main_~q~1.offset 144) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 8) .cse0) .cse2 (<= (+ main_~p~1.offset 388) main_~q~1.offset) (<= (+ main_~q~1.offset 12) .cse1)) (and .cse2 (<= (+ main_~q~1.offset 128) .cse1) (<= (+ main_~p~1.offset 272) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 124) .cse0)) (and (<= (+ main_~p~1.offset 284) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 112) .cse0) (<= (+ main_~q~1.offset 116) .cse1)) (and (<= (+ main_~p~1.offset 304) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 92) .cse0) (<= (+ main_~q~1.offset 96) .cse1)) (and .cse2 (<= (+ main_~p~1.offset 340) main_~q~1.offset) (<= (+ main_~q~1.offset 60) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 56) .cse0)) (and (<= (+ main_~q~1.offset 164) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 160) .cse0) (<= (+ main_~p~1.offset 236) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 148) .cse1) (<= (+ main_~p~1.offset 252) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 144) .cse0)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 180) .cse0) (<= (+ main_~q~1.offset 184) .cse1) .cse2 (<= (+ main_~p~1.offset 216) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 108) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 104) .cse0) (<= (+ main_~p~1.offset 292) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 316) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 80) .cse0) (<= (+ main_~q~1.offset 84) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 384) .cse0) (<= (+ main_~q~1.offset 388) .cse1) .cse2 (<= (+ main_~p~1.offset 12) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 76) .cse1) (<= (+ main_~p~1.offset 324) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 72) .cse0)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 132) .cse0) (<= (+ main_~q~1.offset 136) .cse1) .cse2 (<= (+ main_~p~1.offset 264) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 208) .cse0) (<= (+ main_~p~1.offset 188) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 212) .cse1)) (and (<= (+ main_~p~1.offset 60) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 340) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 336) .cse0)) (and (<= (+ main_~q~1.offset 264) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 260) .cse0) .cse2 (<= (+ main_~p~1.offset 136) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 392) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 4) .cse0) (<= (+ main_~q~1.offset 8) .cse1) .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 236) .cse0) .cse2 (<= (+ main_~q~1.offset 240) .cse1) (<= (+ main_~p~1.offset 160) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 268) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 264) .cse0) (<= (+ main_~p~1.offset 132) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 52) .cse1) .cse2 (<= (+ main_~p~1.offset 348) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 48) .cse0)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 136) .cse0) .cse2 (<= (+ main_~q~1.offset 140) .cse1) (<= (+ main_~p~1.offset 260) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 88) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 84) .cse0) .cse2 (<= (+ main_~p~1.offset 312) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 104) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 296) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 292) .cse0)) (and (<= (+ main_~p~1.offset 116) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 280) .cse0) .cse2 (<= (+ main_~q~1.offset 284) .cse1)) (and (<= (+ main_~p~1.offset 24) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 372) .cse0) (<= (+ main_~q~1.offset 376) .cse1) .cse2) (and (<= (+ main_~q~1.offset 32) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 28) .cse0) (<= (+ main_~p~1.offset 368) main_~q~1.offset) .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 332) .cse0) .cse2 (<= (+ main_~q~1.offset 336) .cse1) (<= (+ main_~p~1.offset 64) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 356) .cse0) (<= (+ main_~q~1.offset 360) .cse1) (<= (+ main_~p~1.offset 40) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 156) .cse1) .cse2 (<= (+ main_~p~1.offset 244) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 152) .cse0)) (and (<= (+ main_~p~1.offset 240) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 156) .cse0) (<= (+ main_~q~1.offset 160) .cse1)) (and (<= (+ main_~p~1.offset 328) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 68) .cse0) (<= (+ main_~q~1.offset 72) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 24) .cse0) (<= (+ main_~p~1.offset 372) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 28) .cse1)) (and .cse2 (<= (+ main_~p~1.offset 268) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 128) .cse0) (<= (+ main_~q~1.offset 132) .cse1)) (and (<= (+ main_~p~1.offset 364) main_~q~1.offset) (<= (+ main_~q~1.offset 36) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 32) .cse0) .cse2) (and (<= (+ main_~q~1.offset 40) .cse1) .cse2 (<= (+ main_~p~1.offset 360) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 36) .cse0)) (and (<= (+ main_~p~1.offset 180) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 216) .cse0) (<= (+ main_~q~1.offset 220) .cse1) .cse2)))) [2018-09-26 08:28:10,779 INFO L422 ceAbstractionStarter]: At program point L12-2(lines 12 31) the Hoare annotation is: (select |#valid| main_~q~1.base) [2018-09-26 08:28:10,783 INFO L422 ceAbstractionStarter]: At program point L41(line 41) the Hoare annotation is: (let ((.cse4 (= |main_read~int_#ptr.base| main_~q~1.base)) (.cse1 (select |#length| main_~q~1.base)) (.cse0 (select |#valid| main_~q~1.base)) (.cse3 (select |#length| |main_read~int_#ptr.base|)) (.cse2 (select |#valid| |main_read~int_#ptr.base|))) (or (and .cse0 (<= (+ main_~q~1.offset 84) .cse1) .cse2 (<= (+ main_~p~1.offset 316) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 80) .cse3)) (and (<= (+ main_~q~1.offset 332) .cse1) (<= (+ main_~p~1.offset 68) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 328) .cse3) .cse0 .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 8) .cse3) .cse2 .cse0 (<= (+ main_~p~1.offset 388) main_~q~1.offset) (<= (+ main_~q~1.offset 12) .cse1)) (and (<= (+ main_~q~1.offset 152) .cse1) .cse0 (<= (+ main_~p~1.offset 248) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 148) .cse3)) (and .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 164) .cse3) (<= (+ main_~q~1.offset 168) .cse1) (<= (+ main_~p~1.offset 232) main_~q~1.offset)) (and .cse4 (<= (+ main_~p~1.offset 4) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 392) .cse3) (<= (+ main_~q~1.offset 396) .cse1) .cse0) (and (<= (+ main_~p~1.offset 52) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 348) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 344) .cse3)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 136) .cse3) .cse0 .cse2 (<= (+ main_~q~1.offset 140) .cse1) (<= (+ main_~p~1.offset 260) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 196) main_~q~1.offset) (<= (+ main_~q~1.offset 204) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 200) .cse3) .cse0 .cse2) (and (<= (+ main_~p~1.offset 380) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 16) .cse3) (<= (+ main_~q~1.offset 20) .cse1) .cse0) (and (<= (+ main_~p~1.offset 228) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 172) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 168) .cse3)) (and (<= (+ main_~p~1.offset 76) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 320) .cse3) (<= (+ main_~q~1.offset 324) .cse1) .cse0 .cse2) (and (<= (+ main_~q~1.offset 352) .cse1) (<= (+ main_~p~1.offset 48) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 348) .cse3) .cse0 .cse2) (and (<= (+ main_~p~1.offset 392) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 4) .cse3) .cse2 (<= (+ main_~q~1.offset 8) .cse1) .cse0) (and (<= (+ main_~q~1.offset 156) .cse1) .cse0 (<= (+ main_~p~1.offset 244) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 152) .cse3)) (and (<= (+ main_~q~1.offset 312) .cse1) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 308) .cse3) (<= (+ main_~p~1.offset 88) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 208) .cse3) (<= (+ main_~p~1.offset 188) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 212) .cse1) .cse2) (and .cse4 (<= (+ main_~p~1.offset 400) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 396) .cse3) .cse0 (= main_~p~1.offset main_~q~1.offset)) (and (<= (+ main_~p~1.offset 192) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 204) .cse3) .cse0 .cse2 (<= (+ main_~q~1.offset 208) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 188) .cse3) .cse0 (<= (+ main_~q~1.offset 192) .cse1) .cse2 (<= (+ main_~p~1.offset 208) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 72) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 324) .cse3) .cse0 .cse2 (<= (+ main_~q~1.offset 328) .cse1)) (and (<= (+ main_~q~1.offset 180) .cse1) (<= (+ main_~p~1.offset 220) main_~q~1.offset) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 176) .cse3)) (and (<= (+ main_~p~1.offset 328) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 68) .cse3) .cse2 (<= (+ main_~q~1.offset 72) .cse1)) (and (<= (+ main_~q~1.offset 196) .cse1) .cse0 (<= (+ main_~p~1.offset 204) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 192) .cse3) .cse2) (and (<= (+ main_~q~1.offset 164) .cse1) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 160) .cse3) .cse2 (<= (+ main_~p~1.offset 236) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 24) .cse1) (<= (+ main_~p~1.offset 376) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 20) .cse3) .cse2 .cse0) (and (<= (+ main_~q~1.offset 48) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 44) .cse3) (<= (+ main_~p~1.offset 352) main_~q~1.offset) .cse0 .cse2) (and (<= (+ main_~q~1.offset 384) .cse1) .cse2 (<= (+ main_~p~1.offset 16) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 380) .cse3)) (and .cse0 (<= (+ main_~q~1.offset 124) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 120) .cse3) (<= (+ main_~p~1.offset 276) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 196) .cse3) (<= (+ main_~p~1.offset 200) main_~q~1.offset) (<= (+ main_~q~1.offset 200) .cse1) .cse0 .cse2) (and (<= (+ main_~p~1.offset 304) main_~q~1.offset) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 92) .cse3) (<= (+ main_~q~1.offset 96) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 132) .cse3) (<= (+ main_~q~1.offset 136) .cse1) .cse0 .cse2 (<= (+ main_~p~1.offset 264) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 232) .cse3) (<= (+ main_~p~1.offset 164) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 236) .cse1)) (and (<= (+ main_~q~1.offset 264) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 260) .cse3) .cse0 (<= (+ main_~p~1.offset 136) main_~q~1.offset) .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 272) .cse3) (<= (+ main_~q~1.offset 276) .cse1) (<= (+ main_~p~1.offset 124) main_~q~1.offset) .cse0 .cse2) (and (<= (+ main_~q~1.offset 272) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 268) .cse3) (<= (+ main_~p~1.offset 128) main_~q~1.offset) .cse0 .cse2) (and (<= (+ main_~p~1.offset 212) main_~q~1.offset) (<= (+ main_~q~1.offset 188) .cse1) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 184) .cse3)) (and (<= (+ main_~p~1.offset 240) main_~q~1.offset) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 156) .cse3) (<= (+ main_~q~1.offset 160) .cse1)) (and (<= (+ main_~q~1.offset 52) .cse1) .cse0 (<= (+ main_~p~1.offset 348) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 48) .cse3) .cse2) (and (<= (+ main_~q~1.offset 108) .cse1) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 104) .cse3) .cse2 (<= (+ main_~p~1.offset 292) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 180) .cse3) (<= (+ main_~q~1.offset 184) .cse1) .cse0 (<= (+ main_~p~1.offset 216) main_~q~1.offset) .cse2) (and .cse0 .cse2 (<= (+ main_~q~1.offset 120) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 116) .cse3) (<= (+ main_~p~1.offset 280) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 60) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 340) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 336) .cse3)) (and (<= (+ main_~q~1.offset 148) .cse1) (<= (+ main_~p~1.offset 252) main_~q~1.offset) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 144) .cse3)) (and (<= (+ main_~p~1.offset 364) main_~q~1.offset) (<= (+ main_~q~1.offset 36) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 32) .cse3) .cse0 .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 96) .cse3) .cse0 .cse2 (<= (+ main_~q~1.offset 100) .cse1) (<= (+ main_~p~1.offset 300) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 120) main_~q~1.offset) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 276) .cse3) (<= (+ main_~q~1.offset 280) .cse1)) (and (<= (+ main_~q~1.offset 216) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 212) .cse3) .cse0 .cse2 (<= (+ main_~p~1.offset 184) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 44) main_~q~1.offset) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 352) .cse3) (<= (+ main_~q~1.offset 356) .cse1)) (and (<= (+ main_~q~1.offset 372) .cse1) (<= (+ main_~p~1.offset 28) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 368) .cse3) .cse0) (and .cse0 (<= (+ main_~p~1.offset 332) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 68) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 64) .cse3)) (and (<= (+ main_~p~1.offset 168) main_~q~1.offset) (<= (+ main_~q~1.offset 232) .cse1) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 228) .cse3) .cse2) (and (<= (+ main_~p~1.offset 56) main_~q~1.offset) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 340) .cse3) (<= (+ main_~q~1.offset 344) .cse1)) (and (<= (+ main_~q~1.offset 44) .cse1) .cse0 (<= (+ main_~p~1.offset 356) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 40) .cse3)) (and (<= (+ main_~p~1.offset 80) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 316) .cse3) .cse0 (<= (+ main_~q~1.offset 320) .cse1) .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 304) .cse3) (<= (+ main_~p~1.offset 92) main_~q~1.offset) (<= (+ main_~q~1.offset 308) .cse1) .cse0 .cse2) (and .cse0 (<= (+ main_~p~1.offset 268) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 128) .cse3) .cse2 (<= (+ main_~q~1.offset 132) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 332) .cse3) .cse0 .cse2 (<= (+ main_~q~1.offset 336) .cse1) (<= (+ main_~p~1.offset 64) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 316) .cse1) (<= (+ main_~p~1.offset 84) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 312) .cse3) .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 356) .cse3) (<= (+ main_~q~1.offset 360) .cse1) (<= (+ main_~p~1.offset 40) main_~q~1.offset) .cse0 .cse2) (and .cse0 .cse2 (<= (+ main_~q~1.offset 128) .cse1) (<= (+ main_~p~1.offset 272) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 124) .cse3)) (and (<= (+ main_~p~1.offset 320) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 76) .cse3) (<= (+ main_~q~1.offset 80) .cse1) .cse2) (and (<= (+ main_~q~1.offset 88) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 84) .cse3) .cse0 .cse2 (<= (+ main_~p~1.offset 312) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 256) main_~q~1.offset) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 140) .cse3) (<= (+ main_~q~1.offset 144) .cse1)) (and (<= (+ main_~q~1.offset 40) .cse1) .cse0 (<= (+ main_~p~1.offset 360) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 36) .cse3) .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 24) .cse3) (<= (+ main_~p~1.offset 372) main_~q~1.offset) .cse2 .cse0 (<= (+ main_~q~1.offset 28) .cse1)) (and (<= (+ main_~p~1.offset 8) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 392) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 388) .cse3) .cse0) (and (<= (+ main_~q~1.offset 32) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 28) .cse3) .cse2 (<= (+ main_~p~1.offset 368) main_~q~1.offset) .cse0) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 248) .cse3) (<= (+ main_~q~1.offset 252) .cse1) (<= (+ main_~p~1.offset 148) main_~q~1.offset) .cse0 .cse2) (and (<= (+ main_~q~1.offset 224) .cse1) .cse0 (<= (+ main_~p~1.offset 176) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 220) .cse3)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 256) .cse3) (<= (+ main_~q~1.offset 260) .cse1) .cse0 .cse2 (<= (+ main_~p~1.offset 140) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 300) .cse3) (<= (+ main_~p~1.offset 96) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 304) .cse1)) (and (<= (+ main_~q~1.offset 256) .cse1) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 252) .cse3) (<= (+ main_~p~1.offset 144) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 92) .cse1) .cse0 (<= (+ main_~p~1.offset 308) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 88) .cse3)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 236) .cse3) .cse0 .cse2 (<= (+ main_~q~1.offset 240) .cse1) (<= (+ main_~p~1.offset 160) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 24) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 372) .cse3) .cse2 (<= (+ main_~q~1.offset 376) .cse1) .cse0) (and (<= (+ main_~q~1.offset 368) .cse1) (<= (+ main_~p~1.offset 32) main_~q~1.offset) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 364) .cse3)) (and .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 52) .cse3) (<= (+ main_~p~1.offset 344) main_~q~1.offset) (<= (+ main_~q~1.offset 56) .cse1) .cse2) (and (<= (+ main_~p~1.offset 172) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 224) .cse3) .cse2 (<= (+ main_~q~1.offset 228) .cse1)) (and (<= (+ main_~p~1.offset 156) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 244) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 240) .cse3) .cse2) (and (<= (+ main_~p~1.offset 384) main_~q~1.offset) .cse2 .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 12) .cse3) (<= (+ main_~q~1.offset 16) .cse1)) (and (<= (+ main_~p~1.offset 284) main_~q~1.offset) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 112) .cse3) (<= (+ main_~q~1.offset 116) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 296) .cse3) (<= (+ main_~q~1.offset 300) .cse1) .cse0 .cse2 (<= (+ main_~p~1.offset 100) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 116) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 280) .cse3) .cse0 .cse2 (<= (+ main_~q~1.offset 284) .cse1)) (and (<= (+ main_~p~1.offset 104) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 296) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 292) .cse3)) (and .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 384) .cse3) (<= (+ main_~q~1.offset 388) .cse1) .cse0 (<= (+ main_~p~1.offset 12) main_~q~1.offset)) (and .cse0 .cse2 (<= (+ main_~q~1.offset 112) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 108) .cse3) (<= (+ main_~p~1.offset 288) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 288) .cse1) .cse0 (<= (+ main_~p~1.offset 112) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 284) .cse3)) (and .cse0 (<= (+ main_~p~1.offset 224) main_~q~1.offset) (<= (+ main_~q~1.offset 176) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 172) .cse3)) (and (<= (+ main_~p~1.offset 336) main_~q~1.offset) (<= (+ main_~q~1.offset 64) .cse1) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 60) .cse3) .cse2) (and (<= (+ main_~q~1.offset 76) .cse1) (<= (+ main_~p~1.offset 324) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 72) .cse3) .cse2) (and .cse0 .cse2 (<= (+ main_~p~1.offset 296) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 100) .cse3) (<= (+ main_~q~1.offset 104) .cse1)) (and (<= (+ main_~q~1.offset 4) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType|) .cse3) .cse2 (<= (+ main_~p~1.offset 396) main_~q~1.offset) .cse0) (and (<= (+ main_~p~1.offset 180) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 216) .cse3) (<= (+ main_~q~1.offset 220) .cse1) .cse0 .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 288) .cse3) .cse0 (<= (+ main_~q~1.offset 292) .cse1) .cse2 (<= (+ main_~p~1.offset 108) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 36) main_~q~1.offset) (<= (+ main_~q~1.offset 364) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 360) .cse3) .cse0 .cse2) (and (<= (+ main_~q~1.offset 248) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 244) .cse3) .cse0 .cse2 (<= (+ main_~p~1.offset 152) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 376) .cse3) (<= (+ main_~p~1.offset 20) main_~q~1.offset) .cse2 .cse0 (<= (+ main_~q~1.offset 380) .cse1)) (and .cse0 (<= (+ main_~p~1.offset 340) main_~q~1.offset) (<= (+ main_~q~1.offset 60) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 56) .cse3) .cse2) (and (<= (+ main_~q~1.offset 268) .cse1) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 264) .cse3) .cse2 (<= (+ main_~p~1.offset 132) main_~q~1.offset)))) [2018-09-26 08:28:10,788 INFO L422 ceAbstractionStarter]: At program point L41-1(lines 41 42) the Hoare annotation is: (let ((.cse4 (= |main_read~int_#ptr.base| main_~q~1.base)) (.cse1 (select |#length| main_~q~1.base)) (.cse0 (select |#valid| main_~q~1.base)) (.cse3 (select |#length| |main_read~int_#ptr.base|)) (.cse2 (select |#valid| |main_read~int_#ptr.base|))) (or (and .cse0 (<= (+ main_~q~1.offset 84) .cse1) .cse2 (<= (+ main_~p~1.offset 316) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 80) .cse3)) (and (<= (+ main_~q~1.offset 332) .cse1) (<= (+ main_~p~1.offset 68) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 328) .cse3) .cse0 .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 8) .cse3) .cse2 .cse0 (<= (+ main_~p~1.offset 388) main_~q~1.offset) (<= (+ main_~q~1.offset 12) .cse1)) (and (<= (+ main_~q~1.offset 152) .cse1) .cse0 (<= (+ main_~p~1.offset 248) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 148) .cse3)) (and .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 164) .cse3) (<= (+ main_~q~1.offset 168) .cse1) (<= (+ main_~p~1.offset 232) main_~q~1.offset)) (and .cse4 (<= (+ main_~p~1.offset 4) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 392) .cse3) (<= (+ main_~q~1.offset 396) .cse1) .cse0) (and (<= (+ main_~p~1.offset 52) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 348) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 344) .cse3)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 136) .cse3) .cse0 .cse2 (<= (+ main_~q~1.offset 140) .cse1) (<= (+ main_~p~1.offset 260) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 196) main_~q~1.offset) (<= (+ main_~q~1.offset 204) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 200) .cse3) .cse0 .cse2) (and (<= (+ main_~p~1.offset 380) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 16) .cse3) (<= (+ main_~q~1.offset 20) .cse1) .cse0) (and (<= (+ main_~p~1.offset 228) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 172) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 168) .cse3)) (and (<= (+ main_~p~1.offset 76) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 320) .cse3) (<= (+ main_~q~1.offset 324) .cse1) .cse0 .cse2) (and (<= (+ main_~q~1.offset 352) .cse1) (<= (+ main_~p~1.offset 48) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 348) .cse3) .cse0 .cse2) (and (<= (+ main_~p~1.offset 392) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 4) .cse3) .cse2 (<= (+ main_~q~1.offset 8) .cse1) .cse0) (and (<= (+ main_~q~1.offset 156) .cse1) .cse0 (<= (+ main_~p~1.offset 244) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 152) .cse3)) (and (<= (+ main_~q~1.offset 312) .cse1) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 308) .cse3) (<= (+ main_~p~1.offset 88) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 208) .cse3) (<= (+ main_~p~1.offset 188) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 212) .cse1) .cse2) (and .cse4 (<= (+ main_~p~1.offset 400) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 396) .cse3) .cse0 (= main_~p~1.offset main_~q~1.offset)) (and (<= (+ main_~p~1.offset 192) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 204) .cse3) .cse0 .cse2 (<= (+ main_~q~1.offset 208) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 188) .cse3) .cse0 (<= (+ main_~q~1.offset 192) .cse1) .cse2 (<= (+ main_~p~1.offset 208) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 72) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 324) .cse3) .cse0 .cse2 (<= (+ main_~q~1.offset 328) .cse1)) (and (<= (+ main_~q~1.offset 180) .cse1) (<= (+ main_~p~1.offset 220) main_~q~1.offset) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 176) .cse3)) (and (<= (+ main_~p~1.offset 328) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 68) .cse3) .cse2 (<= (+ main_~q~1.offset 72) .cse1)) (and (<= (+ main_~q~1.offset 196) .cse1) .cse0 (<= (+ main_~p~1.offset 204) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 192) .cse3) .cse2) (and (<= (+ main_~q~1.offset 164) .cse1) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 160) .cse3) .cse2 (<= (+ main_~p~1.offset 236) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 24) .cse1) (<= (+ main_~p~1.offset 376) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 20) .cse3) .cse2 .cse0) (and (<= (+ main_~q~1.offset 48) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 44) .cse3) (<= (+ main_~p~1.offset 352) main_~q~1.offset) .cse0 .cse2) (and (<= (+ main_~q~1.offset 384) .cse1) .cse2 (<= (+ main_~p~1.offset 16) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 380) .cse3)) (and .cse0 (<= (+ main_~q~1.offset 124) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 120) .cse3) (<= (+ main_~p~1.offset 276) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 196) .cse3) (<= (+ main_~p~1.offset 200) main_~q~1.offset) (<= (+ main_~q~1.offset 200) .cse1) .cse0 .cse2) (and (<= (+ main_~p~1.offset 304) main_~q~1.offset) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 92) .cse3) (<= (+ main_~q~1.offset 96) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 132) .cse3) (<= (+ main_~q~1.offset 136) .cse1) .cse0 .cse2 (<= (+ main_~p~1.offset 264) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 232) .cse3) (<= (+ main_~p~1.offset 164) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 236) .cse1)) (and (<= (+ main_~q~1.offset 264) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 260) .cse3) .cse0 (<= (+ main_~p~1.offset 136) main_~q~1.offset) .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 272) .cse3) (<= (+ main_~q~1.offset 276) .cse1) (<= (+ main_~p~1.offset 124) main_~q~1.offset) .cse0 .cse2) (and (<= (+ main_~q~1.offset 272) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 268) .cse3) (<= (+ main_~p~1.offset 128) main_~q~1.offset) .cse0 .cse2) (and (<= (+ main_~p~1.offset 212) main_~q~1.offset) (<= (+ main_~q~1.offset 188) .cse1) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 184) .cse3)) (and (<= (+ main_~p~1.offset 240) main_~q~1.offset) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 156) .cse3) (<= (+ main_~q~1.offset 160) .cse1)) (and (<= (+ main_~q~1.offset 52) .cse1) .cse0 (<= (+ main_~p~1.offset 348) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 48) .cse3) .cse2) (and (<= (+ main_~q~1.offset 108) .cse1) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 104) .cse3) .cse2 (<= (+ main_~p~1.offset 292) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 180) .cse3) (<= (+ main_~q~1.offset 184) .cse1) .cse0 (<= (+ main_~p~1.offset 216) main_~q~1.offset) .cse2) (and .cse0 .cse2 (<= (+ main_~q~1.offset 120) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 116) .cse3) (<= (+ main_~p~1.offset 280) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 60) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 340) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 336) .cse3)) (and (<= (+ main_~q~1.offset 148) .cse1) (<= (+ main_~p~1.offset 252) main_~q~1.offset) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 144) .cse3)) (and (<= (+ main_~p~1.offset 364) main_~q~1.offset) (<= (+ main_~q~1.offset 36) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 32) .cse3) .cse0 .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 96) .cse3) .cse0 .cse2 (<= (+ main_~q~1.offset 100) .cse1) (<= (+ main_~p~1.offset 300) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 120) main_~q~1.offset) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 276) .cse3) (<= (+ main_~q~1.offset 280) .cse1)) (and (<= (+ main_~q~1.offset 216) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 212) .cse3) .cse0 .cse2 (<= (+ main_~p~1.offset 184) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 44) main_~q~1.offset) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 352) .cse3) (<= (+ main_~q~1.offset 356) .cse1)) (and (<= (+ main_~q~1.offset 372) .cse1) (<= (+ main_~p~1.offset 28) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 368) .cse3) .cse0) (and .cse0 (<= (+ main_~p~1.offset 332) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 68) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 64) .cse3)) (and (<= (+ main_~p~1.offset 168) main_~q~1.offset) (<= (+ main_~q~1.offset 232) .cse1) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 228) .cse3) .cse2) (and (<= (+ main_~p~1.offset 56) main_~q~1.offset) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 340) .cse3) (<= (+ main_~q~1.offset 344) .cse1)) (and (<= (+ main_~q~1.offset 44) .cse1) .cse0 (<= (+ main_~p~1.offset 356) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 40) .cse3)) (and (<= (+ main_~p~1.offset 80) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 316) .cse3) .cse0 (<= (+ main_~q~1.offset 320) .cse1) .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 304) .cse3) (<= (+ main_~p~1.offset 92) main_~q~1.offset) (<= (+ main_~q~1.offset 308) .cse1) .cse0 .cse2) (and .cse0 (<= (+ main_~p~1.offset 268) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 128) .cse3) .cse2 (<= (+ main_~q~1.offset 132) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 332) .cse3) .cse0 .cse2 (<= (+ main_~q~1.offset 336) .cse1) (<= (+ main_~p~1.offset 64) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 316) .cse1) (<= (+ main_~p~1.offset 84) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 312) .cse3) .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 356) .cse3) (<= (+ main_~q~1.offset 360) .cse1) (<= (+ main_~p~1.offset 40) main_~q~1.offset) .cse0 .cse2) (and .cse0 .cse2 (<= (+ main_~q~1.offset 128) .cse1) (<= (+ main_~p~1.offset 272) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 124) .cse3)) (and (<= (+ main_~p~1.offset 320) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 76) .cse3) (<= (+ main_~q~1.offset 80) .cse1) .cse2) (and (<= (+ main_~q~1.offset 88) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 84) .cse3) .cse0 .cse2 (<= (+ main_~p~1.offset 312) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 256) main_~q~1.offset) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 140) .cse3) (<= (+ main_~q~1.offset 144) .cse1)) (and (<= (+ main_~q~1.offset 40) .cse1) .cse0 (<= (+ main_~p~1.offset 360) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 36) .cse3) .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 24) .cse3) (<= (+ main_~p~1.offset 372) main_~q~1.offset) .cse2 .cse0 (<= (+ main_~q~1.offset 28) .cse1)) (and (<= (+ main_~p~1.offset 8) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 392) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 388) .cse3) .cse0) (and (<= (+ main_~q~1.offset 32) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 28) .cse3) .cse2 (<= (+ main_~p~1.offset 368) main_~q~1.offset) .cse0) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 248) .cse3) (<= (+ main_~q~1.offset 252) .cse1) (<= (+ main_~p~1.offset 148) main_~q~1.offset) .cse0 .cse2) (and (<= (+ main_~q~1.offset 224) .cse1) .cse0 (<= (+ main_~p~1.offset 176) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 220) .cse3)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 256) .cse3) (<= (+ main_~q~1.offset 260) .cse1) .cse0 .cse2 (<= (+ main_~p~1.offset 140) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 300) .cse3) (<= (+ main_~p~1.offset 96) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 304) .cse1)) (and (<= (+ main_~q~1.offset 256) .cse1) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 252) .cse3) (<= (+ main_~p~1.offset 144) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 92) .cse1) .cse0 (<= (+ main_~p~1.offset 308) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 88) .cse3)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 236) .cse3) .cse0 .cse2 (<= (+ main_~q~1.offset 240) .cse1) (<= (+ main_~p~1.offset 160) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 24) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 372) .cse3) .cse2 (<= (+ main_~q~1.offset 376) .cse1) .cse0) (and (<= (+ main_~q~1.offset 368) .cse1) (<= (+ main_~p~1.offset 32) main_~q~1.offset) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 364) .cse3)) (and .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 52) .cse3) (<= (+ main_~p~1.offset 344) main_~q~1.offset) (<= (+ main_~q~1.offset 56) .cse1) .cse2) (and (<= (+ main_~p~1.offset 172) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 224) .cse3) .cse2 (<= (+ main_~q~1.offset 228) .cse1)) (and (<= (+ main_~p~1.offset 156) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 244) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 240) .cse3) .cse2) (and (<= (+ main_~p~1.offset 384) main_~q~1.offset) .cse2 .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 12) .cse3) (<= (+ main_~q~1.offset 16) .cse1)) (and (<= (+ main_~p~1.offset 284) main_~q~1.offset) .cse0 .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 112) .cse3) (<= (+ main_~q~1.offset 116) .cse1)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 296) .cse3) (<= (+ main_~q~1.offset 300) .cse1) .cse0 .cse2 (<= (+ main_~p~1.offset 100) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 116) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 280) .cse3) .cse0 .cse2 (<= (+ main_~q~1.offset 284) .cse1)) (and (<= (+ main_~p~1.offset 104) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 296) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 292) .cse3)) (and .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 384) .cse3) (<= (+ main_~q~1.offset 388) .cse1) .cse0 (<= (+ main_~p~1.offset 12) main_~q~1.offset)) (and .cse0 .cse2 (<= (+ main_~q~1.offset 112) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 108) .cse3) (<= (+ main_~p~1.offset 288) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 288) .cse1) .cse0 (<= (+ main_~p~1.offset 112) main_~q~1.offset) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 284) .cse3)) (and .cse0 (<= (+ main_~p~1.offset 224) main_~q~1.offset) (<= (+ main_~q~1.offset 176) .cse1) .cse2 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 172) .cse3)) (and (<= (+ main_~p~1.offset 336) main_~q~1.offset) (<= (+ main_~q~1.offset 64) .cse1) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 60) .cse3) .cse2) (and (<= (+ main_~q~1.offset 76) .cse1) (<= (+ main_~p~1.offset 324) main_~q~1.offset) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 72) .cse3) .cse2) (and .cse0 .cse2 (<= (+ main_~p~1.offset 296) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 100) .cse3) (<= (+ main_~q~1.offset 104) .cse1)) (and (<= (+ main_~q~1.offset 4) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType|) .cse3) .cse2 (<= (+ main_~p~1.offset 396) main_~q~1.offset) .cse0) (and (<= (+ main_~p~1.offset 180) main_~q~1.offset) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 216) .cse3) (<= (+ main_~q~1.offset 220) .cse1) .cse0 .cse2) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 288) .cse3) .cse0 (<= (+ main_~q~1.offset 292) .cse1) .cse2 (<= (+ main_~p~1.offset 108) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 36) main_~q~1.offset) (<= (+ main_~q~1.offset 364) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 360) .cse3) .cse0 .cse2) (and (<= (+ main_~q~1.offset 248) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 244) .cse3) .cse0 .cse2 (<= (+ main_~p~1.offset 152) main_~q~1.offset)) (and (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 376) .cse3) (<= (+ main_~p~1.offset 20) main_~q~1.offset) .cse2 .cse0 (<= (+ main_~q~1.offset 380) .cse1)) (and .cse0 (<= (+ main_~p~1.offset 340) main_~q~1.offset) (<= (+ main_~q~1.offset 60) .cse1) (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 56) .cse3) .cse2) (and (<= (+ main_~q~1.offset 268) .cse1) .cse0 (<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 264) .cse3) .cse2 (<= (+ main_~p~1.offset 132) main_~q~1.offset)))) [2018-09-26 08:28:10,886 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:28:10 BoogieIcfgContainer [2018-09-26 08:28:10,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:28:10,887 INFO L168 Benchmark]: Toolchain (without parser) took 208650.56 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -127.9 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-26 08:28:10,889 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:28:10,889 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:28:10,891 INFO L168 Benchmark]: Boogie Preprocessor took 22.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:28:10,891 INFO L168 Benchmark]: RCFGBuilder took 320.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:28:10,892 INFO L168 Benchmark]: TraceAbstraction took 208241.85 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -138.4 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-26 08:28:10,901 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.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.18 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 22.84 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 320.18 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 208241.85 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -138.4 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: procedure precondition always holds and assertion always holds For all program executions holds that procedure precondition always holds and assertion always holds at this location - PositiveResult [Line: 41]: procedure precondition always holds and assertion always holds For all program executions holds that procedure precondition always holds and assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((#ptr!offset + #sizeOfReadType + 296 <= #length[#ptr!base] && ~q~1!offset + 300 <= #length[~q~1!base]) && #valid[~q~1!base]) && ~p~1!offset + 100 <= ~q~1!offset) || (((~p~1!offset + 336 <= ~q~1!offset && ~q~1!offset + 64 <= #length[~q~1!base]) && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 60 <= #length[#ptr!base])) || (((~p~1!offset + 72 <= ~q~1!offset && #ptr!offset + #sizeOfReadType + 324 <= #length[#ptr!base]) && #valid[~q~1!base]) && ~q~1!offset + 328 <= #length[~q~1!base])) || (((#ptr!offset + #sizeOfReadType + 288 <= #length[#ptr!base] && #valid[~q~1!base]) && ~q~1!offset + 292 <= #length[~q~1!base]) && ~p~1!offset + 108 <= ~q~1!offset)) || (((#ptr!offset + #sizeOfReadType + 248 <= #length[#ptr!base] && ~q~1!offset + 252 <= #length[~q~1!base]) && ~p~1!offset + 148 <= ~q~1!offset) && #valid[~q~1!base])) || (((#ptr!offset + #sizeOfReadType + 376 <= #length[#ptr!base] && ~p~1!offset + 20 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 380 <= #length[~q~1!base])) || (((~p~1!offset + 80 <= ~q~1!offset && #ptr!offset + #sizeOfReadType + 316 <= #length[#ptr!base]) && #valid[~q~1!base]) && ~q~1!offset + 320 <= #length[~q~1!base])) || (((#valid[~q~1!base] && ~q~1!offset + 112 <= #length[~q~1!base]) && #ptr!offset + #sizeOfReadType + 108 <= #length[#ptr!base]) && ~p~1!offset + 288 <= ~q~1!offset)) || (((~q~1!offset + 256 <= #length[~q~1!base] && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 252 <= #length[#ptr!base]) && ~p~1!offset + 144 <= ~q~1!offset)) || (((~p~1!offset + 212 <= ~q~1!offset && ~q~1!offset + 188 <= #length[~q~1!base]) && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 184 <= #length[#ptr!base])) || (((#valid[~q~1!base] && ~q~1!offset + 124 <= #length[~q~1!base]) && #ptr!offset + #sizeOfReadType + 120 <= #length[#ptr!base]) && ~p~1!offset + 276 <= ~q~1!offset)) || (((#ptr!offset + #sizeOfReadType + 96 <= #length[#ptr!base] && #valid[~q~1!base]) && ~q~1!offset + 100 <= #length[~q~1!base]) && ~p~1!offset + 300 <= ~q~1!offset)) || ((((#ptr!base == ~q~1!base && ~p~1!offset + 4 <= ~q~1!offset) && #ptr!offset + #sizeOfReadType + 392 <= #length[#ptr!base]) && ~q~1!offset + 396 <= #length[~q~1!base]) && #valid[~q~1!base])) || (((#valid[~q~1!base] && #ptr!offset + #sizeOfReadType + 52 <= #length[#ptr!base]) && ~p~1!offset + 344 <= ~q~1!offset) && ~q~1!offset + 56 <= #length[~q~1!base])) || (((#ptr!offset + #sizeOfReadType + 196 <= #length[#ptr!base] && ~p~1!offset + 200 <= ~q~1!offset) && ~q~1!offset + 200 <= #length[~q~1!base]) && #valid[~q~1!base])) || (((~q~1!offset + 216 <= #length[~q~1!base] && #ptr!offset + #sizeOfReadType + 212 <= #length[#ptr!base]) && #valid[~q~1!base]) && ~p~1!offset + 184 <= ~q~1!offset)) || (((~p~1!offset + 220 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 180 <= #length[~q~1!base]) && #ptr!offset + #sizeOfReadType + 176 <= #length[#ptr!base])) || (((~q~1!offset + 248 <= #length[~q~1!base] && #ptr!offset + #sizeOfReadType + 244 <= #length[#ptr!base]) && #valid[~q~1!base]) && ~p~1!offset + 152 <= ~q~1!offset)) || (((~p~1!offset + 384 <= ~q~1!offset && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 12 <= #length[#ptr!base]) && ~q~1!offset + 16 <= #length[~q~1!base])) || (((~p~1!offset + 120 <= ~q~1!offset && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 276 <= #length[#ptr!base]) && ~q~1!offset + 280 <= #length[~q~1!base])) || ((~p~1!offset == ~q~1!offset && #valid[~q~1!base]) && ~p~1!offset + 400 <= #length[~q~1!base])) || (((~p~1!offset + 196 <= ~q~1!offset && ~q~1!offset + 204 <= #length[~q~1!base]) && #ptr!offset + #sizeOfReadType + 200 <= #length[#ptr!base]) && #valid[~q~1!base])) || (((~q~1!offset + 48 <= #length[~q~1!base] && #ptr!offset + #sizeOfReadType + 44 <= #length[#ptr!base]) && ~p~1!offset + 352 <= ~q~1!offset) && #valid[~q~1!base])) || (((~q~1!offset + 368 <= #length[~q~1!base] && ~p~1!offset + 32 <= ~q~1!offset) && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 364 <= #length[#ptr!base])) || (((~p~1!offset + 192 <= ~q~1!offset && #ptr!offset + #sizeOfReadType + 204 <= #length[#ptr!base]) && #valid[~q~1!base]) && ~q~1!offset + 208 <= #length[~q~1!base])) || (((~q~1!offset + 352 <= #length[~q~1!base] && ~p~1!offset + 48 <= ~q~1!offset) && #ptr!offset + #sizeOfReadType + 348 <= #length[#ptr!base]) && #valid[~q~1!base])) || (((~q~1!offset + 384 <= #length[~q~1!base] && ~p~1!offset + 16 <= ~q~1!offset) && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 380 <= #length[#ptr!base])) || (((#valid[~q~1!base] && #ptr!offset + #sizeOfReadType + 164 <= #length[#ptr!base]) && ~q~1!offset + 168 <= #length[~q~1!base]) && ~p~1!offset + 232 <= ~q~1!offset)) || (((#ptr!offset + #sizeOfReadType + 304 <= #length[#ptr!base] && ~p~1!offset + 92 <= ~q~1!offset) && ~q~1!offset + 308 <= #length[~q~1!base]) && #valid[~q~1!base])) || (((~p~1!offset + 156 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 244 <= #length[~q~1!base]) && #ptr!offset + #sizeOfReadType + 240 <= #length[#ptr!base])) || (((~q~1!offset + 272 <= #length[~q~1!base] && #ptr!offset + #sizeOfReadType + 268 <= #length[#ptr!base]) && ~p~1!offset + 128 <= ~q~1!offset) && #valid[~q~1!base])) || (((~q~1!offset + 24 <= #length[~q~1!base] && ~p~1!offset + 376 <= ~q~1!offset) && #ptr!offset + #sizeOfReadType + 20 <= #length[#ptr!base]) && #valid[~q~1!base])) || (((#valid[~q~1!base] && ~p~1!offset + 224 <= ~q~1!offset) && ~q~1!offset + 176 <= #length[~q~1!base]) && #ptr!offset + #sizeOfReadType + 172 <= #length[#ptr!base])) || (((~q~1!offset + 332 <= #length[~q~1!base] && ~p~1!offset + 68 <= ~q~1!offset) && #ptr!offset + #sizeOfReadType + 328 <= #length[#ptr!base]) && #valid[~q~1!base])) || (((~p~1!offset + 76 <= ~q~1!offset && #ptr!offset + #sizeOfReadType + 320 <= #length[#ptr!base]) && ~q~1!offset + 324 <= #length[~q~1!base]) && #valid[~q~1!base])) || (((~p~1!offset + 36 <= ~q~1!offset && ~q~1!offset + 364 <= #length[~q~1!base]) && #ptr!offset + #sizeOfReadType + 360 <= #length[#ptr!base]) && #valid[~q~1!base])) || (((~q~1!offset + 372 <= #length[~q~1!base] && #ptr!offset + #sizeOfReadType + 368 <= #length[#ptr!base]) && ~p~1!offset + 28 <= ~q~1!offset) && #valid[~q~1!base])) || (((#ptr!offset + #sizeOfReadType + 272 <= #length[#ptr!base] && ~q~1!offset + 276 <= #length[~q~1!base]) && ~p~1!offset + 124 <= ~q~1!offset) && #valid[~q~1!base])) || (((#valid[~q~1!base] && ~q~1!offset + 120 <= #length[~q~1!base]) && #ptr!offset + #sizeOfReadType + 116 <= #length[#ptr!base]) && ~p~1!offset + 280 <= ~q~1!offset)) || ((#ptr!offset + #sizeOfReadType <= #length[#ptr!base] && #valid[~q~1!base]) && ~p~1!offset + 400 <= ~q~1!offset)) || (((~p~1!offset + 8 <= ~q~1!offset && ~q~1!offset + 392 <= #length[~q~1!base]) && #ptr!offset + #sizeOfReadType + 388 <= #length[#ptr!base]) && #valid[~q~1!base])) || (((~q~1!offset + 44 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 356 <= ~q~1!offset) && #ptr!offset + #sizeOfReadType + 40 <= #length[#ptr!base])) || (((~p~1!offset + 56 <= ~q~1!offset && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 340 <= #length[#ptr!base]) && ~q~1!offset + 344 <= #length[~q~1!base])) || (((#ptr!offset + #sizeOfReadType + 256 <= #length[#ptr!base] && ~q~1!offset + 260 <= #length[~q~1!base]) && #valid[~q~1!base]) && ~p~1!offset + 140 <= ~q~1!offset)) || (((~q~1!offset + 288 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 112 <= ~q~1!offset) && #ptr!offset + #sizeOfReadType + 284 <= #length[#ptr!base])) || (((~q~1!offset + 224 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 176 <= ~q~1!offset) && #ptr!offset + #sizeOfReadType + 220 <= #length[#ptr!base])) || (((#ptr!offset + #sizeOfReadType + 188 <= #length[#ptr!base] && #valid[~q~1!base]) && ~q~1!offset + 192 <= #length[~q~1!base]) && ~p~1!offset + 208 <= ~q~1!offset)) || (((#valid[~q~1!base] && ~p~1!offset + 296 <= ~q~1!offset) && #ptr!offset + #sizeOfReadType + 100 <= #length[#ptr!base]) && ~q~1!offset + 104 <= #length[~q~1!base])) || (((~q~1!offset + 312 <= #length[~q~1!base] && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 308 <= #length[#ptr!base]) && ~p~1!offset + 88 <= ~q~1!offset)) || (((~p~1!offset + 228 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 172 <= #length[~q~1!base]) && #ptr!offset + #sizeOfReadType + 168 <= #length[#ptr!base])) || (((~q~1!offset + 316 <= #length[~q~1!base] && ~p~1!offset + 84 <= ~q~1!offset) && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 312 <= #length[#ptr!base])) || (((#ptr!offset + #sizeOfReadType + 232 <= #length[#ptr!base] && ~p~1!offset + 164 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 236 <= #length[~q~1!base])) || (((~p~1!offset + 168 <= ~q~1!offset && ~q~1!offset + 232 <= #length[~q~1!base]) && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 228 <= #length[#ptr!base])) || (((~p~1!offset + 52 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 348 <= #length[~q~1!base]) && #ptr!offset + #sizeOfReadType + 344 <= #length[#ptr!base])) || (((~q~1!offset + 92 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 308 <= ~q~1!offset) && #ptr!offset + #sizeOfReadType + 88 <= #length[#ptr!base])) || (((~q~1!offset + 4 <= #length[~q~1!base] && #ptr!offset + #sizeOfReadType <= #length[#ptr!base]) && ~p~1!offset + 396 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset + 172 <= ~q~1!offset && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 224 <= #length[#ptr!base]) && ~q~1!offset + 228 <= #length[~q~1!base])) || (((~p~1!offset + 320 <= ~q~1!offset && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 76 <= #length[#ptr!base]) && ~q~1!offset + 80 <= #length[~q~1!base])) || (((~p~1!offset + 44 <= ~q~1!offset && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 352 <= #length[#ptr!base]) && ~q~1!offset + 356 <= #length[~q~1!base])) || (((~q~1!offset + 152 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 248 <= ~q~1!offset) && #ptr!offset + #sizeOfReadType + 148 <= #length[#ptr!base])) || (((~p~1!offset + 380 <= ~q~1!offset && #ptr!offset + #sizeOfReadType + 16 <= #length[#ptr!base]) && ~q~1!offset + 20 <= #length[~q~1!base]) && #valid[~q~1!base])) || (((#ptr!offset + #sizeOfReadType + 300 <= #length[#ptr!base] && ~p~1!offset + 96 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 304 <= #length[~q~1!base])) || (((~q~1!offset + 196 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 204 <= ~q~1!offset) && #ptr!offset + #sizeOfReadType + 192 <= #length[#ptr!base])) || (((#valid[~q~1!base] && ~p~1!offset + 332 <= ~q~1!offset) && ~q~1!offset + 68 <= #length[~q~1!base]) && #ptr!offset + #sizeOfReadType + 64 <= #length[#ptr!base])) || (((~p~1!offset + 256 <= ~q~1!offset && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 140 <= #length[#ptr!base]) && ~q~1!offset + 144 <= #length[~q~1!base])) || (((#ptr!offset + #sizeOfReadType + 8 <= #length[#ptr!base] && #valid[~q~1!base]) && ~p~1!offset + 388 <= ~q~1!offset) && ~q~1!offset + 12 <= #length[~q~1!base])) || (((#valid[~q~1!base] && ~q~1!offset + 128 <= #length[~q~1!base]) && ~p~1!offset + 272 <= ~q~1!offset) && #ptr!offset + #sizeOfReadType + 124 <= #length[#ptr!base])) || (((~p~1!offset + 284 <= ~q~1!offset && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 112 <= #length[#ptr!base]) && ~q~1!offset + 116 <= #length[~q~1!base])) || (((~p~1!offset + 304 <= ~q~1!offset && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 92 <= #length[#ptr!base]) && ~q~1!offset + 96 <= #length[~q~1!base])) || (((#valid[~q~1!base] && ~p~1!offset + 340 <= ~q~1!offset) && ~q~1!offset + 60 <= #length[~q~1!base]) && #ptr!offset + #sizeOfReadType + 56 <= #length[#ptr!base])) || (((~q~1!offset + 164 <= #length[~q~1!base] && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 160 <= #length[#ptr!base]) && ~p~1!offset + 236 <= ~q~1!offset)) || (((~q~1!offset + 148 <= #length[~q~1!base] && ~p~1!offset + 252 <= ~q~1!offset) && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 144 <= #length[#ptr!base])) || (((#ptr!offset + #sizeOfReadType + 180 <= #length[#ptr!base] && ~q~1!offset + 184 <= #length[~q~1!base]) && #valid[~q~1!base]) && ~p~1!offset + 216 <= ~q~1!offset)) || (((~q~1!offset + 108 <= #length[~q~1!base] && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 104 <= #length[#ptr!base]) && ~p~1!offset + 292 <= ~q~1!offset)) || (((~p~1!offset + 316 <= ~q~1!offset && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 80 <= #length[#ptr!base]) && ~q~1!offset + 84 <= #length[~q~1!base])) || (((#ptr!offset + #sizeOfReadType + 384 <= #length[#ptr!base] && ~q~1!offset + 388 <= #length[~q~1!base]) && #valid[~q~1!base]) && ~p~1!offset + 12 <= ~q~1!offset)) || (((~q~1!offset + 76 <= #length[~q~1!base] && ~p~1!offset + 324 <= ~q~1!offset) && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 72 <= #length[#ptr!base])) || (((#ptr!offset + #sizeOfReadType + 132 <= #length[#ptr!base] && ~q~1!offset + 136 <= #length[~q~1!base]) && #valid[~q~1!base]) && ~p~1!offset + 264 <= ~q~1!offset)) || (((#ptr!offset + #sizeOfReadType + 208 <= #length[#ptr!base] && ~p~1!offset + 188 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 212 <= #length[~q~1!base])) || (((~p~1!offset + 60 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 340 <= #length[~q~1!base]) && #ptr!offset + #sizeOfReadType + 336 <= #length[#ptr!base])) || (((~q~1!offset + 264 <= #length[~q~1!base] && #ptr!offset + #sizeOfReadType + 260 <= #length[#ptr!base]) && #valid[~q~1!base]) && ~p~1!offset + 136 <= ~q~1!offset)) || (((~p~1!offset + 392 <= ~q~1!offset && #ptr!offset + #sizeOfReadType + 4 <= #length[#ptr!base]) && ~q~1!offset + 8 <= #length[~q~1!base]) && #valid[~q~1!base])) || (((#ptr!offset + #sizeOfReadType + 236 <= #length[#ptr!base] && #valid[~q~1!base]) && ~q~1!offset + 240 <= #length[~q~1!base]) && ~p~1!offset + 160 <= ~q~1!offset)) || (((~q~1!offset + 268 <= #length[~q~1!base] && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 264 <= #length[#ptr!base]) && ~p~1!offset + 132 <= ~q~1!offset)) || (((~q~1!offset + 52 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 348 <= ~q~1!offset) && #ptr!offset + #sizeOfReadType + 48 <= #length[#ptr!base])) || (((#ptr!offset + #sizeOfReadType + 136 <= #length[#ptr!base] && #valid[~q~1!base]) && ~q~1!offset + 140 <= #length[~q~1!base]) && ~p~1!offset + 260 <= ~q~1!offset)) || (((~q~1!offset + 88 <= #length[~q~1!base] && #ptr!offset + #sizeOfReadType + 84 <= #length[#ptr!base]) && #valid[~q~1!base]) && ~p~1!offset + 312 <= ~q~1!offset)) || (((~p~1!offset + 104 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 296 <= #length[~q~1!base]) && #ptr!offset + #sizeOfReadType + 292 <= #length[#ptr!base])) || (((~p~1!offset + 116 <= ~q~1!offset && #ptr!offset + #sizeOfReadType + 280 <= #length[#ptr!base]) && #valid[~q~1!base]) && ~q~1!offset + 284 <= #length[~q~1!base])) || (((~p~1!offset + 24 <= ~q~1!offset && #ptr!offset + #sizeOfReadType + 372 <= #length[#ptr!base]) && ~q~1!offset + 376 <= #length[~q~1!base]) && #valid[~q~1!base])) || (((~q~1!offset + 32 <= #length[~q~1!base] && #ptr!offset + #sizeOfReadType + 28 <= #length[#ptr!base]) && ~p~1!offset + 368 <= ~q~1!offset) && #valid[~q~1!base])) || (((#ptr!offset + #sizeOfReadType + 332 <= #length[#ptr!base] && #valid[~q~1!base]) && ~q~1!offset + 336 <= #length[~q~1!base]) && ~p~1!offset + 64 <= ~q~1!offset)) || (((#ptr!offset + #sizeOfReadType + 356 <= #length[#ptr!base] && ~q~1!offset + 360 <= #length[~q~1!base]) && ~p~1!offset + 40 <= ~q~1!offset) && #valid[~q~1!base])) || (((~q~1!offset + 156 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 244 <= ~q~1!offset) && #ptr!offset + #sizeOfReadType + 152 <= #length[#ptr!base])) || (((~p~1!offset + 240 <= ~q~1!offset && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 156 <= #length[#ptr!base]) && ~q~1!offset + 160 <= #length[~q~1!base])) || (((~p~1!offset + 328 <= ~q~1!offset && #valid[~q~1!base]) && #ptr!offset + #sizeOfReadType + 68 <= #length[#ptr!base]) && ~q~1!offset + 72 <= #length[~q~1!base])) || (((#ptr!offset + #sizeOfReadType + 24 <= #length[#ptr!base] && ~p~1!offset + 372 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 28 <= #length[~q~1!base])) || (((#valid[~q~1!base] && ~p~1!offset + 268 <= ~q~1!offset) && #ptr!offset + #sizeOfReadType + 128 <= #length[#ptr!base]) && ~q~1!offset + 132 <= #length[~q~1!base])) || (((~p~1!offset + 364 <= ~q~1!offset && ~q~1!offset + 36 <= #length[~q~1!base]) && #ptr!offset + #sizeOfReadType + 32 <= #length[#ptr!base]) && #valid[~q~1!base])) || (((~q~1!offset + 40 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 360 <= ~q~1!offset) && #ptr!offset + #sizeOfReadType + 36 <= #length[#ptr!base])) || (((~p~1!offset + 180 <= ~q~1!offset && #ptr!offset + #sizeOfReadType + 216 <= #length[#ptr!base]) && ~q~1!offset + 220 <= #length[~q~1!base]) && #valid[~q~1!base]) - ProcedureContractResult [Line: 1]: Procedure Contract for main Derived contract for procedure main: #valid[~q~1!base] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 2 error locations. SAFE Result, 208.0s OverallTime, 103 OverallIterations, 101 TraceHistogramMax, 77.7s AutomataDifference, 0.0s DeadEndRemovalTime, 57.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 422 SDtfs, 20654 SDslu, 810 SDs, 0 SdLazy, 31101 SolverSat, 10313 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10409 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10406 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186449 ImplicationChecksByTransitivity, 49.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=506occurred in iteration=102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 28.3s AutomataMinimizationTime, 103 MinimizatonAttempts, 303 StatesRemovedByMinimization, 101 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 517 NumberOfFragments, 12627 HoareAnnotationTreeSize, 10 FomulaSimplifications, -4367 FormulaSimplificationTreeSizeReduction, 39.9s HoareSimplificationTime, 10 FomulaSimplificationsInter, 195172 FormulaSimplificationTreeSizeReductionInter, 17.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 5.1s SatisfiabilityAnalysisTime, 24.6s InterpolantComputationTime, 25767 NumberOfCodeBlocks, 25767 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 25664 ConstructedInterpolants, 0 QuantifiedInterpolants, 60871363 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 103 InterpolantComputations, 3 PerfectInterpolantSequences, 24556/853452 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified01.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-28-10-936.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified01.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-28-10-936.csv Received shutdown request...