java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:36:55,188 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:36:55,190 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:36:55,209 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:36:55,210 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:36:55,211 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:36:55,213 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:36:55,217 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:36:55,220 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:36:55,221 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:36:55,222 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:36:55,227 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:36:55,229 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:36:55,230 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:36:55,234 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:36:55,235 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:36:55,239 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:36:55,242 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:36:55,247 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:36:55,248 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:36:55,252 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:36:55,253 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:36:55,258 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:36:55,258 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:36:55,258 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:36:55,259 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:36:55,262 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:36:55,263 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:36:55,264 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:36:55,267 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:36:55,267 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:36:55,269 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:36:55,269 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:36:55,269 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:36:55,270 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:36:55,271 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:36:55,271 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:36:55,297 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:36:55,298 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:36:55,300 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:36:55,300 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:36:55,300 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:36:55,300 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:36:55,301 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:36:55,301 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:36:55,351 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:36:55,369 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:36:55,376 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:36:55,378 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:36:55,379 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:36:55,379 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl [2018-07-23 13:36:55,380 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl' [2018-07-23 13:36:55,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:36:55,460 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:36:55,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:36:55,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:36:55,461 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:36:55,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:55" (1/1) ... [2018-07-23 13:36:55,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:55" (1/1) ... [2018-07-23 13:36:55,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:55" (1/1) ... [2018-07-23 13:36:55,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:55" (1/1) ... [2018-07-23 13:36:55,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:55" (1/1) ... [2018-07-23 13:36:55,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:55" (1/1) ... [2018-07-23 13:36:55,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:55" (1/1) ... [2018-07-23 13:36:55,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:36:55,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:36:55,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:36:55,517 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:36:55,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:55" (1/1) ... [2018-07-23 13:36:55,607 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-07-23 13:36:55,608 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-07-23 13:36:55,608 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-07-23 13:36:55,815 INFO L258 CfgBuilder]: Using library mode [2018-07-23 13:36:55,816 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:36:55 BoogieIcfgContainer [2018-07-23 13:36:55,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:36:55,817 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:36:55,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:36:55,823 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:36:55,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:55" (1/2) ... [2018-07-23 13:36:55,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9c81f9 and model type threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:36:55, skipping insertion in model container [2018-07-23 13:36:55,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:36:55" (2/2) ... [2018-07-23 13:36:55,828 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product.bpl [2018-07-23 13:36:55,839 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:36:55,848 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-07-23 13:36:55,895 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:36:55,895 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:36:55,896 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:36:55,896 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:36:55,896 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:36:55,896 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:36:55,897 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:36:55,897 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:36:55,897 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:36:55,911 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-07-23 13:36:55,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-23 13:36:55,923 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:55,925 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-07-23 13:36:55,925 INFO L414 AbstractCegarLoop]: === Iteration 1 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:55,930 INFO L82 PathProgramCache]: Analyzing trace with hash 28755683, now seen corresponding path program 1 times [2018-07-23 13:36:55,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:56,025 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:56,026 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:36:56,027 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:56,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:56,028 INFO L185 omatonBuilderFactory]: Interpolants [24#true, 25#false, 26#(<= (+ product_working1 1) product_next), 27#(<= (+ product_working1 1) product_begin0), 28#(<= (+ product_working1 1) product_working0)] [2018-07-23 13:36:56,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:56,029 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:36:56,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:36:56,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:36:56,044 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2018-07-23 13:36:56,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:56,285 INFO L93 Difference]: Finished difference Result 49 states and 85 transitions. [2018-07-23 13:36:56,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:36:56,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-23 13:36:56,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:56,302 INFO L225 Difference]: With dead ends: 49 [2018-07-23 13:36:56,303 INFO L226 Difference]: Without dead ends: 47 [2018-07-23 13:36:56,307 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:36:56,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-23 13:36:56,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-07-23 13:36:56,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-23 13:36:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-07-23 13:36:56,358 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 5 [2018-07-23 13:36:56,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:56,359 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-07-23 13:36:56,359 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:36:56,359 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-07-23 13:36:56,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-23 13:36:56,362 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:56,362 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-07-23 13:36:56,362 INFO L414 AbstractCegarLoop]: === Iteration 2 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:56,363 INFO L82 PathProgramCache]: Analyzing trace with hash 28971747, now seen corresponding path program 1 times [2018-07-23 13:36:56,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:56,386 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:56,386 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:36:56,387 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:56,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:56,387 INFO L185 omatonBuilderFactory]: Interpolants [192#(<= (+ product_working0 1) product_begin1), 193#(<= (+ product_working0 1) product_working1), 189#true, 190#false, 191#(<= (+ product_working0 1) product_next)] [2018-07-23 13:36:56,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:56,389 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:36:56,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:36:56,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:36:56,390 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 5 states. [2018-07-23 13:36:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:56,534 INFO L93 Difference]: Finished difference Result 57 states and 99 transitions. [2018-07-23 13:36:56,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:36:56,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-23 13:36:56,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:56,537 INFO L225 Difference]: With dead ends: 57 [2018-07-23 13:36:56,537 INFO L226 Difference]: Without dead ends: 55 [2018-07-23 13:36:56,538 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:36:56,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-23 13:36:56,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-07-23 13:36:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-23 13:36:56,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2018-07-23 13:36:56,552 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 5 [2018-07-23 13:36:56,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:56,552 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2018-07-23 13:36:56,553 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:36:56,553 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2018-07-23 13:36:56,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:36:56,554 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:56,554 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:56,554 INFO L414 AbstractCegarLoop]: === Iteration 3 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:56,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1864688358, now seen corresponding path program 1 times [2018-07-23 13:36:56,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:56,660 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:56,660 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:56,663 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:56,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:56,664 INFO L185 omatonBuilderFactory]: Interpolants [386#true, 387#false, 388#(<= (+ product_working0 2) (+ product_workload product_next)), 389#(and (not (= product_working0 product_end0)) (= product_end0 product_next)), 390#(not (= product_working0 product_next)), 391#(not (= product_working0 product_begin1)), 392#(not (= product_working0 product_working1))] [2018-07-23 13:36:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:56,664 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:56,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:56,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:56,667 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand 7 states. [2018-07-23 13:36:57,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:57,017 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2018-07-23 13:36:57,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:36:57,017 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-23 13:36:57,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:57,021 INFO L225 Difference]: With dead ends: 84 [2018-07-23 13:36:57,021 INFO L226 Difference]: Without dead ends: 82 [2018-07-23 13:36:57,025 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:36:57,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-23 13:36:57,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2018-07-23 13:36:57,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-23 13:36:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2018-07-23 13:36:57,062 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 7 [2018-07-23 13:36:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:57,063 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2018-07-23 13:36:57,063 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:57,063 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2018-07-23 13:36:57,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:36:57,064 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:57,067 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-07-23 13:36:57,067 INFO L414 AbstractCegarLoop]: === Iteration 4 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:57,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1865765160, now seen corresponding path program 1 times [2018-07-23 13:36:57,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:57,101 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:57,102 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:36:57,102 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:57,103 INFO L185 omatonBuilderFactory]: Interpolants [673#true, 674#false, 675#(<= (+ product_working1 2) (+ product_workload product_next)), 676#(and (not (= product_working1 product_end0)) (= product_end0 product_next)), 677#(not (= product_working1 product_next)), 678#(not (= product_working1 product_begin0)), 679#(not (= product_working1 product_working0))] [2018-07-23 13:36:57,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:57,105 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:57,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:57,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:57,107 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. Second operand 7 states. [2018-07-23 13:36:57,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:57,235 INFO L93 Difference]: Finished difference Result 102 states and 180 transitions. [2018-07-23 13:36:57,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:36:57,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-23 13:36:57,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:57,238 INFO L225 Difference]: With dead ends: 102 [2018-07-23 13:36:57,238 INFO L226 Difference]: Without dead ends: 100 [2018-07-23 13:36:57,239 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:36:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-23 13:36:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 65. [2018-07-23 13:36:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 13:36:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 111 transitions. [2018-07-23 13:36:57,258 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 111 transitions. Word has length 7 [2018-07-23 13:36:57,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:57,258 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 111 transitions. [2018-07-23 13:36:57,259 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:57,259 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 111 transitions. [2018-07-23 13:36:57,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 13:36:57,262 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:57,263 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:57,266 INFO L414 AbstractCegarLoop]: === Iteration 5 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:57,266 INFO L82 PathProgramCache]: Analyzing trace with hash 964893579, now seen corresponding path program 1 times [2018-07-23 13:36:57,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:57,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:57,306 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:57,307 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:36:57,307 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:57,309 INFO L185 omatonBuilderFactory]: Interpolants [1024#true, 1025#false, 1026#(<= (+ product_working0 2) (+ product_workload product_next)), 1027#(and (<= (+ product_working0 2) (+ product_begin0 product_workload)) (= product_end0 product_next)), 1028#(<= (+ product_working0 3) (+ product_workload product_next)), 1029#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 1030#(not (= product_working0 product_next)), 1031#(not (= product_working0 product_begin1)), 1032#(not (= product_working0 product_working1))] [2018-07-23 13:36:57,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:57,309 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:36:57,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:36:57,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:36:57,311 INFO L87 Difference]: Start difference. First operand 65 states and 111 transitions. Second operand 9 states. [2018-07-23 13:36:57,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:57,534 INFO L93 Difference]: Finished difference Result 113 states and 199 transitions. [2018-07-23 13:36:57,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:36:57,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-23 13:36:57,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:57,538 INFO L225 Difference]: With dead ends: 113 [2018-07-23 13:36:57,539 INFO L226 Difference]: Without dead ends: 112 [2018-07-23 13:36:57,545 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:36:57,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-07-23 13:36:57,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 74. [2018-07-23 13:36:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-23 13:36:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 128 transitions. [2018-07-23 13:36:57,582 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 128 transitions. Word has length 9 [2018-07-23 13:36:57,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:57,582 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 128 transitions. [2018-07-23 13:36:57,582 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:36:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 128 transitions. [2018-07-23 13:36:57,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 13:36:57,584 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:57,584 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:57,584 INFO L414 AbstractCegarLoop]: === Iteration 6 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:57,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1999237099, now seen corresponding path program 1 times [2018-07-23 13:36:57,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:57,623 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:57,624 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:36:57,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:57,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:57,625 INFO L185 omatonBuilderFactory]: Interpolants [1424#(and (<= (+ product_working0 2) product_end0) (= product_end0 product_next)), 1425#(<= (+ product_working0 2) product_next), 1426#(and (or (<= (+ product_working0 2) product_begin0) (not (= product_working0 product_end0))) (or (= product_working0 product_end0) (= product_end0 product_next))), 1427#(not (= product_working0 product_next)), 1428#(not (= product_working0 product_begin1)), 1429#(not (= product_working0 product_working1)), 1421#true, 1422#false, 1423#(<= (+ product_working0 2) (+ product_workload product_next))] [2018-07-23 13:36:57,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:57,625 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:36:57,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:36:57,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:36:57,626 INFO L87 Difference]: Start difference. First operand 74 states and 128 transitions. Second operand 9 states. [2018-07-23 13:36:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:57,949 INFO L93 Difference]: Finished difference Result 133 states and 236 transitions. [2018-07-23 13:36:57,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:36:57,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-23 13:36:57,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:57,952 INFO L225 Difference]: With dead ends: 133 [2018-07-23 13:36:57,952 INFO L226 Difference]: Without dead ends: 132 [2018-07-23 13:36:57,957 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:36:57,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-07-23 13:36:57,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 83. [2018-07-23 13:36:57,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-23 13:36:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 145 transitions. [2018-07-23 13:36:57,990 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 145 transitions. Word has length 9 [2018-07-23 13:36:57,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:57,990 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 145 transitions. [2018-07-23 13:36:57,990 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:36:57,992 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 145 transitions. [2018-07-23 13:36:57,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 13:36:57,994 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:57,994 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-07-23 13:36:57,994 INFO L414 AbstractCegarLoop]: === Iteration 7 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:57,994 INFO L82 PathProgramCache]: Analyzing trace with hash 2000313901, now seen corresponding path program 2 times [2018-07-23 13:36:57,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:58,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:36:58,008 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:58,008 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:36:58,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:58,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:58,011 INFO L185 omatonBuilderFactory]: Interpolants [1888#(<= 1 product_workload), 1889#(<= (+ product_begin0 1) product_end0), 1886#true, 1887#false] [2018-07-23 13:36:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:36:58,012 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:36:58,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:36:58,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:36:58,013 INFO L87 Difference]: Start difference. First operand 83 states and 145 transitions. Second operand 4 states. [2018-07-23 13:36:58,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:58,047 INFO L93 Difference]: Finished difference Result 119 states and 205 transitions. [2018-07-23 13:36:58,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:36:58,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-07-23 13:36:58,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:58,048 INFO L225 Difference]: With dead ends: 119 [2018-07-23 13:36:58,049 INFO L226 Difference]: Without dead ends: 76 [2018-07-23 13:36:58,050 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-07-23 13:36:58,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-23 13:36:58,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-23 13:36:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-23 13:36:58,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 124 transitions. [2018-07-23 13:36:58,079 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 124 transitions. Word has length 9 [2018-07-23 13:36:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:58,081 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 124 transitions. [2018-07-23 13:36:58,081 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:36:58,081 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 124 transitions. [2018-07-23 13:36:58,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 13:36:58,082 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:58,084 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-07-23 13:36:58,084 INFO L414 AbstractCegarLoop]: === Iteration 8 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:58,084 INFO L82 PathProgramCache]: Analyzing trace with hash -855455763, now seen corresponding path program 1 times [2018-07-23 13:36:58,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:58,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:36:58,101 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:58,101 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:36:58,101 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:58,102 INFO L185 omatonBuilderFactory]: Interpolants [2282#true, 2283#false, 2284#(<= 1 product_workload), 2285#(<= (+ product_begin1 1) product_end1)] [2018-07-23 13:36:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:36:58,103 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:36:58,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:36:58,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:36:58,108 INFO L87 Difference]: Start difference. First operand 76 states and 124 transitions. Second operand 4 states. [2018-07-23 13:36:58,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:58,138 INFO L93 Difference]: Finished difference Result 111 states and 178 transitions. [2018-07-23 13:36:58,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:36:58,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-07-23 13:36:58,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:58,140 INFO L225 Difference]: With dead ends: 111 [2018-07-23 13:36:58,141 INFO L226 Difference]: Without dead ends: 65 [2018-07-23 13:36:58,142 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-07-23 13:36:58,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-23 13:36:58,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-23 13:36:58,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 13:36:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2018-07-23 13:36:58,164 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 9 [2018-07-23 13:36:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:58,165 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2018-07-23 13:36:58,165 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:36:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2018-07-23 13:36:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:36:58,169 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:58,169 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:58,170 INFO L414 AbstractCegarLoop]: === Iteration 9 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:58,170 INFO L82 PathProgramCache]: Analyzing trace with hash 101966393, now seen corresponding path program 1 times [2018-07-23 13:36:58,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:58,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:58,225 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:58,225 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:36:58,228 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:58,229 INFO L185 omatonBuilderFactory]: Interpolants [2640#true, 2641#false, 2642#(= product_end0 product_next), 2643#(and (or (= product_end0 product_working0) (= product_end0 product_next)) (or (<= product_working0 product_begin0) (not (= product_end0 product_working0)))), 2644#(and (or (= product_end0 product_working0) (= product_end0 product_next)) (or (<= (+ product_working0 1) product_begin0) (not (= product_end0 product_working0)))), 2645#(not (= product_working0 product_next)), 2646#(not (= product_working0 product_begin1)), 2647#(not (= product_working0 product_working1))] [2018-07-23 13:36:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:58,230 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:36:58,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:36:58,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:36:58,233 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand 8 states. [2018-07-23 13:36:58,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:58,390 INFO L93 Difference]: Finished difference Result 97 states and 143 transitions. [2018-07-23 13:36:58,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:36:58,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 13:36:58,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:58,392 INFO L225 Difference]: With dead ends: 97 [2018-07-23 13:36:58,392 INFO L226 Difference]: Without dead ends: 96 [2018-07-23 13:36:58,393 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:36:58,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-23 13:36:58,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2018-07-23 13:36:58,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-23 13:36:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 126 transitions. [2018-07-23 13:36:58,427 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 126 transitions. Word has length 10 [2018-07-23 13:36:58,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:58,427 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 126 transitions. [2018-07-23 13:36:58,427 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:36:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 126 transitions. [2018-07-23 13:36:58,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:36:58,430 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:58,431 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:58,431 INFO L414 AbstractCegarLoop]: === Iteration 10 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:58,432 INFO L82 PathProgramCache]: Analyzing trace with hash 103259259, now seen corresponding path program 1 times [2018-07-23 13:36:58,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:58,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:58,465 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:58,466 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:36:58,466 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:58,467 INFO L185 omatonBuilderFactory]: Interpolants [3024#(= product_end0 product_next), 3025#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 3026#(and (not (= product_end0 product_working0)) (= product_end0 product_next)), 3027#(not (= product_working0 product_next)), 3028#(not (= product_working0 product_begin1)), 3029#(not (= product_working0 product_working1)), 3022#true, 3023#false] [2018-07-23 13:36:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:58,467 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:36:58,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:36:58,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:36:58,468 INFO L87 Difference]: Start difference. First operand 81 states and 126 transitions. Second operand 8 states. [2018-07-23 13:36:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:58,596 INFO L93 Difference]: Finished difference Result 104 states and 152 transitions. [2018-07-23 13:36:58,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:36:58,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 13:36:58,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:58,598 INFO L225 Difference]: With dead ends: 104 [2018-07-23 13:36:58,598 INFO L226 Difference]: Without dead ends: 102 [2018-07-23 13:36:58,599 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:36:58,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-23 13:36:58,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 85. [2018-07-23 13:36:58,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-23 13:36:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 134 transitions. [2018-07-23 13:36:58,625 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 134 transitions. Word has length 10 [2018-07-23 13:36:58,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:58,625 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 134 transitions. [2018-07-23 13:36:58,625 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:36:58,626 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 134 transitions. [2018-07-23 13:36:58,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:36:58,626 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:58,627 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:58,627 INFO L414 AbstractCegarLoop]: === Iteration 11 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:58,627 INFO L82 PathProgramCache]: Analyzing trace with hash -176034144, now seen corresponding path program 1 times [2018-07-23 13:36:58,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:58,656 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:58,664 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:36:58,665 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:58,666 INFO L185 omatonBuilderFactory]: Interpolants [3428#true, 3429#false, 3430#(<= (+ product_working0 1) product_next), 3431#(and (<= (+ product_working0 1) product_begin0) (= product_end0 product_next)), 3432#(<= (+ product_working0 2) product_next), 3433#(<= (+ product_working0 2) product_begin1), 3434#(<= (+ product_working0 3) product_begin1), 3435#(<= (+ product_working0 3) product_working1)] [2018-07-23 13:36:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:58,666 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:36:58,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:36:58,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:36:58,667 INFO L87 Difference]: Start difference. First operand 85 states and 134 transitions. Second operand 8 states. [2018-07-23 13:36:58,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:58,744 INFO L93 Difference]: Finished difference Result 91 states and 143 transitions. [2018-07-23 13:36:58,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:36:58,745 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 13:36:58,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:58,746 INFO L225 Difference]: With dead ends: 91 [2018-07-23 13:36:58,746 INFO L226 Difference]: Without dead ends: 90 [2018-07-23 13:36:58,747 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:36:58,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-23 13:36:58,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2018-07-23 13:36:58,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-23 13:36:58,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 132 transitions. [2018-07-23 13:36:58,775 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 132 transitions. Word has length 10 [2018-07-23 13:36:58,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:58,775 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 132 transitions. [2018-07-23 13:36:58,775 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:36:58,775 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 132 transitions. [2018-07-23 13:36:58,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:36:58,776 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:58,777 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:58,777 INFO L414 AbstractCegarLoop]: === Iteration 12 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:58,777 INFO L82 PathProgramCache]: Analyzing trace with hash -176034432, now seen corresponding path program 1 times [2018-07-23 13:36:58,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:58,798 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:58,798 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:36:58,798 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:58,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:58,799 INFO L185 omatonBuilderFactory]: Interpolants [3792#(= product_end0 product_next), 3793#(<= (+ product_begin0 1) product_next), 3794#(<= (+ product_begin0 1) product_begin1), 3795#(<= (+ product_begin0 1) product_working1), 3796#(not (= product_working0 product_working1)), 3790#true, 3791#false] [2018-07-23 13:36:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:58,799 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:58,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:58,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:58,801 INFO L87 Difference]: Start difference. First operand 84 states and 132 transitions. Second operand 7 states. [2018-07-23 13:36:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:58,922 INFO L93 Difference]: Finished difference Result 108 states and 159 transitions. [2018-07-23 13:36:58,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:36:58,922 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-07-23 13:36:58,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:58,923 INFO L225 Difference]: With dead ends: 108 [2018-07-23 13:36:58,923 INFO L226 Difference]: Without dead ends: 106 [2018-07-23 13:36:58,924 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:36:58,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-23 13:36:58,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2018-07-23 13:36:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-23 13:36:58,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2018-07-23 13:36:58,953 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 149 transitions. Word has length 10 [2018-07-23 13:36:58,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:58,953 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 149 transitions. [2018-07-23 13:36:58,954 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:58,954 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 149 transitions. [2018-07-23 13:36:58,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:36:58,954 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:58,955 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:58,955 INFO L414 AbstractCegarLoop]: === Iteration 13 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:58,955 INFO L82 PathProgramCache]: Analyzing trace with hash -184622601, now seen corresponding path program 1 times [2018-07-23 13:36:58,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:58,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:58,999 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:58,999 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:36:58,999 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:59,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,000 INFO L185 omatonBuilderFactory]: Interpolants [4224#(not (= product_working0 product_working1)), 4217#true, 4218#false, 4219#(= product_end0 product_next), 4220#(= product_end0 product_begin1), 4221#(and (or (= product_end0 product_working0) (= product_end0 product_begin1)) (or (<= product_working0 product_begin0) (not (= product_end0 product_working0)))), 4222#(and (or (= product_end0 product_working0) (= product_end0 product_begin1)) (or (<= (+ product_working0 1) product_begin0) (not (= product_end0 product_working0)))), 4223#(not (= product_working0 product_begin1))] [2018-07-23 13:36:59,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,001 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:36:59,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:36:59,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:36:59,003 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. Second operand 8 states. [2018-07-23 13:36:59,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:59,146 INFO L93 Difference]: Finished difference Result 116 states and 171 transitions. [2018-07-23 13:36:59,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:36:59,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 13:36:59,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:59,148 INFO L225 Difference]: With dead ends: 116 [2018-07-23 13:36:59,148 INFO L226 Difference]: Without dead ends: 115 [2018-07-23 13:36:59,149 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:36:59,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-23 13:36:59,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 100. [2018-07-23 13:36:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-23 13:36:59,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 158 transitions. [2018-07-23 13:36:59,179 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 158 transitions. Word has length 10 [2018-07-23 13:36:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:59,179 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 158 transitions. [2018-07-23 13:36:59,179 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:36:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 158 transitions. [2018-07-23 13:36:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:36:59,180 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:59,180 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:59,181 INFO L414 AbstractCegarLoop]: === Iteration 14 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:59,181 INFO L82 PathProgramCache]: Analyzing trace with hash -184621319, now seen corresponding path program 1 times [2018-07-23 13:36:59,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:59,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,209 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:59,209 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:36:59,210 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,210 INFO L185 omatonBuilderFactory]: Interpolants [4672#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 4673#(and (= product_end0 product_begin1) (<= (+ product_begin0 1) product_end0)), 4674#(and (= product_end0 product_begin1) (not (= product_end0 product_working0))), 4675#(not (= product_working0 product_begin1)), 4676#(not (= product_working0 product_working1)), 4669#true, 4670#false, 4671#(= product_end0 product_next)] [2018-07-23 13:36:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,211 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:36:59,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:36:59,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:36:59,212 INFO L87 Difference]: Start difference. First operand 100 states and 158 transitions. Second operand 8 states. [2018-07-23 13:36:59,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:59,361 INFO L93 Difference]: Finished difference Result 116 states and 171 transitions. [2018-07-23 13:36:59,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:36:59,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 13:36:59,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:59,363 INFO L225 Difference]: With dead ends: 116 [2018-07-23 13:36:59,363 INFO L226 Difference]: Without dead ends: 114 [2018-07-23 13:36:59,364 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:36:59,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-07-23 13:36:59,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2018-07-23 13:36:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-23 13:36:59,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 158 transitions. [2018-07-23 13:36:59,398 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 158 transitions. Word has length 10 [2018-07-23 13:36:59,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:59,399 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 158 transitions. [2018-07-23 13:36:59,399 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:36:59,399 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 158 transitions. [2018-07-23 13:36:59,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:36:59,399 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:59,400 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:59,400 INFO L414 AbstractCegarLoop]: === Iteration 15 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:59,400 INFO L82 PathProgramCache]: Analyzing trace with hash -973282432, now seen corresponding path program 1 times [2018-07-23 13:36:59,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,440 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:59,440 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:36:59,440 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:59,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,441 INFO L185 omatonBuilderFactory]: Interpolants [5125#true, 5126#false, 5127#(= product_end1 product_next), 5128#(= product_end1 product_begin0), 5129#(and (or (<= product_working1 product_begin1) (not (= product_end1 product_working1))) (or (= product_end1 product_working1) (= product_end1 product_begin0))), 5130#(and (or (not (= product_end1 product_working1)) (<= (+ product_working1 1) product_begin1)) (or (= product_end1 product_working1) (= product_end1 product_begin0))), 5131#(not (= product_working1 product_begin0)), 5132#(not (= product_working1 product_working0))] [2018-07-23 13:36:59,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,442 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:36:59,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:36:59,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:36:59,443 INFO L87 Difference]: Start difference. First operand 100 states and 158 transitions. Second operand 8 states. [2018-07-23 13:36:59,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:59,589 INFO L93 Difference]: Finished difference Result 124 states and 186 transitions. [2018-07-23 13:36:59,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:36:59,590 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 13:36:59,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:59,591 INFO L225 Difference]: With dead ends: 124 [2018-07-23 13:36:59,591 INFO L226 Difference]: Without dead ends: 123 [2018-07-23 13:36:59,592 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:36:59,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-23 13:36:59,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2018-07-23 13:36:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-23 13:36:59,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 167 transitions. [2018-07-23 13:36:59,631 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 167 transitions. Word has length 10 [2018-07-23 13:36:59,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:59,631 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 167 transitions. [2018-07-23 13:36:59,632 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:36:59,632 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 167 transitions. [2018-07-23 13:36:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:36:59,632 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:59,633 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:59,633 INFO L414 AbstractCegarLoop]: === Iteration 16 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:59,633 INFO L82 PathProgramCache]: Analyzing trace with hash -973281662, now seen corresponding path program 1 times [2018-07-23 13:36:59,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:59,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,657 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:59,657 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:36:59,657 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,658 INFO L185 omatonBuilderFactory]: Interpolants [5603#true, 5604#false, 5605#(= product_end1 product_next), 5606#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 5607#(and (= product_end1 product_begin0) (<= (+ product_begin1 1) product_end1)), 5608#(and (not (= product_end1 product_working1)) (= product_end1 product_begin0)), 5609#(not (= product_working1 product_begin0)), 5610#(not (= product_working1 product_working0))] [2018-07-23 13:36:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,662 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:36:59,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:36:59,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:36:59,663 INFO L87 Difference]: Start difference. First operand 105 states and 167 transitions. Second operand 8 states. [2018-07-23 13:36:59,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:59,816 INFO L93 Difference]: Finished difference Result 124 states and 186 transitions. [2018-07-23 13:36:59,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:36:59,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 13:36:59,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:59,818 INFO L225 Difference]: With dead ends: 124 [2018-07-23 13:36:59,821 INFO L226 Difference]: Without dead ends: 122 [2018-07-23 13:36:59,822 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:36:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-23 13:36:59,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2018-07-23 13:36:59,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-07-23 13:36:59,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 172 transitions. [2018-07-23 13:36:59,864 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 172 transitions. Word has length 10 [2018-07-23 13:36:59,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:59,865 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 172 transitions. [2018-07-23 13:36:59,865 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:36:59,865 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 172 transitions. [2018-07-23 13:36:59,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:36:59,866 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:59,866 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:59,866 INFO L414 AbstractCegarLoop]: === Iteration 17 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:59,868 INFO L82 PathProgramCache]: Analyzing trace with hash -981870601, now seen corresponding path program 1 times [2018-07-23 13:36:59,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:59,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,882 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:59,883 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:36:59,883 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:59,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,884 INFO L185 omatonBuilderFactory]: Interpolants [6096#(<= (+ product_begin1 1) product_working0), 6097#(not (= product_working1 product_working0)), 6091#true, 6092#false, 6093#(= product_end1 product_next), 6094#(<= (+ product_begin1 1) product_next), 6095#(<= (+ product_begin1 1) product_begin0)] [2018-07-23 13:36:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,884 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:59,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:59,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:59,885 INFO L87 Difference]: Start difference. First operand 108 states and 172 transitions. Second operand 7 states. [2018-07-23 13:37:00,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:00,007 INFO L93 Difference]: Finished difference Result 129 states and 195 transitions. [2018-07-23 13:37:00,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:37:00,007 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-07-23 13:37:00,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:00,009 INFO L225 Difference]: With dead ends: 129 [2018-07-23 13:37:00,009 INFO L226 Difference]: Without dead ends: 127 [2018-07-23 13:37:00,010 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:00,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-23 13:37:00,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-07-23 13:37:00,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-23 13:37:00,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 189 transitions. [2018-07-23 13:37:00,051 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 189 transitions. Word has length 10 [2018-07-23 13:37:00,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:00,051 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 189 transitions. [2018-07-23 13:37:00,051 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 189 transitions. [2018-07-23 13:37:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:37:00,052 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:00,052 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:00,052 INFO L414 AbstractCegarLoop]: === Iteration 18 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:00,053 INFO L82 PathProgramCache]: Analyzing trace with hash -981870889, now seen corresponding path program 1 times [2018-07-23 13:37:00,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:00,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:00,074 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:00,074 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:00,074 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:00,075 INFO L185 omatonBuilderFactory]: Interpolants [6608#true, 6609#false, 6610#(<= (+ product_working1 1) product_next), 6611#(and (= product_end1 product_next) (<= (+ product_working1 1) product_begin1)), 6612#(<= (+ product_working1 2) product_next), 6613#(<= (+ product_working1 2) product_begin0), 6614#(<= (+ product_working1 3) product_begin0), 6615#(<= (+ product_working1 3) product_working0)] [2018-07-23 13:37:00,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:00,076 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:00,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:00,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:00,077 INFO L87 Difference]: Start difference. First operand 119 states and 189 transitions. Second operand 8 states. [2018-07-23 13:37:00,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:00,206 INFO L93 Difference]: Finished difference Result 129 states and 206 transitions. [2018-07-23 13:37:00,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:37:00,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 13:37:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:00,208 INFO L225 Difference]: With dead ends: 129 [2018-07-23 13:37:00,208 INFO L226 Difference]: Without dead ends: 128 [2018-07-23 13:37:00,208 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:00,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-07-23 13:37:00,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2018-07-23 13:37:00,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-23 13:37:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 193 transitions. [2018-07-23 13:37:00,246 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 193 transitions. Word has length 10 [2018-07-23 13:37:00,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:00,246 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 193 transitions. [2018-07-23 13:37:00,246 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 193 transitions. [2018-07-23 13:37:00,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:37:00,247 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:00,247 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:00,247 INFO L414 AbstractCegarLoop]: === Iteration 19 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:00,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1101306322, now seen corresponding path program 1 times [2018-07-23 13:37:00,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:00,271 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:00,272 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:00,272 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:00,272 INFO L185 omatonBuilderFactory]: Interpolants [7120#true, 7121#false, 7122#(= product_end1 product_next), 7123#(and (or (= product_end1 product_working1) (= product_end1 product_next)) (or (<= product_working1 product_begin1) (not (= product_end1 product_working1)))), 7124#(and (or (not (= product_end1 product_working1)) (<= (+ product_working1 1) product_begin1)) (or (= product_end1 product_working1) (= product_end1 product_next))), 7125#(not (= product_working1 product_next)), 7126#(not (= product_working1 product_begin0)), 7127#(not (= product_working1 product_working0))] [2018-07-23 13:37:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:00,273 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:00,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:00,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:00,273 INFO L87 Difference]: Start difference. First operand 121 states and 193 transitions. Second operand 8 states. [2018-07-23 13:37:00,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:00,408 INFO L93 Difference]: Finished difference Result 137 states and 209 transitions. [2018-07-23 13:37:00,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:00,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 13:37:00,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:00,410 INFO L225 Difference]: With dead ends: 137 [2018-07-23 13:37:00,410 INFO L226 Difference]: Without dead ends: 136 [2018-07-23 13:37:00,410 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:00,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-07-23 13:37:00,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2018-07-23 13:37:00,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-23 13:37:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 206 transitions. [2018-07-23 13:37:00,448 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 206 transitions. Word has length 10 [2018-07-23 13:37:00,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:00,448 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 206 transitions. [2018-07-23 13:37:00,448 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:00,448 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 206 transitions. [2018-07-23 13:37:00,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:37:00,449 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:00,449 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:00,449 INFO L414 AbstractCegarLoop]: === Iteration 20 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:00,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1102106644, now seen corresponding path program 1 times [2018-07-23 13:37:00,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:00,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:00,466 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:00,466 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:37:00,466 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:00,467 INFO L185 omatonBuilderFactory]: Interpolants [7680#(= product_end1 product_next), 7681#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 7682#(and (not (= product_end1 product_working1)) (= product_end1 product_next)), 7683#(not (= product_working1 product_next)), 7684#(not (= product_working1 product_begin0)), 7685#(not (= product_working1 product_working0)), 7678#true, 7679#false] [2018-07-23 13:37:00,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:00,467 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:00,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:00,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:00,468 INFO L87 Difference]: Start difference. First operand 129 states and 206 transitions. Second operand 8 states. [2018-07-23 13:37:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:00,585 INFO L93 Difference]: Finished difference Result 147 states and 223 transitions. [2018-07-23 13:37:00,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:37:00,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 13:37:00,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:00,587 INFO L225 Difference]: With dead ends: 147 [2018-07-23 13:37:00,587 INFO L226 Difference]: Without dead ends: 145 [2018-07-23 13:37:00,588 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:37:00,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-23 13:37:00,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129. [2018-07-23 13:37:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-23 13:37:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 206 transitions. [2018-07-23 13:37:00,625 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 206 transitions. Word has length 10 [2018-07-23 13:37:00,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:00,625 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 206 transitions. [2018-07-23 13:37:00,626 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 206 transitions. [2018-07-23 13:37:00,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:37:00,626 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:00,626 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:00,627 INFO L414 AbstractCegarLoop]: === Iteration 21 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:00,627 INFO L82 PathProgramCache]: Analyzing trace with hash 240543358, now seen corresponding path program 1 times [2018-07-23 13:37:00,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:00,652 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:00,652 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:00,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:00,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:00,653 INFO L185 omatonBuilderFactory]: Interpolants [8258#true, 8259#false, 8260#(= product_end0 product_next), 8261#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 8262#(and (<= (+ product_working0 1) product_end0) (= product_end0 product_next)), 8263#(<= (+ product_working0 1) product_next), 8264#(and (or (= product_working0 product_end0) (= product_end0 product_next)) (or (<= (+ product_working0 1) product_begin0) (not (= product_working0 product_end0)))), 8265#(not (= product_working0 product_next)), 8266#(not (= product_working0 product_begin1)), 8267#(not (= product_working0 product_working1))] [2018-07-23 13:37:00,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:00,654 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:00,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:00,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:00,654 INFO L87 Difference]: Start difference. First operand 129 states and 206 transitions. Second operand 10 states. [2018-07-23 13:37:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:00,856 INFO L93 Difference]: Finished difference Result 151 states and 226 transitions. [2018-07-23 13:37:00,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:37:00,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-07-23 13:37:00,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:00,858 INFO L225 Difference]: With dead ends: 151 [2018-07-23 13:37:00,858 INFO L226 Difference]: Without dead ends: 150 [2018-07-23 13:37:00,859 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:37:00,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-23 13:37:00,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2018-07-23 13:37:00,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-23 13:37:00,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 192 transitions. [2018-07-23 13:37:00,899 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 192 transitions. Word has length 12 [2018-07-23 13:37:00,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:00,899 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 192 transitions. [2018-07-23 13:37:00,899 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:00,900 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 192 transitions. [2018-07-23 13:37:00,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:37:00,900 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:00,900 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:00,901 INFO L414 AbstractCegarLoop]: === Iteration 22 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:00,901 INFO L82 PathProgramCache]: Analyzing trace with hash 447688542, now seen corresponding path program 1 times [2018-07-23 13:37:00,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:00,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:00,930 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:00,930 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-07-23 13:37:00,930 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:00,931 INFO L185 omatonBuilderFactory]: Interpolants [8848#(not (= product_working1 product_begin0)), 8849#(not (= product_working1 product_working0)), 8840#true, 8841#false, 8842#(<= (+ product_working1 1) product_next), 8843#(and (= product_end0 product_next) (<= (+ product_working1 1) product_begin0)), 8844#(and (<= (+ product_working1 2) product_end0) (= product_end0 product_next)), 8845#(<= (+ product_working1 2) product_next), 8846#(and (or (= product_working1 product_end1) (= product_end1 product_next)) (or (not (= product_working1 product_end1)) (<= (+ product_working1 2) product_begin1))), 8847#(not (= product_working1 product_next))] [2018-07-23 13:37:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:00,931 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:00,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:00,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:00,932 INFO L87 Difference]: Start difference. First operand 121 states and 192 transitions. Second operand 10 states. [2018-07-23 13:37:01,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:01,083 INFO L93 Difference]: Finished difference Result 149 states and 233 transitions. [2018-07-23 13:37:01,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:01,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-07-23 13:37:01,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:01,085 INFO L225 Difference]: With dead ends: 149 [2018-07-23 13:37:01,085 INFO L226 Difference]: Without dead ends: 147 [2018-07-23 13:37:01,085 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:37:01,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-23 13:37:01,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2018-07-23 13:37:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-23 13:37:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 216 transitions. [2018-07-23 13:37:01,138 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 216 transitions. Word has length 12 [2018-07-23 13:37:01,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:01,138 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 216 transitions. [2018-07-23 13:37:01,138 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:01,138 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 216 transitions. [2018-07-23 13:37:01,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:37:01,139 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:01,139 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:01,139 INFO L414 AbstractCegarLoop]: === Iteration 23 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:01,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1316178012, now seen corresponding path program 1 times [2018-07-23 13:37:01,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:01,168 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:01,168 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:01,168 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:01,168 INFO L185 omatonBuilderFactory]: Interpolants [9440#true, 9441#false, 9442#(<= (+ product_working1 1) product_next), 9443#(and (= product_end1 product_next) (<= (+ product_working1 1) product_begin1)), 9444#(<= (+ product_working1 2) product_next), 9445#(<= (+ product_working1 product_end0 2) (+ product_begin0 product_next)), 9446#(<= (+ product_working1 3) product_next), 9447#(<= (+ product_working1 3) product_begin0), 9448#(<= (+ product_working1 3) product_working0)] [2018-07-23 13:37:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:01,169 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:01,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:01,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:01,170 INFO L87 Difference]: Start difference. First operand 136 states and 216 transitions. Second operand 9 states. [2018-07-23 13:37:01,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:01,291 INFO L93 Difference]: Finished difference Result 145 states and 230 transitions. [2018-07-23 13:37:01,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:01,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-23 13:37:01,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:01,292 INFO L225 Difference]: With dead ends: 145 [2018-07-23 13:37:01,292 INFO L226 Difference]: Without dead ends: 144 [2018-07-23 13:37:01,293 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:01,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-23 13:37:01,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-07-23 13:37:01,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-07-23 13:37:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 229 transitions. [2018-07-23 13:37:01,346 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 229 transitions. Word has length 12 [2018-07-23 13:37:01,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:01,346 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 229 transitions. [2018-07-23 13:37:01,346 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:01,346 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 229 transitions. [2018-07-23 13:37:01,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:37:01,347 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:01,347 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:01,347 INFO L414 AbstractCegarLoop]: === Iteration 24 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:01,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1525011273, now seen corresponding path program 1 times [2018-07-23 13:37:01,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:01,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:01,375 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:01,376 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:01,376 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:01,376 INFO L185 omatonBuilderFactory]: Interpolants [10048#(not (= product_working1 product_working0)), 10039#true, 10040#false, 10041#(= product_end1 product_next), 10042#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 10043#(and (= product_end1 product_next) (<= (+ product_working1 1) product_end1)), 10044#(<= (+ product_working1 1) product_next), 10045#(and (or (not (= product_working1 product_end1)) (<= (+ product_working1 1) product_begin1)) (or (= product_working1 product_end1) (= product_end1 product_next))), 10046#(not (= product_working1 product_next)), 10047#(not (= product_working1 product_begin0))] [2018-07-23 13:37:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:01,377 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:01,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:01,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:01,378 INFO L87 Difference]: Start difference. First operand 144 states and 229 transitions. Second operand 10 states. [2018-07-23 13:37:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:01,605 INFO L93 Difference]: Finished difference Result 168 states and 253 transitions. [2018-07-23 13:37:01,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:37:01,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-07-23 13:37:01,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:01,607 INFO L225 Difference]: With dead ends: 168 [2018-07-23 13:37:01,607 INFO L226 Difference]: Without dead ends: 167 [2018-07-23 13:37:01,608 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:37:01,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-23 13:37:01,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 137. [2018-07-23 13:37:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-23 13:37:01,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 217 transitions. [2018-07-23 13:37:01,663 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 217 transitions. Word has length 12 [2018-07-23 13:37:01,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:01,664 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 217 transitions. [2018-07-23 13:37:01,664 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 217 transitions. [2018-07-23 13:37:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:01,665 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:01,665 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:01,665 INFO L414 AbstractCegarLoop]: === Iteration 25 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:01,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1139034733, now seen corresponding path program 1 times [2018-07-23 13:37:01,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:01,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:01,687 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:01,687 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:01,688 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:01,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:01,688 INFO L185 omatonBuilderFactory]: Interpolants [10688#false, 10689#(= product_end0 product_next), 10690#(and (<= product_working0 product_begin0) (= product_end0 product_next)), 10691#(and (<= (+ product_working0 1) product_begin0) (= product_end0 product_next)), 10692#(<= (+ product_working0 2) product_next), 10693#(<= (+ product_working0 2) product_begin1), 10694#(<= (+ product_working0 3) product_begin1), 10695#(<= (+ product_working0 3) product_working1), 10687#true] [2018-07-23 13:37:01,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:01,689 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:01,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:01,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:01,689 INFO L87 Difference]: Start difference. First operand 137 states and 217 transitions. Second operand 9 states. [2018-07-23 13:37:01,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:01,818 INFO L93 Difference]: Finished difference Result 164 states and 254 transitions. [2018-07-23 13:37:01,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:37:01,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 13:37:01,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:01,819 INFO L225 Difference]: With dead ends: 164 [2018-07-23 13:37:01,819 INFO L226 Difference]: Without dead ends: 163 [2018-07-23 13:37:01,820 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-23 13:37:01,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2018-07-23 13:37:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-23 13:37:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 241 transitions. [2018-07-23 13:37:01,876 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 241 transitions. Word has length 13 [2018-07-23 13:37:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:01,876 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 241 transitions. [2018-07-23 13:37:01,877 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:01,877 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 241 transitions. [2018-07-23 13:37:01,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:01,877 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:01,878 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:01,878 INFO L414 AbstractCegarLoop]: === Iteration 26 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:01,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1000080215, now seen corresponding path program 1 times [2018-07-23 13:37:01,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:01,896 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:01,896 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:01,896 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:01,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:01,897 INFO L185 omatonBuilderFactory]: Interpolants [11330#true, 11331#false, 11332#(= product_end0 product_next), 11333#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 11334#(and (<= (+ product_working0 1) product_end0) (= product_end0 product_next)), 11335#(<= (+ product_working0 1) product_next), 11336#(<= (+ product_working0 1) product_begin1), 11337#(<= (+ product_working0 2) product_begin1), 11338#(<= (+ product_working0 2) product_working1)] [2018-07-23 13:37:01,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:01,897 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:01,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:01,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:01,898 INFO L87 Difference]: Start difference. First operand 151 states and 241 transitions. Second operand 9 states. [2018-07-23 13:37:02,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:02,108 INFO L93 Difference]: Finished difference Result 217 states and 338 transitions. [2018-07-23 13:37:02,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:37:02,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 13:37:02,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:02,110 INFO L225 Difference]: With dead ends: 217 [2018-07-23 13:37:02,111 INFO L226 Difference]: Without dead ends: 215 [2018-07-23 13:37:02,111 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:02,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-23 13:37:02,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 163. [2018-07-23 13:37:02,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-23 13:37:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 260 transitions. [2018-07-23 13:37:02,175 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 260 transitions. Word has length 13 [2018-07-23 13:37:02,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:02,175 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 260 transitions. [2018-07-23 13:37:02,175 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:02,175 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 260 transitions. [2018-07-23 13:37:02,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:02,176 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:02,176 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:02,176 INFO L414 AbstractCegarLoop]: === Iteration 27 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:02,176 INFO L82 PathProgramCache]: Analyzing trace with hash -86604803, now seen corresponding path program 1 times [2018-07-23 13:37:02,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:02,195 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:02,196 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:02,196 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:02,196 INFO L185 omatonBuilderFactory]: Interpolants [12119#true, 12120#false, 12121#(= product_end0 product_next), 12122#(= product_end0 product_begin1), 12123#(<= (+ product_end0 1) product_begin1), 12124#(<= (+ product_end0 product_working0 1) (+ product_begin0 product_begin1)), 12125#(<= (+ product_end0 product_working0 2) (+ product_begin0 product_begin1)), 12126#(<= (+ product_working0 3) product_begin1), 12127#(<= (+ product_working0 3) product_working1)] [2018-07-23 13:37:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:02,197 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:02,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:02,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:02,198 INFO L87 Difference]: Start difference. First operand 163 states and 260 transitions. Second operand 9 states. [2018-07-23 13:37:02,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:02,412 INFO L93 Difference]: Finished difference Result 208 states and 319 transitions. [2018-07-23 13:37:02,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:37:02,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 13:37:02,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:02,414 INFO L225 Difference]: With dead ends: 208 [2018-07-23 13:37:02,414 INFO L226 Difference]: Without dead ends: 207 [2018-07-23 13:37:02,415 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:37:02,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-23 13:37:02,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 173. [2018-07-23 13:37:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-23 13:37:02,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 277 transitions. [2018-07-23 13:37:02,491 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 277 transitions. Word has length 13 [2018-07-23 13:37:02,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:02,491 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 277 transitions. [2018-07-23 13:37:02,492 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:02,492 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 277 transitions. [2018-07-23 13:37:02,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:02,492 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:02,493 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:02,493 INFO L414 AbstractCegarLoop]: === Iteration 28 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:02,493 INFO L82 PathProgramCache]: Analyzing trace with hash -86605091, now seen corresponding path program 1 times [2018-07-23 13:37:02,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:02,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:02,508 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:02,508 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:02,509 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:02,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:02,509 INFO L185 omatonBuilderFactory]: Interpolants [12898#true, 12899#false, 12900#(= product_end0 product_next), 12901#(= product_end0 product_begin1), 12902#(= product_end0 product_working1), 12903#(<= (+ product_begin0 1) product_working1), 12904#(not (= product_working0 product_working1))] [2018-07-23 13:37:02,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:02,509 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:02,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:02,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:02,510 INFO L87 Difference]: Start difference. First operand 173 states and 277 transitions. Second operand 7 states. [2018-07-23 13:37:02,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:02,680 INFO L93 Difference]: Finished difference Result 229 states and 357 transitions. [2018-07-23 13:37:02,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:02,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-07-23 13:37:02,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:02,682 INFO L225 Difference]: With dead ends: 229 [2018-07-23 13:37:02,682 INFO L226 Difference]: Without dead ends: 227 [2018-07-23 13:37:02,683 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:02,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-07-23 13:37:02,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 203. [2018-07-23 13:37:02,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-23 13:37:02,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 329 transitions. [2018-07-23 13:37:02,783 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 329 transitions. Word has length 13 [2018-07-23 13:37:02,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:02,784 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 329 transitions. [2018-07-23 13:37:02,784 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:02,784 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 329 transitions. [2018-07-23 13:37:02,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:02,785 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:02,785 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:02,785 INFO L414 AbstractCegarLoop]: === Iteration 29 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:02,785 INFO L82 PathProgramCache]: Analyzing trace with hash -86603521, now seen corresponding path program 1 times [2018-07-23 13:37:02,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:02,811 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:02,811 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:02,812 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:02,812 INFO L185 omatonBuilderFactory]: Interpolants [13779#true, 13780#false, 13781#(= product_end0 product_next), 13782#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 13783#(and (= product_end0 product_begin1) (<= (+ product_begin0 1) product_end0)), 13784#(<= (+ product_begin0 2) product_begin1), 13785#(<= (+ product_working0 2) product_begin1), 13786#(<= (+ product_working0 2) product_working1)] [2018-07-23 13:37:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:02,813 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:02,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:02,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:02,813 INFO L87 Difference]: Start difference. First operand 203 states and 329 transitions. Second operand 8 states. [2018-07-23 13:37:03,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:03,090 INFO L93 Difference]: Finished difference Result 254 states and 401 transitions. [2018-07-23 13:37:03,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:37:03,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-07-23 13:37:03,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:03,094 INFO L225 Difference]: With dead ends: 254 [2018-07-23 13:37:03,094 INFO L226 Difference]: Without dead ends: 252 [2018-07-23 13:37:03,095 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:03,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-07-23 13:37:03,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 206. [2018-07-23 13:37:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-07-23 13:37:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 334 transitions. [2018-07-23 13:37:03,222 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 334 transitions. Word has length 13 [2018-07-23 13:37:03,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:03,223 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 334 transitions. [2018-07-23 13:37:03,223 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 334 transitions. [2018-07-23 13:37:03,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:03,224 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:03,224 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:03,224 INFO L414 AbstractCegarLoop]: === Iteration 30 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:03,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298927, now seen corresponding path program 2 times [2018-07-23 13:37:03,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:03,245 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:03,245 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:03,245 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:03,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:03,246 INFO L185 omatonBuilderFactory]: Interpolants [14725#true, 14726#false, 14727#(= product_end0 product_next), 14728#(= product_end0 product_begin1), 14729#(and (= product_end0 product_begin1) (<= product_working0 product_begin0)), 14730#(and (<= (+ product_working0 1) product_begin0) (= product_end0 product_begin1)), 14731#(<= (+ product_working0 2) product_begin1), 14732#(<= (+ product_working0 3) product_begin1), 14733#(<= (+ product_working0 3) product_working1)] [2018-07-23 13:37:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:03,246 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:03,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:03,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:03,248 INFO L87 Difference]: Start difference. First operand 206 states and 334 transitions. Second operand 9 states. [2018-07-23 13:37:03,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:03,395 INFO L93 Difference]: Finished difference Result 220 states and 345 transitions. [2018-07-23 13:37:03,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:37:03,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 13:37:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:03,397 INFO L225 Difference]: With dead ends: 220 [2018-07-23 13:37:03,397 INFO L226 Difference]: Without dead ends: 219 [2018-07-23 13:37:03,398 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:03,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-23 13:37:03,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 203. [2018-07-23 13:37:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-23 13:37:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 328 transitions. [2018-07-23 13:37:03,472 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 328 transitions. Word has length 13 [2018-07-23 13:37:03,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:03,473 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 328 transitions. [2018-07-23 13:37:03,473 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:03,473 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 328 transitions. [2018-07-23 13:37:03,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:03,474 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:03,474 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:03,474 INFO L414 AbstractCegarLoop]: === Iteration 31 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:03,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298639, now seen corresponding path program 2 times [2018-07-23 13:37:03,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:03,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:03,486 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:03,486 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:03,486 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:03,487 INFO L185 omatonBuilderFactory]: Interpolants [15584#true, 15585#false, 15586#(= product_end0 product_next), 15587#(= product_end0 product_begin1), 15588#(<= (+ product_begin0 1) product_begin1), 15589#(<= (+ product_begin0 1) product_working1), 15590#(not (= product_working0 product_working1))] [2018-07-23 13:37:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:03,487 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:03,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:03,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:03,488 INFO L87 Difference]: Start difference. First operand 203 states and 328 transitions. Second operand 7 states. [2018-07-23 13:37:03,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:03,650 INFO L93 Difference]: Finished difference Result 227 states and 353 transitions. [2018-07-23 13:37:03,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:03,651 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-07-23 13:37:03,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:03,652 INFO L225 Difference]: With dead ends: 227 [2018-07-23 13:37:03,652 INFO L226 Difference]: Without dead ends: 225 [2018-07-23 13:37:03,653 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:03,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-07-23 13:37:03,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 201. [2018-07-23 13:37:03,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-23 13:37:03,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 323 transitions. [2018-07-23 13:37:03,727 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 323 transitions. Word has length 13 [2018-07-23 13:37:03,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:03,728 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 323 transitions. [2018-07-23 13:37:03,728 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 323 transitions. [2018-07-23 13:37:03,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:03,729 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:03,729 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:03,729 INFO L414 AbstractCegarLoop]: === Iteration 32 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:03,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1799471129, now seen corresponding path program 1 times [2018-07-23 13:37:03,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:03,751 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:03,752 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:03,752 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:03,752 INFO L185 omatonBuilderFactory]: Interpolants [16464#false, 16465#(= product_end0 product_next), 16466#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 16467#(and (= product_end0 product_begin1) (<= (+ product_begin0 1) product_end0)), 16468#(and (<= (+ product_working0 1) product_end0) (= product_end0 product_begin1)), 16469#(<= (+ product_working0 1) product_begin1), 16470#(<= (+ product_working0 2) product_begin1), 16471#(<= (+ product_working0 2) product_working1), 16463#true] [2018-07-23 13:37:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:03,753 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:03,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:03,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:03,753 INFO L87 Difference]: Start difference. First operand 201 states and 323 transitions. Second operand 9 states. [2018-07-23 13:37:04,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:04,001 INFO L93 Difference]: Finished difference Result 244 states and 382 transitions. [2018-07-23 13:37:04,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:37:04,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 13:37:04,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:04,003 INFO L225 Difference]: With dead ends: 244 [2018-07-23 13:37:04,003 INFO L226 Difference]: Without dead ends: 242 [2018-07-23 13:37:04,004 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:37:04,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-07-23 13:37:04,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 198. [2018-07-23 13:37:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-07-23 13:37:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 318 transitions. [2018-07-23 13:37:04,084 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 318 transitions. Word has length 13 [2018-07-23 13:37:04,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:04,084 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 318 transitions. [2018-07-23 13:37:04,084 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:04,084 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 318 transitions. [2018-07-23 13:37:04,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:04,085 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:04,085 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:04,085 INFO L414 AbstractCegarLoop]: === Iteration 33 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:04,085 INFO L82 PathProgramCache]: Analyzing trace with hash 267374077, now seen corresponding path program 1 times [2018-07-23 13:37:04,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:04,097 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:04,097 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:04,098 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:04,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:04,098 INFO L185 omatonBuilderFactory]: Interpolants [17378#true, 17379#false, 17380#(= product_end1 product_next), 17381#(= product_end1 product_begin0), 17382#(<= (+ product_begin1 1) product_begin0), 17383#(<= (+ product_begin1 1) product_working0), 17384#(not (= product_working1 product_working0))] [2018-07-23 13:37:04,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:04,099 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:04,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:04,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:04,102 INFO L87 Difference]: Start difference. First operand 198 states and 318 transitions. Second operand 7 states. [2018-07-23 13:37:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:04,265 INFO L93 Difference]: Finished difference Result 222 states and 342 transitions. [2018-07-23 13:37:04,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:04,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-07-23 13:37:04,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:04,267 INFO L225 Difference]: With dead ends: 222 [2018-07-23 13:37:04,267 INFO L226 Difference]: Without dead ends: 220 [2018-07-23 13:37:04,268 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:04,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-07-23 13:37:04,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 194. [2018-07-23 13:37:04,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-23 13:37:04,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 311 transitions. [2018-07-23 13:37:04,343 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 311 transitions. Word has length 13 [2018-07-23 13:37:04,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:04,344 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 311 transitions. [2018-07-23 13:37:04,344 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:04,344 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 311 transitions. [2018-07-23 13:37:04,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:04,345 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:04,345 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:04,345 INFO L414 AbstractCegarLoop]: === Iteration 34 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:04,345 INFO L82 PathProgramCache]: Analyzing trace with hash 267373789, now seen corresponding path program 1 times [2018-07-23 13:37:04,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:04,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:04,362 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:04,362 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:04,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:04,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:04,363 INFO L185 omatonBuilderFactory]: Interpolants [18240#(<= (+ product_working1 3) product_begin0), 18241#(<= (+ product_working1 3) product_working0), 18233#true, 18234#false, 18235#(= product_end1 product_next), 18236#(= product_end1 product_begin0), 18237#(and (<= product_working1 product_begin1) (= product_end1 product_begin0)), 18238#(and (<= (+ product_working1 1) product_begin1) (= product_end1 product_begin0)), 18239#(<= (+ product_working1 2) product_begin0)] [2018-07-23 13:37:04,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:04,363 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:04,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:04,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:04,364 INFO L87 Difference]: Start difference. First operand 194 states and 311 transitions. Second operand 9 states. [2018-07-23 13:37:04,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:04,516 INFO L93 Difference]: Finished difference Result 219 states and 343 transitions. [2018-07-23 13:37:04,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:37:04,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 13:37:04,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:04,518 INFO L225 Difference]: With dead ends: 219 [2018-07-23 13:37:04,518 INFO L226 Difference]: Without dead ends: 218 [2018-07-23 13:37:04,518 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:04,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-07-23 13:37:04,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 200. [2018-07-23 13:37:04,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-07-23 13:37:04,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 322 transitions. [2018-07-23 13:37:04,597 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 322 transitions. Word has length 13 [2018-07-23 13:37:04,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:04,597 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 322 transitions. [2018-07-23 13:37:04,597 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 322 transitions. [2018-07-23 13:37:04,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:04,598 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:04,598 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:04,598 INFO L414 AbstractCegarLoop]: === Iteration 35 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:04,598 INFO L82 PathProgramCache]: Analyzing trace with hash 290277111, now seen corresponding path program 1 times [2018-07-23 13:37:04,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:04,615 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:04,616 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:04,616 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:04,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:04,616 INFO L185 omatonBuilderFactory]: Interpolants [19088#(and (= product_end1 product_begin0) (<= (+ product_begin1 1) product_end1)), 19089#(and (= product_end1 product_begin0) (<= (+ product_working1 1) product_end1)), 19090#(<= (+ product_working1 1) product_begin0), 19091#(<= (+ product_working1 2) product_begin0), 19092#(<= (+ product_working1 2) product_working0), 19084#true, 19085#false, 19086#(= product_end1 product_next), 19087#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))] [2018-07-23 13:37:04,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:04,617 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:04,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:04,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:04,617 INFO L87 Difference]: Start difference. First operand 200 states and 322 transitions. Second operand 9 states. [2018-07-23 13:37:04,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:04,855 INFO L93 Difference]: Finished difference Result 251 states and 394 transitions. [2018-07-23 13:37:04,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:37:04,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 13:37:04,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:04,857 INFO L225 Difference]: With dead ends: 251 [2018-07-23 13:37:04,857 INFO L226 Difference]: Without dead ends: 249 [2018-07-23 13:37:04,858 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:37:04,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-07-23 13:37:04,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 214. [2018-07-23 13:37:04,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-07-23 13:37:04,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 345 transitions. [2018-07-23 13:37:04,948 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 345 transitions. Word has length 13 [2018-07-23 13:37:04,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:04,949 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 345 transitions. [2018-07-23 13:37:04,949 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:04,949 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 345 transitions. [2018-07-23 13:37:04,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:04,949 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:04,950 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:04,950 INFO L414 AbstractCegarLoop]: === Iteration 36 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:04,950 INFO L82 PathProgramCache]: Analyzing trace with hash 2115277807, now seen corresponding path program 2 times [2018-07-23 13:37:04,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:04,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:04,960 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:04,961 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:04,961 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:04,961 INFO L185 omatonBuilderFactory]: Interpolants [20048#(= product_end1 product_begin0), 20049#(= product_end1 product_working0), 20050#(<= (+ product_begin1 1) product_working0), 20051#(not (= product_working1 product_working0)), 20045#true, 20046#false, 20047#(= product_end1 product_next)] [2018-07-23 13:37:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:04,962 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:04,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:04,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:04,962 INFO L87 Difference]: Start difference. First operand 214 states and 345 transitions. Second operand 7 states. [2018-07-23 13:37:05,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:05,131 INFO L93 Difference]: Finished difference Result 258 states and 407 transitions. [2018-07-23 13:37:05,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:05,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-07-23 13:37:05,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:05,133 INFO L225 Difference]: With dead ends: 258 [2018-07-23 13:37:05,133 INFO L226 Difference]: Without dead ends: 256 [2018-07-23 13:37:05,134 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:05,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-07-23 13:37:05,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 236. [2018-07-23 13:37:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-07-23 13:37:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 382 transitions. [2018-07-23 13:37:05,233 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 382 transitions. Word has length 13 [2018-07-23 13:37:05,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:05,233 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 382 transitions. [2018-07-23 13:37:05,233 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:05,233 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 382 transitions. [2018-07-23 13:37:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:05,234 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:05,234 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:05,234 INFO L414 AbstractCegarLoop]: === Iteration 37 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:05,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2115277519, now seen corresponding path program 2 times [2018-07-23 13:37:05,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:05,250 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:05,250 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:05,250 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:05,251 INFO L185 omatonBuilderFactory]: Interpolants [21056#(<= (+ product_working1 product_end1 2) (+ product_begin0 product_begin1)), 21057#(<= (+ product_working1 3) product_begin0), 21058#(<= (+ product_working1 3) product_working0), 21050#true, 21051#false, 21052#(= product_end1 product_next), 21053#(= product_end1 product_begin0), 21054#(<= (+ product_end1 1) product_begin0), 21055#(<= (+ product_working1 product_end1 1) (+ product_begin0 product_begin1))] [2018-07-23 13:37:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:05,251 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:05,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:05,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:05,252 INFO L87 Difference]: Start difference. First operand 236 states and 382 transitions. Second operand 9 states. [2018-07-23 13:37:05,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:05,490 INFO L93 Difference]: Finished difference Result 270 states and 424 transitions. [2018-07-23 13:37:05,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:37:05,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 13:37:05,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:05,492 INFO L225 Difference]: With dead ends: 270 [2018-07-23 13:37:05,493 INFO L226 Difference]: Without dead ends: 269 [2018-07-23 13:37:05,493 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:37:05,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-23 13:37:05,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 241. [2018-07-23 13:37:05,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-07-23 13:37:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 391 transitions. [2018-07-23 13:37:05,597 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 391 transitions. Word has length 13 [2018-07-23 13:37:05,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:05,597 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 391 transitions. [2018-07-23 13:37:05,597 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:05,597 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 391 transitions. [2018-07-23 13:37:05,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:05,598 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:05,598 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:05,598 INFO L414 AbstractCegarLoop]: === Iteration 38 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:05,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2115278289, now seen corresponding path program 1 times [2018-07-23 13:37:05,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:05,616 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:05,616 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:05,616 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:05,617 INFO L185 omatonBuilderFactory]: Interpolants [22096#(<= (+ product_working1 2) product_working0), 22089#true, 22090#false, 22091#(= product_end1 product_next), 22092#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 22093#(and (= product_end1 product_begin0) (<= (+ product_begin1 1) product_end1)), 22094#(<= (+ product_begin1 2) product_begin0), 22095#(<= (+ product_working1 2) product_begin0)] [2018-07-23 13:37:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:05,618 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:05,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:05,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:05,619 INFO L87 Difference]: Start difference. First operand 241 states and 391 transitions. Second operand 8 states. [2018-07-23 13:37:05,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:05,895 INFO L93 Difference]: Finished difference Result 296 states and 468 transitions. [2018-07-23 13:37:05,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:37:05,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-07-23 13:37:05,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:05,898 INFO L225 Difference]: With dead ends: 296 [2018-07-23 13:37:05,898 INFO L226 Difference]: Without dead ends: 294 [2018-07-23 13:37:05,899 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:05,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-07-23 13:37:06,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 245. [2018-07-23 13:37:06,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-23 13:37:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 397 transitions. [2018-07-23 13:37:06,035 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 397 transitions. Word has length 13 [2018-07-23 13:37:06,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:06,035 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 397 transitions. [2018-07-23 13:37:06,035 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 397 transitions. [2018-07-23 13:37:06,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:06,036 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:06,036 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:06,037 INFO L414 AbstractCegarLoop]: === Iteration 39 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:06,037 INFO L82 PathProgramCache]: Analyzing trace with hash -238445237, now seen corresponding path program 1 times [2018-07-23 13:37:06,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:06,066 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:06,066 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:06,066 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:06,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:06,067 INFO L185 omatonBuilderFactory]: Interpolants [23200#(and (<= product_working1 product_begin1) (= product_end1 product_next)), 23201#(and (= product_end1 product_next) (<= (+ product_working1 1) product_begin1)), 23202#(<= (+ product_working1 2) product_next), 23203#(<= (+ product_working1 2) product_begin0), 23204#(<= (+ product_working1 3) product_begin0), 23205#(<= (+ product_working1 3) product_working0), 23197#true, 23198#false, 23199#(= product_end1 product_next)] [2018-07-23 13:37:06,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:06,067 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:06,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:06,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:06,068 INFO L87 Difference]: Start difference. First operand 245 states and 397 transitions. Second operand 9 states. [2018-07-23 13:37:06,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:06,285 INFO L93 Difference]: Finished difference Result 270 states and 431 transitions. [2018-07-23 13:37:06,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:37:06,286 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 13:37:06,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:06,287 INFO L225 Difference]: With dead ends: 270 [2018-07-23 13:37:06,288 INFO L226 Difference]: Without dead ends: 269 [2018-07-23 13:37:06,288 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:06,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-23 13:37:06,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 260. [2018-07-23 13:37:06,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-07-23 13:37:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 423 transitions. [2018-07-23 13:37:06,448 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 423 transitions. Word has length 13 [2018-07-23 13:37:06,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:06,448 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 423 transitions. [2018-07-23 13:37:06,448 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:06,449 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 423 transitions. [2018-07-23 13:37:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:06,449 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:06,449 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:06,450 INFO L414 AbstractCegarLoop]: === Iteration 40 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:06,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2129075237, now seen corresponding path program 1 times [2018-07-23 13:37:06,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:06,465 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:06,466 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:06,466 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:06,466 INFO L185 omatonBuilderFactory]: Interpolants [24272#(= product_end1 product_next), 24273#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 24274#(and (= product_end1 product_next) (<= (+ product_working1 1) product_end1)), 24275#(<= (+ product_working1 1) product_next), 24276#(<= (+ product_working1 1) product_begin0), 24277#(<= (+ product_working1 2) product_begin0), 24278#(<= (+ product_working1 2) product_working0), 24270#true, 24271#false] [2018-07-23 13:37:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:06,467 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:06,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:06,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:06,467 INFO L87 Difference]: Start difference. First operand 260 states and 423 transitions. Second operand 9 states. [2018-07-23 13:37:06,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:06,713 INFO L93 Difference]: Finished difference Result 317 states and 507 transitions. [2018-07-23 13:37:06,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:37:06,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 13:37:06,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:06,715 INFO L225 Difference]: With dead ends: 317 [2018-07-23 13:37:06,715 INFO L226 Difference]: Without dead ends: 315 [2018-07-23 13:37:06,716 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:06,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-07-23 13:37:06,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 252. [2018-07-23 13:37:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-07-23 13:37:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 411 transitions. [2018-07-23 13:37:06,828 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 411 transitions. Word has length 13 [2018-07-23 13:37:06,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:06,828 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 411 transitions. [2018-07-23 13:37:06,828 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 411 transitions. [2018-07-23 13:37:06,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:06,829 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:06,829 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2018-07-23 13:37:06,829 INFO L414 AbstractCegarLoop]: === Iteration 41 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:06,830 INFO L82 PathProgramCache]: Analyzing trace with hash -24071906, now seen corresponding path program 1 times [2018-07-23 13:37:06,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:06,847 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:06,848 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:06,848 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:06,848 INFO L185 omatonBuilderFactory]: Interpolants [25440#(and (<= (+ product_working0 1) product_begin1) (= product_end1 product_next)), 25441#(and (<= (+ product_working0 2) product_end1) (= product_end1 product_next)), 25442#(<= (+ product_working0 2) product_next), 25443#(<= (+ product_working0 2) product_begin1), 25444#(<= (+ product_working0 3) product_begin1), 25445#(<= (+ product_working0 3) product_working1), 25437#true, 25438#false, 25439#(<= (+ product_working0 1) product_next)] [2018-07-23 13:37:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:06,849 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:06,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:06,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:06,849 INFO L87 Difference]: Start difference. First operand 252 states and 411 transitions. Second operand 9 states. [2018-07-23 13:37:07,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:07,081 INFO L93 Difference]: Finished difference Result 317 states and 513 transitions. [2018-07-23 13:37:07,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:37:07,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 13:37:07,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:07,083 INFO L225 Difference]: With dead ends: 317 [2018-07-23 13:37:07,084 INFO L226 Difference]: Without dead ends: 315 [2018-07-23 13:37:07,084 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:37:07,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-07-23 13:37:07,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2018-07-23 13:37:07,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-07-23 13:37:07,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 423 transitions. [2018-07-23 13:37:07,194 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 423 transitions. Word has length 13 [2018-07-23 13:37:07,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:07,194 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 423 transitions. [2018-07-23 13:37:07,194 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:07,195 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 423 transitions. [2018-07-23 13:37:07,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:07,195 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:07,195 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:07,196 INFO L414 AbstractCegarLoop]: === Iteration 42 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:07,196 INFO L82 PathProgramCache]: Analyzing trace with hash -603538094, now seen corresponding path program 1 times [2018-07-23 13:37:07,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:07,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:07,225 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:07,225 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:37:07,225 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:07,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:07,225 INFO L185 omatonBuilderFactory]: Interpolants [26624#(not (= product_working0 product_working1)), 26614#true, 26615#false, 26616#(= product_end0 product_next), 26617#(and (<= product_working0 product_begin0) (= product_end0 product_next)), 26618#(and (<= (+ product_working0 1) product_begin0) (= product_end0 product_next)), 26619#(<= (+ product_working0 2) product_next), 26620#(and (or (= product_working0 product_end1) (= product_end1 product_next)) (or (not (= product_working0 product_end1)) (<= (+ product_working0 2) product_begin1))), 26621#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 26622#(not (= product_working0 product_next)), 26623#(not (= product_working0 product_begin1))] [2018-07-23 13:37:07,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:07,226 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:37:07,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:37:07,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:07,227 INFO L87 Difference]: Start difference. First operand 258 states and 423 transitions. Second operand 11 states. [2018-07-23 13:37:07,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:07,453 INFO L93 Difference]: Finished difference Result 273 states and 437 transitions. [2018-07-23 13:37:07,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:37:07,453 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 13:37:07,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:07,455 INFO L225 Difference]: With dead ends: 273 [2018-07-23 13:37:07,455 INFO L226 Difference]: Without dead ends: 272 [2018-07-23 13:37:07,456 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:37:07,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-07-23 13:37:07,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 249. [2018-07-23 13:37:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-07-23 13:37:07,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 408 transitions. [2018-07-23 13:37:07,575 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 408 transitions. Word has length 15 [2018-07-23 13:37:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:07,575 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 408 transitions. [2018-07-23 13:37:07,575 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:37:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 408 transitions. [2018-07-23 13:37:07,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:07,576 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:07,576 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:07,577 INFO L414 AbstractCegarLoop]: === Iteration 43 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:07,577 INFO L82 PathProgramCache]: Analyzing trace with hash 2021827592, now seen corresponding path program 1 times [2018-07-23 13:37:07,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:07,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:07,597 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:07,597 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:37:07,597 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:07,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:07,598 INFO L185 omatonBuilderFactory]: Interpolants [27696#(<= (+ product_working0 2) product_next), 27697#(<= (+ product_working0 2) product_begin1), 27698#(<= (+ product_working0 3) product_begin1), 27699#(<= (+ product_working0 3) product_working1), 27689#true, 27690#false, 27691#(= product_end0 product_next), 27692#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 27693#(and (<= (+ product_working0 1) product_end0) (= product_end0 product_next)), 27694#(<= (+ product_working0 1) product_next), 27695#(and (<= (+ product_working0 1) product_begin0) (= product_end0 product_next))] [2018-07-23 13:37:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:07,598 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:37:07,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:37:07,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:07,599 INFO L87 Difference]: Start difference. First operand 249 states and 408 transitions. Second operand 11 states. [2018-07-23 13:37:07,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:07,805 INFO L93 Difference]: Finished difference Result 279 states and 448 transitions. [2018-07-23 13:37:07,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:07,806 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 13:37:07,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:07,807 INFO L225 Difference]: With dead ends: 279 [2018-07-23 13:37:07,807 INFO L226 Difference]: Without dead ends: 278 [2018-07-23 13:37:07,808 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:07,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-07-23 13:37:07,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 255. [2018-07-23 13:37:07,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-07-23 13:37:07,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 418 transitions. [2018-07-23 13:37:07,926 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 418 transitions. Word has length 15 [2018-07-23 13:37:07,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:07,926 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 418 transitions. [2018-07-23 13:37:07,926 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:37:07,926 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 418 transitions. [2018-07-23 13:37:07,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:07,927 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:07,927 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:07,927 INFO L414 AbstractCegarLoop]: === Iteration 44 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:07,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2013238847, now seen corresponding path program 1 times [2018-07-23 13:37:07,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:07,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:07,943 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:07,943 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:07,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:07,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:07,943 INFO L185 omatonBuilderFactory]: Interpolants [28784#(<= (+ product_working1 3) product_working0), 28776#true, 28777#false, 28778#(<= (+ product_working1 1) product_next), 28779#(and (= product_end0 product_next) (<= (+ product_working1 1) product_begin0)), 28780#(and (<= (+ product_working1 2) product_end0) (= product_end0 product_next)), 28781#(<= (+ product_working1 2) product_next), 28782#(<= (+ product_working1 2) product_begin0), 28783#(<= (+ product_working1 3) product_begin0)] [2018-07-23 13:37:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:07,944 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:07,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:07,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:07,945 INFO L87 Difference]: Start difference. First operand 255 states and 418 transitions. Second operand 9 states. [2018-07-23 13:37:08,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:08,161 INFO L93 Difference]: Finished difference Result 296 states and 483 transitions. [2018-07-23 13:37:08,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:37:08,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-07-23 13:37:08,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:08,164 INFO L225 Difference]: With dead ends: 296 [2018-07-23 13:37:08,164 INFO L226 Difference]: Without dead ends: 295 [2018-07-23 13:37:08,164 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:37:08,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-07-23 13:37:08,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 246. [2018-07-23 13:37:08,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-07-23 13:37:08,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 403 transitions. [2018-07-23 13:37:08,278 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 403 transitions. Word has length 15 [2018-07-23 13:37:08,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:08,278 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 403 transitions. [2018-07-23 13:37:08,278 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:08,278 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 403 transitions. [2018-07-23 13:37:08,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:08,279 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:08,279 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:08,279 INFO L414 AbstractCegarLoop]: === Iteration 45 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:08,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1215990847, now seen corresponding path program 1 times [2018-07-23 13:37:08,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:08,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:08,299 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:08,299 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:08,300 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:08,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:08,300 INFO L185 omatonBuilderFactory]: Interpolants [29888#false, 29889#(<= (+ product_working1 1) product_next), 29890#(and (= product_end0 product_next) (<= (+ product_working1 1) product_begin0)), 29891#(and (<= (+ product_working1 2) product_end0) (= product_end0 product_next)), 29892#(<= (+ product_working1 2) product_next), 29893#(and (= product_end1 product_next) (<= (+ product_working1 2) product_begin1)), 29894#(<= (+ product_working1 3) product_next), 29895#(<= (+ product_working1 3) product_begin0), 29896#(<= (+ product_working1 4) product_begin0), 29897#(<= (+ product_working1 4) product_working0), 29887#true] [2018-07-23 13:37:08,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:08,300 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:37:08,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:37:08,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:08,301 INFO L87 Difference]: Start difference. First operand 246 states and 403 transitions. Second operand 11 states. [2018-07-23 13:37:08,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:08,523 INFO L93 Difference]: Finished difference Result 274 states and 449 transitions. [2018-07-23 13:37:08,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:08,523 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 13:37:08,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:08,525 INFO L225 Difference]: With dead ends: 274 [2018-07-23 13:37:08,525 INFO L226 Difference]: Without dead ends: 273 [2018-07-23 13:37:08,526 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:08,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-07-23 13:37:08,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2018-07-23 13:37:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-23 13:37:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 438 transitions. [2018-07-23 13:37:08,672 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 438 transitions. Word has length 15 [2018-07-23 13:37:08,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:08,673 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 438 transitions. [2018-07-23 13:37:08,673 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:37:08,673 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 438 transitions. [2018-07-23 13:37:08,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:08,674 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:08,674 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:08,674 INFO L414 AbstractCegarLoop]: === Iteration 46 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:08,674 INFO L82 PathProgramCache]: Analyzing trace with hash -994782852, now seen corresponding path program 1 times [2018-07-23 13:37:08,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:08,702 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:08,702 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:37:08,703 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:08,703 INFO L185 omatonBuilderFactory]: Interpolants [30996#true, 30997#false, 30998#(= product_end0 product_next), 30999#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 31000#(and (<= (+ product_working0 1) product_end0) (= product_end0 product_next)), 31001#(<= (+ product_working0 1) product_next), 31002#(and (or (<= (+ product_working0 1) product_begin1) (not (= product_working0 product_end1))) (or (= product_working0 product_end1) (= product_end1 product_next))), 31003#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 31004#(not (= product_working0 product_next)), 31005#(not (= product_working0 product_begin1)), 31006#(not (= product_working0 product_working1))] [2018-07-23 13:37:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:08,704 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:37:08,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:37:08,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:08,704 INFO L87 Difference]: Start difference. First operand 267 states and 438 transitions. Second operand 11 states. [2018-07-23 13:37:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:09,022 INFO L93 Difference]: Finished difference Result 311 states and 496 transitions. [2018-07-23 13:37:09,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:37:09,023 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 13:37:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:09,025 INFO L225 Difference]: With dead ends: 311 [2018-07-23 13:37:09,025 INFO L226 Difference]: Without dead ends: 309 [2018-07-23 13:37:09,025 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:37:09,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-07-23 13:37:09,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 279. [2018-07-23 13:37:09,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-07-23 13:37:09,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 457 transitions. [2018-07-23 13:37:09,185 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 457 transitions. Word has length 15 [2018-07-23 13:37:09,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:09,186 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 457 transitions. [2018-07-23 13:37:09,186 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:37:09,186 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 457 transitions. [2018-07-23 13:37:09,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:09,187 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:09,187 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:09,187 INFO L414 AbstractCegarLoop]: === Iteration 47 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:09,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1087577094, now seen corresponding path program 2 times [2018-07-23 13:37:09,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:09,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:09,210 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:09,210 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:37:09,210 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:09,211 INFO L185 omatonBuilderFactory]: Interpolants [32224#(or (<= (+ product_end0 1) product_begin0) (not (= product_working0 product_next))), 32225#(or (not (= product_working0 product_next)) (<= (+ product_end0 2) product_begin0)), 32226#(not (= product_working0 product_next)), 32227#(not (= product_working0 product_begin1)), 32228#(not (= product_working0 product_working1)), 32217#true, 32218#false, 32219#(= product_end0 product_next), 32220#(and (= product_end0 product_begin1) (= product_end1 product_next)), 32221#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 32222#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 32223#(<= (+ product_end0 1) product_next)] [2018-07-23 13:37:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:09,211 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:37:09,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:37:09,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:09,212 INFO L87 Difference]: Start difference. First operand 279 states and 457 transitions. Second operand 12 states. [2018-07-23 13:37:09,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:09,600 INFO L93 Difference]: Finished difference Result 313 states and 495 transitions. [2018-07-23 13:37:09,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:37:09,600 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-07-23 13:37:09,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:09,602 INFO L225 Difference]: With dead ends: 313 [2018-07-23 13:37:09,602 INFO L226 Difference]: Without dead ends: 312 [2018-07-23 13:37:09,603 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:37:09,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-07-23 13:37:09,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 284. [2018-07-23 13:37:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-07-23 13:37:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 466 transitions. [2018-07-23 13:37:09,790 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 466 transitions. Word has length 15 [2018-07-23 13:37:09,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:09,790 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 466 transitions. [2018-07-23 13:37:09,790 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:37:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 466 transitions. [2018-07-23 13:37:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:09,791 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:09,791 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:09,792 INFO L414 AbstractCegarLoop]: === Iteration 48 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:09,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1086284228, now seen corresponding path program 1 times [2018-07-23 13:37:09,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:09,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:09,829 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:09,829 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:37:09,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:09,830 INFO L185 omatonBuilderFactory]: Interpolants [33457#true, 33458#false, 33459#(= product_end0 product_next), 33460#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 33461#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0)), 33462#(and (= product_end0 product_begin1) (<= (+ product_begin0 product_begin1 2) (+ product_end0 product_end1)) (= product_end1 product_next)), 33463#(and (<= (+ product_begin0 2) product_end1) (= product_end1 product_next)), 33464#(<= (+ product_begin0 2) product_next), 33465#(not (= product_working0 product_next)), 33466#(not (= product_working0 product_begin1)), 33467#(not (= product_working0 product_working1))] [2018-07-23 13:37:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:09,831 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:37:09,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:37:09,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:09,832 INFO L87 Difference]: Start difference. First operand 284 states and 466 transitions. Second operand 11 states. [2018-07-23 13:37:10,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:10,263 INFO L93 Difference]: Finished difference Result 354 states and 563 transitions. [2018-07-23 13:37:10,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 13:37:10,264 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 13:37:10,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:10,266 INFO L225 Difference]: With dead ends: 354 [2018-07-23 13:37:10,266 INFO L226 Difference]: Without dead ends: 352 [2018-07-23 13:37:10,267 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:37:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-07-23 13:37:10,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 296. [2018-07-23 13:37:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-07-23 13:37:10,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 486 transitions. [2018-07-23 13:37:10,414 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 486 transitions. Word has length 15 [2018-07-23 13:37:10,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:10,414 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 486 transitions. [2018-07-23 13:37:10,414 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:37:10,415 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 486 transitions. [2018-07-23 13:37:10,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:10,415 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:10,415 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:10,416 INFO L414 AbstractCegarLoop]: === Iteration 49 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:10,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1365577631, now seen corresponding path program 1 times [2018-07-23 13:37:10,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:10,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:10,438 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:10,438 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:10,438 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:10,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:10,439 INFO L185 omatonBuilderFactory]: Interpolants [34816#(and (= product_end1 product_next) (<= (+ product_working0 3) product_end1)), 34817#(<= (+ product_working0 3) product_next), 34818#(<= (+ product_working0 3) product_begin1), 34819#(<= (+ product_working0 4) product_begin1), 34820#(<= (+ product_working0 4) product_working1), 34810#true, 34811#false, 34812#(<= (+ product_working0 1) product_next), 34813#(and (<= (+ product_working0 1) product_begin0) (= product_end0 product_next)), 34814#(<= (+ product_working0 2) product_next), 34815#(and (<= (+ product_working0 2) product_begin1) (= product_end1 product_next))] [2018-07-23 13:37:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:10,439 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:37:10,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:37:10,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:10,440 INFO L87 Difference]: Start difference. First operand 296 states and 486 transitions. Second operand 11 states. [2018-07-23 13:37:10,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:10,689 INFO L93 Difference]: Finished difference Result 332 states and 544 transitions. [2018-07-23 13:37:10,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:10,689 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 13:37:10,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:10,691 INFO L225 Difference]: With dead ends: 332 [2018-07-23 13:37:10,692 INFO L226 Difference]: Without dead ends: 331 [2018-07-23 13:37:10,693 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:10,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-07-23 13:37:10,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 318. [2018-07-23 13:37:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-07-23 13:37:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 523 transitions. [2018-07-23 13:37:10,857 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 523 transitions. Word has length 15 [2018-07-23 13:37:10,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:10,857 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 523 transitions. [2018-07-23 13:37:10,858 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:37:10,858 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 523 transitions. [2018-07-23 13:37:10,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:10,859 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:10,859 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:10,859 INFO L414 AbstractCegarLoop]: === Iteration 50 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:10,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1365577919, now seen corresponding path program 1 times [2018-07-23 13:37:10,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:10,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:10,878 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:10,878 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:10,878 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:10,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:10,879 INFO L185 omatonBuilderFactory]: Interpolants [36144#(<= (+ product_begin0 2) product_begin1), 36145#(<= (+ product_begin0 2) product_working1), 36146#(not (= product_working0 product_working1)), 36137#true, 36138#false, 36139#(= product_end0 product_next), 36140#(<= (+ product_begin0 1) product_next), 36141#(and (<= (+ product_begin0 1) product_begin1) (= product_end1 product_next)), 36142#(and (<= (+ product_begin0 2) product_end1) (= product_end1 product_next)), 36143#(<= (+ product_begin0 2) product_next)] [2018-07-23 13:37:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:10,879 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:10,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:10,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:10,880 INFO L87 Difference]: Start difference. First operand 318 states and 523 transitions. Second operand 10 states. [2018-07-23 13:37:11,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:11,393 INFO L93 Difference]: Finished difference Result 503 states and 808 transitions. [2018-07-23 13:37:11,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:37:11,393 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 13:37:11,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:11,396 INFO L225 Difference]: With dead ends: 503 [2018-07-23 13:37:11,396 INFO L226 Difference]: Without dead ends: 501 [2018-07-23 13:37:11,397 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:37:11,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-07-23 13:37:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 396. [2018-07-23 13:37:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-07-23 13:37:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 658 transitions. [2018-07-23 13:37:11,620 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 658 transitions. Word has length 15 [2018-07-23 13:37:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:11,620 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 658 transitions. [2018-07-23 13:37:11,620 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 658 transitions. [2018-07-23 13:37:11,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:11,621 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:11,621 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:11,621 INFO L414 AbstractCegarLoop]: === Iteration 51 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:11,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1374166088, now seen corresponding path program 1 times [2018-07-23 13:37:11,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:11,642 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:11,642 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:37:11,642 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:11,643 INFO L185 omatonBuilderFactory]: Interpolants [37984#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 37985#(<= (+ product_end0 1) product_next), 37986#(<= (+ product_end0 1) product_begin1), 37987#(or (<= (+ product_end0 1) product_begin0) (not (= product_working0 product_begin1))), 37988#(or (<= (+ product_end0 2) product_begin0) (not (= product_working0 product_begin1))), 37989#(not (= product_working0 product_begin1)), 37990#(not (= product_working0 product_working1)), 37979#true, 37980#false, 37981#(= product_end0 product_next), 37982#(and (= product_end0 product_begin1) (= product_end1 product_next)), 37983#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))] [2018-07-23 13:37:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:11,645 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:37:11,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:37:11,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:11,646 INFO L87 Difference]: Start difference. First operand 396 states and 658 transitions. Second operand 12 states. [2018-07-23 13:37:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:12,055 INFO L93 Difference]: Finished difference Result 489 states and 800 transitions. [2018-07-23 13:37:12,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:37:12,056 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-07-23 13:37:12,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:12,058 INFO L225 Difference]: With dead ends: 489 [2018-07-23 13:37:12,059 INFO L226 Difference]: Without dead ends: 488 [2018-07-23 13:37:12,059 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:37:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-07-23 13:37:12,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 429. [2018-07-23 13:37:12,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-07-23 13:37:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 718 transitions. [2018-07-23 13:37:12,310 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 718 transitions. Word has length 15 [2018-07-23 13:37:12,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:12,310 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 718 transitions. [2018-07-23 13:37:12,310 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:37:12,310 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 718 transitions. [2018-07-23 13:37:12,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:12,311 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:12,311 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:12,314 INFO L414 AbstractCegarLoop]: === Iteration 52 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:12,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1374164806, now seen corresponding path program 1 times [2018-07-23 13:37:12,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:12,337 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:12,337 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:37:12,337 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:12,338 INFO L185 omatonBuilderFactory]: Interpolants [39856#false, 39857#(= product_end0 product_next), 39858#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 39859#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0)), 39860#(and (= product_end0 product_begin1) (<= (+ product_begin0 product_begin1 2) (+ product_end0 product_end1)) (= product_end1 product_next)), 39861#(and (<= (+ product_begin0 2) product_end1) (= product_end1 product_next)), 39862#(<= (+ product_begin0 2) product_next), 39863#(<= (+ product_begin0 2) product_begin1), 39864#(not (= product_working0 product_begin1)), 39865#(not (= product_working0 product_working1)), 39855#true] [2018-07-23 13:37:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:12,338 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:37:12,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:37:12,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:12,339 INFO L87 Difference]: Start difference. First operand 429 states and 718 transitions. Second operand 11 states. [2018-07-23 13:37:12,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:12,770 INFO L93 Difference]: Finished difference Result 484 states and 793 transitions. [2018-07-23 13:37:12,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:37:12,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 13:37:12,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:12,773 INFO L225 Difference]: With dead ends: 484 [2018-07-23 13:37:12,773 INFO L226 Difference]: Without dead ends: 482 [2018-07-23 13:37:12,774 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:37:12,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-07-23 13:37:13,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 442. [2018-07-23 13:37:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-07-23 13:37:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 739 transitions. [2018-07-23 13:37:13,004 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 739 transitions. Word has length 15 [2018-07-23 13:37:13,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:13,004 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 739 transitions. [2018-07-23 13:37:13,004 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:37:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 739 transitions. [2018-07-23 13:37:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:13,005 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:13,005 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:13,005 INFO L414 AbstractCegarLoop]: === Iteration 53 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:13,005 INFO L82 PathProgramCache]: Analyzing trace with hash -750529310, now seen corresponding path program 1 times [2018-07-23 13:37:13,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:13,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:13,033 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:13,033 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:13,033 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:13,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:13,034 INFO L185 omatonBuilderFactory]: Interpolants [41746#true, 41747#false, 41748#(= product_end1 product_next), 41749#(and (<= product_end0 product_next) (= product_end1 product_begin0)), 41750#(and (<= (+ product_begin0 1) product_next) (= product_end1 product_begin0)), 41751#(and (<= (+ product_begin0 product_working1 1) (+ product_next product_begin1)) (= product_end1 product_begin0)), 41752#(and (<= (+ product_begin0 product_working1 2) (+ product_next product_begin1)) (= product_end1 product_begin0)), 41753#(<= (+ product_working1 3) product_next), 41754#(<= (+ product_working1 3) product_begin0), 41755#(<= (+ product_working1 3) product_working0)] [2018-07-23 13:37:13,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:13,034 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:13,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:13,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:13,035 INFO L87 Difference]: Start difference. First operand 442 states and 739 transitions. Second operand 10 states. [2018-07-23 13:37:13,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:13,354 INFO L93 Difference]: Finished difference Result 465 states and 766 transitions. [2018-07-23 13:37:13,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:37:13,355 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 13:37:13,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:13,357 INFO L225 Difference]: With dead ends: 465 [2018-07-23 13:37:13,357 INFO L226 Difference]: Without dead ends: 464 [2018-07-23 13:37:13,358 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:13,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-07-23 13:37:13,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 451. [2018-07-23 13:37:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-07-23 13:37:13,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 754 transitions. [2018-07-23 13:37:13,635 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 754 transitions. Word has length 15 [2018-07-23 13:37:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:13,635 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 754 transitions. [2018-07-23 13:37:13,635 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:13,635 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 754 transitions. [2018-07-23 13:37:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:13,636 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:13,636 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:13,636 INFO L414 AbstractCegarLoop]: === Iteration 54 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:13,637 INFO L82 PathProgramCache]: Analyzing trace with hash -215212996, now seen corresponding path program 1 times [2018-07-23 13:37:13,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:13,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:13,654 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:13,654 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:13,655 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:13,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:13,655 INFO L185 omatonBuilderFactory]: Interpolants [43600#(= product_end1 product_next), 43601#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 43602#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0)), 43603#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 43604#(and (<= (+ product_begin0 product_working1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 43605#(<= (+ product_working1 2) product_next), 43606#(<= (+ product_working1 2) product_begin0), 43607#(<= (+ product_working1 2) product_working0), 43598#true, 43599#false] [2018-07-23 13:37:13,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:13,656 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:13,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:13,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:13,656 INFO L87 Difference]: Start difference. First operand 451 states and 754 transitions. Second operand 10 states. [2018-07-23 13:37:14,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:14,054 INFO L93 Difference]: Finished difference Result 518 states and 855 transitions. [2018-07-23 13:37:14,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:37:14,055 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 13:37:14,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:14,058 INFO L225 Difference]: With dead ends: 518 [2018-07-23 13:37:14,058 INFO L226 Difference]: Without dead ends: 516 [2018-07-23 13:37:14,058 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:37:14,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-07-23 13:37:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 467. [2018-07-23 13:37:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-07-23 13:37:14,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 781 transitions. [2018-07-23 13:37:14,314 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 781 transitions. Word has length 15 [2018-07-23 13:37:14,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:14,315 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 781 transitions. [2018-07-23 13:37:14,315 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:14,315 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 781 transitions. [2018-07-23 13:37:14,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:14,316 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:14,316 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:14,316 INFO L414 AbstractCegarLoop]: === Iteration 55 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:14,316 INFO L82 PathProgramCache]: Analyzing trace with hash -494290335, now seen corresponding path program 1 times [2018-07-23 13:37:14,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:14,332 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:14,332 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:14,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:14,333 INFO L185 omatonBuilderFactory]: Interpolants [45600#true, 45601#false, 45602#(<= (+ product_working0 1) product_next), 45603#(and (<= (+ product_working0 1) product_begin1) (= product_end1 product_next)), 45604#(and (<= (+ product_working0 2) product_end1) (= product_end1 product_next)), 45605#(and (<= (+ product_end0 product_working0 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 45606#(<= (+ product_working0 3) product_next), 45607#(<= (+ product_working0 3) product_begin1), 45608#(<= (+ product_working0 4) product_begin1), 45609#(<= (+ product_working0 4) product_working1)] [2018-07-23 13:37:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:14,333 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:14,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:14,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:14,334 INFO L87 Difference]: Start difference. First operand 467 states and 781 transitions. Second operand 10 states. [2018-07-23 13:37:14,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:14,673 INFO L93 Difference]: Finished difference Result 513 states and 856 transitions. [2018-07-23 13:37:14,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:14,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 13:37:14,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:14,676 INFO L225 Difference]: With dead ends: 513 [2018-07-23 13:37:14,676 INFO L226 Difference]: Without dead ends: 512 [2018-07-23 13:37:14,677 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:37:14,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-07-23 13:37:14,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 492. [2018-07-23 13:37:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-07-23 13:37:14,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 823 transitions. [2018-07-23 13:37:14,895 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 823 transitions. Word has length 15 [2018-07-23 13:37:14,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:14,895 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 823 transitions. [2018-07-23 13:37:14,895 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:14,896 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 823 transitions. [2018-07-23 13:37:14,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:14,897 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:14,897 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:14,897 INFO L414 AbstractCegarLoop]: === Iteration 56 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:14,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1511388970, now seen corresponding path program 2 times [2018-07-23 13:37:14,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:14,913 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:14,913 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:37:14,913 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:14,914 INFO L185 omatonBuilderFactory]: Interpolants [47636#true, 47637#false, 47638#(= product_end1 product_next), 47639#(and (<= product_end0 product_next) (= product_end1 product_begin0)), 47640#(and (<= (+ product_begin0 1) product_next) (= product_end1 product_begin0)), 47641#(<= (+ product_end1 1) product_next), 47642#(<= (+ product_end1 1) product_begin0), 47643#(<= (+ product_working1 product_end1 1) (+ product_begin0 product_begin1)), 47644#(<= (+ product_working1 product_end1 2) (+ product_begin0 product_begin1)), 47645#(<= (+ product_working1 3) product_begin0), 47646#(<= (+ product_working1 3) product_working0)] [2018-07-23 13:37:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:14,914 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:37:14,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:37:14,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:14,915 INFO L87 Difference]: Start difference. First operand 492 states and 823 transitions. Second operand 11 states. [2018-07-23 13:37:15,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:15,353 INFO L93 Difference]: Finished difference Result 571 states and 939 transitions. [2018-07-23 13:37:15,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:37:15,353 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 13:37:15,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:15,356 INFO L225 Difference]: With dead ends: 571 [2018-07-23 13:37:15,356 INFO L226 Difference]: Without dead ends: 570 [2018-07-23 13:37:15,356 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:37:15,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-07-23 13:37:15,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 512. [2018-07-23 13:37:15,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-07-23 13:37:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 860 transitions. [2018-07-23 13:37:15,605 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 860 transitions. Word has length 15 [2018-07-23 13:37:15,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:15,605 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 860 transitions. [2018-07-23 13:37:15,606 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:37:15,606 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 860 transitions. [2018-07-23 13:37:15,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:15,607 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:15,607 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:15,607 INFO L414 AbstractCegarLoop]: === Iteration 57 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:15,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1511389740, now seen corresponding path program 1 times [2018-07-23 13:37:15,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:15,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:15,623 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:15,623 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:15,623 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:15,624 INFO L185 omatonBuilderFactory]: Interpolants [49840#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 49841#(<= (+ product_begin1 2) product_next), 49842#(<= (+ product_begin1 2) product_begin0), 49843#(<= (+ product_working1 2) product_begin0), 49844#(<= (+ product_working1 2) product_working0), 49835#true, 49836#false, 49837#(= product_end1 product_next), 49838#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 49839#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0))] [2018-07-23 13:37:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:15,624 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:15,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:15,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:15,625 INFO L87 Difference]: Start difference. First operand 512 states and 860 transitions. Second operand 10 states. [2018-07-23 13:37:16,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:16,043 INFO L93 Difference]: Finished difference Result 583 states and 963 transitions. [2018-07-23 13:37:16,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:37:16,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 13:37:16,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:16,046 INFO L225 Difference]: With dead ends: 583 [2018-07-23 13:37:16,046 INFO L226 Difference]: Without dead ends: 581 [2018-07-23 13:37:16,047 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:37:16,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-07-23 13:37:16,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 524. [2018-07-23 13:37:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-07-23 13:37:16,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 881 transitions. [2018-07-23 13:37:16,273 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 881 transitions. Word has length 15 [2018-07-23 13:37:16,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:16,274 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 881 transitions. [2018-07-23 13:37:16,274 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:16,274 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 881 transitions. [2018-07-23 13:37:16,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:16,275 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:16,275 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:16,275 INFO L414 AbstractCegarLoop]: === Iteration 58 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:16,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1502800801, now seen corresponding path program 1 times [2018-07-23 13:37:16,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:16,297 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:16,297 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:37:16,298 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:16,298 INFO L185 omatonBuilderFactory]: Interpolants [52081#true, 52082#false, 52083#(and (<= (+ product_workload product_begin1) product_end1) (= product_end1 product_next)), 52084#(<= (+ product_workload product_begin1) product_next), 52085#(<= (+ product_workload product_end0 product_begin1) (+ product_begin0 product_next)), 52086#(<= (+ product_workload product_begin1 1) product_next), 52087#(<= (+ product_end0 product_begin1 1) (* 2 product_begin0)), 52088#(<= (+ product_end0 product_begin1 1) (+ product_begin0 product_working0)), 52089#(<= (+ product_end0 product_begin1 2) (+ product_begin0 product_working0)), 52090#(<= (+ product_begin1 3) product_working0), 52091#(<= (+ product_working1 3) product_working0)] [2018-07-23 13:37:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:16,299 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:37:16,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:37:16,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:16,299 INFO L87 Difference]: Start difference. First operand 524 states and 881 transitions. Second operand 11 states. [2018-07-23 13:37:16,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:16,960 INFO L93 Difference]: Finished difference Result 737 states and 1215 transitions. [2018-07-23 13:37:16,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:37:16,961 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 13:37:16,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:16,965 INFO L225 Difference]: With dead ends: 737 [2018-07-23 13:37:16,965 INFO L226 Difference]: Without dead ends: 736 [2018-07-23 13:37:16,966 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:37:16,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-07-23 13:37:17,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 623. [2018-07-23 13:37:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-07-23 13:37:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1052 transitions. [2018-07-23 13:37:17,357 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 1052 transitions. Word has length 15 [2018-07-23 13:37:17,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:17,358 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 1052 transitions. [2018-07-23 13:37:17,358 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:37:17,358 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1052 transitions. [2018-07-23 13:37:17,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:17,359 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:17,359 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-23 13:37:17,359 INFO L414 AbstractCegarLoop]: === Iteration 59 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:17,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1502802083, now seen corresponding path program 1 times [2018-07-23 13:37:17,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:17,370 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:17,371 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:17,371 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:17,371 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:17,371 INFO L185 omatonBuilderFactory]: Interpolants [54836#true, 54837#false, 54838#(= product_end1 product_next), 54839#(<= (+ product_begin1 1) product_next), 54840#(<= (+ product_end0 product_begin1 1) (+ product_begin0 product_next)), 54841#(<= (+ product_begin1 2) product_next), 54842#(<= (+ product_begin1 2) product_begin0), 54843#(<= (+ product_begin1 2) product_working0), 54844#(<= (+ product_working1 2) product_working0)] [2018-07-23 13:37:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:17,372 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:17,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:17,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:17,372 INFO L87 Difference]: Start difference. First operand 623 states and 1052 transitions. Second operand 9 states. [2018-07-23 13:37:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:17,922 INFO L93 Difference]: Finished difference Result 819 states and 1364 transitions. [2018-07-23 13:37:17,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:37:17,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-07-23 13:37:17,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:17,926 INFO L225 Difference]: With dead ends: 819 [2018-07-23 13:37:17,926 INFO L226 Difference]: Without dead ends: 817 [2018-07-23 13:37:17,927 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:37:17,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2018-07-23 13:37:18,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 600. [2018-07-23 13:37:18,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-07-23 13:37:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1013 transitions. [2018-07-23 13:37:18,168 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1013 transitions. Word has length 15 [2018-07-23 13:37:18,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:18,168 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 1013 transitions. [2018-07-23 13:37:18,169 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1013 transitions. [2018-07-23 13:37:18,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:18,170 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:18,170 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:18,170 INFO L414 AbstractCegarLoop]: === Iteration 60 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:18,170 INFO L82 PathProgramCache]: Analyzing trace with hash -708989572, now seen corresponding path program 1 times [2018-07-23 13:37:18,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:18,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,185 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:18,185 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:37:18,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,185 INFO L185 omatonBuilderFactory]: Interpolants [57712#false, 57713#(= product_end1 product_next), 57714#(and (<= product_end0 product_next) (= product_end1 product_begin0)), 57715#(and (<= (+ product_begin0 1) product_next) (= product_end1 product_begin0)), 57716#(<= (+ product_end1 1) product_next), 57717#(<= (+ product_working1 product_end1 1) (+ product_next product_begin1)), 57718#(<= (+ product_working1 product_end1 2) (+ product_next product_begin1)), 57719#(<= (+ product_working1 3) product_next), 57720#(<= (+ product_working1 3) product_begin0), 57721#(<= (+ product_working1 3) product_working0), 57711#true] [2018-07-23 13:37:18,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,186 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:37:18,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:37:18,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:18,186 INFO L87 Difference]: Start difference. First operand 600 states and 1013 transitions. Second operand 11 states. [2018-07-23 13:37:18,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:18,635 INFO L93 Difference]: Finished difference Result 638 states and 1059 transitions. [2018-07-23 13:37:18,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:18,636 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 13:37:18,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:18,639 INFO L225 Difference]: With dead ends: 638 [2018-07-23 13:37:18,639 INFO L226 Difference]: Without dead ends: 637 [2018-07-23 13:37:18,640 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-07-23 13:37:18,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 587. [2018-07-23 13:37:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-07-23 13:37:18,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 989 transitions. [2018-07-23 13:37:18,877 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 989 transitions. Word has length 15 [2018-07-23 13:37:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:18,877 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 989 transitions. [2018-07-23 13:37:18,877 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:37:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 989 transitions. [2018-07-23 13:37:18,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:18,878 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:18,878 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:18,879 INFO L414 AbstractCegarLoop]: === Iteration 61 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:18,879 INFO L82 PathProgramCache]: Analyzing trace with hash -708189250, now seen corresponding path program 1 times [2018-07-23 13:37:18,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,893 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:18,893 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:18,893 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,894 INFO L185 omatonBuilderFactory]: Interpolants [60192#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0)), 60193#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 60194#(<= (+ product_begin1 2) product_next), 60195#(<= (+ product_working1 2) product_next), 60196#(<= (+ product_working1 2) product_begin0), 60197#(<= (+ product_working1 2) product_working0), 60188#true, 60189#false, 60190#(= product_end1 product_next), 60191#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))] [2018-07-23 13:37:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,894 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:18,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:18,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:18,895 INFO L87 Difference]: Start difference. First operand 587 states and 989 transitions. Second operand 10 states. [2018-07-23 13:37:19,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:19,418 INFO L93 Difference]: Finished difference Result 642 states and 1067 transitions. [2018-07-23 13:37:19,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:37:19,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 13:37:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:19,422 INFO L225 Difference]: With dead ends: 642 [2018-07-23 13:37:19,422 INFO L226 Difference]: Without dead ends: 640 [2018-07-23 13:37:19,422 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:37:19,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-07-23 13:37:19,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 587. [2018-07-23 13:37:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-07-23 13:37:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 989 transitions. [2018-07-23 13:37:19,735 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 989 transitions. Word has length 15 [2018-07-23 13:37:19,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:19,735 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 989 transitions. [2018-07-23 13:37:19,735 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:19,735 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 989 transitions. [2018-07-23 13:37:19,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:19,736 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:19,736 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:19,736 INFO L414 AbstractCegarLoop]: === Iteration 62 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:19,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1511308848, now seen corresponding path program 2 times [2018-07-23 13:37:19,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:19,749 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:19,749 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:19,749 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:19,750 INFO L185 omatonBuilderFactory]: Interpolants [62688#(<= (+ product_working1 3) product_begin0), 62689#(<= (+ product_working1 3) product_working0), 62680#true, 62681#false, 62682#(= product_end1 product_next), 62683#(and (<= product_working1 product_begin1) (= product_end1 product_next)), 62684#(and (= product_end1 product_next) (<= (+ product_working1 1) product_begin1)), 62685#(<= (+ product_working1 2) product_next), 62686#(<= (+ product_working1 product_end0 2) (+ product_begin0 product_next)), 62687#(<= (+ product_working1 3) product_next)] [2018-07-23 13:37:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:19,750 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:19,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:19,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:19,751 INFO L87 Difference]: Start difference. First operand 587 states and 989 transitions. Second operand 10 states. [2018-07-23 13:37:20,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:20,108 INFO L93 Difference]: Finished difference Result 610 states and 1020 transitions. [2018-07-23 13:37:20,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:20,108 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 13:37:20,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:20,111 INFO L225 Difference]: With dead ends: 610 [2018-07-23 13:37:20,112 INFO L226 Difference]: Without dead ends: 609 [2018-07-23 13:37:20,112 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:20,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-07-23 13:37:20,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 578. [2018-07-23 13:37:20,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-07-23 13:37:20,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 974 transitions. [2018-07-23 13:37:20,354 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 974 transitions. Word has length 15 [2018-07-23 13:37:20,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:20,355 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 974 transitions. [2018-07-23 13:37:20,355 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:20,355 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 974 transitions. [2018-07-23 13:37:20,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:20,356 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:20,356 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:20,356 INFO L414 AbstractCegarLoop]: === Iteration 63 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:20,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1638227434, now seen corresponding path program 1 times [2018-07-23 13:37:20,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:20,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:20,390 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:20,390 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:37:20,390 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:20,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:20,391 INFO L185 omatonBuilderFactory]: Interpolants [65088#(not (= product_working1 product_next)), 65089#(not (= product_working1 product_begin0)), 65090#(not (= product_working1 product_working0)), 65080#true, 65081#false, 65082#(= product_end1 product_next), 65083#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 65084#(and (= product_end1 product_next) (<= (+ product_working1 1) product_end1)), 65085#(<= (+ product_working1 1) product_next), 65086#(and (or (not (= product_working1 product_end0)) (<= (+ product_working1 1) product_begin0)) (or (= product_working1 product_end0) (= product_end0 product_next))), 65087#(and (not (= product_working1 product_end0)) (= product_end0 product_next))] [2018-07-23 13:37:20,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:20,391 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:37:20,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:37:20,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:20,395 INFO L87 Difference]: Start difference. First operand 578 states and 974 transitions. Second operand 11 states. [2018-07-23 13:37:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:20,845 INFO L93 Difference]: Finished difference Result 633 states and 1050 transitions. [2018-07-23 13:37:20,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:37:20,845 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 13:37:20,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:20,848 INFO L225 Difference]: With dead ends: 633 [2018-07-23 13:37:20,848 INFO L226 Difference]: Without dead ends: 631 [2018-07-23 13:37:20,849 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:37:20,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-07-23 13:37:21,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 591. [2018-07-23 13:37:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-07-23 13:37:21,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 995 transitions. [2018-07-23 13:37:21,128 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 995 transitions. Word has length 15 [2018-07-23 13:37:21,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:21,129 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 995 transitions. [2018-07-23 13:37:21,129 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:37:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 995 transitions. [2018-07-23 13:37:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:21,130 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:21,130 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:21,130 INFO L414 AbstractCegarLoop]: === Iteration 64 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:21,131 INFO L82 PathProgramCache]: Analyzing trace with hash 553313350, now seen corresponding path program 1 times [2018-07-23 13:37:21,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:21,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:21,148 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:21,148 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:37:21,148 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:21,148 INFO L185 omatonBuilderFactory]: Interpolants [67569#true, 67571#(= product_end1 product_next), 67570#false, 67573#(and (= product_end1 product_next) (<= (+ product_working1 1) product_end1)), 67572#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 67575#(and (= product_end1 product_next) (<= (+ product_working1 1) product_begin1)), 67574#(<= (+ product_working1 1) product_next), 67577#(<= (+ product_working1 2) product_begin0), 67576#(<= (+ product_working1 2) product_next), 67579#(<= (+ product_working1 3) product_working0), 67578#(<= (+ product_working1 3) product_begin0)] [2018-07-23 13:37:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:21,149 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:37:21,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:37:21,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:21,149 INFO L87 Difference]: Start difference. First operand 591 states and 995 transitions. Second operand 11 states. [2018-07-23 13:37:21,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:21,531 INFO L93 Difference]: Finished difference Result 620 states and 1034 transitions. [2018-07-23 13:37:21,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:21,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 13:37:21,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:21,535 INFO L225 Difference]: With dead ends: 620 [2018-07-23 13:37:21,535 INFO L226 Difference]: Without dead ends: 619 [2018-07-23 13:37:21,535 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:21,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-07-23 13:37:21,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 596. [2018-07-23 13:37:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-07-23 13:37:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1004 transitions. [2018-07-23 13:37:21,868 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1004 transitions. Word has length 15 [2018-07-23 13:37:21,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:21,868 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 1004 transitions. [2018-07-23 13:37:21,869 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:37:21,869 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1004 transitions. [2018-07-23 13:37:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:21,870 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:21,870 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2018-07-23 13:37:21,870 INFO L414 AbstractCegarLoop]: === Iteration 65 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:21,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1657460349, now seen corresponding path program 1 times [2018-07-23 13:37:21,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:21,898 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:21,898 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:21,899 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:21,899 INFO L185 omatonBuilderFactory]: Interpolants [70021#false, 70020#true, 70023#(and (<= (+ product_working0 1) product_begin1) (= product_end1 product_next)), 70022#(<= (+ product_working0 1) product_next), 70025#(<= (+ product_working0 2) product_next), 70024#(and (<= (+ product_working0 2) product_end1) (= product_end1 product_next)), 70027#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 70026#(and (or (= product_working0 product_end1) (= product_end1 product_next)) (or (not (= product_working0 product_end1)) (<= (+ product_working0 2) product_begin1))), 70029#(not (= product_working0 product_begin1)), 70028#(not (= product_working0 product_next)), 70030#(not (= product_working0 product_working1))] [2018-07-23 13:37:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:21,900 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:37:21,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:37:21,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:21,900 INFO L87 Difference]: Start difference. First operand 596 states and 1004 transitions. Second operand 11 states. [2018-07-23 13:37:22,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:22,229 INFO L93 Difference]: Finished difference Result 601 states and 1009 transitions. [2018-07-23 13:37:22,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:37:22,230 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 13:37:22,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:22,232 INFO L225 Difference]: With dead ends: 601 [2018-07-23 13:37:22,232 INFO L226 Difference]: Without dead ends: 599 [2018-07-23 13:37:22,233 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:22,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-07-23 13:37:22,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 590. [2018-07-23 13:37:22,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-07-23 13:37:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 994 transitions. [2018-07-23 13:37:22,520 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 994 transitions. Word has length 15 [2018-07-23 13:37:22,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:22,520 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 994 transitions. [2018-07-23 13:37:22,520 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:37:22,521 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 994 transitions. [2018-07-23 13:37:22,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:22,522 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:22,522 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:22,522 INFO L414 AbstractCegarLoop]: === Iteration 66 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:22,522 INFO L82 PathProgramCache]: Analyzing trace with hash -616146153, now seen corresponding path program 3 times [2018-07-23 13:37:22,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:22,531 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:22,531 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:22,531 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:22,531 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:22,532 INFO L185 omatonBuilderFactory]: Interpolants [72421#true, 72423#(= product_end0 product_next), 72422#false, 72425#(<= (+ product_end0 1) product_begin1), 72424#(= product_end0 product_begin1), 72427#(<= (+ product_begin0 2) product_working1), 72426#(<= (+ product_end0 1) product_working1), 72428#(<= (+ product_working0 2) product_working1)] [2018-07-23 13:37:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:22,532 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:22,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:22,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:22,533 INFO L87 Difference]: Start difference. First operand 590 states and 994 transitions. Second operand 8 states. [2018-07-23 13:37:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:22,941 INFO L93 Difference]: Finished difference Result 652 states and 1080 transitions. [2018-07-23 13:37:22,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:22,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 13:37:22,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:22,945 INFO L225 Difference]: With dead ends: 652 [2018-07-23 13:37:22,945 INFO L226 Difference]: Without dead ends: 650 [2018-07-23 13:37:22,946 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:22,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-07-23 13:37:23,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 534. [2018-07-23 13:37:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-07-23 13:37:23,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 901 transitions. [2018-07-23 13:37:23,164 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 901 transitions. Word has length 16 [2018-07-23 13:37:23,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:23,164 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 901 transitions. [2018-07-23 13:37:23,164 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 901 transitions. [2018-07-23 13:37:23,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:23,166 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:23,166 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:23,166 INFO L414 AbstractCegarLoop]: === Iteration 67 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:23,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1231757577, now seen corresponding path program 4 times [2018-07-23 13:37:23,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:23,174 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:23,174 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:23,174 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:23,175 INFO L185 omatonBuilderFactory]: Interpolants [74819#true, 74821#(= product_end0 product_next), 74820#false, 74823#(<= (+ product_end0 1) product_begin1), 74822#(= product_end0 product_begin1), 74825#(<= (+ product_begin0 2) product_working1), 74824#(<= (+ product_begin0 2) product_begin1), 74826#(<= (+ product_working0 2) product_working1)] [2018-07-23 13:37:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:23,175 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:23,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:23,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:23,175 INFO L87 Difference]: Start difference. First operand 534 states and 901 transitions. Second operand 8 states. [2018-07-23 13:37:23,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:23,581 INFO L93 Difference]: Finished difference Result 587 states and 970 transitions. [2018-07-23 13:37:23,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:23,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 13:37:23,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:23,584 INFO L225 Difference]: With dead ends: 587 [2018-07-23 13:37:23,584 INFO L226 Difference]: Without dead ends: 585 [2018-07-23 13:37:23,585 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:23,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-07-23 13:37:23,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 518. [2018-07-23 13:37:23,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-07-23 13:37:23,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 872 transitions. [2018-07-23 13:37:23,852 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 872 transitions. Word has length 16 [2018-07-23 13:37:23,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:23,852 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 872 transitions. [2018-07-23 13:37:23,852 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:23,852 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 872 transitions. [2018-07-23 13:37:23,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:23,853 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:23,853 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:23,853 INFO L414 AbstractCegarLoop]: === Iteration 68 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:23,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1223170690, now seen corresponding path program 1 times [2018-07-23 13:37:23,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:23,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:23,861 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:23,861 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:23,861 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:23,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:23,861 INFO L185 omatonBuilderFactory]: Interpolants [77057#(<= (+ product_end0 1) product_begin1), 77056#(= product_end0 product_begin1), 77059#(<= (+ product_working0 2) product_begin1), 77058#(<= (+ product_begin0 2) product_begin1), 77060#(<= (+ product_working0 2) product_working1), 77053#true, 77055#(= product_end0 product_next), 77054#false] [2018-07-23 13:37:23,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:23,861 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:23,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:23,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:23,862 INFO L87 Difference]: Start difference. First operand 518 states and 872 transitions. Second operand 8 states. [2018-07-23 13:37:24,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:24,262 INFO L93 Difference]: Finished difference Result 599 states and 990 transitions. [2018-07-23 13:37:24,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:24,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 13:37:24,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:24,265 INFO L225 Difference]: With dead ends: 599 [2018-07-23 13:37:24,265 INFO L226 Difference]: Without dead ends: 597 [2018-07-23 13:37:24,265 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:24,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-07-23 13:37:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 523. [2018-07-23 13:37:24,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-07-23 13:37:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 880 transitions. [2018-07-23 13:37:24,494 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 880 transitions. Word has length 16 [2018-07-23 13:37:24,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:24,494 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 880 transitions. [2018-07-23 13:37:24,494 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:24,494 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 880 transitions. [2018-07-23 13:37:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:24,495 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:24,496 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:24,496 INFO L414 AbstractCegarLoop]: === Iteration 69 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:24,496 INFO L82 PathProgramCache]: Analyzing trace with hash -767609008, now seen corresponding path program 2 times [2018-07-23 13:37:24,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:24,504 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:24,504 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:24,504 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:24,505 INFO L185 omatonBuilderFactory]: Interpolants [79329#(<= (+ product_working0 2) product_begin1), 79328#(<= (+ product_begin0 2) product_begin1), 79330#(<= (+ product_working0 2) product_working1), 79323#true, 79325#(= product_end0 product_next), 79324#false, 79327#(and (= product_end0 product_begin1) (<= (+ product_begin0 1) product_end0)), 79326#(= product_end0 product_begin1)] [2018-07-23 13:37:24,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:24,505 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:24,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:24,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:24,506 INFO L87 Difference]: Start difference. First operand 523 states and 880 transitions. Second operand 8 states. [2018-07-23 13:37:24,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:24,845 INFO L93 Difference]: Finished difference Result 581 states and 960 transitions. [2018-07-23 13:37:24,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:24,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 13:37:24,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:24,849 INFO L225 Difference]: With dead ends: 581 [2018-07-23 13:37:24,849 INFO L226 Difference]: Without dead ends: 579 [2018-07-23 13:37:24,849 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-07-23 13:37:25,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 518. [2018-07-23 13:37:25,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-07-23 13:37:25,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 872 transitions. [2018-07-23 13:37:25,056 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 872 transitions. Word has length 16 [2018-07-23 13:37:25,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:25,057 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 872 transitions. [2018-07-23 13:37:25,057 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:25,057 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 872 transitions. [2018-07-23 13:37:25,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:25,058 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:25,058 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:25,058 INFO L414 AbstractCegarLoop]: === Iteration 70 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:25,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1823106549, now seen corresponding path program 1 times [2018-07-23 13:37:25,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:25,067 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:25,067 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:25,067 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:25,068 INFO L185 omatonBuilderFactory]: Interpolants [81541#true, 81543#(= product_end1 product_next), 81542#false, 81545#(and (= product_end1 product_begin0) (<= (+ product_begin1 1) product_end1)), 81544#(= product_end1 product_begin0), 81547#(<= (+ product_working1 2) product_begin0), 81546#(<= (+ product_begin1 2) product_begin0), 81548#(<= (+ product_working1 2) product_working0)] [2018-07-23 13:37:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:25,068 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:25,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:25,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:25,069 INFO L87 Difference]: Start difference. First operand 518 states and 872 transitions. Second operand 8 states. [2018-07-23 13:37:25,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:25,440 INFO L93 Difference]: Finished difference Result 575 states and 954 transitions. [2018-07-23 13:37:25,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:25,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 13:37:25,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:25,443 INFO L225 Difference]: With dead ends: 575 [2018-07-23 13:37:25,444 INFO L226 Difference]: Without dead ends: 573 [2018-07-23 13:37:25,444 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:25,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-07-23 13:37:25,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 521. [2018-07-23 13:37:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-07-23 13:37:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 877 transitions. [2018-07-23 13:37:25,816 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 877 transitions. Word has length 16 [2018-07-23 13:37:25,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:25,816 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 877 transitions. [2018-07-23 13:37:25,816 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:25,816 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 877 transitions. [2018-07-23 13:37:25,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:25,817 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:25,818 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:25,818 INFO L414 AbstractCegarLoop]: === Iteration 71 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:25,818 INFO L82 PathProgramCache]: Analyzing trace with hash 481081049, now seen corresponding path program 2 times [2018-07-23 13:37:25,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:25,827 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:25,827 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:25,827 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:25,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:25,828 INFO L185 omatonBuilderFactory]: Interpolants [83760#(<= (+ product_working1 2) product_working0), 83753#true, 83755#(= product_end1 product_next), 83754#false, 83757#(<= (+ product_end1 1) product_begin0), 83756#(= product_end1 product_begin0), 83759#(<= (+ product_working1 2) product_begin0), 83758#(<= (+ product_begin1 2) product_begin0)] [2018-07-23 13:37:25,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:25,828 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:25,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:25,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:25,829 INFO L87 Difference]: Start difference. First operand 521 states and 877 transitions. Second operand 8 states. [2018-07-23 13:37:26,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:26,348 INFO L93 Difference]: Finished difference Result 581 states and 961 transitions. [2018-07-23 13:37:26,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:26,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 13:37:26,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:26,352 INFO L225 Difference]: With dead ends: 581 [2018-07-23 13:37:26,352 INFO L226 Difference]: Without dead ends: 579 [2018-07-23 13:37:26,353 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:26,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-07-23 13:37:26,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 518. [2018-07-23 13:37:26,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-07-23 13:37:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 872 transitions. [2018-07-23 13:37:26,717 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 872 transitions. Word has length 16 [2018-07-23 13:37:26,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:26,718 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 872 transitions. [2018-07-23 13:37:26,718 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:26,718 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 872 transitions. [2018-07-23 13:37:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:26,719 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:26,719 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:26,719 INFO L414 AbstractCegarLoop]: === Iteration 72 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:26,720 INFO L82 PathProgramCache]: Analyzing trace with hash 472492110, now seen corresponding path program 3 times [2018-07-23 13:37:26,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:26,731 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:26,731 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:26,732 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:26,732 INFO L185 omatonBuilderFactory]: Interpolants [85984#(<= (+ product_working1 2) product_working0), 85977#true, 85979#(= product_end1 product_next), 85978#false, 85981#(<= (+ product_end1 1) product_begin0), 85980#(= product_end1 product_begin0), 85983#(<= (+ product_begin1 2) product_working0), 85982#(<= (+ product_begin1 2) product_begin0)] [2018-07-23 13:37:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:26,732 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:26,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:26,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:26,733 INFO L87 Difference]: Start difference. First operand 518 states and 872 transitions. Second operand 8 states. [2018-07-23 13:37:27,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:27,129 INFO L93 Difference]: Finished difference Result 573 states and 946 transitions. [2018-07-23 13:37:27,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:27,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 13:37:27,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:27,133 INFO L225 Difference]: With dead ends: 573 [2018-07-23 13:37:27,133 INFO L226 Difference]: Without dead ends: 571 [2018-07-23 13:37:27,133 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:27,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-07-23 13:37:27,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 512. [2018-07-23 13:37:27,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-07-23 13:37:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 862 transitions. [2018-07-23 13:37:27,361 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 862 transitions. Word has length 16 [2018-07-23 13:37:27,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:27,361 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 862 transitions. [2018-07-23 13:37:27,361 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:27,361 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 862 transitions. [2018-07-23 13:37:27,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:27,362 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:27,362 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:27,362 INFO L414 AbstractCegarLoop]: === Iteration 73 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:27,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1974571456, now seen corresponding path program 4 times [2018-07-23 13:37:27,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:27,370 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:27,370 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:27,371 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:27,371 INFO L185 omatonBuilderFactory]: Interpolants [88177#(<= (+ product_begin1 2) product_working0), 88176#(<= (+ product_end1 1) product_working0), 88178#(<= (+ product_working1 2) product_working0), 88171#true, 88173#(= product_end1 product_next), 88172#false, 88175#(<= (+ product_end1 1) product_begin0), 88174#(= product_end1 product_begin0)] [2018-07-23 13:37:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:27,371 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:27,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:27,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:27,372 INFO L87 Difference]: Start difference. First operand 512 states and 862 transitions. Second operand 8 states. [2018-07-23 13:37:27,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:27,698 INFO L93 Difference]: Finished difference Result 564 states and 935 transitions. [2018-07-23 13:37:27,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:27,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 13:37:27,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:27,701 INFO L225 Difference]: With dead ends: 564 [2018-07-23 13:37:27,702 INFO L226 Difference]: Without dead ends: 562 [2018-07-23 13:37:27,702 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:27,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-07-23 13:37:27,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 452. [2018-07-23 13:37:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-07-23 13:37:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 761 transitions. [2018-07-23 13:37:27,924 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 761 transitions. Word has length 16 [2018-07-23 13:37:27,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:27,924 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 761 transitions. [2018-07-23 13:37:27,924 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:27,924 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 761 transitions. [2018-07-23 13:37:27,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:37:27,925 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:27,925 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:27,925 INFO L414 AbstractCegarLoop]: === Iteration 74 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:27,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1651842093, now seen corresponding path program 1 times [2018-07-23 13:37:27,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:27,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:27,946 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:27,947 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:37:27,947 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:27,947 INFO L185 omatonBuilderFactory]: Interpolants [90241#(not (= product_working0 product_working1)), 90240#(not (= product_working0 product_begin1)), 90229#true, 90231#(= product_end0 product_next), 90230#false, 90233#(and (<= (+ product_working0 1) product_end0) (= product_end0 product_next)), 90232#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 90235#(and (<= (+ product_working0 1) product_begin0) (= product_end0 product_next)), 90234#(<= (+ product_working0 1) product_next), 90237#(and (or (= product_working0 product_end1) (= product_end1 product_next)) (or (not (= product_working0 product_end1)) (<= (+ product_working0 2) product_begin1))), 90236#(<= (+ product_working0 2) product_next), 90239#(not (= product_working0 product_next)), 90238#(and (not (= product_working0 product_end1)) (= product_end1 product_next))] [2018-07-23 13:37:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:27,947 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:37:27,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:37:27,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:37:27,948 INFO L87 Difference]: Start difference. First operand 452 states and 761 transitions. Second operand 13 states. [2018-07-23 13:37:28,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:28,283 INFO L93 Difference]: Finished difference Result 480 states and 791 transitions. [2018-07-23 13:37:28,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:37:28,283 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-07-23 13:37:28,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:28,285 INFO L225 Difference]: With dead ends: 480 [2018-07-23 13:37:28,285 INFO L226 Difference]: Without dead ends: 479 [2018-07-23 13:37:28,286 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=195, Invalid=861, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:37:28,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-07-23 13:37:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 430. [2018-07-23 13:37:28,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-07-23 13:37:28,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 722 transitions. [2018-07-23 13:37:28,485 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 722 transitions. Word has length 17 [2018-07-23 13:37:28,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:28,485 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 722 transitions. [2018-07-23 13:37:28,485 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:37:28,485 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 722 transitions. [2018-07-23 13:37:28,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:37:28,485 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:28,486 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:28,486 INFO L414 AbstractCegarLoop]: === Iteration 75 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:28,486 INFO L82 PathProgramCache]: Analyzing trace with hash 692781, now seen corresponding path program 1 times [2018-07-23 13:37:28,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:28,498 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:28,498 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:37:28,498 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:28,498 INFO L185 omatonBuilderFactory]: Interpolants [92113#(<= (+ product_working0 3) product_working1), 92112#(<= (+ product_working0 3) product_begin1), 92103#false, 92102#true, 92105#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 92104#(= product_end0 product_next), 92107#(<= (+ product_working0 1) product_next), 92106#(and (<= (+ product_working0 1) product_end0) (= product_end0 product_next)), 92109#(and (<= (+ product_working0 2) product_end1) (= product_end1 product_next)), 92108#(and (<= (+ product_working0 1) product_begin1) (= product_end1 product_next)), 92111#(<= (+ product_working0 3) product_next), 92110#(and (<= (+ product_end0 product_working0 2) (+ product_end1 product_next)) (= product_end1 product_begin0))] [2018-07-23 13:37:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:28,499 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:37:28,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:37:28,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:28,499 INFO L87 Difference]: Start difference. First operand 430 states and 722 transitions. Second operand 12 states. [2018-07-23 13:37:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:28,815 INFO L93 Difference]: Finished difference Result 545 states and 906 transitions. [2018-07-23 13:37:28,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:28,816 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-07-23 13:37:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:28,817 INFO L225 Difference]: With dead ends: 545 [2018-07-23 13:37:28,817 INFO L226 Difference]: Without dead ends: 544 [2018-07-23 13:37:28,818 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:37:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-07-23 13:37:29,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 451. [2018-07-23 13:37:29,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-07-23 13:37:29,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 757 transitions. [2018-07-23 13:37:29,038 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 757 transitions. Word has length 17 [2018-07-23 13:37:29,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:29,038 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 757 transitions. [2018-07-23 13:37:29,038 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:37:29,038 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 757 transitions. [2018-07-23 13:37:29,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:37:29,039 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:29,039 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:29,040 INFO L414 AbstractCegarLoop]: === Iteration 76 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:29,040 INFO L82 PathProgramCache]: Analyzing trace with hash 337396676, now seen corresponding path program 1 times [2018-07-23 13:37:29,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:29,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:29,055 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:29,056 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:37:29,056 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:29,056 INFO L185 omatonBuilderFactory]: Interpolants [94129#(<= (+ product_working1 3) product_next), 94128#(and (= product_end1 product_next) (<= (+ product_working1 2) product_begin1)), 94131#(<= (+ product_working1 4) product_next), 94130#(<= (+ product_working1 product_end0 3) (+ product_begin0 product_next)), 94133#(<= (+ product_working1 4) product_working0), 94132#(<= (+ product_working1 4) product_begin0), 94123#false, 94122#true, 94125#(and (= product_end0 product_next) (<= (+ product_working1 1) product_begin0)), 94124#(<= (+ product_working1 1) product_next), 94127#(<= (+ product_working1 2) product_next), 94126#(and (<= (+ product_working1 2) product_end0) (= product_end0 product_next))] [2018-07-23 13:37:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:29,056 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:37:29,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:37:29,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:29,057 INFO L87 Difference]: Start difference. First operand 451 states and 757 transitions. Second operand 12 states. [2018-07-23 13:37:29,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:29,309 INFO L93 Difference]: Finished difference Result 458 states and 767 transitions. [2018-07-23 13:37:29,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:29,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-07-23 13:37:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:29,311 INFO L225 Difference]: With dead ends: 458 [2018-07-23 13:37:29,311 INFO L226 Difference]: Without dead ends: 457 [2018-07-23 13:37:29,312 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:37:29,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-07-23 13:37:29,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 423. [2018-07-23 13:37:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-07-23 13:37:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 709 transitions. [2018-07-23 13:37:29,532 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 709 transitions. Word has length 17 [2018-07-23 13:37:29,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:29,532 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 709 transitions. [2018-07-23 13:37:29,532 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:37:29,532 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 709 transitions. [2018-07-23 13:37:29,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:37:29,533 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:29,533 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:29,533 INFO L414 AbstractCegarLoop]: === Iteration 77 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:29,533 INFO L82 PathProgramCache]: Analyzing trace with hash -449446913, now seen corresponding path program 2 times [2018-07-23 13:37:29,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:29,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:29,553 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:29,553 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:37:29,553 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:29,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:29,554 INFO L185 omatonBuilderFactory]: Interpolants [95915#false, 95914#true, 95917#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 95916#(= product_end0 product_next), 95919#(and (= product_end0 product_begin1) (<= (+ product_begin0 product_begin1 2) (+ product_end0 product_end1)) (= product_end1 product_next)), 95918#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0)), 95921#(<= (+ product_begin0 2) product_next), 95920#(and (<= (+ product_begin0 2) product_end1) (= product_end1 product_next)), 95923#(and (or (<= (+ product_working0 2) product_begin0) (not (= product_working0 product_end0))) (or (= product_working0 product_end0) (= product_end0 product_next))), 95922#(<= (+ product_working0 2) product_next), 95925#(not (= product_working0 product_begin1)), 95924#(not (= product_working0 product_next)), 95926#(not (= product_working0 product_working1))] [2018-07-23 13:37:29,554 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:29,554 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:37:29,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:37:29,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:37:29,555 INFO L87 Difference]: Start difference. First operand 423 states and 709 transitions. Second operand 13 states. [2018-07-23 13:37:29,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:29,955 INFO L93 Difference]: Finished difference Result 508 states and 829 transitions. [2018-07-23 13:37:29,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 13:37:29,955 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-07-23 13:37:29,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:29,956 INFO L225 Difference]: With dead ends: 508 [2018-07-23 13:37:29,956 INFO L226 Difference]: Without dead ends: 507 [2018-07-23 13:37:29,957 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=220, Invalid=1112, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:37:29,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-07-23 13:37:30,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 440. [2018-07-23 13:37:30,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-07-23 13:37:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 736 transitions. [2018-07-23 13:37:30,179 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 736 transitions. Word has length 17 [2018-07-23 13:37:30,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:30,180 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 736 transitions. [2018-07-23 13:37:30,180 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:37:30,180 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 736 transitions. [2018-07-23 13:37:30,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:37:30,181 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:30,181 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2018-07-23 13:37:30,181 INFO L414 AbstractCegarLoop]: === Iteration 78 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:30,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1940633158, now seen corresponding path program 1 times [2018-07-23 13:37:30,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,205 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:30,205 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:37:30,206 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,206 INFO L185 omatonBuilderFactory]: Interpolants [97871#true, 97873#(<= (+ product_working0 1) product_next), 97872#false, 97875#(<= (+ product_working0 2) product_next), 97874#(and (<= (+ product_working0 1) product_begin0) (= product_end0 product_next)), 97877#(and (= product_end1 product_next) (<= (+ product_working0 3) product_end1)), 97876#(and (<= (+ product_working0 2) product_begin1) (= product_end1 product_next)), 97879#(and (or (= product_working0 product_end1) (= product_end1 product_next)) (or (not (= product_working0 product_end1)) (<= (+ product_working0 3) product_begin1))), 97878#(<= (+ product_working0 3) product_next), 97881#(not (= product_working0 product_next)), 97880#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 97883#(not (= product_working0 product_working1)), 97882#(not (= product_working0 product_begin1))] [2018-07-23 13:37:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,206 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:37:30,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:37:30,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:37:30,207 INFO L87 Difference]: Start difference. First operand 440 states and 736 transitions. Second operand 13 states. [2018-07-23 13:37:30,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:30,541 INFO L93 Difference]: Finished difference Result 446 states and 743 transitions. [2018-07-23 13:37:30,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:37:30,541 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-07-23 13:37:30,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:30,542 INFO L225 Difference]: With dead ends: 446 [2018-07-23 13:37:30,542 INFO L226 Difference]: Without dead ends: 445 [2018-07-23 13:37:30,542 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:37:30,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-07-23 13:37:30,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 424. [2018-07-23 13:37:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-07-23 13:37:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 709 transitions. [2018-07-23 13:37:30,801 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 709 transitions. Word has length 17 [2018-07-23 13:37:30,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:30,801 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 709 transitions. [2018-07-23 13:37:30,802 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:37:30,802 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 709 transitions. [2018-07-23 13:37:30,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:37:30,802 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:30,802 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:30,802 INFO L414 AbstractCegarLoop]: === Iteration 79 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:30,803 INFO L82 PathProgramCache]: Analyzing trace with hash -453832993, now seen corresponding path program 1 times [2018-07-23 13:37:30,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,823 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:30,823 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:37:30,823 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,823 INFO L185 omatonBuilderFactory]: Interpolants [99635#false, 99634#true, 99637#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 99636#(= product_end1 product_next), 99639#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 99638#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0)), 99641#(<= (+ product_working1 2) product_next), 99640#(and (<= (+ product_begin0 product_working1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 99643#(not (= product_working1 product_next)), 99642#(and (or (= product_working1 product_end1) (= product_end1 product_next)) (or (not (= product_working1 product_end1)) (<= (+ product_working1 2) product_begin1))), 99645#(not (= product_working1 product_working0)), 99644#(not (= product_working1 product_begin0))] [2018-07-23 13:37:30,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,824 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:37:30,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:37:30,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:30,824 INFO L87 Difference]: Start difference. First operand 424 states and 709 transitions. Second operand 12 states. [2018-07-23 13:37:31,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:31,249 INFO L93 Difference]: Finished difference Result 505 states and 821 transitions. [2018-07-23 13:37:31,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 13:37:31,249 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-07-23 13:37:31,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:31,250 INFO L225 Difference]: With dead ends: 505 [2018-07-23 13:37:31,251 INFO L226 Difference]: Without dead ends: 504 [2018-07-23 13:37:31,251 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:37:31,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-07-23 13:37:31,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 453. [2018-07-23 13:37:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-07-23 13:37:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 755 transitions. [2018-07-23 13:37:31,513 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 755 transitions. Word has length 17 [2018-07-23 13:37:31,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:31,513 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 755 transitions. [2018-07-23 13:37:31,513 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:37:31,513 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 755 transitions. [2018-07-23 13:37:31,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:37:31,514 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:31,514 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:31,514 INFO L414 AbstractCegarLoop]: === Iteration 80 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:31,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1757610527, now seen corresponding path program 1 times [2018-07-23 13:37:31,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:31,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:31,530 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:31,530 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:37:31,530 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:31,530 INFO L185 omatonBuilderFactory]: Interpolants [101603#false, 101602#true, 101605#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 101604#(= product_end1 product_next), 101607#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 101606#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0)), 101609#(<= (+ product_working1 2) product_next), 101608#(<= (+ product_begin1 2) product_next), 101611#(not (= product_working1 product_next)), 101610#(and (or (= product_working1 product_end1) (= product_end1 product_next)) (or (not (= product_working1 product_end1)) (<= (+ product_working1 2) product_begin1))), 101613#(not (= product_working1 product_working0)), 101612#(not (= product_working1 product_begin0))] [2018-07-23 13:37:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:31,531 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:37:31,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:37:31,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:31,531 INFO L87 Difference]: Start difference. First operand 453 states and 755 transitions. Second operand 12 states. [2018-07-23 13:37:31,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:31,997 INFO L93 Difference]: Finished difference Result 516 states and 838 transitions. [2018-07-23 13:37:31,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 13:37:31,998 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-07-23 13:37:31,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:31,999 INFO L225 Difference]: With dead ends: 516 [2018-07-23 13:37:31,999 INFO L226 Difference]: Without dead ends: 515 [2018-07-23 13:37:31,999 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:37:32,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-07-23 13:37:32,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 449. [2018-07-23 13:37:32,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-07-23 13:37:32,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 748 transitions. [2018-07-23 13:37:32,246 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 748 transitions. Word has length 17 [2018-07-23 13:37:32,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:32,246 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 748 transitions. [2018-07-23 13:37:32,246 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:37:32,246 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 748 transitions. [2018-07-23 13:37:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:37:32,247 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:32,247 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:32,247 INFO L414 AbstractCegarLoop]: === Iteration 81 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:32,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1709007603, now seen corresponding path program 1 times [2018-07-23 13:37:32,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:32,266 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:32,266 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:37:32,266 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:32,267 INFO L185 omatonBuilderFactory]: Interpolants [103587#false, 103586#true, 103589#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 103588#(= product_end1 product_next), 103591#(<= (+ product_working1 1) product_next), 103590#(and (= product_end1 product_next) (<= (+ product_working1 1) product_end1)), 103593#(and (<= (+ product_working1 2) product_end0) (= product_end0 product_next)), 103592#(and (= product_end0 product_next) (<= (+ product_working1 1) product_begin0)), 103595#(and (or (= product_working1 product_end1) (= product_end1 product_next)) (or (not (= product_working1 product_end1)) (<= (+ product_working1 2) product_begin1))), 103594#(<= (+ product_working1 2) product_next), 103597#(not (= product_working1 product_begin0)), 103596#(not (= product_working1 product_next)), 103598#(not (= product_working1 product_working0))] [2018-07-23 13:37:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:32,267 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:37:32,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:37:32,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:37:32,267 INFO L87 Difference]: Start difference. First operand 449 states and 748 transitions. Second operand 13 states. [2018-07-23 13:37:32,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:32,680 INFO L93 Difference]: Finished difference Result 526 states and 863 transitions. [2018-07-23 13:37:32,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:37:32,680 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-07-23 13:37:32,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:32,681 INFO L225 Difference]: With dead ends: 526 [2018-07-23 13:37:32,681 INFO L226 Difference]: Without dead ends: 524 [2018-07-23 13:37:32,681 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:37:32,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-07-23 13:37:32,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 455. [2018-07-23 13:37:32,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-07-23 13:37:32,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 760 transitions. [2018-07-23 13:37:32,943 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 760 transitions. Word has length 17 [2018-07-23 13:37:32,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:32,943 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 760 transitions. [2018-07-23 13:37:32,943 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:37:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 760 transitions. [2018-07-23 13:37:32,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:37:32,944 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:32,944 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:32,944 INFO L414 AbstractCegarLoop]: === Iteration 82 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:32,944 INFO L82 PathProgramCache]: Analyzing trace with hash -840518133, now seen corresponding path program 2 times [2018-07-23 13:37:32,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:32,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:32,960 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:32,960 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:37:32,960 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:32,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:32,961 INFO L185 omatonBuilderFactory]: Interpolants [105601#(<= (+ product_working1 3) product_begin0), 105600#(<= (+ product_working1 3) product_next), 105602#(<= (+ product_working1 3) product_working0), 105591#true, 105593#(= product_end1 product_next), 105592#false, 105595#(and (= product_end1 product_next) (<= (+ product_working1 1) product_end1)), 105594#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 105597#(and (= product_end1 product_next) (<= (+ product_working1 1) product_begin1)), 105596#(<= (+ product_working1 1) product_next), 105599#(<= (+ product_working1 product_end0 2) (+ product_begin0 product_next)), 105598#(<= (+ product_working1 2) product_next)] [2018-07-23 13:37:32,961 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:32,961 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:37:32,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:37:32,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:32,962 INFO L87 Difference]: Start difference. First operand 455 states and 760 transitions. Second operand 12 states. [2018-07-23 13:37:33,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:33,290 INFO L93 Difference]: Finished difference Result 499 states and 825 transitions. [2018-07-23 13:37:33,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:37:33,290 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-07-23 13:37:33,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:33,291 INFO L225 Difference]: With dead ends: 499 [2018-07-23 13:37:33,291 INFO L226 Difference]: Without dead ends: 498 [2018-07-23 13:37:33,292 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:37:33,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-07-23 13:37:33,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 428. [2018-07-23 13:37:33,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-07-23 13:37:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 713 transitions. [2018-07-23 13:37:33,531 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 713 transitions. Word has length 17 [2018-07-23 13:37:33,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:33,531 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 713 transitions. [2018-07-23 13:37:33,531 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:37:33,531 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 713 transitions. [2018-07-23 13:37:33,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:33,532 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:33,532 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:33,532 INFO L414 AbstractCegarLoop]: === Iteration 83 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:33,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1270158156, now seen corresponding path program 1 times [2018-07-23 13:37:33,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:33,547 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:33,547 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:37:33,547 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:33,548 INFO L185 omatonBuilderFactory]: Interpolants [107475#true, 107477#(= product_end0 product_next), 107476#false, 107479#(and (<= (+ product_working0 1) product_begin0) (= product_end0 product_next)), 107478#(and (<= product_working0 product_begin0) (= product_end0 product_next)), 107481#(and (<= (+ product_working0 2) product_begin1) (= product_end1 product_next)), 107480#(<= (+ product_working0 2) product_next), 107483#(<= (+ product_working0 3) product_next), 107482#(and (= product_end1 product_next) (<= (+ product_working0 3) product_end1)), 107485#(<= (+ product_working0 4) product_begin1), 107484#(<= (+ product_working0 3) product_begin1), 107486#(<= (+ product_working0 4) product_working1)] [2018-07-23 13:37:33,548 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:33,548 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:37:33,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:37:33,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:33,549 INFO L87 Difference]: Start difference. First operand 428 states and 713 transitions. Second operand 12 states. [2018-07-23 13:37:33,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:33,884 INFO L93 Difference]: Finished difference Result 491 states and 812 transitions. [2018-07-23 13:37:33,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:33,884 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-23 13:37:33,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:33,885 INFO L225 Difference]: With dead ends: 491 [2018-07-23 13:37:33,885 INFO L226 Difference]: Without dead ends: 490 [2018-07-23 13:37:33,886 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:37:33,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-07-23 13:37:34,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 466. [2018-07-23 13:37:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-07-23 13:37:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 779 transitions. [2018-07-23 13:37:34,161 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 779 transitions. Word has length 18 [2018-07-23 13:37:34,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:34,161 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 779 transitions. [2018-07-23 13:37:34,162 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:37:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 779 transitions. [2018-07-23 13:37:34,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:34,162 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:34,162 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:34,162 INFO L414 AbstractCegarLoop]: === Iteration 84 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:34,163 INFO L82 PathProgramCache]: Analyzing trace with hash -301522250, now seen corresponding path program 1 times [2018-07-23 13:37:34,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:34,174 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:34,174 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:37:34,174 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:34,175 INFO L185 omatonBuilderFactory]: Interpolants [109425#(<= (+ product_working0 2) product_next), 109424#(and (<= (+ product_working0 2) product_end1) (= product_end1 product_next)), 109427#(<= (+ product_working0 3) product_begin1), 109426#(<= (+ product_working0 2) product_begin1), 109428#(<= (+ product_working0 3) product_working1), 109417#true, 109419#(= product_end0 product_next), 109418#false, 109421#(and (<= (+ product_working0 1) product_end0) (= product_end0 product_next)), 109420#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 109423#(and (<= (+ product_working0 1) product_begin1) (= product_end1 product_next)), 109422#(<= (+ product_working0 1) product_next)] [2018-07-23 13:37:34,175 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:34,175 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:37:34,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:37:34,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:34,175 INFO L87 Difference]: Start difference. First operand 466 states and 779 transitions. Second operand 12 states. [2018-07-23 13:37:34,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:34,693 INFO L93 Difference]: Finished difference Result 563 states and 925 transitions. [2018-07-23 13:37:34,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:37:34,694 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-23 13:37:34,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:34,695 INFO L225 Difference]: With dead ends: 563 [2018-07-23 13:37:34,696 INFO L226 Difference]: Without dead ends: 561 [2018-07-23 13:37:34,696 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:37:34,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-07-23 13:37:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 458. [2018-07-23 13:37:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-07-23 13:37:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 765 transitions. [2018-07-23 13:37:35,022 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 765 transitions. Word has length 18 [2018-07-23 13:37:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:35,022 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 765 transitions. [2018-07-23 13:37:35,022 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:37:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 765 transitions. [2018-07-23 13:37:35,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:35,023 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:35,023 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:35,023 INFO L414 AbstractCegarLoop]: === Iteration 85 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:35,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1503466215, now seen corresponding path program 1 times [2018-07-23 13:37:35,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:35,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:35,037 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:35,037 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:37:35,037 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:35,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:35,038 INFO L185 omatonBuilderFactory]: Interpolants [111505#(= product_end0 product_next), 111504#false, 111507#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 111506#(and (= product_end0 product_begin1) (= product_end1 product_next)), 111509#(<= (+ product_end0 1) product_next), 111508#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 111511#(not (= product_working0 product_next)), 111510#(<= (+ product_begin0 2) product_next), 111513#(not (= product_working0 product_working1)), 111512#(not (= product_working0 product_begin1)), 111503#true] [2018-07-23 13:37:35,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:35,038 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:37:35,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:37:35,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:35,038 INFO L87 Difference]: Start difference. First operand 458 states and 765 transitions. Second operand 11 states. [2018-07-23 13:37:35,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:35,498 INFO L93 Difference]: Finished difference Result 513 states and 833 transitions. [2018-07-23 13:37:35,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:37:35,498 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 13:37:35,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:35,499 INFO L225 Difference]: With dead ends: 513 [2018-07-23 13:37:35,499 INFO L226 Difference]: Without dead ends: 511 [2018-07-23 13:37:35,499 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:37:35,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-07-23 13:37:35,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 459. [2018-07-23 13:37:35,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-07-23 13:37:35,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 767 transitions. [2018-07-23 13:37:35,781 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 767 transitions. Word has length 18 [2018-07-23 13:37:35,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:35,781 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 767 transitions. [2018-07-23 13:37:35,781 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:37:35,781 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 767 transitions. [2018-07-23 13:37:35,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:35,782 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:35,782 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:35,782 INFO L414 AbstractCegarLoop]: === Iteration 86 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:35,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1224172812, now seen corresponding path program 2 times [2018-07-23 13:37:35,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:35,797 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:35,798 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:37:35,798 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:35,798 INFO L185 omatonBuilderFactory]: Interpolants [113505#(<= (+ product_working0 3) product_next), 113504#(<= (+ product_end0 product_working0 2) (+ product_begin0 product_next)), 113507#(<= (+ product_working0 4) product_begin1), 113506#(<= (+ product_working0 3) product_begin1), 113508#(<= (+ product_working0 4) product_working1), 113497#false, 113496#true, 113499#(and (= product_end0 product_begin1) (= product_end1 product_next)), 113498#(= product_end0 product_next), 113501#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 113500#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 113503#(<= (+ product_end0 product_working0 1) (+ product_begin0 product_next)), 113502#(<= (+ product_end0 1) product_next)] [2018-07-23 13:37:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:35,798 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:37:35,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:37:35,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:37:35,799 INFO L87 Difference]: Start difference. First operand 459 states and 767 transitions. Second operand 13 states. [2018-07-23 13:37:36,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:36,236 INFO L93 Difference]: Finished difference Result 507 states and 835 transitions. [2018-07-23 13:37:36,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:37:36,237 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-07-23 13:37:36,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:36,238 INFO L225 Difference]: With dead ends: 507 [2018-07-23 13:37:36,238 INFO L226 Difference]: Without dead ends: 506 [2018-07-23 13:37:36,238 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:37:36,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-07-23 13:37:36,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 466. [2018-07-23 13:37:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-07-23 13:37:36,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 780 transitions. [2018-07-23 13:37:36,520 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 780 transitions. Word has length 18 [2018-07-23 13:37:36,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:36,520 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 780 transitions. [2018-07-23 13:37:36,520 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:37:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 780 transitions. [2018-07-23 13:37:36,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:36,521 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:36,521 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:36,522 INFO L414 AbstractCegarLoop]: === Iteration 87 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:36,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1224172524, now seen corresponding path program 1 times [2018-07-23 13:37:36,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:36,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:36,535 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:36,535 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:37:36,535 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:36,535 INFO L185 omatonBuilderFactory]: Interpolants [115473#(= product_end0 product_next), 115472#false, 115475#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 115474#(and (= product_end0 product_begin1) (= product_end1 product_next)), 115477#(<= (+ product_end0 1) product_next), 115476#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 115479#(<= (+ product_begin0 2) product_begin1), 115478#(<= (+ product_begin0 2) product_next), 115481#(not (= product_working0 product_working1)), 115480#(<= (+ product_begin0 2) product_working1), 115471#true] [2018-07-23 13:37:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:36,536 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:37:36,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:37:36,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:36,536 INFO L87 Difference]: Start difference. First operand 466 states and 780 transitions. Second operand 11 states. [2018-07-23 13:37:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:36,958 INFO L93 Difference]: Finished difference Result 518 states and 845 transitions. [2018-07-23 13:37:36,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:37:36,958 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 13:37:36,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:36,959 INFO L225 Difference]: With dead ends: 518 [2018-07-23 13:37:36,960 INFO L226 Difference]: Without dead ends: 516 [2018-07-23 13:37:36,960 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:37:36,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-07-23 13:37:37,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 469. [2018-07-23 13:37:37,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-07-23 13:37:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 783 transitions. [2018-07-23 13:37:37,287 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 783 transitions. Word has length 18 [2018-07-23 13:37:37,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:37,288 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 783 transitions. [2018-07-23 13:37:37,288 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:37:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 783 transitions. [2018-07-23 13:37:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:37,288 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:37,289 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:37,289 INFO L414 AbstractCegarLoop]: === Iteration 88 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:37,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1215585637, now seen corresponding path program 1 times [2018-07-23 13:37:37,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:37,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:37,304 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:37,304 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:37:37,304 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:37,304 INFO L185 omatonBuilderFactory]: Interpolants [117489#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 117488#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 117491#(<= (+ product_begin0 2) product_next), 117490#(<= (+ product_end0 1) product_next), 117493#(not (= product_working0 product_begin1)), 117492#(<= (+ product_begin0 2) product_begin1), 117494#(not (= product_working0 product_working1)), 117485#false, 117484#true, 117487#(and (= product_end0 product_begin1) (= product_end1 product_next)), 117486#(= product_end0 product_next)] [2018-07-23 13:37:37,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:37,305 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:37:37,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:37:37,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:37,305 INFO L87 Difference]: Start difference. First operand 469 states and 783 transitions. Second operand 11 states. [2018-07-23 13:37:37,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:37,782 INFO L93 Difference]: Finished difference Result 531 states and 868 transitions. [2018-07-23 13:37:37,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:37:37,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 13:37:37,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:37,784 INFO L225 Difference]: With dead ends: 531 [2018-07-23 13:37:37,784 INFO L226 Difference]: Without dead ends: 529 [2018-07-23 13:37:37,784 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:37:37,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-07-23 13:37:38,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 470. [2018-07-23 13:37:38,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-07-23 13:37:38,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 785 transitions. [2018-07-23 13:37:38,053 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 785 transitions. Word has length 18 [2018-07-23 13:37:38,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:38,053 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 785 transitions. [2018-07-23 13:37:38,053 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:37:38,053 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 785 transitions. [2018-07-23 13:37:38,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:38,054 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:38,054 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:38,054 INFO L414 AbstractCegarLoop]: === Iteration 89 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:38,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1085218294, now seen corresponding path program 1 times [2018-07-23 13:37:38,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:38,067 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:38,067 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:37:38,067 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:38,068 INFO L185 omatonBuilderFactory]: Interpolants [119537#(<= (+ product_working0 2) product_next), 119536#(<= (+ product_begin0 2) product_next), 119539#(<= (+ product_working0 3) product_begin1), 119538#(<= (+ product_working0 2) product_begin1), 119540#(<= (+ product_working0 3) product_working1), 119529#true, 119531#(= product_end0 product_next), 119530#false, 119533#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0)), 119532#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 119535#(and (<= (+ product_begin0 2) product_end1) (= product_end1 product_next)), 119534#(and (= product_end0 product_begin1) (<= (+ product_begin0 product_begin1 2) (+ product_end0 product_end1)) (= product_end1 product_next))] [2018-07-23 13:37:38,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:38,068 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:37:38,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:37:38,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:38,068 INFO L87 Difference]: Start difference. First operand 470 states and 785 transitions. Second operand 12 states. [2018-07-23 13:37:38,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:38,525 INFO L93 Difference]: Finished difference Result 545 states and 895 transitions. [2018-07-23 13:37:38,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:37:38,526 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-23 13:37:38,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:38,527 INFO L225 Difference]: With dead ends: 545 [2018-07-23 13:37:38,527 INFO L226 Difference]: Without dead ends: 543 [2018-07-23 13:37:38,527 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:37:38,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-07-23 13:37:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 474. [2018-07-23 13:37:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-07-23 13:37:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 791 transitions. [2018-07-23 13:37:38,950 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 791 transitions. Word has length 18 [2018-07-23 13:37:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:38,950 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 791 transitions. [2018-07-23 13:37:38,950 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:37:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 791 transitions. [2018-07-23 13:37:38,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:38,951 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:38,951 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:38,951 INFO L414 AbstractCegarLoop]: === Iteration 90 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:38,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1467012, now seen corresponding path program 1 times [2018-07-23 13:37:38,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:38,961 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:38,961 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:38,961 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:37:38,961 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:38,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:38,961 INFO L185 omatonBuilderFactory]: Interpolants [121617#(not (= product_working0 product_working1)), 121616#(<= (+ product_begin0 2) product_working1), 121607#true, 121609#(= product_end0 product_next), 121608#false, 121611#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 121610#(and (= product_end0 product_begin1) (= product_end1 product_next)), 121613#(<= (+ product_end0 1) product_next), 121612#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 121615#(<= (+ product_end0 1) product_working1), 121614#(<= (+ product_end0 1) product_begin1)] [2018-07-23 13:37:38,961 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:38,962 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:37:38,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:37:38,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:38,962 INFO L87 Difference]: Start difference. First operand 474 states and 791 transitions. Second operand 11 states. [2018-07-23 13:37:39,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:39,478 INFO L93 Difference]: Finished difference Result 634 states and 1037 transitions. [2018-07-23 13:37:39,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:37:39,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 13:37:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:39,481 INFO L225 Difference]: With dead ends: 634 [2018-07-23 13:37:39,481 INFO L226 Difference]: Without dead ends: 632 [2018-07-23 13:37:39,481 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:37:39,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-07-23 13:37:39,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 493. [2018-07-23 13:37:39,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-07-23 13:37:39,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 822 transitions. [2018-07-23 13:37:39,991 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 822 transitions. Word has length 18 [2018-07-23 13:37:39,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:39,991 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 822 transitions. [2018-07-23 13:37:39,992 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:37:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 822 transitions. [2018-07-23 13:37:39,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:39,992 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:39,993 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:39,993 INFO L414 AbstractCegarLoop]: === Iteration 91 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:39,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1846437006, now seen corresponding path program 1 times [2018-07-23 13:37:39,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:40,010 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:40,011 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:40,011 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:37:40,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:40,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:40,013 INFO L185 omatonBuilderFactory]: Interpolants [123905#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 123904#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 123907#(<= (+ product_end0 1) product_begin1), 123906#(<= (+ product_end0 1) product_next), 123909#(<= (+ product_end0 product_working0 2) (+ product_begin0 product_begin1)), 123908#(<= (+ product_end0 product_working0 1) (+ product_begin0 product_begin1)), 123911#(<= (+ product_working0 4) product_begin1), 123910#(<= (+ product_working0 3) product_begin1), 123912#(<= (+ product_working0 4) product_working1), 123901#false, 123900#true, 123903#(and (= product_end0 product_begin1) (= product_end1 product_next)), 123902#(= product_end0 product_next)] [2018-07-23 13:37:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:40,014 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:37:40,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:37:40,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:37:40,014 INFO L87 Difference]: Start difference. First operand 493 states and 822 transitions. Second operand 13 states. [2018-07-23 13:37:40,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:40,573 INFO L93 Difference]: Finished difference Result 574 states and 939 transitions. [2018-07-23 13:37:40,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:37:40,573 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-07-23 13:37:40,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:40,575 INFO L225 Difference]: With dead ends: 574 [2018-07-23 13:37:40,575 INFO L226 Difference]: Without dead ends: 573 [2018-07-23 13:37:40,575 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:37:40,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-07-23 13:37:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 491. [2018-07-23 13:37:40,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-07-23 13:37:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 817 transitions. [2018-07-23 13:37:40,867 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 817 transitions. Word has length 18 [2018-07-23 13:37:40,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:40,867 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 817 transitions. [2018-07-23 13:37:40,867 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:37:40,867 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 817 transitions. [2018-07-23 13:37:40,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:40,867 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:40,868 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:40,868 INFO L414 AbstractCegarLoop]: === Iteration 92 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:40,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1846436718, now seen corresponding path program 2 times [2018-07-23 13:37:40,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:40,881 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:40,881 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:37:40,881 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:40,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:40,882 INFO L185 omatonBuilderFactory]: Interpolants [126067#true, 126069#(= product_end0 product_next), 126068#false, 126071#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 126070#(and (= product_end0 product_begin1) (= product_end1 product_next)), 126073#(<= (+ product_end0 1) product_next), 126072#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 126075#(<= (+ product_begin0 2) product_begin1), 126074#(<= (+ product_end0 1) product_begin1), 126077#(not (= product_working0 product_working1)), 126076#(<= (+ product_begin0 2) product_working1)] [2018-07-23 13:37:40,882 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:40,882 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:37:40,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:37:40,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:40,882 INFO L87 Difference]: Start difference. First operand 491 states and 817 transitions. Second operand 11 states. [2018-07-23 13:37:41,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:41,348 INFO L93 Difference]: Finished difference Result 557 states and 901 transitions. [2018-07-23 13:37:41,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:37:41,348 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 13:37:41,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:41,349 INFO L225 Difference]: With dead ends: 557 [2018-07-23 13:37:41,349 INFO L226 Difference]: Without dead ends: 555 [2018-07-23 13:37:41,350 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:37:41,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-07-23 13:37:41,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 477. [2018-07-23 13:37:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-07-23 13:37:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 791 transitions. [2018-07-23 13:37:41,638 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 791 transitions. Word has length 18 [2018-07-23 13:37:41,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:41,638 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 791 transitions. [2018-07-23 13:37:41,639 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:37:41,639 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 791 transitions. [2018-07-23 13:37:41,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:41,639 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:41,639 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:41,639 INFO L414 AbstractCegarLoop]: === Iteration 93 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:41,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1837849831, now seen corresponding path program 1 times [2018-07-23 13:37:41,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:41,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:41,653 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:41,653 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:37:41,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:41,653 INFO L185 omatonBuilderFactory]: Interpolants [128179#false, 128178#true, 128181#(and (= product_end0 product_begin1) (= product_end1 product_next)), 128180#(= product_end0 product_next), 128183#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 128182#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 128185#(<= (+ product_end0 1) product_begin1), 128184#(<= (+ product_end0 1) product_next), 128187#(not (= product_working0 product_begin1)), 128186#(<= (+ product_begin0 2) product_begin1), 128188#(not (= product_working0 product_working1))] [2018-07-23 13:37:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:41,654 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:37:41,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:37:41,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:41,654 INFO L87 Difference]: Start difference. First operand 477 states and 791 transitions. Second operand 11 states. [2018-07-23 13:37:42,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:42,166 INFO L93 Difference]: Finished difference Result 557 states and 903 transitions. [2018-07-23 13:37:42,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:37:42,166 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 13:37:42,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:42,167 INFO L225 Difference]: With dead ends: 557 [2018-07-23 13:37:42,167 INFO L226 Difference]: Without dead ends: 555 [2018-07-23 13:37:42,168 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:37:42,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-07-23 13:37:42,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 467. [2018-07-23 13:37:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-07-23 13:37:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 775 transitions. [2018-07-23 13:37:42,680 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 775 transitions. Word has length 18 [2018-07-23 13:37:42,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:42,680 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 775 transitions. [2018-07-23 13:37:42,680 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:37:42,680 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 775 transitions. [2018-07-23 13:37:42,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:42,681 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:42,681 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:42,681 INFO L414 AbstractCegarLoop]: === Iteration 94 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:42,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1884609208, now seen corresponding path program 1 times [2018-07-23 13:37:42,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:42,699 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:42,699 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:37:42,700 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:42,700 INFO L185 omatonBuilderFactory]: Interpolants [130273#(= product_end0 product_next), 130272#false, 130275#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0)), 130274#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 130277#(and (<= (+ product_begin0 2) product_end1) (= product_end1 product_next)), 130276#(and (= product_end0 product_begin1) (<= (+ product_begin0 product_begin1 2) (+ product_end0 product_end1)) (= product_end1 product_next)), 130279#(<= (+ product_begin0 2) product_begin1), 130278#(<= (+ product_begin0 2) product_next), 130281#(<= (+ product_working0 3) product_begin1), 130280#(<= (+ product_working0 2) product_begin1), 130282#(<= (+ product_working0 3) product_working1), 130271#true] [2018-07-23 13:37:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:42,700 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:37:42,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:37:42,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:42,701 INFO L87 Difference]: Start difference. First operand 467 states and 775 transitions. Second operand 12 states. [2018-07-23 13:37:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:43,340 INFO L93 Difference]: Finished difference Result 594 states and 971 transitions. [2018-07-23 13:37:43,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:37:43,340 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-23 13:37:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:43,341 INFO L225 Difference]: With dead ends: 594 [2018-07-23 13:37:43,341 INFO L226 Difference]: Without dead ends: 592 [2018-07-23 13:37:43,341 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:37:43,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-07-23 13:37:43,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 469. [2018-07-23 13:37:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-07-23 13:37:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 778 transitions. [2018-07-23 13:37:43,631 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 778 transitions. Word has length 18 [2018-07-23 13:37:43,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:43,631 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 778 transitions. [2018-07-23 13:37:43,631 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:37:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 778 transitions. [2018-07-23 13:37:43,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:43,632 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:43,632 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:43,632 INFO L414 AbstractCegarLoop]: === Iteration 95 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:43,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1136854538, now seen corresponding path program 1 times [2018-07-23 13:37:43,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:43,642 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:43,642 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:43,642 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:43,642 INFO L185 omatonBuilderFactory]: Interpolants [132448#(<= (+ product_working1 2) product_working0), 132439#true, 132442#(and (<= product_end0 product_next) (= product_end1 product_begin0)), 132443#(and (<= (+ product_begin0 1) product_next) (= product_end1 product_begin0)), 132440#false, 132441#(= product_end1 product_next), 132446#(<= (+ product_working1 2) product_next), 132447#(<= (+ product_working1 2) product_begin0), 132444#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 132445#(and (<= (+ product_begin0 product_working1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))] [2018-07-23 13:37:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:43,642 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:43,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:43,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:43,643 INFO L87 Difference]: Start difference. First operand 469 states and 778 transitions. Second operand 10 states. [2018-07-23 13:37:44,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:44,098 INFO L93 Difference]: Finished difference Result 531 states and 864 transitions. [2018-07-23 13:37:44,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:37:44,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 13:37:44,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:44,099 INFO L225 Difference]: With dead ends: 531 [2018-07-23 13:37:44,099 INFO L226 Difference]: Without dead ends: 529 [2018-07-23 13:37:44,100 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:37:44,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-07-23 13:37:44,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 473. [2018-07-23 13:37:44,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-07-23 13:37:44,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 785 transitions. [2018-07-23 13:37:44,533 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 785 transitions. Word has length 18 [2018-07-23 13:37:44,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:44,533 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 785 transitions. [2018-07-23 13:37:44,533 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:44,533 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 785 transitions. [2018-07-23 13:37:44,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:44,534 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:44,534 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:44,534 INFO L414 AbstractCegarLoop]: === Iteration 96 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:44,534 INFO L82 PathProgramCache]: Analyzing trace with hash 589748198, now seen corresponding path program 1 times [2018-07-23 13:37:44,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:44,548 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:44,548 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:44,548 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:44,549 INFO L185 omatonBuilderFactory]: Interpolants [134482#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 134483#(<= (+ product_begin1 2) product_next), 134480#(and (<= product_end0 product_next) (= product_end1 product_begin0)), 134481#(and (<= (+ product_begin0 1) product_next) (= product_end1 product_begin0)), 134486#(<= (+ product_working1 2) product_working0), 134484#(<= (+ product_begin1 2) product_begin0), 134485#(<= (+ product_working1 2) product_begin0), 134478#false, 134479#(= product_end1 product_next), 134477#true] [2018-07-23 13:37:44,549 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:44,549 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:44,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:44,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:44,549 INFO L87 Difference]: Start difference. First operand 473 states and 785 transitions. Second operand 10 states. [2018-07-23 13:37:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:45,021 INFO L93 Difference]: Finished difference Result 578 states and 943 transitions. [2018-07-23 13:37:45,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:37:45,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 13:37:45,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:45,023 INFO L225 Difference]: With dead ends: 578 [2018-07-23 13:37:45,023 INFO L226 Difference]: Without dead ends: 576 [2018-07-23 13:37:45,023 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:45,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-07-23 13:37:45,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 496. [2018-07-23 13:37:45,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-07-23 13:37:45,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 824 transitions. [2018-07-23 13:37:45,383 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 824 transitions. Word has length 18 [2018-07-23 13:37:45,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:45,383 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 824 transitions. [2018-07-23 13:37:45,383 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:45,384 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 824 transitions. [2018-07-23 13:37:45,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:45,385 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:45,385 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:45,385 INFO L414 AbstractCegarLoop]: === Iteration 97 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:45,385 INFO L82 PathProgramCache]: Analyzing trace with hash 581159259, now seen corresponding path program 1 times [2018-07-23 13:37:45,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:45,394 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:45,394 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:45,395 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:45,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:45,395 INFO L185 omatonBuilderFactory]: Interpolants [136658#(<= (+ product_begin1 2) product_next), 136659#(<= (+ product_begin1 2) product_begin0), 136656#(and (<= product_end0 product_next) (= product_end1 product_begin0)), 136657#(and (<= (+ product_begin0 1) product_next) (= product_end1 product_begin0)), 136660#(<= (+ product_begin1 2) product_working0), 136661#(<= (+ product_working1 2) product_working0), 136654#false, 136655#(= product_end1 product_next), 136653#true] [2018-07-23 13:37:45,395 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:45,395 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:45,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:45,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:45,396 INFO L87 Difference]: Start difference. First operand 496 states and 824 transitions. Second operand 9 states. [2018-07-23 13:37:45,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:45,842 INFO L93 Difference]: Finished difference Result 551 states and 898 transitions. [2018-07-23 13:37:45,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:37:45,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-07-23 13:37:45,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:45,843 INFO L225 Difference]: With dead ends: 551 [2018-07-23 13:37:45,843 INFO L226 Difference]: Without dead ends: 549 [2018-07-23 13:37:45,843 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:45,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-07-23 13:37:46,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 500. [2018-07-23 13:37:46,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-07-23 13:37:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 828 transitions. [2018-07-23 13:37:46,288 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 828 transitions. Word has length 18 [2018-07-23 13:37:46,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:46,288 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 828 transitions. [2018-07-23 13:37:46,288 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:46,288 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 828 transitions. [2018-07-23 13:37:46,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:46,289 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:46,289 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:46,289 INFO L414 AbstractCegarLoop]: === Iteration 98 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:46,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1629830792, now seen corresponding path program 1 times [2018-07-23 13:37:46,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:46,301 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:46,301 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:46,301 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:46,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:46,302 INFO L185 omatonBuilderFactory]: Interpolants [138786#(<= (+ product_begin1 2) product_next), 138787#(<= (+ product_working1 2) product_next), 138784#(and (<= (+ product_begin0 1) product_next) (= product_end1 product_begin0)), 138785#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 138788#(<= (+ product_working1 2) product_begin0), 138789#(<= (+ product_working1 2) product_working0), 138782#(= product_end1 product_next), 138783#(and (<= product_end0 product_next) (= product_end1 product_begin0)), 138780#true, 138781#false] [2018-07-23 13:37:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:46,302 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:46,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:46,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:46,302 INFO L87 Difference]: Start difference. First operand 500 states and 828 transitions. Second operand 10 states. [2018-07-23 13:37:46,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:46,769 INFO L93 Difference]: Finished difference Result 581 states and 944 transitions. [2018-07-23 13:37:46,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:37:46,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 13:37:46,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:46,770 INFO L225 Difference]: With dead ends: 581 [2018-07-23 13:37:46,771 INFO L226 Difference]: Without dead ends: 579 [2018-07-23 13:37:46,771 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:37:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-07-23 13:37:47,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 504. [2018-07-23 13:37:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-07-23 13:37:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 834 transitions. [2018-07-23 13:37:47,089 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 834 transitions. Word has length 18 [2018-07-23 13:37:47,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:47,090 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 834 transitions. [2018-07-23 13:37:47,090 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 834 transitions. [2018-07-23 13:37:47,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:47,090 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:47,090 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:47,090 INFO L414 AbstractCegarLoop]: === Iteration 99 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:47,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1655320734, now seen corresponding path program 2 times [2018-07-23 13:37:47,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:47,098 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:47,098 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:47,098 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:47,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:47,099 INFO L185 omatonBuilderFactory]: Interpolants [140982#true, 140983#false, 140986#(and (<= (+ product_begin0 1) product_next) (= product_end1 product_begin0)), 140987#(<= (+ product_end1 1) product_next), 140984#(= product_end1 product_next), 140985#(and (<= product_end0 product_next) (= product_end1 product_begin0)), 140990#(<= (+ product_working1 2) product_begin0), 140991#(<= (+ product_working1 2) product_working0), 140988#(<= (+ product_end1 1) product_begin0), 140989#(<= (+ product_begin1 2) product_begin0)] [2018-07-23 13:37:47,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:47,099 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:47,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:47,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:47,099 INFO L87 Difference]: Start difference. First operand 504 states and 834 transitions. Second operand 10 states. [2018-07-23 13:37:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:47,654 INFO L93 Difference]: Finished difference Result 630 states and 1024 transitions. [2018-07-23 13:37:47,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:37:47,654 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 13:37:47,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:47,655 INFO L225 Difference]: With dead ends: 630 [2018-07-23 13:37:47,655 INFO L226 Difference]: Without dead ends: 628 [2018-07-23 13:37:47,656 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:37:47,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-07-23 13:37:47,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 509. [2018-07-23 13:37:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-07-23 13:37:47,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 843 transitions. [2018-07-23 13:37:47,984 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 843 transitions. Word has length 18 [2018-07-23 13:37:47,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:47,984 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 843 transitions. [2018-07-23 13:37:47,984 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:47,985 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 843 transitions. [2018-07-23 13:37:47,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:47,985 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:47,985 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:47,985 INFO L414 AbstractCegarLoop]: === Iteration 100 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:47,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1646731795, now seen corresponding path program 2 times [2018-07-23 13:37:47,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:47,994 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:47,995 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:47,995 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:47,995 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:47,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:47,995 INFO L185 omatonBuilderFactory]: Interpolants [143314#(<= (+ product_begin1 2) product_working0), 143315#(<= (+ product_working1 2) product_working0), 143312#(<= (+ product_end1 1) product_begin0), 143313#(<= (+ product_begin1 2) product_begin0), 143306#true, 143307#false, 143310#(and (<= (+ product_begin0 1) product_next) (= product_end1 product_begin0)), 143311#(<= (+ product_end1 1) product_next), 143308#(= product_end1 product_next), 143309#(and (<= product_end0 product_next) (= product_end1 product_begin0))] [2018-07-23 13:37:47,995 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:47,995 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:47,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:47,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:47,996 INFO L87 Difference]: Start difference. First operand 509 states and 843 transitions. Second operand 10 states. [2018-07-23 13:37:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:48,563 INFO L93 Difference]: Finished difference Result 620 states and 1007 transitions. [2018-07-23 13:37:48,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 13:37:48,564 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 13:37:48,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:48,564 INFO L225 Difference]: With dead ends: 620 [2018-07-23 13:37:48,564 INFO L226 Difference]: Without dead ends: 618 [2018-07-23 13:37:48,565 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:37:48,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-07-23 13:37:48,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 510. [2018-07-23 13:37:48,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-07-23 13:37:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 845 transitions. [2018-07-23 13:37:48,892 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 845 transitions. Word has length 18 [2018-07-23 13:37:48,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:48,892 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 845 transitions. [2018-07-23 13:37:48,892 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:48,892 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 845 transitions. [2018-07-23 13:37:48,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:48,893 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:48,893 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:48,893 INFO L414 AbstractCegarLoop]: === Iteration 101 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:48,893 INFO L82 PathProgramCache]: Analyzing trace with hash -800331771, now seen corresponding path program 3 times [2018-07-23 13:37:48,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:48,907 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:48,907 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:48,907 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:48,907 INFO L185 omatonBuilderFactory]: Interpolants [145618#(<= (+ product_end1 1) product_begin0), 145619#(<= (+ product_end1 1) product_working0), 145616#(and (<= (+ product_begin0 1) product_next) (= product_end1 product_begin0)), 145617#(<= (+ product_end1 1) product_next), 145620#(<= (+ product_begin1 2) product_working0), 145621#(<= (+ product_working1 2) product_working0), 145614#(= product_end1 product_next), 145615#(and (<= product_end0 product_next) (= product_end1 product_begin0)), 145612#true, 145613#false] [2018-07-23 13:37:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:48,908 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:48,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:48,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:48,908 INFO L87 Difference]: Start difference. First operand 510 states and 845 transitions. Second operand 10 states. [2018-07-23 13:37:49,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:49,669 INFO L93 Difference]: Finished difference Result 703 states and 1148 transitions. [2018-07-23 13:37:49,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:37:49,669 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 13:37:49,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:49,670 INFO L225 Difference]: With dead ends: 703 [2018-07-23 13:37:49,670 INFO L226 Difference]: Without dead ends: 701 [2018-07-23 13:37:49,670 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:37:49,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-07-23 13:37:50,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 530. [2018-07-23 13:37:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-07-23 13:37:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 879 transitions. [2018-07-23 13:37:50,020 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 879 transitions. Word has length 18 [2018-07-23 13:37:50,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:50,020 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 879 transitions. [2018-07-23 13:37:50,020 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 879 transitions. [2018-07-23 13:37:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:50,021 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:50,021 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:50,021 INFO L414 AbstractCegarLoop]: === Iteration 102 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:50,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1149501708, now seen corresponding path program 1 times [2018-07-23 13:37:50,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:50,032 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:50,032 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:50,032 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:50,033 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:50,033 INFO L185 omatonBuilderFactory]: Interpolants [148128#(<= (+ product_working1 2) product_begin0), 148129#(<= (+ product_working1 2) product_working0), 148122#(= product_end1 product_next), 148123#(and (<= product_end0 product_next) (= product_end1 product_begin0)), 148120#true, 148121#false, 148126#(<= (+ product_begin1 2) product_next), 148127#(<= (+ product_begin1 2) product_begin0), 148124#(and (<= (+ product_begin0 1) product_next) (= product_end1 product_begin0)), 148125#(<= (+ product_end1 1) product_next)] [2018-07-23 13:37:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:50,033 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:50,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:50,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:50,034 INFO L87 Difference]: Start difference. First operand 530 states and 879 transitions. Second operand 10 states. [2018-07-23 13:37:50,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:50,588 INFO L93 Difference]: Finished difference Result 642 states and 1045 transitions. [2018-07-23 13:37:50,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:37:50,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 13:37:50,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:50,589 INFO L225 Difference]: With dead ends: 642 [2018-07-23 13:37:50,589 INFO L226 Difference]: Without dead ends: 640 [2018-07-23 13:37:50,589 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:37:50,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-07-23 13:37:50,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 524. [2018-07-23 13:37:50,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-07-23 13:37:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 869 transitions. [2018-07-23 13:37:50,931 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 869 transitions. Word has length 18 [2018-07-23 13:37:50,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:50,931 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 869 transitions. [2018-07-23 13:37:50,931 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 869 transitions. [2018-07-23 13:37:50,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:50,932 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:50,932 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:50,932 INFO L414 AbstractCegarLoop]: === Iteration 103 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:50,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1140912769, now seen corresponding path program 1 times [2018-07-23 13:37:50,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:50,944 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:50,944 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:50,944 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:50,944 INFO L185 omatonBuilderFactory]: Interpolants [150482#true, 150483#false, 150486#(and (<= (+ product_begin0 1) product_next) (= product_end1 product_begin0)), 150487#(<= (+ product_end1 1) product_next), 150484#(= product_end1 product_next), 150485#(and (<= product_end0 product_next) (= product_end1 product_begin0)), 150490#(<= (+ product_begin1 2) product_working0), 150491#(<= (+ product_working1 2) product_working0), 150488#(<= (+ product_begin1 2) product_next), 150489#(<= (+ product_begin1 2) product_begin0)] [2018-07-23 13:37:50,945 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:50,945 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:50,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:50,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:50,945 INFO L87 Difference]: Start difference. First operand 524 states and 869 transitions. Second operand 10 states. [2018-07-23 13:37:51,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:51,437 INFO L93 Difference]: Finished difference Result 591 states and 958 transitions. [2018-07-23 13:37:51,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:37:51,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 13:37:51,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:51,438 INFO L225 Difference]: With dead ends: 591 [2018-07-23 13:37:51,438 INFO L226 Difference]: Without dead ends: 589 [2018-07-23 13:37:51,439 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:51,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-07-23 13:37:51,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 502. [2018-07-23 13:37:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-07-23 13:37:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 831 transitions. [2018-07-23 13:37:51,785 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 831 transitions. Word has length 18 [2018-07-23 13:37:51,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:51,785 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 831 transitions. [2018-07-23 13:37:51,785 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:51,785 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 831 transitions. [2018-07-23 13:37:51,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:51,786 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:51,786 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:51,786 INFO L414 AbstractCegarLoop]: === Iteration 104 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:51,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1070077282, now seen corresponding path program 1 times [2018-07-23 13:37:51,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:51,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:51,795 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:51,795 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:51,795 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:51,796 INFO L185 omatonBuilderFactory]: Interpolants [152704#(<= (+ product_working1 2) product_begin0), 152705#(<= (+ product_working1 2) product_working0), 152698#(= product_end1 product_next), 152699#(and (<= product_end0 product_next) (= product_end1 product_begin0)), 152696#true, 152697#false, 152702#(<= (+ product_begin1 2) product_next), 152703#(<= (+ product_working1 2) product_next), 152700#(and (<= (+ product_begin0 1) product_next) (= product_end1 product_begin0)), 152701#(<= (+ product_end1 1) product_next)] [2018-07-23 13:37:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:51,796 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:51,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:51,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:51,797 INFO L87 Difference]: Start difference. First operand 502 states and 831 transitions. Second operand 10 states. [2018-07-23 13:37:52,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:52,331 INFO L93 Difference]: Finished difference Result 576 states and 935 transitions. [2018-07-23 13:37:52,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:37:52,331 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 13:37:52,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:52,332 INFO L225 Difference]: With dead ends: 576 [2018-07-23 13:37:52,332 INFO L226 Difference]: Without dead ends: 574 [2018-07-23 13:37:52,332 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:37:52,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-07-23 13:37:52,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 490. [2018-07-23 13:37:52,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-07-23 13:37:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 811 transitions. [2018-07-23 13:37:52,667 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 811 transitions. Word has length 18 [2018-07-23 13:37:52,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:52,667 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 811 transitions. [2018-07-23 13:37:52,667 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:52,667 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 811 transitions. [2018-07-23 13:37:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:37:52,667 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:52,667 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:52,668 INFO L414 AbstractCegarLoop]: === Iteration 105 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:52,668 INFO L82 PathProgramCache]: Analyzing trace with hash -850531879, now seen corresponding path program 3 times [2018-07-23 13:37:52,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:52,683 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:52,683 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:37:52,683 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:52,683 INFO L185 omatonBuilderFactory]: Interpolants [154866#(= product_end0 product_next), 154867#(and (<= product_working0 product_begin0) (= product_end0 product_next)), 154864#true, 154865#false, 154870#(and (<= (+ product_working0 2) product_begin1) (= product_end1 product_next)), 154871#(and (= product_end1 product_next) (<= (+ product_working0 3) product_end1)), 154868#(and (<= (+ product_working0 1) product_begin0) (= product_end0 product_next)), 154869#(<= (+ product_working0 2) product_next), 154874#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 154875#(not (= product_working0 product_next)), 154872#(<= (+ product_working0 3) product_next), 154873#(and (or (= product_working0 product_end1) (= product_end1 product_next)) (or (not (= product_working0 product_end1)) (<= (+ product_working0 3) product_begin1))), 154876#(not (= product_working0 product_begin1)), 154877#(not (= product_working0 product_working1))] [2018-07-23 13:37:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:52,683 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:37:52,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:37:52,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:52,684 INFO L87 Difference]: Start difference. First operand 490 states and 811 transitions. Second operand 14 states. [2018-07-23 13:37:53,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:53,117 INFO L93 Difference]: Finished difference Result 502 states and 819 transitions. [2018-07-23 13:37:53,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:37:53,117 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-23 13:37:53,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:53,118 INFO L225 Difference]: With dead ends: 502 [2018-07-23 13:37:53,118 INFO L226 Difference]: Without dead ends: 501 [2018-07-23 13:37:53,119 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:37:53,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-07-23 13:37:53,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 454. [2018-07-23 13:37:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-07-23 13:37:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 750 transitions. [2018-07-23 13:37:53,486 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 750 transitions. Word has length 20 [2018-07-23 13:37:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:53,486 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 750 transitions. [2018-07-23 13:37:53,486 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:37:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 750 transitions. [2018-07-23 13:37:53,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:37:53,487 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:53,487 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:53,487 INFO L414 AbstractCegarLoop]: === Iteration 106 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:53,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1707385863, now seen corresponding path program 1 times [2018-07-23 13:37:53,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:53,498 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:53,499 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:53,499 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:37:53,499 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:53,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:53,499 INFO L185 omatonBuilderFactory]: Interpolants [156810#true, 156811#false, 156814#(and (<= (+ product_working0 1) product_end0) (= product_end0 product_next)), 156815#(<= (+ product_working0 1) product_next), 156812#(= product_end0 product_next), 156813#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 156818#(and (<= (+ product_working0 2) product_begin1) (= product_end1 product_next)), 156819#(and (= product_end1 product_next) (<= (+ product_working0 3) product_end1)), 156816#(and (<= (+ product_working0 1) product_begin0) (= product_end0 product_next)), 156817#(<= (+ product_working0 2) product_next), 156822#(<= (+ product_working0 4) product_begin1), 156823#(<= (+ product_working0 4) product_working1), 156820#(<= (+ product_working0 3) product_next), 156821#(<= (+ product_working0 3) product_begin1)] [2018-07-23 13:37:53,499 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:53,499 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:37:53,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:37:53,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:53,500 INFO L87 Difference]: Start difference. First operand 454 states and 750 transitions. Second operand 14 states. [2018-07-23 13:37:53,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:53,993 INFO L93 Difference]: Finished difference Result 549 states and 901 transitions. [2018-07-23 13:37:53,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:37:53,993 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-23 13:37:53,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:53,994 INFO L225 Difference]: With dead ends: 549 [2018-07-23 13:37:53,994 INFO L226 Difference]: Without dead ends: 548 [2018-07-23 13:37:53,994 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:37:53,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-07-23 13:37:54,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 465. [2018-07-23 13:37:54,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-07-23 13:37:54,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 769 transitions. [2018-07-23 13:37:54,324 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 769 transitions. Word has length 20 [2018-07-23 13:37:54,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:54,324 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 769 transitions. [2018-07-23 13:37:54,324 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:37:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 769 transitions. [2018-07-23 13:37:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:37:54,325 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:54,325 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:54,325 INFO L414 AbstractCegarLoop]: === Iteration 107 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:54,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1999268581, now seen corresponding path program 2 times [2018-07-23 13:37:54,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:54,345 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:54,345 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:54,345 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:37:54,345 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:54,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:54,346 INFO L185 omatonBuilderFactory]: Interpolants [158882#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 158883#(not (= product_working0 product_next)), 158880#(<= (+ product_working0 2) product_next), 158881#(and (or (= product_working0 product_end1) (= product_end1 product_next)) (or (not (= product_working0 product_end1)) (<= (+ product_working0 2) product_begin1))), 158884#(not (= product_working0 product_begin1)), 158885#(not (= product_working0 product_working1)), 158874#(= product_end0 product_next), 158875#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 158872#true, 158873#false, 158878#(and (<= (+ product_working0 1) product_begin1) (= product_end1 product_next)), 158879#(and (<= (+ product_working0 2) product_end1) (= product_end1 product_next)), 158876#(and (<= (+ product_working0 1) product_end0) (= product_end0 product_next)), 158877#(<= (+ product_working0 1) product_next)] [2018-07-23 13:37:54,346 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:54,346 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:37:54,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:37:54,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:54,346 INFO L87 Difference]: Start difference. First operand 465 states and 769 transitions. Second operand 14 states. [2018-07-23 13:37:54,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:54,801 INFO L93 Difference]: Finished difference Result 510 states and 832 transitions. [2018-07-23 13:37:54,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:37:54,801 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-23 13:37:54,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:54,802 INFO L225 Difference]: With dead ends: 510 [2018-07-23 13:37:54,802 INFO L226 Difference]: Without dead ends: 508 [2018-07-23 13:37:54,802 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:37:54,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-07-23 13:37:55,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 449. [2018-07-23 13:37:55,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-07-23 13:37:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 743 transitions. [2018-07-23 13:37:55,125 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 743 transitions. Word has length 20 [2018-07-23 13:37:55,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:55,125 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 743 transitions. [2018-07-23 13:37:55,125 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:37:55,125 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 743 transitions. [2018-07-23 13:37:55,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:37:55,125 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:55,125 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:55,126 INFO L414 AbstractCegarLoop]: === Iteration 108 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:55,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1514664426, now seen corresponding path program 1 times [2018-07-23 13:37:55,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:55,140 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:55,140 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:37:55,140 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:55,140 INFO L185 omatonBuilderFactory]: Interpolants [160834#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 160835#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 160832#(= product_end0 product_next), 160833#(and (= product_end0 product_begin1) (= product_end1 product_next)), 160838#(<= (+ product_working0 2) product_next), 160839#(and (or (<= (+ product_working0 2) product_begin0) (not (= product_working0 product_end0))) (or (= product_working0 product_end0) (= product_end0 product_next))), 160836#(<= (+ product_end0 1) product_next), 160837#(<= (+ product_begin0 2) product_next), 160842#(not (= product_working0 product_working1)), 160840#(not (= product_working0 product_next)), 160841#(not (= product_working0 product_begin1)), 160830#true, 160831#false] [2018-07-23 13:37:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:55,141 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:37:55,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:37:55,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:37:55,141 INFO L87 Difference]: Start difference. First operand 449 states and 743 transitions. Second operand 13 states. [2018-07-23 13:37:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:55,733 INFO L93 Difference]: Finished difference Result 529 states and 854 transitions. [2018-07-23 13:37:55,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-23 13:37:55,733 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-23 13:37:55,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:55,734 INFO L225 Difference]: With dead ends: 529 [2018-07-23 13:37:55,734 INFO L226 Difference]: Without dead ends: 528 [2018-07-23 13:37:55,735 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=297, Invalid=1343, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 13:37:55,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-07-23 13:37:56,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 445. [2018-07-23 13:37:56,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-07-23 13:37:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 737 transitions. [2018-07-23 13:37:56,063 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 737 transitions. Word has length 20 [2018-07-23 13:37:56,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:56,063 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 737 transitions. [2018-07-23 13:37:56,063 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:37:56,063 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 737 transitions. [2018-07-23 13:37:56,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:37:56,063 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:56,064 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:56,064 INFO L414 AbstractCegarLoop]: === Iteration 109 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:56,064 INFO L82 PathProgramCache]: Analyzing trace with hash -390222799, now seen corresponding path program 4 times [2018-07-23 13:37:56,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:56,080 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:56,080 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:56,081 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:37:56,081 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:56,081 INFO L185 omatonBuilderFactory]: Interpolants [162850#(and (= product_end0 product_begin1) (= product_end1 product_next)), 162851#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 162848#false, 162849#(= product_end0 product_next), 162854#(<= (+ product_end0 product_working0 1) (+ product_begin0 product_next)), 162855#(<= (+ product_end0 product_working0 2) (+ product_begin0 product_next)), 162852#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 162853#(<= (+ product_end0 1) product_next), 162858#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 162859#(not (= product_working0 product_next)), 162856#(<= (+ product_working0 3) product_next), 162857#(and (or (= product_working0 product_end1) (= product_end1 product_next)) (or (not (= product_working0 product_end1)) (<= (+ product_working0 3) product_begin1))), 162860#(not (= product_working0 product_begin1)), 162861#(not (= product_working0 product_working1)), 162847#true] [2018-07-23 13:37:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:56,081 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:37:56,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:37:56,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:56,082 INFO L87 Difference]: Start difference. First operand 445 states and 737 transitions. Second operand 15 states. [2018-07-23 13:37:56,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:56,699 INFO L93 Difference]: Finished difference Result 502 states and 814 transitions. [2018-07-23 13:37:56,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 13:37:56,699 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2018-07-23 13:37:56,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:56,700 INFO L225 Difference]: With dead ends: 502 [2018-07-23 13:37:56,700 INFO L226 Difference]: Without dead ends: 501 [2018-07-23 13:37:56,701 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 13:37:56,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-07-23 13:37:57,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 459. [2018-07-23 13:37:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-07-23 13:37:57,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 759 transitions. [2018-07-23 13:37:57,042 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 759 transitions. Word has length 20 [2018-07-23 13:37:57,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:57,042 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 759 transitions. [2018-07-23 13:37:57,042 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:37:57,042 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 759 transitions. [2018-07-23 13:37:57,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:37:57,042 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:57,042 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:57,042 INFO L414 AbstractCegarLoop]: === Iteration 110 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:57,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2059824409, now seen corresponding path program 2 times [2018-07-23 13:37:57,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:57,062 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:57,062 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:37:57,062 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:57,062 INFO L185 omatonBuilderFactory]: Interpolants [164834#(<= (+ product_working0 2) product_next), 164835#(and (<= (+ product_working0 2) product_begin0) (= product_end0 product_next)), 164832#(and (<= (+ product_begin0 2) product_end1) (= product_end1 product_next)), 164833#(<= (+ product_begin0 2) product_next), 164838#(<= (+ product_working0 4) product_begin1), 164839#(<= (+ product_working0 4) product_working1), 164836#(<= (+ product_working0 3) product_next), 164837#(<= (+ product_working0 3) product_begin1), 164826#true, 164827#false, 164830#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0)), 164831#(and (= product_end0 product_begin1) (<= (+ product_begin0 product_begin1 2) (+ product_end0 product_end1)) (= product_end1 product_next)), 164828#(= product_end0 product_next), 164829#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0))] [2018-07-23 13:37:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:57,063 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:37:57,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:37:57,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:57,063 INFO L87 Difference]: Start difference. First operand 459 states and 759 transitions. Second operand 14 states. [2018-07-23 13:37:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:57,569 INFO L93 Difference]: Finished difference Result 521 states and 849 transitions. [2018-07-23 13:37:57,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:37:57,569 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-23 13:37:57,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:57,569 INFO L225 Difference]: With dead ends: 521 [2018-07-23 13:37:57,569 INFO L226 Difference]: Without dead ends: 520 [2018-07-23 13:37:57,570 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:37:57,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-07-23 13:37:57,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 489. [2018-07-23 13:37:57,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-07-23 13:37:57,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 808 transitions. [2018-07-23 13:37:57,927 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 808 transitions. Word has length 20 [2018-07-23 13:37:57,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:57,927 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 808 transitions. [2018-07-23 13:37:57,927 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:37:57,927 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 808 transitions. [2018-07-23 13:37:57,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:37:57,927 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:57,927 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:57,928 INFO L414 AbstractCegarLoop]: === Iteration 111 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:57,928 INFO L82 PathProgramCache]: Analyzing trace with hash -781467557, now seen corresponding path program 1 times [2018-07-23 13:37:57,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:57,945 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:57,945 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:57,945 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:37:57,945 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:57,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:57,946 INFO L185 omatonBuilderFactory]: Interpolants [166882#(= product_end0 product_next), 166883#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 166880#true, 166881#false, 166886#(and (<= (+ product_begin0 2) product_end1) (= product_end1 product_next)), 166887#(<= (+ product_begin0 2) product_next), 166884#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0)), 166885#(and (= product_end0 product_begin1) (<= (+ product_begin0 product_begin1 2) (+ product_end0 product_end1)) (= product_end1 product_next)), 166890#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 166891#(not (= product_working0 product_next)), 166888#(<= (+ product_working0 2) product_next), 166889#(and (or (= product_working0 product_end1) (= product_end1 product_next)) (or (not (= product_working0 product_end1)) (<= (+ product_working0 2) product_begin1))), 166892#(not (= product_working0 product_begin1)), 166893#(not (= product_working0 product_working1))] [2018-07-23 13:37:57,946 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:57,946 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:37:57,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:37:57,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:57,946 INFO L87 Difference]: Start difference. First operand 489 states and 808 transitions. Second operand 14 states. [2018-07-23 13:37:58,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:58,588 INFO L93 Difference]: Finished difference Result 578 states and 932 transitions. [2018-07-23 13:37:58,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 13:37:58,588 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-23 13:37:58,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:58,589 INFO L225 Difference]: With dead ends: 578 [2018-07-23 13:37:58,589 INFO L226 Difference]: Without dead ends: 576 [2018-07-23 13:37:58,590 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:37:58,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-07-23 13:37:58,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 493. [2018-07-23 13:37:58,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-07-23 13:37:58,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 815 transitions. [2018-07-23 13:37:58,955 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 815 transitions. Word has length 20 [2018-07-23 13:37:58,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:58,955 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 815 transitions. [2018-07-23 13:37:58,955 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:37:58,955 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 815 transitions. [2018-07-23 13:37:58,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:37:58,955 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:58,955 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:58,956 INFO L414 AbstractCegarLoop]: === Iteration 112 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:58,956 INFO L82 PathProgramCache]: Analyzing trace with hash -874261799, now seen corresponding path program 5 times [2018-07-23 13:37:58,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:58,970 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:58,970 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:58,970 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:37:58,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:58,971 INFO L185 omatonBuilderFactory]: Interpolants [169090#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 169091#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 169088#(= product_end0 product_next), 169089#(and (= product_end0 product_begin1) (= product_end1 product_next)), 169094#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next)), 169095#(<= (+ product_end0 2) product_next), 169092#(<= (+ product_end0 1) product_next), 169093#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next)), 169098#(not (= product_working0 product_next)), 169099#(not (= product_working0 product_begin1)), 169096#(or (not (= product_working0 product_next)) (<= (+ product_end0 2) product_begin0)), 169097#(or (<= (+ product_end0 3) product_begin0) (not (= product_working0 product_next))), 169100#(not (= product_working0 product_working1)), 169086#true, 169087#false] [2018-07-23 13:37:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:58,971 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:37:58,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:37:58,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:58,971 INFO L87 Difference]: Start difference. First operand 493 states and 815 transitions. Second operand 15 states. [2018-07-23 13:37:59,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:59,687 INFO L93 Difference]: Finished difference Result 600 states and 981 transitions. [2018-07-23 13:37:59,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:37:59,687 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2018-07-23 13:37:59,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:59,688 INFO L225 Difference]: With dead ends: 600 [2018-07-23 13:37:59,688 INFO L226 Difference]: Without dead ends: 599 [2018-07-23 13:37:59,689 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:37:59,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-07-23 13:38:00,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 498. [2018-07-23 13:38:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-07-23 13:38:00,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 825 transitions. [2018-07-23 13:38:00,059 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 825 transitions. Word has length 20 [2018-07-23 13:38:00,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:00,059 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 825 transitions. [2018-07-23 13:38:00,059 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:38:00,059 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 825 transitions. [2018-07-23 13:38:00,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:00,060 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:00,060 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:00,060 INFO L414 AbstractCegarLoop]: === Iteration 113 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:00,060 INFO L82 PathProgramCache]: Analyzing trace with hash -872968933, now seen corresponding path program 2 times [2018-07-23 13:38:00,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:00,075 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:00,075 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:38:00,076 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:00,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:00,076 INFO L185 omatonBuilderFactory]: Interpolants [171334#false, 171335#(= product_end0 product_next), 171333#true, 171338#(and (= product_end0 product_begin1) (<= (+ product_begin0 product_begin1 2) (+ product_end0 product_end1)) (= product_end1 product_next)), 171339#(and (<= (+ product_begin0 2) product_end1) (= product_end1 product_next)), 171336#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 171337#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0)), 171342#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next)), 171343#(<= (+ product_begin0 3) product_next), 171340#(<= (+ product_begin0 2) product_next), 171341#(and (= product_end1 product_next) (<= (+ product_begin0 2) product_begin1)), 171346#(not (= product_working0 product_working1)), 171344#(not (= product_working0 product_next)), 171345#(not (= product_working0 product_begin1))] [2018-07-23 13:38:00,076 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:00,076 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:38:00,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:38:00,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:38:00,076 INFO L87 Difference]: Start difference. First operand 498 states and 825 transitions. Second operand 14 states. [2018-07-23 13:38:00,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:00,921 INFO L93 Difference]: Finished difference Result 829 states and 1342 transitions. [2018-07-23 13:38:00,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 13:38:00,922 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-23 13:38:00,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:00,923 INFO L225 Difference]: With dead ends: 829 [2018-07-23 13:38:00,923 INFO L226 Difference]: Without dead ends: 827 [2018-07-23 13:38:00,923 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=275, Invalid=1705, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 13:38:00,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-07-23 13:38:01,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 612. [2018-07-23 13:38:01,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-07-23 13:38:01,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1017 transitions. [2018-07-23 13:38:01,375 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1017 transitions. Word has length 20 [2018-07-23 13:38:01,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:01,376 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 1017 transitions. [2018-07-23 13:38:01,376 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:38:01,376 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1017 transitions. [2018-07-23 13:38:01,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:01,376 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:01,376 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:01,376 INFO L414 AbstractCegarLoop]: === Iteration 114 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:01,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1388091879, now seen corresponding path program 1 times [2018-07-23 13:38:01,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:01,402 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:01,403 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:38:01,403 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:01,403 INFO L185 omatonBuilderFactory]: Interpolants [174291#true, 174294#(and (<= (+ product_end0 product_end1) (+ product_workload product_next product_begin1)) (= product_end1 product_begin0)), 174295#(and (<= (+ product_begin0 product_end1 1) (+ product_workload product_next product_begin1)) (= product_end1 product_begin0)), 174292#false, 174293#(and (<= product_end1 (+ product_workload product_begin1)) (= product_end1 product_next)), 174298#(and (<= (+ product_begin0 product_working1 4) (+ product_workload product_end1 product_next)) (= product_end1 product_begin0)), 174299#(<= (+ product_working1 4) (+ product_workload product_next)), 174296#(and (<= (+ product_begin0 product_end1 2) (+ product_workload product_next product_begin1)) (= product_end1 product_begin0)), 174297#(and (<= (+ product_begin0 product_begin1 4) (+ product_workload product_end1 product_next)) (= product_end1 product_begin0)), 174302#(not (= product_working1 product_begin0)), 174303#(not (= product_working1 product_working0)), 174300#(and (not (= product_working1 product_end1)) (= product_end1 product_next)), 174301#(not (= product_working1 product_next))] [2018-07-23 13:38:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:01,403 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:38:01,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:38:01,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:38:01,404 INFO L87 Difference]: Start difference. First operand 612 states and 1017 transitions. Second operand 13 states. [2018-07-23 13:38:02,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:02,161 INFO L93 Difference]: Finished difference Result 696 states and 1138 transitions. [2018-07-23 13:38:02,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:38:02,161 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-23 13:38:02,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:02,162 INFO L225 Difference]: With dead ends: 696 [2018-07-23 13:38:02,162 INFO L226 Difference]: Without dead ends: 694 [2018-07-23 13:38:02,163 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:38:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-07-23 13:38:02,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 643. [2018-07-23 13:38:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-07-23 13:38:02,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1068 transitions. [2018-07-23 13:38:02,646 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1068 transitions. Word has length 20 [2018-07-23 13:38:02,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:02,646 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 1068 transitions. [2018-07-23 13:38:02,646 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:38:02,646 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1068 transitions. [2018-07-23 13:38:02,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:02,646 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:02,647 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:02,647 INFO L414 AbstractCegarLoop]: === Iteration 115 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:02,647 INFO L82 PathProgramCache]: Analyzing trace with hash 149319872, now seen corresponding path program 3 times [2018-07-23 13:38:02,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:02,653 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:02,653 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:38:02,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:02,654 INFO L185 omatonBuilderFactory]: Interpolants [177026#(<= product_end1 (+ product_workload product_begin1)), 177027#(<= (+ product_end1 1) (+ product_workload product_begin1)), 177024#true, 177025#false, 177030#(<= (+ product_begin0 1) product_end0), 177028#(<= 2 product_workload), 177029#(<= (+ product_begin0 2) product_end0)] [2018-07-23 13:38:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:02,654 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:38:02,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:38:02,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:38:02,655 INFO L87 Difference]: Start difference. First operand 643 states and 1068 transitions. Second operand 7 states. [2018-07-23 13:38:03,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:03,732 INFO L93 Difference]: Finished difference Result 2025 states and 3340 transitions. [2018-07-23 13:38:03,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:38:03,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-07-23 13:38:03,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:03,734 INFO L225 Difference]: With dead ends: 2025 [2018-07-23 13:38:03,734 INFO L226 Difference]: Without dead ends: 1397 [2018-07-23 13:38:03,736 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:38:03,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2018-07-23 13:38:04,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1239. [2018-07-23 13:38:04,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2018-07-23 13:38:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 2029 transitions. [2018-07-23 13:38:04,670 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 2029 transitions. Word has length 20 [2018-07-23 13:38:04,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:04,670 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 2029 transitions. [2018-07-23 13:38:04,670 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:38:04,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2029 transitions. [2018-07-23 13:38:04,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:04,671 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:04,671 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:04,672 INFO L414 AbstractCegarLoop]: === Iteration 116 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:04,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1603097883, now seen corresponding path program 1 times [2018-07-23 13:38:04,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:04,697 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:04,697 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:04,697 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:38:04,698 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:04,698 INFO L185 omatonBuilderFactory]: Interpolants [183586#(not (= product_working1 product_begin0)), 183587#(not (= product_working1 product_working0)), 183584#(and (not (= product_working1 product_end1)) (= product_end1 product_next)), 183585#(not (= product_working1 product_next)), 183575#true, 183578#(and (<= (+ product_end0 product_end1) (+ product_workload product_next product_begin1)) (= product_end1 product_begin0)), 183579#(and (<= (+ product_begin0 product_end1 1) (+ product_workload product_next product_begin1)) (= product_end1 product_begin0)), 183576#false, 183577#(and (<= product_end1 (+ product_workload product_begin1)) (= product_end1 product_next)), 183582#(<= (+ product_begin1 4) (+ product_workload product_next)), 183583#(<= (+ product_working1 4) (+ product_workload product_next)), 183580#(and (<= (+ product_begin0 product_end1 2) (+ product_workload product_next product_begin1)) (= product_end1 product_begin0)), 183581#(and (<= (+ product_begin0 product_begin1 4) (+ product_workload product_end1 product_next)) (= product_end1 product_begin0))] [2018-07-23 13:38:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:04,698 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:38:04,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:38:04,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:38:04,698 INFO L87 Difference]: Start difference. First operand 1239 states and 2029 transitions. Second operand 13 states. [2018-07-23 13:38:05,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:05,902 INFO L93 Difference]: Finished difference Result 1356 states and 2197 transitions. [2018-07-23 13:38:05,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 13:38:05,902 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-23 13:38:05,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:05,904 INFO L225 Difference]: With dead ends: 1356 [2018-07-23 13:38:05,904 INFO L226 Difference]: Without dead ends: 1354 [2018-07-23 13:38:05,904 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=215, Invalid=1117, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:38:05,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-07-23 13:38:06,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1251. [2018-07-23 13:38:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1251 states. [2018-07-23 13:38:06,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 2049 transitions. [2018-07-23 13:38:06,835 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 2049 transitions. Word has length 20 [2018-07-23 13:38:06,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:06,835 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 2049 transitions. [2018-07-23 13:38:06,835 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:38:06,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 2049 transitions. [2018-07-23 13:38:06,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:06,836 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:06,836 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:06,836 INFO L414 AbstractCegarLoop]: === Iteration 117 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:06,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1503357634, now seen corresponding path program 2 times [2018-07-23 13:38:06,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:06,859 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:06,859 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:06,859 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:38:06,859 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:06,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:06,860 INFO L185 omatonBuilderFactory]: Interpolants [188850#true, 188851#false, 188854#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0)), 188855#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 188852#(= product_end1 product_next), 188853#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 188858#(and (or (= product_working1 product_end0) (= product_end0 product_next)) (or (not (= product_working1 product_end0)) (<= (+ product_working1 2) product_begin0))), 188859#(and (not (= product_working1 product_end0)) (= product_end0 product_next)), 188856#(and (<= (+ product_begin0 product_working1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 188857#(<= (+ product_working1 2) product_next), 188862#(not (= product_working1 product_working0)), 188860#(not (= product_working1 product_next)), 188861#(not (= product_working1 product_begin0))] [2018-07-23 13:38:06,860 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:06,860 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:38:06,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:38:06,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:38:06,860 INFO L87 Difference]: Start difference. First operand 1251 states and 2049 transitions. Second operand 13 states. [2018-07-23 13:38:08,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:08,062 INFO L93 Difference]: Finished difference Result 1410 states and 2292 transitions. [2018-07-23 13:38:08,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 13:38:08,062 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-23 13:38:08,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:08,063 INFO L225 Difference]: With dead ends: 1410 [2018-07-23 13:38:08,063 INFO L226 Difference]: Without dead ends: 1408 [2018-07-23 13:38:08,064 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:38:08,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2018-07-23 13:38:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1272. [2018-07-23 13:38:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-07-23 13:38:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2080 transitions. [2018-07-23 13:38:09,027 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2080 transitions. Word has length 20 [2018-07-23 13:38:09,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:09,027 INFO L471 AbstractCegarLoop]: Abstraction has 1272 states and 2080 transitions. [2018-07-23 13:38:09,027 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:38:09,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2080 transitions. [2018-07-23 13:38:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:09,028 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:09,028 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:09,028 INFO L414 AbstractCegarLoop]: === Iteration 118 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:09,028 INFO L82 PathProgramCache]: Analyzing trace with hash 418443550, now seen corresponding path program 1 times [2018-07-23 13:38:09,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:09,040 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:09,040 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:38:09,040 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:09,041 INFO L185 omatonBuilderFactory]: Interpolants [194274#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 194275#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0)), 194272#false, 194273#(= product_end1 product_next), 194278#(<= (+ product_working1 2) product_next), 194279#(and (= product_end1 product_next) (<= (+ product_working1 2) product_begin1)), 194276#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 194277#(and (<= (+ product_begin0 product_working1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 194282#(<= (+ product_working1 4) product_begin0), 194283#(<= (+ product_working1 4) product_working0), 194280#(<= (+ product_working1 3) product_next), 194281#(<= (+ product_working1 3) product_begin0), 194271#true] [2018-07-23 13:38:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:09,041 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:38:09,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:38:09,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:38:09,042 INFO L87 Difference]: Start difference. First operand 1272 states and 2080 transitions. Second operand 13 states. [2018-07-23 13:38:10,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:10,190 INFO L93 Difference]: Finished difference Result 1365 states and 2218 transitions. [2018-07-23 13:38:10,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:38:10,190 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-23 13:38:10,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:10,192 INFO L225 Difference]: With dead ends: 1365 [2018-07-23 13:38:10,192 INFO L226 Difference]: Without dead ends: 1364 [2018-07-23 13:38:10,192 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:38:10,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2018-07-23 13:38:11,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1342. [2018-07-23 13:38:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2018-07-23 13:38:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 2190 transitions. [2018-07-23 13:38:11,241 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 2190 transitions. Word has length 20 [2018-07-23 13:38:11,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:11,241 INFO L471 AbstractCegarLoop]: Abstraction has 1342 states and 2190 transitions. [2018-07-23 13:38:11,241 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:38:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 2190 transitions. [2018-07-23 13:38:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:11,242 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:11,242 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:11,242 INFO L414 AbstractCegarLoop]: === Iteration 119 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:11,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1962310520, now seen corresponding path program 4 times [2018-07-23 13:38:11,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:38:11,251 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:11,251 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:38:11,251 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:11,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:11,252 INFO L185 omatonBuilderFactory]: Interpolants [199715#(<= (+ product_begin0 2) product_end0), 199714#(<= (+ product_begin0 product_end1 1) (+ product_end0 product_begin1)), 199713#(<= (+ product_begin0 product_end1) (+ product_end0 product_begin1)), 199712#(<= product_end1 (+ product_workload product_begin1)), 199716#(<= (+ product_begin0 1) product_end0), 199711#false, 199710#true] [2018-07-23 13:38:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:38:11,252 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:38:11,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:38:11,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:38:11,252 INFO L87 Difference]: Start difference. First operand 1342 states and 2190 transitions. Second operand 7 states. [2018-07-23 13:38:12,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:12,685 INFO L93 Difference]: Finished difference Result 2545 states and 4127 transitions. [2018-07-23 13:38:12,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:38:12,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-07-23 13:38:12,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:12,687 INFO L225 Difference]: With dead ends: 2545 [2018-07-23 13:38:12,687 INFO L226 Difference]: Without dead ends: 1760 [2018-07-23 13:38:12,688 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:38:12,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2018-07-23 13:38:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1331. [2018-07-23 13:38:13,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-07-23 13:38:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2166 transitions. [2018-07-23 13:38:13,786 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2166 transitions. Word has length 20 [2018-07-23 13:38:13,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:13,786 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 2166 transitions. [2018-07-23 13:38:13,786 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:38:13,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2166 transitions. [2018-07-23 13:38:13,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:13,787 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:13,787 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:13,787 INFO L414 AbstractCegarLoop]: === Iteration 120 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:13,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1797340462, now seen corresponding path program 1 times [2018-07-23 13:38:13,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:13,798 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:13,798 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:38:13,799 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:13,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:13,799 INFO L185 omatonBuilderFactory]: Interpolants [207491#(<= (+ product_working1 3) product_begin0), 207490#(<= (+ product_working1 3) product_next), 207489#(<= (+ product_begin1 3) product_next), 207488#(<= (+ product_begin1 3) (+ product_workload product_next)), 207492#(<= (+ product_working1 3) product_working0), 207483#(<= 1 product_workload), 207482#false, 207481#true, 207487#(and (<= (+ product_begin0 product_begin1 3) (+ product_workload product_end1 product_next)) (= product_end1 product_begin0)), 207486#(and (<= (+ product_end0 product_begin1 2) (+ product_workload product_end1 product_next)) (= product_end1 product_begin0)), 207485#(and (<= (+ product_begin1 2) (+ product_workload product_end1)) (= product_end1 product_next)), 207484#(and (<= 1 product_workload) (= product_end1 product_next))] [2018-07-23 13:38:13,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:13,799 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:38:13,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:38:13,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:38:13,799 INFO L87 Difference]: Start difference. First operand 1331 states and 2166 transitions. Second operand 12 states. [2018-07-23 13:38:15,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:15,240 INFO L93 Difference]: Finished difference Result 1610 states and 2608 transitions. [2018-07-23 13:38:15,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:38:15,240 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-07-23 13:38:15,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:15,242 INFO L225 Difference]: With dead ends: 1610 [2018-07-23 13:38:15,242 INFO L226 Difference]: Without dead ends: 1608 [2018-07-23 13:38:15,243 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:38:15,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2018-07-23 13:38:16,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1436. [2018-07-23 13:38:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1436 states. [2018-07-23 13:38:16,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2341 transitions. [2018-07-23 13:38:16,428 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2341 transitions. Word has length 20 [2018-07-23 13:38:16,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:16,428 INFO L471 AbstractCegarLoop]: Abstraction has 1436 states and 2341 transitions. [2018-07-23 13:38:16,428 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:38:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2341 transitions. [2018-07-23 13:38:16,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:16,429 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:16,429 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:16,429 INFO L414 AbstractCegarLoop]: === Iteration 121 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:16,430 INFO L82 PathProgramCache]: Analyzing trace with hash -70738496, now seen corresponding path program 5 times [2018-07-23 13:38:16,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:38:16,437 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:16,437 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:38:16,437 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:16,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:16,438 INFO L185 omatonBuilderFactory]: Interpolants [213619#(<= product_end1 product_begin1), 213618#(<= product_end1 (+ product_begin1 1)), 213617#(<= (+ product_begin0 product_end1) (+ product_end0 product_begin1 1)), 213616#(<= (+ product_begin0 product_end1) (+ product_end0 product_begin1)), 213615#(<= product_end1 (+ product_workload product_begin1)), 213614#false, 213613#true] [2018-07-23 13:38:16,438 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:38:16,438 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:38:16,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:38:16,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:38:16,438 INFO L87 Difference]: Start difference. First operand 1436 states and 2341 transitions. Second operand 7 states. [2018-07-23 13:38:17,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:17,964 INFO L93 Difference]: Finished difference Result 2745 states and 4471 transitions. [2018-07-23 13:38:17,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:38:17,964 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-07-23 13:38:17,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:17,966 INFO L225 Difference]: With dead ends: 2745 [2018-07-23 13:38:17,966 INFO L226 Difference]: Without dead ends: 1823 [2018-07-23 13:38:17,968 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:38:17,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2018-07-23 13:38:19,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1657. [2018-07-23 13:38:19,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1657 states. [2018-07-23 13:38:19,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2701 transitions. [2018-07-23 13:38:19,370 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2701 transitions. Word has length 20 [2018-07-23 13:38:19,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:19,370 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2701 transitions. [2018-07-23 13:38:19,370 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:38:19,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2701 transitions. [2018-07-23 13:38:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:19,371 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:19,371 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:19,371 INFO L414 AbstractCegarLoop]: === Iteration 122 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:19,371 INFO L82 PathProgramCache]: Analyzing trace with hash -70737726, now seen corresponding path program 2 times [2018-07-23 13:38:19,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:19,383 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:19,383 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:38:19,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:19,384 INFO L185 omatonBuilderFactory]: Interpolants [222449#(<= (+ product_working1 3) product_working0), 222448#(<= (+ product_working1 3) product_begin0), 222439#false, 222438#true, 222443#(and (<= (+ product_end0 product_begin1 2) (+ product_workload product_end1 product_next)) (= product_end1 product_begin0)), 222442#(and (<= (+ product_begin1 2) (+ product_workload product_end1)) (= product_end1 product_next)), 222441#(and (<= 1 product_workload) (= product_end1 product_next)), 222440#(<= 1 product_workload), 222447#(<= (+ product_begin1 3) product_begin0), 222446#(<= (+ product_begin1 3) product_next), 222445#(<= (+ product_begin1 3) (+ product_workload product_next)), 222444#(and (<= (+ product_begin0 product_begin1 3) (+ product_workload product_end1 product_next)) (= product_end1 product_begin0))] [2018-07-23 13:38:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:19,384 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:38:19,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:38:19,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:38:19,385 INFO L87 Difference]: Start difference. First operand 1657 states and 2701 transitions. Second operand 12 states. [2018-07-23 13:38:21,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:21,042 INFO L93 Difference]: Finished difference Result 1815 states and 2934 transitions. [2018-07-23 13:38:21,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:38:21,043 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-07-23 13:38:21,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:21,045 INFO L225 Difference]: With dead ends: 1815 [2018-07-23 13:38:21,045 INFO L226 Difference]: Without dead ends: 1813 [2018-07-23 13:38:21,045 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:38:21,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2018-07-23 13:38:22,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1651. [2018-07-23 13:38:22,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1651 states. [2018-07-23 13:38:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2690 transitions. [2018-07-23 13:38:22,380 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2690 transitions. Word has length 20 [2018-07-23 13:38:22,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:22,381 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 2690 transitions. [2018-07-23 13:38:22,381 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:38:22,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2690 transitions. [2018-07-23 13:38:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:22,381 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:22,382 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:22,382 INFO L414 AbstractCegarLoop]: === Iteration 123 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:22,382 INFO L82 PathProgramCache]: Analyzing trace with hash 56099968, now seen corresponding path program 1 times [2018-07-23 13:38:22,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:22,402 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:22,402 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:38:22,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:22,403 INFO L185 omatonBuilderFactory]: Interpolants [229411#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 229410#(= product_end1 product_next), 229409#false, 229408#true, 229415#(<= (+ product_working1 2) product_next), 229414#(<= (+ product_begin1 2) product_next), 229413#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 229412#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0)), 229419#(not (= product_working1 product_begin0)), 229418#(not (= product_working1 product_next)), 229417#(and (not (= product_working1 product_end0)) (= product_end0 product_next)), 229416#(and (or (= product_working1 product_end0) (= product_end0 product_next)) (or (not (= product_working1 product_end0)) (<= (+ product_working1 2) product_begin0))), 229420#(not (= product_working1 product_working0))] [2018-07-23 13:38:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:22,403 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:38:22,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:38:22,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:38:22,404 INFO L87 Difference]: Start difference. First operand 1651 states and 2690 transitions. Second operand 13 states. [2018-07-23 13:38:24,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:24,049 INFO L93 Difference]: Finished difference Result 1804 states and 2922 transitions. [2018-07-23 13:38:24,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 13:38:24,050 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-23 13:38:24,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:24,052 INFO L225 Difference]: With dead ends: 1804 [2018-07-23 13:38:24,052 INFO L226 Difference]: Without dead ends: 1802 [2018-07-23 13:38:24,052 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 13:38:24,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2018-07-23 13:38:25,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1635. [2018-07-23 13:38:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2018-07-23 13:38:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2664 transitions. [2018-07-23 13:38:25,379 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2664 transitions. Word has length 20 [2018-07-23 13:38:25,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:25,379 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 2664 transitions. [2018-07-23 13:38:25,379 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:38:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2664 transitions. [2018-07-23 13:38:25,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:25,380 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:25,380 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:25,380 INFO L414 AbstractCegarLoop]: === Iteration 124 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:25,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1028814116, now seen corresponding path program 1 times [2018-07-23 13:38:25,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:25,396 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:25,397 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:25,397 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:38:25,397 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:25,398 INFO L185 omatonBuilderFactory]: Interpolants [236355#(<= (+ product_working1 3) product_begin0), 236354#(<= (+ product_working1 3) product_next), 236353#(and (= product_end1 product_next) (<= (+ product_working1 2) product_begin1)), 236352#(<= (+ product_working1 2) product_next), 236357#(<= (+ product_working1 4) product_working0), 236356#(<= (+ product_working1 4) product_begin0), 236347#(= product_end1 product_next), 236346#false, 236345#true, 236351#(<= (+ product_begin1 2) product_next), 236350#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 236349#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0)), 236348#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))] [2018-07-23 13:38:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:25,398 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:38:25,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:38:25,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:38:25,398 INFO L87 Difference]: Start difference. First operand 1635 states and 2664 transitions. Second operand 13 states. [2018-07-23 13:38:27,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:27,217 INFO L93 Difference]: Finished difference Result 1702 states and 2762 transitions. [2018-07-23 13:38:27,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:38:27,217 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-23 13:38:27,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:27,219 INFO L225 Difference]: With dead ends: 1702 [2018-07-23 13:38:27,219 INFO L226 Difference]: Without dead ends: 1701 [2018-07-23 13:38:27,219 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:38:27,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2018-07-23 13:38:28,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1631. [2018-07-23 13:38:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1631 states. [2018-07-23 13:38:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2657 transitions. [2018-07-23 13:38:28,641 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2657 transitions. Word has length 20 [2018-07-23 13:38:28,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:28,641 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2657 transitions. [2018-07-23 13:38:28,641 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:38:28,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2657 transitions. [2018-07-23 13:38:28,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:28,642 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:28,642 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:28,642 INFO L414 AbstractCegarLoop]: === Iteration 125 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:28,643 INFO L82 PathProgramCache]: Analyzing trace with hash 294164016, now seen corresponding path program 1 times [2018-07-23 13:38:28,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:28,656 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:28,656 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:28,656 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:38:28,656 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:28,657 INFO L185 omatonBuilderFactory]: Interpolants [243043#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 243042#(= product_end1 product_next), 243041#false, 243040#true, 243047#(and (<= (+ product_working1 2) product_end0) (= product_end0 product_next)), 243046#(and (= product_end0 product_next) (<= (+ product_working1 1) product_begin0)), 243045#(<= (+ product_working1 1) product_next), 243044#(and (= product_end1 product_next) (<= (+ product_working1 1) product_end1)), 243051#(<= (+ product_working1 3) product_working0), 243050#(<= (+ product_working1 3) product_begin0), 243049#(<= (+ product_working1 2) product_begin0), 243048#(<= (+ product_working1 2) product_next)] [2018-07-23 13:38:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:28,657 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:38:28,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:38:28,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:38:28,658 INFO L87 Difference]: Start difference. First operand 1631 states and 2657 transitions. Second operand 12 states. [2018-07-23 13:38:30,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:30,458 INFO L93 Difference]: Finished difference Result 1884 states and 3067 transitions. [2018-07-23 13:38:30,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:38:30,459 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-07-23 13:38:30,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:30,461 INFO L225 Difference]: With dead ends: 1884 [2018-07-23 13:38:30,461 INFO L226 Difference]: Without dead ends: 1883 [2018-07-23 13:38:30,461 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:38:30,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2018-07-23 13:38:31,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1605. [2018-07-23 13:38:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2018-07-23 13:38:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2615 transitions. [2018-07-23 13:38:31,780 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2615 transitions. Word has length 20 [2018-07-23 13:38:31,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:31,780 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 2615 transitions. [2018-07-23 13:38:31,780 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:38:31,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2615 transitions. [2018-07-23 13:38:31,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:31,781 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:31,781 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:31,781 INFO L414 AbstractCegarLoop]: === Iteration 126 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:31,781 INFO L82 PathProgramCache]: Analyzing trace with hash -503083984, now seen corresponding path program 1 times [2018-07-23 13:38:31,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:31,797 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:31,797 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:38:31,798 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:31,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:31,798 INFO L185 omatonBuilderFactory]: Interpolants [250063#false, 250062#true, 250067#(<= (+ product_working1 1) product_next), 250066#(and (= product_end1 product_next) (<= (+ product_working1 1) product_end1)), 250065#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 250064#(= product_end1 product_next), 250071#(and (= product_end1 product_next) (<= (+ product_working1 2) product_begin1)), 250070#(<= (+ product_working1 2) product_next), 250069#(and (<= (+ product_working1 2) product_end0) (= product_end0 product_next)), 250068#(and (= product_end0 product_next) (<= (+ product_working1 1) product_begin0)), 250075#(<= (+ product_working1 4) product_working0), 250074#(<= (+ product_working1 4) product_begin0), 250073#(<= (+ product_working1 3) product_begin0), 250072#(<= (+ product_working1 3) product_next)] [2018-07-23 13:38:31,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:31,799 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:38:31,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:38:31,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:38:31,799 INFO L87 Difference]: Start difference. First operand 1605 states and 2615 transitions. Second operand 14 states. [2018-07-23 13:38:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:33,493 INFO L93 Difference]: Finished difference Result 1872 states and 3057 transitions. [2018-07-23 13:38:33,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:38:33,493 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-23 13:38:33,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:33,495 INFO L225 Difference]: With dead ends: 1872 [2018-07-23 13:38:33,495 INFO L226 Difference]: Without dead ends: 1871 [2018-07-23 13:38:33,495 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:38:33,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2018-07-23 13:38:34,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1694. [2018-07-23 13:38:34,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694 states. [2018-07-23 13:38:34,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2762 transitions. [2018-07-23 13:38:34,891 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2762 transitions. Word has length 20 [2018-07-23 13:38:34,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:34,891 INFO L471 AbstractCegarLoop]: Abstraction has 1694 states and 2762 transitions. [2018-07-23 13:38:34,892 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:38:34,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2762 transitions. [2018-07-23 13:38:34,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:38:34,892 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:34,893 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:34,893 INFO L414 AbstractCegarLoop]: === Iteration 127 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:34,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1843127659, now seen corresponding path program 1 times [2018-07-23 13:38:34,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:34,907 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:34,908 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:34,908 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:38:34,908 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:34,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:34,911 INFO L185 omatonBuilderFactory]: Interpolants [257235#(<= (+ product_working0 2) product_begin1), 257234#(<= (+ product_working0 2) product_next), 257233#(<= (+ product_begin0 2) product_next), 257232#(<= (+ product_end0 1) product_next), 257237#(<= (+ product_working0 3) product_working1), 257236#(<= (+ product_working0 3) product_begin1), 257227#false, 257226#true, 257231#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 257230#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 257229#(and (= product_end0 product_begin1) (= product_end1 product_next)), 257228#(= product_end0 product_next)] [2018-07-23 13:38:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:34,911 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:38:34,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:38:34,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:38:34,912 INFO L87 Difference]: Start difference. First operand 1694 states and 2762 transitions. Second operand 12 states. [2018-07-23 13:38:36,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:36,519 INFO L93 Difference]: Finished difference Result 1818 states and 2952 transitions. [2018-07-23 13:38:36,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:38:36,519 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:38:36,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:36,522 INFO L225 Difference]: With dead ends: 1818 [2018-07-23 13:38:36,522 INFO L226 Difference]: Without dead ends: 1816 [2018-07-23 13:38:36,523 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:38:36,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2018-07-23 13:38:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1702. [2018-07-23 13:38:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2018-07-23 13:38:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2774 transitions. [2018-07-23 13:38:38,032 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2774 transitions. Word has length 21 [2018-07-23 13:38:38,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:38,032 INFO L471 AbstractCegarLoop]: Abstraction has 1702 states and 2774 transitions. [2018-07-23 13:38:38,032 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:38:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2774 transitions. [2018-07-23 13:38:38,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:38:38,033 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:38,033 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:38,033 INFO L414 AbstractCegarLoop]: === Iteration 128 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:38,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1652448723, now seen corresponding path program 1 times [2018-07-23 13:38:38,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:38,044 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:38,044 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:38:38,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:38,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:38,045 INFO L185 omatonBuilderFactory]: Interpolants [264308#true, 264309#false, 264310#(= product_end0 product_next), 264311#(and (= product_end0 product_begin1) (= product_end1 product_next)), 264316#(<= (+ product_begin0 2) product_begin1), 264317#(<= (+ product_working0 2) product_begin1), 264318#(<= (+ product_working0 3) product_begin1), 264319#(<= (+ product_working0 3) product_working1), 264312#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 264313#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 264314#(<= (+ product_end0 1) product_next), 264315#(<= (+ product_begin0 2) product_next)] [2018-07-23 13:38:38,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:38,045 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:38:38,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:38:38,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:38:38,046 INFO L87 Difference]: Start difference. First operand 1702 states and 2774 transitions. Second operand 12 states. [2018-07-23 13:38:39,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:39,775 INFO L93 Difference]: Finished difference Result 1906 states and 3103 transitions. [2018-07-23 13:38:39,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:38:39,775 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:38:39,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:39,778 INFO L225 Difference]: With dead ends: 1906 [2018-07-23 13:38:39,778 INFO L226 Difference]: Without dead ends: 1904 [2018-07-23 13:38:39,779 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:38:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2018-07-23 13:38:41,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1715. [2018-07-23 13:38:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2018-07-23 13:38:41,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2795 transitions. [2018-07-23 13:38:41,211 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2795 transitions. Word has length 21 [2018-07-23 13:38:41,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:41,212 INFO L471 AbstractCegarLoop]: Abstraction has 1715 states and 2795 transitions. [2018-07-23 13:38:41,212 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:38:41,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2795 transitions. [2018-07-23 13:38:41,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:38:41,213 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:41,213 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:41,213 INFO L414 AbstractCegarLoop]: === Iteration 129 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:41,213 INFO L82 PathProgramCache]: Analyzing trace with hash -858694805, now seen corresponding path program 1 times [2018-07-23 13:38:41,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:41,225 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:41,226 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:41,226 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:38:41,226 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:41,226 INFO L185 omatonBuilderFactory]: Interpolants [271590#true, 271591#false, 271600#(<= (+ product_working0 3) product_begin1), 271601#(<= (+ product_working0 3) product_working1), 271596#(<= (+ product_end0 1) product_next), 271597#(<= (+ product_end0 1) product_begin1), 271598#(<= (+ product_begin0 2) product_begin1), 271599#(<= (+ product_working0 2) product_begin1), 271592#(= product_end0 product_next), 271593#(and (= product_end0 product_begin1) (= product_end1 product_next)), 271594#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 271595#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1))] [2018-07-23 13:38:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:41,227 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:38:41,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:38:41,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:38:41,227 INFO L87 Difference]: Start difference. First operand 1715 states and 2795 transitions. Second operand 12 states. [2018-07-23 13:38:43,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:43,090 INFO L93 Difference]: Finished difference Result 1953 states and 3181 transitions. [2018-07-23 13:38:43,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:38:43,090 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:38:43,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:43,092 INFO L225 Difference]: With dead ends: 1953 [2018-07-23 13:38:43,093 INFO L226 Difference]: Without dead ends: 1951 [2018-07-23 13:38:43,093 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:38:43,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2018-07-23 13:38:44,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1700. [2018-07-23 13:38:44,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2018-07-23 13:38:44,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2771 transitions. [2018-07-23 13:38:44,522 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2771 transitions. Word has length 21 [2018-07-23 13:38:44,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:44,523 INFO L471 AbstractCegarLoop]: Abstraction has 1700 states and 2771 transitions. [2018-07-23 13:38:44,523 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:38:44,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2771 transitions. [2018-07-23 13:38:44,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:38:44,524 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:44,524 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-23 13:38:44,524 INFO L414 AbstractCegarLoop]: === Iteration 130 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:44,524 INFO L82 PathProgramCache]: Analyzing trace with hash -119563298, now seen corresponding path program 3 times [2018-07-23 13:38:44,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:44,549 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:44,549 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:38:44,549 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:44,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:44,550 INFO L185 omatonBuilderFactory]: Interpolants [278956#(and (<= (+ product_working0 1) product_end0) (= product_end0 product_next)), 278957#(<= (+ product_working0 1) product_next), 278958#(and (<= (+ product_working0 1) product_begin0) (= product_end0 product_next)), 278959#(<= (+ product_working0 2) product_next), 278952#true, 278953#false, 278954#(= product_end0 product_next), 278955#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 278964#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 278965#(not (= product_working0 product_next)), 278966#(not (= product_working0 product_begin1)), 278967#(not (= product_working0 product_working1)), 278960#(and (<= (+ product_working0 2) product_begin1) (= product_end1 product_next)), 278961#(and (= product_end1 product_next) (<= (+ product_working0 3) product_end1)), 278962#(<= (+ product_working0 3) product_next), 278963#(and (or (= product_working0 product_end1) (= product_end1 product_next)) (or (not (= product_working0 product_end1)) (<= (+ product_working0 3) product_begin1)))] [2018-07-23 13:38:44,550 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:44,550 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:38:44,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:38:44,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:38:44,550 INFO L87 Difference]: Start difference. First operand 1700 states and 2771 transitions. Second operand 16 states. [2018-07-23 13:38:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:46,147 INFO L93 Difference]: Finished difference Result 1765 states and 2860 transitions. [2018-07-23 13:38:46,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 13:38:46,148 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-07-23 13:38:46,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:46,150 INFO L225 Difference]: With dead ends: 1765 [2018-07-23 13:38:46,150 INFO L226 Difference]: Without dead ends: 1764 [2018-07-23 13:38:46,150 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:38:46,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-07-23 13:38:47,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1611. [2018-07-23 13:38:47,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2018-07-23 13:38:47,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2624 transitions. [2018-07-23 13:38:47,518 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2624 transitions. Word has length 22 [2018-07-23 13:38:47,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:47,518 INFO L471 AbstractCegarLoop]: Abstraction has 1611 states and 2624 transitions. [2018-07-23 13:38:47,518 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:38:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2624 transitions. [2018-07-23 13:38:47,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:38:47,519 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:47,519 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-23 13:38:47,519 INFO L414 AbstractCegarLoop]: === Iteration 131 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:47,519 INFO L82 PathProgramCache]: Analyzing trace with hash 489410380, now seen corresponding path program 4 times [2018-07-23 13:38:47,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:47,539 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:47,540 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:47,540 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:38:47,540 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:47,540 INFO L185 omatonBuilderFactory]: Interpolants [285764#(and (<= (+ product_begin0 2) product_end1) (= product_end1 product_next)), 285765#(<= (+ product_begin0 2) product_next), 285766#(<= (+ product_working0 2) product_next), 285767#(and (<= (+ product_working0 2) product_begin0) (= product_end0 product_next)), 285760#(= product_end0 product_next), 285761#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 285762#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0)), 285763#(and (= product_end0 product_begin1) (<= (+ product_begin0 product_begin1 2) (+ product_end0 product_end1)) (= product_end1 product_next)), 285772#(not (= product_working0 product_begin1)), 285773#(not (= product_working0 product_working1)), 285768#(<= (+ product_working0 3) product_next), 285769#(and (or (= product_working0 product_end1) (= product_end1 product_next)) (or (not (= product_working0 product_end1)) (<= (+ product_working0 3) product_begin1))), 285770#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 285771#(not (= product_working0 product_next)), 285758#true, 285759#false] [2018-07-23 13:38:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:47,540 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:38:47,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:38:47,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:38:47,541 INFO L87 Difference]: Start difference. First operand 1611 states and 2624 transitions. Second operand 16 states. [2018-07-23 13:38:49,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:49,315 INFO L93 Difference]: Finished difference Result 1706 states and 2757 transitions. [2018-07-23 13:38:49,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 13:38:49,315 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-07-23 13:38:49,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:49,317 INFO L225 Difference]: With dead ends: 1706 [2018-07-23 13:38:49,317 INFO L226 Difference]: Without dead ends: 1705 [2018-07-23 13:38:49,318 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=323, Invalid=1839, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 13:38:49,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2018-07-23 13:38:50,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1607. [2018-07-23 13:38:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2018-07-23 13:38:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 2615 transitions. [2018-07-23 13:38:50,698 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 2615 transitions. Word has length 22 [2018-07-23 13:38:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:50,698 INFO L471 AbstractCegarLoop]: Abstraction has 1607 states and 2615 transitions. [2018-07-23 13:38:50,698 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:38:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 2615 transitions. [2018-07-23 13:38:50,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:38:50,699 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:50,699 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:50,699 INFO L414 AbstractCegarLoop]: === Iteration 132 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:50,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1161738932, now seen corresponding path program 2 times [2018-07-23 13:38:50,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:50,720 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:50,721 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:38:50,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:50,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:50,721 INFO L185 omatonBuilderFactory]: Interpolants [292462#true, 292463#false, 292468#(and (<= (+ product_begin0 2) product_end1) (= product_end1 product_next)), 292469#(<= (+ product_begin0 2) product_next), 292470#(<= (+ product_working0 2) product_next), 292471#(and (<= (+ product_working0 2) product_begin1) (= product_end1 product_next)), 292464#(= product_end0 product_next), 292465#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 292466#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0)), 292467#(and (= product_end0 product_begin1) (<= (+ product_begin0 product_begin1 2) (+ product_end0 product_end1)) (= product_end1 product_next)), 292476#(<= (+ product_working0 4) product_working1), 292472#(and (= product_end1 product_next) (<= (+ product_working0 3) product_end1)), 292473#(and (<= (+ product_end0 product_working0 3) (+ product_end1 product_next)) (= product_end1 product_begin0)), 292474#(<= (+ product_working0 4) product_next), 292475#(<= (+ product_working0 4) product_begin1)] [2018-07-23 13:38:50,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:50,721 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:38:50,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:38:50,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:38:50,722 INFO L87 Difference]: Start difference. First operand 1607 states and 2615 transitions. Second operand 15 states. [2018-07-23 13:38:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:52,493 INFO L93 Difference]: Finished difference Result 1768 states and 2871 transitions. [2018-07-23 13:38:52,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:38:52,493 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-07-23 13:38:52,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:52,495 INFO L225 Difference]: With dead ends: 1768 [2018-07-23 13:38:52,495 INFO L226 Difference]: Without dead ends: 1767 [2018-07-23 13:38:52,496 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:38:52,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2018-07-23 13:38:53,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1649. [2018-07-23 13:38:53,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2018-07-23 13:38:53,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2685 transitions. [2018-07-23 13:38:53,991 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2685 transitions. Word has length 22 [2018-07-23 13:38:53,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:53,991 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2685 transitions. [2018-07-23 13:38:53,991 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:38:53,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2685 transitions. [2018-07-23 13:38:53,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:38:53,992 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:53,992 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-23 13:38:53,992 INFO L414 AbstractCegarLoop]: === Iteration 133 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:53,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1611878626, now seen corresponding path program 5 times [2018-07-23 13:38:53,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:54,011 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:54,011 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:54,012 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:38:54,012 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:54,012 INFO L185 omatonBuilderFactory]: Interpolants [299335#true, 299340#(and (= product_end0 product_begin1) (<= (+ product_begin0 product_begin1 2) (+ product_end0 product_end1)) (= product_end1 product_next)), 299341#(and (<= (+ product_begin0 2) product_end1) (= product_end1 product_next)), 299342#(<= (+ product_begin0 2) product_next), 299343#(and (= product_end1 product_next) (<= (+ product_begin0 2) product_begin1)), 299336#false, 299337#(= product_end0 product_next), 299338#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 299339#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0)), 299348#(not (= product_working0 product_next)), 299349#(not (= product_working0 product_begin1)), 299350#(not (= product_working0 product_working1)), 299344#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next)), 299345#(<= (+ product_begin0 3) product_next), 299346#(<= (+ product_working0 3) product_next), 299347#(and (or (not (= product_working0 product_end0)) (<= (+ product_working0 3) product_begin0)) (or (= product_working0 product_end0) (= product_end0 product_next)))] [2018-07-23 13:38:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:54,012 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:38:54,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:38:54,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:38:54,013 INFO L87 Difference]: Start difference. First operand 1649 states and 2685 transitions. Second operand 16 states. [2018-07-23 13:38:56,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:56,165 INFO L93 Difference]: Finished difference Result 1995 states and 3219 transitions. [2018-07-23 13:38:56,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 13:38:56,165 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-07-23 13:38:56,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:56,168 INFO L225 Difference]: With dead ends: 1995 [2018-07-23 13:38:56,168 INFO L226 Difference]: Without dead ends: 1994 [2018-07-23 13:38:56,168 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=347, Invalid=2203, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 13:38:56,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2018-07-23 13:38:57,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1676. [2018-07-23 13:38:57,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1676 states. [2018-07-23 13:38:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2732 transitions. [2018-07-23 13:38:57,638 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2732 transitions. Word has length 22 [2018-07-23 13:38:57,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:57,638 INFO L471 AbstractCegarLoop]: Abstraction has 1676 states and 2732 transitions. [2018-07-23 13:38:57,638 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:38:57,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2732 transitions. [2018-07-23 13:38:57,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:38:57,639 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:57,640 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:57,640 INFO L414 AbstractCegarLoop]: === Iteration 134 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:57,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1825100773, now seen corresponding path program 1 times [2018-07-23 13:38:57,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:57,661 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:57,661 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:38:57,662 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:57,662 INFO L185 omatonBuilderFactory]: Interpolants [306764#false, 306765#(= product_end1 product_next), 306766#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 306767#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0)), 306763#true, 306772#(and (<= (+ product_working1 3) product_end0) (= product_end0 product_next)), 306773#(<= (+ product_working1 3) product_next), 306774#(and (or (<= (+ product_working1 3) product_begin1) (not (= product_working1 product_end1))) (or (= product_working1 product_end1) (= product_end1 product_next))), 306775#(not (= product_working1 product_next)), 306768#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 306769#(and (<= (+ product_begin0 product_working1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 306770#(<= (+ product_working1 2) product_next), 306771#(and (<= (+ product_working1 2) product_begin0) (= product_end0 product_next)), 306776#(not (= product_working1 product_begin0)), 306777#(not (= product_working1 product_working0))] [2018-07-23 13:38:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:57,662 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:38:57,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:38:57,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:38:57,663 INFO L87 Difference]: Start difference. First operand 1676 states and 2732 transitions. Second operand 15 states. [2018-07-23 13:38:59,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:59,623 INFO L93 Difference]: Finished difference Result 1916 states and 3112 transitions. [2018-07-23 13:38:59,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 13:38:59,623 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-07-23 13:38:59,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:59,625 INFO L225 Difference]: With dead ends: 1916 [2018-07-23 13:38:59,626 INFO L226 Difference]: Without dead ends: 1914 [2018-07-23 13:38:59,626 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:38:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2018-07-23 13:39:01,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1767. [2018-07-23 13:39:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2018-07-23 13:39:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2876 transitions. [2018-07-23 13:39:01,196 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2876 transitions. Word has length 22 [2018-07-23 13:39:01,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:01,196 INFO L471 AbstractCegarLoop]: Abstraction has 1767 states and 2876 transitions. [2018-07-23 13:39:01,196 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:39:01,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2876 transitions. [2018-07-23 13:39:01,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:39:01,197 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:01,197 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:01,198 INFO L414 AbstractCegarLoop]: === Iteration 135 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:01,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1601377053, now seen corresponding path program 1 times [2018-07-23 13:39:01,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:01,213 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:01,213 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:01,213 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:39:01,214 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:01,214 INFO L185 omatonBuilderFactory]: Interpolants [314190#true, 314191#false, 314196#(and (<= (+ product_begin0 product_working1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 314197#(<= (+ product_working1 2) product_next), 314198#(and (= product_end1 product_next) (<= (+ product_working1 2) product_begin1)), 314199#(<= (+ product_working1 3) product_next), 314192#(= product_end1 product_next), 314193#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 314194#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0)), 314195#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 314200#(<= (+ product_working1 product_end0 3) (+ product_begin0 product_next)), 314201#(<= (+ product_working1 4) product_next), 314202#(<= (+ product_working1 4) product_begin0), 314203#(<= (+ product_working1 4) product_working0)] [2018-07-23 13:39:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:01,214 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:39:01,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:39:01,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:39:01,215 INFO L87 Difference]: Start difference. First operand 1767 states and 2876 transitions. Second operand 14 states. [2018-07-23 13:39:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:02,882 INFO L93 Difference]: Finished difference Result 1874 states and 3046 transitions. [2018-07-23 13:39:02,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:39:02,882 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-07-23 13:39:02,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:02,884 INFO L225 Difference]: With dead ends: 1874 [2018-07-23 13:39:02,885 INFO L226 Difference]: Without dead ends: 1873 [2018-07-23 13:39:02,885 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:39:02,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2018-07-23 13:39:04,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1763. [2018-07-23 13:39:04,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1763 states. [2018-07-23 13:39:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2871 transitions. [2018-07-23 13:39:04,510 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2871 transitions. Word has length 22 [2018-07-23 13:39:04,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:04,510 INFO L471 AbstractCegarLoop]: Abstraction has 1763 states and 2871 transitions. [2018-07-23 13:39:04,510 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:39:04,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2871 transitions. [2018-07-23 13:39:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:39:04,511 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:04,511 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:04,511 INFO L414 AbstractCegarLoop]: === Iteration 136 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:04,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1715079645, now seen corresponding path program 1 times [2018-07-23 13:39:04,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:04,529 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:04,529 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:39:04,529 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:04,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:04,530 INFO L185 omatonBuilderFactory]: Interpolants [321508#(and (<= (+ product_working1 2) product_begin0) (= product_end0 product_next)), 321509#(and (<= (+ product_working1 3) product_end0) (= product_end0 product_next)), 321510#(<= (+ product_working1 3) product_next), 321511#(and (or (<= (+ product_working1 3) product_begin1) (not (= product_working1 product_end1))) (or (= product_working1 product_end1) (= product_end1 product_next))), 321504#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0)), 321505#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 321506#(<= (+ product_begin1 2) product_next), 321507#(<= (+ product_working1 2) product_next), 321512#(not (= product_working1 product_next)), 321513#(not (= product_working1 product_begin0)), 321514#(not (= product_working1 product_working0)), 321500#true, 321501#false, 321502#(= product_end1 product_next), 321503#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))] [2018-07-23 13:39:04,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:04,530 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:39:04,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:39:04,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:39:04,530 INFO L87 Difference]: Start difference. First operand 1763 states and 2871 transitions. Second operand 15 states. [2018-07-23 13:39:06,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:06,466 INFO L93 Difference]: Finished difference Result 1970 states and 3194 transitions. [2018-07-23 13:39:06,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 13:39:06,466 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-07-23 13:39:06,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:06,468 INFO L225 Difference]: With dead ends: 1970 [2018-07-23 13:39:06,468 INFO L226 Difference]: Without dead ends: 1968 [2018-07-23 13:39:06,469 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=221, Invalid=1261, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:39:06,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2018-07-23 13:39:07,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1712. [2018-07-23 13:39:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1712 states. [2018-07-23 13:39:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2788 transitions. [2018-07-23 13:39:08,002 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2788 transitions. Word has length 22 [2018-07-23 13:39:08,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:08,002 INFO L471 AbstractCegarLoop]: Abstraction has 1712 states and 2788 transitions. [2018-07-23 13:39:08,002 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:39:08,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2788 transitions. [2018-07-23 13:39:08,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:39:08,003 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:08,003 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-23 13:39:08,003 INFO L414 AbstractCegarLoop]: === Iteration 137 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:08,003 INFO L82 PathProgramCache]: Analyzing trace with hash -846590175, now seen corresponding path program 3 times [2018-07-23 13:39:08,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:08,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:08,017 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:08,018 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:39:08,018 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:08,018 INFO L185 omatonBuilderFactory]: Interpolants [328933#(<= (+ product_begin1 2) product_next), 328932#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 328935#(and (= product_end1 product_next) (<= (+ product_working1 2) product_begin1)), 328934#(<= (+ product_working1 2) product_next), 328929#(= product_end1 product_next), 328928#false, 328931#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0)), 328930#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 328940#(<= (+ product_working1 4) product_working0), 328937#(<= (+ product_working1 product_end0 3) (+ product_begin0 product_next)), 328936#(<= (+ product_working1 3) product_next), 328939#(<= (+ product_working1 4) product_begin0), 328938#(<= (+ product_working1 4) product_next), 328927#true] [2018-07-23 13:39:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:08,018 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:39:08,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:39:08,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:39:08,019 INFO L87 Difference]: Start difference. First operand 1712 states and 2788 transitions. Second operand 14 states. [2018-07-23 13:39:09,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:09,839 INFO L93 Difference]: Finished difference Result 1872 states and 3041 transitions. [2018-07-23 13:39:09,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:39:09,839 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-07-23 13:39:09,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:09,841 INFO L225 Difference]: With dead ends: 1872 [2018-07-23 13:39:09,841 INFO L226 Difference]: Without dead ends: 1871 [2018-07-23 13:39:09,842 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:39:09,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2018-07-23 13:39:11,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1656. [2018-07-23 13:39:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2018-07-23 13:39:11,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2697 transitions. [2018-07-23 13:39:11,322 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2697 transitions. Word has length 22 [2018-07-23 13:39:11,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:11,322 INFO L471 AbstractCegarLoop]: Abstraction has 1656 states and 2697 transitions. [2018-07-23 13:39:11,322 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:39:11,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2697 transitions. [2018-07-23 13:39:11,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:39:11,323 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:11,323 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:11,323 INFO L414 AbstractCegarLoop]: === Iteration 138 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:11,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1868893045, now seen corresponding path program 2 times [2018-07-23 13:39:11,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:11,343 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:11,344 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:39:11,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:11,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:11,344 INFO L185 omatonBuilderFactory]: Interpolants [336033#(<= (+ product_working1 4) product_next), 336032#(<= (+ product_working1 product_end0 3) (+ product_begin0 product_next)), 336035#(<= (+ product_working1 4) product_working0), 336034#(<= (+ product_working1 4) product_begin0), 336021#true, 336023#(= product_end1 product_next), 336022#false, 336029#(<= (+ product_working1 2) product_next), 336028#(and (<= (+ product_working1 2) product_end0) (= product_end0 product_next)), 336031#(<= (+ product_working1 3) product_next), 336030#(and (= product_end1 product_next) (<= (+ product_working1 2) product_begin1)), 336025#(and (= product_end1 product_next) (<= (+ product_working1 1) product_end1)), 336024#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 336027#(and (= product_end0 product_next) (<= (+ product_working1 1) product_begin0)), 336026#(<= (+ product_working1 1) product_next)] [2018-07-23 13:39:11,344 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:11,345 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:39:11,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:39:11,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:39:11,345 INFO L87 Difference]: Start difference. First operand 1656 states and 2697 transitions. Second operand 15 states. [2018-07-23 13:39:13,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:13,058 INFO L93 Difference]: Finished difference Result 1826 states and 2973 transitions. [2018-07-23 13:39:13,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:39:13,058 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-07-23 13:39:13,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:13,060 INFO L225 Difference]: With dead ends: 1826 [2018-07-23 13:39:13,060 INFO L226 Difference]: Without dead ends: 1825 [2018-07-23 13:39:13,061 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:39:13,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2018-07-23 13:39:14,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1527. [2018-07-23 13:39:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2018-07-23 13:39:14,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2487 transitions. [2018-07-23 13:39:14,419 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2487 transitions. Word has length 22 [2018-07-23 13:39:14,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:14,420 INFO L471 AbstractCegarLoop]: Abstraction has 1527 states and 2487 transitions. [2018-07-23 13:39:14,420 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:39:14,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2487 transitions. [2018-07-23 13:39:14,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:39:14,420 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:14,421 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:14,421 INFO L414 AbstractCegarLoop]: === Iteration 139 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:14,421 INFO L82 PathProgramCache]: Analyzing trace with hash 441602332, now seen corresponding path program 1 times [2018-07-23 13:39:14,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:14,433 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:14,433 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:39:14,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:14,434 INFO L185 omatonBuilderFactory]: Interpolants [342765#(and (= product_end0 product_begin1) (= product_end1 product_next)), 342764#(= product_end0 product_next), 342767#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 342766#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 342763#false, 342762#true, 342773#(<= (+ product_working0 3) product_begin1), 342772#(<= (+ product_working0 3) product_next), 342775#(<= (+ product_working0 4) product_working1), 342774#(<= (+ product_working0 4) product_begin1), 342769#(<= (+ product_begin0 2) product_next), 342768#(<= (+ product_end0 1) product_next), 342771#(and (<= (+ product_working0 2) product_begin0) (= product_end0 product_next)), 342770#(<= (+ product_working0 2) product_next)] [2018-07-23 13:39:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:14,434 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:39:14,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:39:14,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:39:14,434 INFO L87 Difference]: Start difference. First operand 1527 states and 2487 transitions. Second operand 14 states. [2018-07-23 13:39:16,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:16,043 INFO L93 Difference]: Finished difference Result 1634 states and 2653 transitions. [2018-07-23 13:39:16,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:39:16,043 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-23 13:39:16,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:16,045 INFO L225 Difference]: With dead ends: 1634 [2018-07-23 13:39:16,045 INFO L226 Difference]: Without dead ends: 1633 [2018-07-23 13:39:16,045 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:39:16,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2018-07-23 13:39:17,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1575. [2018-07-23 13:39:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-07-23 13:39:17,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2566 transitions. [2018-07-23 13:39:17,464 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2566 transitions. Word has length 23 [2018-07-23 13:39:17,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:17,465 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2566 transitions. [2018-07-23 13:39:17,465 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:39:17,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2566 transitions. [2018-07-23 13:39:17,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:39:17,466 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:17,466 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:17,466 INFO L414 AbstractCegarLoop]: === Iteration 140 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:17,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1719959184, now seen corresponding path program 1 times [2018-07-23 13:39:17,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:17,480 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:17,481 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:17,481 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:39:17,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:17,482 INFO L185 omatonBuilderFactory]: Interpolants [349221#false, 349220#true, 349223#(and (= product_end0 product_begin1) (= product_end1 product_next)), 349222#(= product_end0 product_next), 349229#(and (or (= product_working0 product_end1) (= product_end1 product_next)) (or (not (= product_working0 product_end1)) (<= (+ product_working0 2) product_begin1))), 349228#(<= (+ product_working0 2) product_next), 349231#(not (= product_working0 product_next)), 349230#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 349225#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 349224#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 349227#(<= (+ product_begin0 2) product_next), 349226#(<= (+ product_end0 1) product_next), 349233#(not (= product_working0 product_working1)), 349232#(not (= product_working0 product_begin1))] [2018-07-23 13:39:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:17,482 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:39:17,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:39:17,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:39:17,482 INFO L87 Difference]: Start difference. First operand 1575 states and 2566 transitions. Second operand 14 states. [2018-07-23 13:39:19,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:19,201 INFO L93 Difference]: Finished difference Result 1685 states and 2725 transitions. [2018-07-23 13:39:19,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 13:39:19,202 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-23 13:39:19,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:19,203 INFO L225 Difference]: With dead ends: 1685 [2018-07-23 13:39:19,204 INFO L226 Difference]: Without dead ends: 1683 [2018-07-23 13:39:19,204 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=287, Invalid=1119, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:39:19,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2018-07-23 13:39:20,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1575. [2018-07-23 13:39:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-07-23 13:39:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2566 transitions. [2018-07-23 13:39:20,702 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2566 transitions. Word has length 23 [2018-07-23 13:39:20,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:20,702 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2566 transitions. [2018-07-23 13:39:20,703 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:39:20,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2566 transitions. [2018-07-23 13:39:20,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:39:20,703 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:20,704 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:20,704 INFO L414 AbstractCegarLoop]: === Iteration 141 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:20,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1628457808, now seen corresponding path program 2 times [2018-07-23 13:39:20,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:20,715 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:20,716 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:20,716 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:39:20,716 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:20,716 INFO L185 omatonBuilderFactory]: Interpolants [355813#(not (= product_working0 product_next)), 355812#(<= (+ product_begin0 3) product_next), 355815#(not (= product_working0 product_working1)), 355814#(not (= product_working0 product_begin1)), 355809#(<= (+ product_begin0 2) product_next), 355808#(<= (+ product_end0 1) product_next), 355811#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next)), 355810#(and (= product_end1 product_next) (<= (+ product_begin0 2) product_begin1)), 355805#(and (= product_end0 product_begin1) (= product_end1 product_next)), 355804#(= product_end0 product_next), 355807#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 355806#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 355803#false, 355802#true] [2018-07-23 13:39:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:20,716 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:39:20,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:39:20,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:39:20,717 INFO L87 Difference]: Start difference. First operand 1575 states and 2566 transitions. Second operand 14 states. [2018-07-23 13:39:22,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:22,756 INFO L93 Difference]: Finished difference Result 2088 states and 3396 transitions. [2018-07-23 13:39:22,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 13:39:22,756 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-23 13:39:22,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:22,758 INFO L225 Difference]: With dead ends: 2088 [2018-07-23 13:39:22,758 INFO L226 Difference]: Without dead ends: 2086 [2018-07-23 13:39:22,759 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=399, Invalid=2151, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 13:39:22,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2018-07-23 13:39:24,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 1710. [2018-07-23 13:39:24,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2018-07-23 13:39:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2793 transitions. [2018-07-23 13:39:24,271 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2793 transitions. Word has length 23 [2018-07-23 13:39:24,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:24,271 INFO L471 AbstractCegarLoop]: Abstraction has 1710 states and 2793 transitions. [2018-07-23 13:39:24,271 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:39:24,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2793 transitions. [2018-07-23 13:39:24,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:39:24,272 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:24,272 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:24,272 INFO L414 AbstractCegarLoop]: === Iteration 142 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:24,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1349164405, now seen corresponding path program 3 times [2018-07-23 13:39:24,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:24,291 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:24,291 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:24,291 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:39:24,292 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:24,292 INFO L185 omatonBuilderFactory]: Interpolants [363493#(<= (+ product_end0 product_working0 1) (+ product_begin0 product_next)), 363492#(<= (+ product_end0 1) product_next), 363495#(<= (+ product_working0 3) product_next), 363494#(<= (+ product_end0 product_working0 2) (+ product_begin0 product_next)), 363489#(and (= product_end0 product_begin1) (= product_end1 product_next)), 363488#(= product_end0 product_next), 363491#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 363490#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 363501#(<= (+ product_working0 5) product_working1), 363500#(<= (+ product_working0 5) product_begin1), 363497#(and (<= (+ product_working0 4) product_end1) (= product_end1 product_next)), 363496#(and (<= (+ product_working0 3) product_begin1) (= product_end1 product_next)), 363499#(<= (+ product_working0 4) product_begin1), 363498#(<= (+ product_working0 4) product_next), 363487#false, 363486#true] [2018-07-23 13:39:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:24,292 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:39:24,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:39:24,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:39:24,292 INFO L87 Difference]: Start difference. First operand 1710 states and 2793 transitions. Second operand 16 states. [2018-07-23 13:39:26,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:26,056 INFO L93 Difference]: Finished difference Result 1839 states and 2998 transitions. [2018-07-23 13:39:26,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:39:26,056 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-07-23 13:39:26,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:26,058 INFO L225 Difference]: With dead ends: 1839 [2018-07-23 13:39:26,058 INFO L226 Difference]: Without dead ends: 1838 [2018-07-23 13:39:26,058 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:39:26,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2018-07-23 13:39:27,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1750. [2018-07-23 13:39:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-07-23 13:39:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2860 transitions. [2018-07-23 13:39:27,551 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2860 transitions. Word has length 23 [2018-07-23 13:39:27,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:27,551 INFO L471 AbstractCegarLoop]: Abstraction has 1750 states and 2860 transitions. [2018-07-23 13:39:27,551 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:39:27,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2860 transitions. [2018-07-23 13:39:27,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:39:27,552 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:27,552 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:27,552 INFO L414 AbstractCegarLoop]: === Iteration 143 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:27,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1977166985, now seen corresponding path program 1 times [2018-07-23 13:39:27,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:27,567 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:27,567 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:27,567 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:39:27,567 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:27,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:27,568 INFO L185 omatonBuilderFactory]: Interpolants [370721#(<= (+ product_working0 4) product_begin1), 370720#(<= (+ product_working0 3) product_begin1), 370722#(<= (+ product_working0 4) product_working1), 370709#false, 370708#true, 370711#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 370710#(= product_end0 product_next), 370717#(and (<= (+ product_working0 2) product_begin1) (= product_end1 product_next)), 370716#(<= (+ product_working0 2) product_next), 370719#(<= (+ product_working0 3) product_next), 370718#(and (= product_end1 product_next) (<= (+ product_working0 3) product_end1)), 370713#(and (= product_end0 product_begin1) (<= (+ product_begin0 product_begin1 2) (+ product_end0 product_end1)) (= product_end1 product_next)), 370712#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0)), 370715#(<= (+ product_begin0 2) product_next), 370714#(and (<= (+ product_begin0 2) product_end1) (= product_end1 product_next))] [2018-07-23 13:39:27,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:27,568 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:39:27,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:39:27,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:39:27,568 INFO L87 Difference]: Start difference. First operand 1750 states and 2860 transitions. Second operand 15 states. [2018-07-23 13:39:29,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:29,432 INFO L93 Difference]: Finished difference Result 1875 states and 3050 transitions. [2018-07-23 13:39:29,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:39:29,432 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-07-23 13:39:29,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:29,434 INFO L225 Difference]: With dead ends: 1875 [2018-07-23 13:39:29,435 INFO L226 Difference]: Without dead ends: 1873 [2018-07-23 13:39:29,435 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:39:29,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2018-07-23 13:39:30,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1738. [2018-07-23 13:39:30,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2018-07-23 13:39:30,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2840 transitions. [2018-07-23 13:39:30,995 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2840 transitions. Word has length 23 [2018-07-23 13:39:30,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:30,995 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2840 transitions. [2018-07-23 13:39:30,995 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:39:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2840 transitions. [2018-07-23 13:39:30,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:39:30,996 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:30,996 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:30,996 INFO L414 AbstractCegarLoop]: === Iteration 144 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:30,996 INFO L82 PathProgramCache]: Analyzing trace with hash -451471923, now seen corresponding path program 4 times [2018-07-23 13:39:30,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:31,011 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:31,011 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:31,011 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:39:31,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:31,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:31,012 INFO L185 omatonBuilderFactory]: Interpolants [377989#true, 377991#(= product_end0 product_next), 377990#false, 377997#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next)), 377996#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next)), 377999#(<= (+ product_end0 product_working0 2) (+ product_begin0 product_next)), 377998#(<= (+ product_end0 2) product_next), 377993#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 377992#(and (= product_end0 product_begin1) (= product_end1 product_next)), 377995#(<= (+ product_end0 1) product_next), 377994#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 378004#(<= (+ product_working0 5) product_working1), 378001#(<= (+ product_working0 4) product_next), 378000#(<= (+ product_end0 product_working0 3) (+ product_begin0 product_next)), 378003#(<= (+ product_working0 5) product_begin1), 378002#(<= (+ product_working0 4) product_begin1)] [2018-07-23 13:39:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:31,012 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:39:31,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:39:31,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:39:31,012 INFO L87 Difference]: Start difference. First operand 1738 states and 2840 transitions. Second operand 16 states. [2018-07-23 13:39:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:32,860 INFO L93 Difference]: Finished difference Result 1956 states and 3208 transitions. [2018-07-23 13:39:32,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:39:32,861 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-07-23 13:39:32,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:32,863 INFO L225 Difference]: With dead ends: 1956 [2018-07-23 13:39:32,863 INFO L226 Difference]: Without dead ends: 1955 [2018-07-23 13:39:32,863 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:39:32,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2018-07-23 13:39:34,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1711. [2018-07-23 13:39:34,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1711 states. [2018-07-23 13:39:34,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2797 transitions. [2018-07-23 13:39:34,370 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2797 transitions. Word has length 23 [2018-07-23 13:39:34,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:34,371 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 2797 transitions. [2018-07-23 13:39:34,371 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:39:34,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2797 transitions. [2018-07-23 13:39:34,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:39:34,372 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:34,372 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:34,372 INFO L414 AbstractCegarLoop]: === Iteration 145 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:34,372 INFO L82 PathProgramCache]: Analyzing trace with hash -451472211, now seen corresponding path program 2 times [2018-07-23 13:39:34,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:34,387 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:34,387 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:39:34,387 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:34,388 INFO L185 omatonBuilderFactory]: Interpolants [385376#(not (= product_working0 product_working1)), 385365#(= product_end0 product_next), 385364#false, 385367#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 385366#(and (= product_end0 product_begin1) (= product_end1 product_next)), 385363#true, 385373#(<= (+ product_begin0 3) product_next), 385372#(<= (+ product_end0 2) product_next), 385375#(<= (+ product_begin0 3) product_working1), 385374#(<= (+ product_begin0 3) product_begin1), 385369#(<= (+ product_end0 1) product_next), 385368#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 385371#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next)), 385370#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next))] [2018-07-23 13:39:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:34,388 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:39:34,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:39:34,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:39:34,388 INFO L87 Difference]: Start difference. First operand 1711 states and 2797 transitions. Second operand 14 states. [2018-07-23 13:39:36,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:36,295 INFO L93 Difference]: Finished difference Result 1914 states and 3100 transitions. [2018-07-23 13:39:36,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:39:36,295 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-23 13:39:36,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:36,297 INFO L225 Difference]: With dead ends: 1914 [2018-07-23 13:39:36,297 INFO L226 Difference]: Without dead ends: 1912 [2018-07-23 13:39:36,297 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:39:36,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2018-07-23 13:39:37,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1723. [2018-07-23 13:39:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2018-07-23 13:39:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2809 transitions. [2018-07-23 13:39:37,832 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2809 transitions. Word has length 23 [2018-07-23 13:39:37,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:37,832 INFO L471 AbstractCegarLoop]: Abstraction has 1723 states and 2809 transitions. [2018-07-23 13:39:37,832 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:39:37,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2809 transitions. [2018-07-23 13:39:37,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:39:37,834 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:37,834 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:37,834 INFO L414 AbstractCegarLoop]: === Iteration 146 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:37,834 INFO L82 PathProgramCache]: Analyzing trace with hash -590426441, now seen corresponding path program 2 times [2018-07-23 13:39:37,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:37,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:37,849 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:37,849 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:39:37,849 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:37,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:37,849 INFO L185 omatonBuilderFactory]: Interpolants [392685#(= product_end0 product_next), 392684#false, 392687#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0)), 392686#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 392683#true, 392693#(<= (+ product_begin0 3) product_next), 392692#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next)), 392695#(<= (+ product_working0 3) product_begin1), 392694#(<= (+ product_working0 3) product_next), 392689#(and (<= (+ product_begin0 2) product_end1) (= product_end1 product_next)), 392688#(and (= product_end0 product_begin1) (<= (+ product_begin0 product_begin1 2) (+ product_end0 product_end1)) (= product_end1 product_next)), 392691#(and (= product_end1 product_next) (<= (+ product_begin0 2) product_begin1)), 392690#(<= (+ product_begin0 2) product_next), 392697#(<= (+ product_working0 4) product_working1), 392696#(<= (+ product_working0 4) product_begin1)] [2018-07-23 13:39:37,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:37,849 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:39:37,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:39:37,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:39:37,850 INFO L87 Difference]: Start difference. First operand 1723 states and 2809 transitions. Second operand 15 states. [2018-07-23 13:39:39,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:39,852 INFO L93 Difference]: Finished difference Result 1923 states and 3105 transitions. [2018-07-23 13:39:39,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:39:39,852 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-07-23 13:39:39,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:39,854 INFO L225 Difference]: With dead ends: 1923 [2018-07-23 13:39:39,854 INFO L226 Difference]: Without dead ends: 1921 [2018-07-23 13:39:39,855 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:39:39,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2018-07-23 13:39:41,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1745. [2018-07-23 13:39:41,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1745 states. [2018-07-23 13:39:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2845 transitions. [2018-07-23 13:39:41,478 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2845 transitions. Word has length 23 [2018-07-23 13:39:41,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:41,478 INFO L471 AbstractCegarLoop]: Abstraction has 1745 states and 2845 transitions. [2018-07-23 13:39:41,478 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:39:41,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2845 transitions. [2018-07-23 13:39:41,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:39:41,479 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:41,479 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:41,479 INFO L414 AbstractCegarLoop]: === Iteration 147 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:41,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1677111747, now seen corresponding path program 3 times [2018-07-23 13:39:41,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:41,492 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:41,492 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:41,492 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:39:41,493 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:41,493 INFO L185 omatonBuilderFactory]: Interpolants [400078#true, 400079#false, 400086#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next)), 400087#(<= (+ product_end0 2) product_next), 400084#(<= (+ product_end0 1) product_next), 400085#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next)), 400082#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 400083#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 400080#(= product_end0 product_next), 400081#(and (= product_end0 product_begin1) (= product_end1 product_next)), 400090#(<= (+ product_begin0 3) product_working1), 400091#(not (= product_working0 product_working1)), 400088#(<= (+ product_end0 2) product_begin1), 400089#(<= (+ product_end0 2) product_working1)] [2018-07-23 13:39:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:41,493 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:39:41,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:39:41,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:39:41,493 INFO L87 Difference]: Start difference. First operand 1745 states and 2845 transitions. Second operand 14 states. [2018-07-23 13:39:43,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:43,676 INFO L93 Difference]: Finished difference Result 2195 states and 3566 transitions. [2018-07-23 13:39:43,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:39:43,676 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-23 13:39:43,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:43,678 INFO L225 Difference]: With dead ends: 2195 [2018-07-23 13:39:43,678 INFO L226 Difference]: Without dead ends: 2193 [2018-07-23 13:39:43,679 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:39:43,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2018-07-23 13:39:45,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 1652. [2018-07-23 13:39:45,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2018-07-23 13:39:45,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2691 transitions. [2018-07-23 13:39:45,271 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2691 transitions. Word has length 23 [2018-07-23 13:39:45,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:45,271 INFO L471 AbstractCegarLoop]: Abstraction has 1652 states and 2691 transitions. [2018-07-23 13:39:45,271 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:39:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2691 transitions. [2018-07-23 13:39:45,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:39:45,272 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:45,272 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:45,272 INFO L414 AbstractCegarLoop]: === Iteration 148 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:45,272 INFO L82 PathProgramCache]: Analyzing trace with hash 170792271, now seen corresponding path program 2 times [2018-07-23 13:39:45,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:45,289 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:45,289 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:45,289 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:39:45,289 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:45,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:45,290 INFO L185 omatonBuilderFactory]: Interpolants [407822#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 407823#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 407820#(= product_end0 product_next), 407821#(and (= product_end0 product_begin1) (= product_end1 product_next)), 407818#true, 407819#false, 407830#(<= (+ product_end0 product_working0 3) (+ product_begin0 product_begin1)), 407831#(<= (+ product_working0 4) product_begin1), 407828#(<= (+ product_end0 2) product_begin1), 407829#(<= (+ product_end0 product_working0 2) (+ product_begin0 product_begin1)), 407826#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next)), 407827#(<= (+ product_end0 2) product_next), 407824#(<= (+ product_end0 1) product_next), 407825#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next)), 407832#(<= (+ product_working0 5) product_begin1), 407833#(<= (+ product_working0 5) product_working1)] [2018-07-23 13:39:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:45,290 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:39:45,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:39:45,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:39:45,290 INFO L87 Difference]: Start difference. First operand 1652 states and 2691 transitions. Second operand 16 states. [2018-07-23 13:39:47,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:47,360 INFO L93 Difference]: Finished difference Result 1928 states and 3135 transitions. [2018-07-23 13:39:47,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:39:47,360 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-07-23 13:39:47,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:47,362 INFO L225 Difference]: With dead ends: 1928 [2018-07-23 13:39:47,362 INFO L226 Difference]: Without dead ends: 1927 [2018-07-23 13:39:47,362 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:39:47,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2018-07-23 13:39:48,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1651. [2018-07-23 13:39:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1651 states. [2018-07-23 13:39:48,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2684 transitions. [2018-07-23 13:39:48,952 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2684 transitions. Word has length 23 [2018-07-23 13:39:48,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:48,952 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 2684 transitions. [2018-07-23 13:39:48,952 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:39:48,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2684 transitions. [2018-07-23 13:39:48,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:39:48,953 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:48,953 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:48,953 INFO L414 AbstractCegarLoop]: === Iteration 149 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:48,953 INFO L82 PathProgramCache]: Analyzing trace with hash 170791983, now seen corresponding path program 4 times [2018-07-23 13:39:48,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:48,967 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:48,967 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:39:48,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:48,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:48,968 INFO L185 omatonBuilderFactory]: Interpolants [415014#true, 415015#false, 415022#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next)), 415023#(<= (+ product_end0 2) product_next), 415020#(<= (+ product_end0 1) product_next), 415021#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next)), 415018#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 415019#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 415016#(= product_end0 product_next), 415017#(and (= product_end0 product_begin1) (= product_end1 product_next)), 415026#(<= (+ product_begin0 3) product_working1), 415027#(not (= product_working0 product_working1)), 415024#(<= (+ product_end0 2) product_begin1), 415025#(<= (+ product_begin0 3) product_begin1)] [2018-07-23 13:39:48,968 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:48,968 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:39:48,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:39:48,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:39:48,969 INFO L87 Difference]: Start difference. First operand 1651 states and 2684 transitions. Second operand 14 states. [2018-07-23 13:39:51,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:51,013 INFO L93 Difference]: Finished difference Result 1899 states and 3045 transitions. [2018-07-23 13:39:51,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:39:51,013 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-23 13:39:51,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:51,015 INFO L225 Difference]: With dead ends: 1899 [2018-07-23 13:39:51,015 INFO L226 Difference]: Without dead ends: 1897 [2018-07-23 13:39:51,016 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:39:51,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2018-07-23 13:39:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1441. [2018-07-23 13:39:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1441 states. [2018-07-23 13:39:52,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 2333 transitions. [2018-07-23 13:39:52,594 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 2333 transitions. Word has length 23 [2018-07-23 13:39:52,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:52,594 INFO L471 AbstractCegarLoop]: Abstraction has 1441 states and 2333 transitions. [2018-07-23 13:39:52,594 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:39:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 2333 transitions. [2018-07-23 13:39:52,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:39:52,595 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:52,595 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-23 13:39:52,595 INFO L414 AbstractCegarLoop]: === Iteration 150 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:52,595 INFO L82 PathProgramCache]: Analyzing trace with hash 162203814, now seen corresponding path program 2 times [2018-07-23 13:39:52,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:39:52,609 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:52,610 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:39:52,610 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:52,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:52,610 INFO L185 omatonBuilderFactory]: Interpolants [421742#true, 421743#false, 421750#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next)), 421751#(<= (+ product_end0 2) product_next), 421748#(<= (+ product_end0 1) product_next), 421749#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next)), 421746#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 421747#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 421744#(= product_end0 product_next), 421745#(and (= product_end0 product_begin1) (= product_end1 product_next)), 421756#(not (= product_working0 product_working1)), 421754#(or (<= (+ product_end0 3) product_begin0) (not (= product_working0 product_begin1))), 421755#(not (= product_working0 product_begin1)), 421752#(<= (+ product_end0 2) product_begin1), 421753#(or (<= (+ product_end0 2) product_begin0) (not (= product_working0 product_begin1)))] [2018-07-23 13:39:52,610 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:39:52,610 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:39:52,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:39:52,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:39:52,611 INFO L87 Difference]: Start difference. First operand 1441 states and 2333 transitions. Second operand 15 states. [2018-07-23 13:39:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:54,575 INFO L93 Difference]: Finished difference Result 1620 states and 2601 transitions. [2018-07-23 13:39:54,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:39:54,575 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-07-23 13:39:54,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:54,577 INFO L225 Difference]: With dead ends: 1620 [2018-07-23 13:39:54,577 INFO L226 Difference]: Without dead ends: 1619 [2018-07-23 13:39:54,578 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:39:54,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2018-07-23 13:39:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1439. [2018-07-23 13:39:56,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1439 states. [2018-07-23 13:39:56,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2328 transitions. [2018-07-23 13:39:56,130 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2328 transitions. Word has length 23 [2018-07-23 13:39:56,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:56,130 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 2328 transitions. [2018-07-23 13:39:56,130 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:39:56,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2328 transitions. [2018-07-23 13:39:56,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:39:56,131 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:56,131 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:56,131 INFO L414 AbstractCegarLoop]: === Iteration 151 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:56,131 INFO L82 PathProgramCache]: Analyzing trace with hash 162205096, now seen corresponding path program 2 times [2018-07-23 13:39:56,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:56,148 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:56,148 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:39:56,148 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:56,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:56,148 INFO L185 omatonBuilderFactory]: Interpolants [427910#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 427911#(<= (+ product_end0 1) product_next), 427908#(and (= product_end0 product_begin1) (= product_end1 product_next)), 427909#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 427906#false, 427907#(= product_end0 product_next), 427905#true, 427918#(not (= product_working0 product_working1)), 427916#(<= (+ product_begin0 3) product_begin1), 427917#(not (= product_working0 product_begin1)), 427914#(<= (+ product_end0 2) product_next), 427915#(<= (+ product_end0 2) product_begin1), 427912#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next)), 427913#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next))] [2018-07-23 13:39:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:56,149 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:39:56,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:39:56,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:39:56,149 INFO L87 Difference]: Start difference. First operand 1439 states and 2328 transitions. Second operand 14 states. [2018-07-23 13:39:58,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:58,206 INFO L93 Difference]: Finished difference Result 1661 states and 2663 transitions. [2018-07-23 13:39:58,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:39:58,206 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-23 13:39:58,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:58,208 INFO L225 Difference]: With dead ends: 1661 [2018-07-23 13:39:58,208 INFO L226 Difference]: Without dead ends: 1659 [2018-07-23 13:39:58,208 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:39:58,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2018-07-23 13:39:59,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1441. [2018-07-23 13:39:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1441 states. [2018-07-23 13:39:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 2330 transitions. [2018-07-23 13:39:59,761 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 2330 transitions. Word has length 23 [2018-07-23 13:39:59,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:59,761 INFO L471 AbstractCegarLoop]: Abstraction has 1441 states and 2330 transitions. [2018-07-23 13:39:59,761 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:39:59,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 2330 transitions. [2018-07-23 13:39:59,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:39:59,762 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:59,762 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:59,762 INFO L414 AbstractCegarLoop]: === Iteration 152 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:59,763 INFO L82 PathProgramCache]: Analyzing trace with hash 208964473, now seen corresponding path program 2 times [2018-07-23 13:39:59,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:59,783 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:59,783 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:39:59,784 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:59,784 INFO L185 omatonBuilderFactory]: Interpolants [434158#false, 434159#(= product_end0 product_next), 434157#true, 434166#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next)), 434167#(<= (+ product_begin0 3) product_next), 434164#(<= (+ product_begin0 2) product_next), 434165#(and (= product_end1 product_next) (<= (+ product_begin0 2) product_begin1)), 434162#(and (= product_end0 product_begin1) (<= (+ product_begin0 product_begin1 2) (+ product_end0 product_end1)) (= product_end1 product_next)), 434163#(and (<= (+ product_begin0 2) product_end1) (= product_end1 product_next)), 434160#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 434161#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0)), 434170#(<= (+ product_working0 4) product_begin1), 434171#(<= (+ product_working0 4) product_working1), 434168#(<= (+ product_begin0 3) product_begin1), 434169#(<= (+ product_working0 3) product_begin1)] [2018-07-23 13:39:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:59,784 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:39:59,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:39:59,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:39:59,785 INFO L87 Difference]: Start difference. First operand 1441 states and 2330 transitions. Second operand 15 states. [2018-07-23 13:40:02,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:02,406 INFO L93 Difference]: Finished difference Result 2002 states and 3222 transitions. [2018-07-23 13:40:02,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 13:40:02,406 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-07-23 13:40:02,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:02,408 INFO L225 Difference]: With dead ends: 2002 [2018-07-23 13:40:02,408 INFO L226 Difference]: Without dead ends: 2000 [2018-07-23 13:40:02,408 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=255, Invalid=1227, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:40:02,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2018-07-23 13:40:04,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1602. [2018-07-23 13:40:04,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1602 states. [2018-07-23 13:40:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2591 transitions. [2018-07-23 13:40:04,251 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2591 transitions. Word has length 23 [2018-07-23 13:40:04,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:04,251 INFO L471 AbstractCegarLoop]: Abstraction has 1602 states and 2591 transitions. [2018-07-23 13:40:04,252 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:40:04,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2591 transitions. [2018-07-23 13:40:04,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:40:04,252 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:04,252 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:04,253 INFO L414 AbstractCegarLoop]: === Iteration 153 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:40:04,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1117815128, now seen corresponding path program 1 times [2018-07-23 13:40:04,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:04,272 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:04,272 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:40:04,272 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:04,272 INFO L185 omatonBuilderFactory]: Interpolants [441440#(not (= product_working1 product_working0)), 441430#(and (<= product_end1 (+ product_workload product_begin1)) (= product_end1 product_next)), 441431#(and (<= (+ product_end0 product_end1) (+ product_workload product_next product_begin1)) (= product_end1 product_begin0)), 441428#true, 441429#false, 441438#(not (= product_working1 product_next)), 441439#(not (= product_working1 product_begin0)), 441436#(<= (+ product_working1 5) (+ product_workload product_next)), 441437#(and (not (= product_working1 product_end1)) (= product_end1 product_next)), 441434#(<= (+ (* 2 product_end1) 3) (+ product_workload product_next product_begin1)), 441435#(<= (+ product_begin1 5) (+ product_workload product_next)), 441432#(<= (+ product_end0 (* 2 product_end1) 1) (+ product_begin0 product_workload product_next product_begin1)), 441433#(<= (+ (* 2 product_end1) 2) (+ product_workload product_next product_begin1))] [2018-07-23 13:40:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:04,273 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:40:04,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:40:04,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:40:04,273 INFO L87 Difference]: Start difference. First operand 1602 states and 2591 transitions. Second operand 13 states. [2018-07-23 13:40:06,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:06,750 INFO L93 Difference]: Finished difference Result 1864 states and 2997 transitions. [2018-07-23 13:40:06,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 13:40:06,750 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-07-23 13:40:06,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:06,752 INFO L225 Difference]: With dead ends: 1864 [2018-07-23 13:40:06,752 INFO L226 Difference]: Without dead ends: 1862 [2018-07-23 13:40:06,753 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:40:06,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2018-07-23 13:40:08,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1671. [2018-07-23 13:40:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2018-07-23 13:40:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2717 transitions. [2018-07-23 13:40:08,652 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2717 transitions. Word has length 23 [2018-07-23 13:40:08,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:08,652 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2717 transitions. [2018-07-23 13:40:08,652 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:40:08,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2717 transitions. [2018-07-23 13:40:08,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:40:08,653 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:08,653 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-23 13:40:08,653 INFO L414 AbstractCegarLoop]: === Iteration 154 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:40:08,653 INFO L82 PathProgramCache]: Analyzing trace with hash -821177279, now seen corresponding path program 2 times [2018-07-23 13:40:08,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:08,671 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:08,671 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:40:08,671 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:08,671 INFO L185 omatonBuilderFactory]: Interpolants [448578#(not (= product_working0 product_working1)), 448576#(not (= product_working0 product_next)), 448577#(not (= product_working0 product_begin1)), 448566#(and (= product_end0 product_begin1) (= product_end1 product_next)), 448567#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 448564#false, 448565#(= product_end0 product_next), 448563#true, 448574#(and (or (= product_working0 product_end1) (= product_end1 product_next)) (or (not (= product_working0 product_end1)) (<= (+ product_working0 3) product_begin1))), 448575#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 448572#(and (<= (+ product_working0 2) product_begin0) (= product_end0 product_next)), 448573#(<= (+ product_working0 3) product_next), 448570#(<= (+ product_begin0 2) product_next), 448571#(<= (+ product_working0 2) product_next), 448568#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 448569#(<= (+ product_end0 1) product_next)] [2018-07-23 13:40:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:08,672 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:40:08,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:40:08,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:40:08,672 INFO L87 Difference]: Start difference. First operand 1671 states and 2717 transitions. Second operand 16 states. [2018-07-23 13:40:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:10,841 INFO L93 Difference]: Finished difference Result 1740 states and 2811 transitions. [2018-07-23 13:40:10,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 13:40:10,841 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-07-23 13:40:10,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:10,843 INFO L225 Difference]: With dead ends: 1740 [2018-07-23 13:40:10,843 INFO L226 Difference]: Without dead ends: 1739 [2018-07-23 13:40:10,844 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=373, Invalid=1697, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 13:40:10,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2018-07-23 13:40:12,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1613. [2018-07-23 13:40:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2018-07-23 13:40:12,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2622 transitions. [2018-07-23 13:40:12,777 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2622 transitions. Word has length 25 [2018-07-23 13:40:12,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:12,777 INFO L471 AbstractCegarLoop]: Abstraction has 1613 states and 2622 transitions. [2018-07-23 13:40:12,777 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:40:12,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2622 transitions. [2018-07-23 13:40:12,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:40:12,778 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:12,778 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:12,778 INFO L414 AbstractCegarLoop]: === Iteration 155 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:40:12,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1822640705, now seen corresponding path program 1 times [2018-07-23 13:40:12,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:12,793 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:12,793 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:12,793 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:40:12,793 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:12,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:12,794 INFO L185 omatonBuilderFactory]: Interpolants [455350#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 455351#(<= (+ product_end0 1) product_next), 455348#(and (= product_end0 product_begin1) (= product_end1 product_next)), 455349#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 455346#false, 455347#(= product_end0 product_next), 455345#true, 455358#(<= (+ product_working0 4) product_begin1), 455359#(<= (+ product_working0 4) product_working1), 455356#(and (<= (+ product_end0 product_working0 3) (+ product_end1 product_next)) (= product_end1 product_begin0)), 455357#(<= (+ product_working0 4) product_next), 455354#(and (<= (+ product_working0 2) product_begin1) (= product_end1 product_next)), 455355#(and (= product_end1 product_next) (<= (+ product_working0 3) product_end1)), 455352#(<= (+ product_begin0 2) product_next), 455353#(<= (+ product_working0 2) product_next)] [2018-07-23 13:40:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:12,794 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:40:12,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:40:12,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:40:12,794 INFO L87 Difference]: Start difference. First operand 1613 states and 2622 transitions. Second operand 15 states. [2018-07-23 13:40:14,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:14,961 INFO L93 Difference]: Finished difference Result 1786 states and 2897 transitions. [2018-07-23 13:40:14,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:40:14,961 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-07-23 13:40:14,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:14,963 INFO L225 Difference]: With dead ends: 1786 [2018-07-23 13:40:14,963 INFO L226 Difference]: Without dead ends: 1785 [2018-07-23 13:40:14,964 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:40:14,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2018-07-23 13:40:16,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1655. [2018-07-23 13:40:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2018-07-23 13:40:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2692 transitions. [2018-07-23 13:40:16,855 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2692 transitions. Word has length 25 [2018-07-23 13:40:16,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:16,855 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2692 transitions. [2018-07-23 13:40:16,855 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:40:16,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2692 transitions. [2018-07-23 13:40:16,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:40:16,856 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:16,857 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-23 13:40:16,857 INFO L414 AbstractCegarLoop]: === Iteration 156 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:40:16,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1372501011, now seen corresponding path program 3 times [2018-07-23 13:40:16,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:16,881 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:16,881 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:40:16,881 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:16,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:16,881 INFO L185 omatonBuilderFactory]: Interpolants [462279#(and (= product_end0 product_begin1) (= product_end1 product_next)), 462278#(= product_end0 product_next), 462277#false, 462276#true, 462287#(<= (+ product_working0 3) product_next), 462286#(<= (+ product_begin0 3) product_next), 462285#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next)), 462284#(and (= product_end1 product_next) (<= (+ product_begin0 2) product_begin1)), 462283#(<= (+ product_begin0 2) product_next), 462282#(<= (+ product_end0 1) product_next), 462281#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 462280#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 462291#(not (= product_working0 product_working1)), 462290#(not (= product_working0 product_begin1)), 462289#(not (= product_working0 product_next)), 462288#(and (or (not (= product_working0 product_end0)) (<= (+ product_working0 3) product_begin0)) (or (= product_working0 product_end0) (= product_end0 product_next)))] [2018-07-23 13:40:16,882 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:16,882 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:40:16,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:40:16,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:40:16,882 INFO L87 Difference]: Start difference. First operand 1655 states and 2692 transitions. Second operand 16 states. [2018-07-23 13:40:19,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:19,705 INFO L93 Difference]: Finished difference Result 2034 states and 3278 transitions. [2018-07-23 13:40:19,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 13:40:19,705 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-07-23 13:40:19,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:19,707 INFO L225 Difference]: With dead ends: 2034 [2018-07-23 13:40:19,707 INFO L226 Difference]: Without dead ends: 2033 [2018-07-23 13:40:19,708 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=473, Invalid=3187, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 13:40:19,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2018-07-23 13:40:21,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 1671. [2018-07-23 13:40:21,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2018-07-23 13:40:21,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2720 transitions. [2018-07-23 13:40:21,643 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2720 transitions. Word has length 25 [2018-07-23 13:40:21,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:21,643 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2720 transitions. [2018-07-23 13:40:21,643 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:40:21,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2720 transitions. [2018-07-23 13:40:21,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:40:21,644 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:21,644 INFO L357 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:21,645 INFO L414 AbstractCegarLoop]: === Iteration 157 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:40:21,645 INFO L82 PathProgramCache]: Analyzing trace with hash -532386214, now seen corresponding path program 6 times [2018-07-23 13:40:21,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:21,673 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:21,674 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:21,674 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 13:40:21,674 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:21,674 INFO L185 omatonBuilderFactory]: Interpolants [469799#(<= (+ product_end0 product_working0 1) (+ product_begin0 product_next)), 469798#(<= (+ product_end0 1) product_next), 469797#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 469796#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 469795#(and (= product_end0 product_begin1) (= product_end1 product_next)), 469794#(= product_end0 product_next), 469793#false, 469792#true, 469807#(not (= product_working0 product_next)), 469806#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 469805#(and (or (not (= product_working0 product_end1)) (<= (+ product_working0 4) product_begin1)) (or (= product_working0 product_end1) (= product_end1 product_next))), 469804#(<= (+ product_working0 4) product_next), 469803#(and (<= (+ product_working0 4) product_end1) (= product_end1 product_next)), 469802#(and (<= (+ product_working0 3) product_begin1) (= product_end1 product_next)), 469801#(<= (+ product_working0 3) product_next), 469800#(<= (+ product_end0 product_working0 2) (+ product_begin0 product_next)), 469809#(not (= product_working0 product_working1)), 469808#(not (= product_working0 product_begin1))] [2018-07-23 13:40:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:21,674 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 13:40:21,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 13:40:21,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:40:21,675 INFO L87 Difference]: Start difference. First operand 1671 states and 2720 transitions. Second operand 18 states. [2018-07-23 13:40:23,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:23,862 INFO L93 Difference]: Finished difference Result 1747 states and 2831 transitions. [2018-07-23 13:40:23,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 13:40:23,862 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-07-23 13:40:23,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:23,864 INFO L225 Difference]: With dead ends: 1747 [2018-07-23 13:40:23,864 INFO L226 Difference]: Without dead ends: 1746 [2018-07-23 13:40:23,865 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=265, Invalid=1217, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:40:23,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2018-07-23 13:40:25,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1673. [2018-07-23 13:40:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1673 states. [2018-07-23 13:40:25,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2721 transitions. [2018-07-23 13:40:25,808 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2721 transitions. Word has length 25 [2018-07-23 13:40:25,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:25,808 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 2721 transitions. [2018-07-23 13:40:25,808 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 13:40:25,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2721 transitions. [2018-07-23 13:40:25,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:40:25,809 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:25,809 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:25,809 INFO L414 AbstractCegarLoop]: === Iteration 158 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:40:25,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1681122916, now seen corresponding path program 2 times [2018-07-23 13:40:25,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:25,830 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:25,830 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 13:40:25,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:25,830 INFO L185 omatonBuilderFactory]: Interpolants [476708#(not (= product_working0 product_working1)), 476707#(not (= product_working0 product_begin1)), 476706#(not (= product_working0 product_next)), 476705#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 476704#(and (or (= product_working0 product_end1) (= product_end1 product_next)) (or (not (= product_working0 product_end1)) (<= (+ product_working0 3) product_begin1))), 476695#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 476694#(= product_end0 product_next), 476693#false, 476692#true, 476703#(<= (+ product_working0 3) product_next), 476702#(and (= product_end1 product_next) (<= (+ product_working0 3) product_end1)), 476701#(and (<= (+ product_working0 2) product_begin1) (= product_end1 product_next)), 476700#(<= (+ product_working0 2) product_next), 476699#(<= (+ product_begin0 2) product_next), 476698#(and (<= (+ product_begin0 2) product_end1) (= product_end1 product_next)), 476697#(and (= product_end0 product_begin1) (<= (+ product_begin0 product_begin1 2) (+ product_end0 product_end1)) (= product_end1 product_next)), 476696#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0))] [2018-07-23 13:40:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:25,831 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 13:40:25,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 13:40:25,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:40:25,831 INFO L87 Difference]: Start difference. First operand 1673 states and 2721 transitions. Second operand 17 states. [2018-07-23 13:40:28,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:28,179 INFO L93 Difference]: Finished difference Result 1789 states and 2888 transitions. [2018-07-23 13:40:28,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 13:40:28,179 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-07-23 13:40:28,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:28,181 INFO L225 Difference]: With dead ends: 1789 [2018-07-23 13:40:28,181 INFO L226 Difference]: Without dead ends: 1787 [2018-07-23 13:40:28,181 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=260, Invalid=1546, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 13:40:28,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-07-23 13:40:30,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1641. [2018-07-23 13:40:30,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1641 states. [2018-07-23 13:40:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2669 transitions. [2018-07-23 13:40:30,110 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2669 transitions. Word has length 25 [2018-07-23 13:40:30,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:30,110 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 2669 transitions. [2018-07-23 13:40:30,110 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 13:40:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2669 transitions. [2018-07-23 13:40:30,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:40:30,111 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:30,111 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-23 13:40:30,112 INFO L414 AbstractCegarLoop]: === Iteration 159 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:40:30,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1832810091, now seen corresponding path program 4 times [2018-07-23 13:40:30,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:30,127 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:30,127 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:40:30,127 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:30,127 INFO L185 omatonBuilderFactory]: Interpolants [483623#(= product_end0 product_next), 483622#false, 483621#true, 483631#(<= (+ product_begin0 3) product_next), 483630#(<= (+ product_end0 2) product_next), 483629#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next)), 483628#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next)), 483627#(<= (+ product_end0 1) product_next), 483626#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 483625#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 483624#(and (= product_end0 product_begin1) (= product_end1 product_next)), 483636#(not (= product_working0 product_working1)), 483635#(not (= product_working0 product_begin1)), 483634#(not (= product_working0 product_next)), 483633#(and (or (not (= product_working0 product_end0)) (<= (+ product_working0 3) product_begin0)) (or (= product_working0 product_end0) (= product_end0 product_next))), 483632#(<= (+ product_working0 3) product_next)] [2018-07-23 13:40:30,128 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:30,128 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:40:30,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:40:30,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:40:30,128 INFO L87 Difference]: Start difference. First operand 1641 states and 2669 transitions. Second operand 16 states. [2018-07-23 13:40:32,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:32,609 INFO L93 Difference]: Finished difference Result 1864 states and 3013 transitions. [2018-07-23 13:40:32,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 13:40:32,610 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-07-23 13:40:32,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:32,612 INFO L225 Difference]: With dead ends: 1864 [2018-07-23 13:40:32,612 INFO L226 Difference]: Without dead ends: 1862 [2018-07-23 13:40:32,612 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=330, Invalid=1562, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 13:40:32,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2018-07-23 13:40:34,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1610. [2018-07-23 13:40:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2018-07-23 13:40:34,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2618 transitions. [2018-07-23 13:40:34,517 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2618 transitions. Word has length 25 [2018-07-23 13:40:34,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:34,517 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 2618 transitions. [2018-07-23 13:40:34,517 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:40:34,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2618 transitions. [2018-07-23 13:40:34,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:40:34,518 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:34,518 INFO L357 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:34,518 INFO L414 AbstractCegarLoop]: === Iteration 160 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:40:34,518 INFO L82 PathProgramCache]: Analyzing trace with hash -72077134, now seen corresponding path program 7 times [2018-07-23 13:40:34,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:34,546 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:34,546 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 13:40:34,546 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:34,547 INFO L185 omatonBuilderFactory]: Interpolants [490658#(not (= product_working0 product_working1)), 490657#(not (= product_working0 product_begin1)), 490656#(not (= product_working0 product_next)), 490647#(<= (+ product_end0 1) product_next), 490646#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 490645#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 490644#(and (= product_end0 product_begin1) (= product_end1 product_next)), 490643#(= product_end0 product_next), 490642#false, 490641#true, 490655#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 490654#(and (or (not (= product_working0 product_end1)) (<= (+ product_working0 4) product_begin1)) (or (= product_working0 product_end1) (= product_end1 product_next))), 490653#(<= (+ product_working0 4) product_next), 490652#(<= (+ product_end0 product_working0 3) (+ product_begin0 product_next)), 490651#(<= (+ product_end0 product_working0 2) (+ product_begin0 product_next)), 490650#(<= (+ product_end0 2) product_next), 490649#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next)), 490648#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next))] [2018-07-23 13:40:34,547 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:34,547 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 13:40:34,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 13:40:34,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:40:34,547 INFO L87 Difference]: Start difference. First operand 1610 states and 2618 transitions. Second operand 18 states. [2018-07-23 13:40:36,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:36,921 INFO L93 Difference]: Finished difference Result 1778 states and 2887 transitions. [2018-07-23 13:40:36,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 13:40:36,922 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-07-23 13:40:36,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:36,923 INFO L225 Difference]: With dead ends: 1778 [2018-07-23 13:40:36,924 INFO L226 Difference]: Without dead ends: 1777 [2018-07-23 13:40:36,924 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=312, Invalid=1328, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 13:40:36,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2018-07-23 13:40:38,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1650. [2018-07-23 13:40:38,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1650 states. [2018-07-23 13:40:38,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2682 transitions. [2018-07-23 13:40:38,865 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2682 transitions. Word has length 25 [2018-07-23 13:40:38,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:38,866 INFO L471 AbstractCegarLoop]: Abstraction has 1650 states and 2682 transitions. [2018-07-23 13:40:38,866 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 13:40:38,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2682 transitions. [2018-07-23 13:40:38,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:40:38,866 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:38,867 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:38,867 INFO L414 AbstractCegarLoop]: === Iteration 161 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:40:38,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1741678744, now seen corresponding path program 3 times [2018-07-23 13:40:38,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:38,884 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:38,884 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 13:40:38,884 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:38,884 INFO L185 omatonBuilderFactory]: Interpolants [497575#(<= (+ product_working0 4) product_begin1), 497574#(<= (+ product_working0 4) product_next), 497573#(and (= product_end0 product_next) (<= (+ product_working0 3) product_begin0)), 497572#(<= (+ product_working0 3) product_next), 497571#(<= (+ product_begin0 3) product_next), 497570#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next)), 497569#(and (= product_end1 product_next) (<= (+ product_begin0 2) product_begin1)), 497568#(<= (+ product_begin0 2) product_next), 497577#(<= (+ product_working0 5) product_working1), 497576#(<= (+ product_working0 5) product_begin1), 497567#(and (<= (+ product_begin0 2) product_end1) (= product_end1 product_next)), 497566#(and (= product_end0 product_begin1) (<= (+ product_begin0 product_begin1 2) (+ product_end0 product_end1)) (= product_end1 product_next)), 497565#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0)), 497564#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 497563#(= product_end0 product_next), 497562#false, 497561#true] [2018-07-23 13:40:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:38,884 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 13:40:38,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 13:40:38,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:40:38,885 INFO L87 Difference]: Start difference. First operand 1650 states and 2682 transitions. Second operand 17 states. [2018-07-23 13:40:41,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:41,184 INFO L93 Difference]: Finished difference Result 1836 states and 2973 transitions. [2018-07-23 13:40:41,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:40:41,184 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-07-23 13:40:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:41,187 INFO L225 Difference]: With dead ends: 1836 [2018-07-23 13:40:41,187 INFO L226 Difference]: Without dead ends: 1835 [2018-07-23 13:40:41,187 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:40:41,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2018-07-23 13:40:43,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1762. [2018-07-23 13:40:43,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2018-07-23 13:40:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2868 transitions. [2018-07-23 13:40:43,291 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2868 transitions. Word has length 25 [2018-07-23 13:40:43,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:43,291 INFO L471 AbstractCegarLoop]: Abstraction has 1762 states and 2868 transitions. [2018-07-23 13:40:43,291 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 13:40:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2868 transitions. [2018-07-23 13:40:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:40:43,292 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:43,292 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:43,292 INFO L414 AbstractCegarLoop]: === Iteration 162 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:40:43,292 INFO L82 PathProgramCache]: Analyzing trace with hash -463321892, now seen corresponding path program 3 times [2018-07-23 13:40:43,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:43,311 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:43,312 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:43,312 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 13:40:43,312 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:43,312 INFO L185 omatonBuilderFactory]: Interpolants [504807#false, 504806#true, 504815#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next)), 504814#(and (= product_end1 product_next) (<= (+ product_begin0 2) product_begin1)), 504813#(<= (+ product_begin0 2) product_next), 504812#(and (<= (+ product_begin0 2) product_end1) (= product_end1 product_next)), 504811#(and (= product_end0 product_begin1) (<= (+ product_begin0 product_begin1 2) (+ product_end0 product_end1)) (= product_end1 product_next)), 504810#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0)), 504809#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 504808#(= product_end0 product_next), 504822#(not (= product_working0 product_working1)), 504821#(not (= product_working0 product_begin1)), 504820#(not (= product_working0 product_next)), 504819#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 504818#(and (or (= product_working0 product_end1) (= product_end1 product_next)) (or (not (= product_working0 product_end1)) (<= (+ product_working0 3) product_begin1))), 504817#(<= (+ product_working0 3) product_next), 504816#(<= (+ product_begin0 3) product_next)] [2018-07-23 13:40:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:43,312 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 13:40:43,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 13:40:43,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:40:43,313 INFO L87 Difference]: Start difference. First operand 1762 states and 2868 transitions. Second operand 17 states. [2018-07-23 13:40:46,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:46,305 INFO L93 Difference]: Finished difference Result 2066 states and 3329 transitions. [2018-07-23 13:40:46,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 13:40:46,305 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-07-23 13:40:46,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:46,308 INFO L225 Difference]: With dead ends: 2066 [2018-07-23 13:40:46,308 INFO L226 Difference]: Without dead ends: 2064 [2018-07-23 13:40:46,308 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=390, Invalid=2366, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 13:40:46,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2018-07-23 13:40:48,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1772. [2018-07-23 13:40:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-07-23 13:40:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2884 transitions. [2018-07-23 13:40:48,491 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2884 transitions. Word has length 25 [2018-07-23 13:40:48,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:48,491 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2884 transitions. [2018-07-23 13:40:48,491 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 13:40:48,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2884 transitions. [2018-07-23 13:40:48,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:40:48,492 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:48,492 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:48,492 INFO L414 AbstractCegarLoop]: === Iteration 163 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:40:48,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1911500712, now seen corresponding path program 1 times [2018-07-23 13:40:48,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:48,507 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:48,507 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:48,507 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:40:48,507 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:48,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:48,507 INFO L185 omatonBuilderFactory]: Interpolants [512583#(<= (+ product_working1 4) product_begin0), 512582#(<= (+ product_working1 3) product_begin0), 512581#(<= (+ product_working1 3) product_next), 512580#(and (<= (+ product_working1 3) product_end0) (= product_end0 product_next)), 512579#(and (<= (+ product_working1 2) product_begin0) (= product_end0 product_next)), 512578#(<= (+ product_working1 2) product_next), 512577#(and (<= (+ product_begin0 product_working1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 512576#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 512584#(<= (+ product_working1 4) product_working0), 512575#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0)), 512574#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 512573#(= product_end1 product_next), 512572#false, 512571#true] [2018-07-23 13:40:48,507 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:48,508 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:40:48,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:40:48,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:40:48,508 INFO L87 Difference]: Start difference. First operand 1772 states and 2884 transitions. Second operand 14 states. [2018-07-23 13:40:50,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:50,873 INFO L93 Difference]: Finished difference Result 1956 states and 3171 transitions. [2018-07-23 13:40:50,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 13:40:50,873 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-07-23 13:40:50,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:50,876 INFO L225 Difference]: With dead ends: 1956 [2018-07-23 13:40:50,876 INFO L226 Difference]: Without dead ends: 1955 [2018-07-23 13:40:50,876 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:40:50,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2018-07-23 13:40:53,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1793. [2018-07-23 13:40:53,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2018-07-23 13:40:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2918 transitions. [2018-07-23 13:40:53,106 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2918 transitions. Word has length 25 [2018-07-23 13:40:53,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:53,106 INFO L471 AbstractCegarLoop]: Abstraction has 1793 states and 2918 transitions. [2018-07-23 13:40:53,106 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:40:53,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2918 transitions. [2018-07-23 13:40:53,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:40:53,107 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:53,107 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:53,107 INFO L414 AbstractCegarLoop]: === Iteration 164 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:40:53,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1586218584, now seen corresponding path program 1 times [2018-07-23 13:40:53,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:53,125 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:53,125 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:40:53,125 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:53,125 INFO L185 omatonBuilderFactory]: Interpolants [520135#(<= (+ product_working1 5) product_begin0), 520134#(<= (+ product_working1 4) product_begin0), 520133#(<= (+ product_working1 4) product_next), 520132#(and (<= (+ product_working1 3) product_begin1) (= product_end1 product_next)), 520131#(<= (+ product_working1 3) product_next), 520130#(and (<= (+ product_working1 3) product_end0) (= product_end0 product_next)), 520129#(and (<= (+ product_working1 2) product_begin0) (= product_end0 product_next)), 520128#(<= (+ product_working1 2) product_next), 520136#(<= (+ product_working1 5) product_working0), 520127#(and (<= (+ product_begin0 product_working1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 520126#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 520125#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0)), 520124#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 520123#(= product_end1 product_next), 520122#false, 520121#true] [2018-07-23 13:40:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:53,125 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:40:53,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:40:53,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:40:53,126 INFO L87 Difference]: Start difference. First operand 1793 states and 2918 transitions. Second operand 16 states. [2018-07-23 13:40:55,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:55,508 INFO L93 Difference]: Finished difference Result 1932 states and 3141 transitions. [2018-07-23 13:40:55,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:40:55,508 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-07-23 13:40:55,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:55,510 INFO L225 Difference]: With dead ends: 1932 [2018-07-23 13:40:55,510 INFO L226 Difference]: Without dead ends: 1931 [2018-07-23 13:40:55,511 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:40:55,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2018-07-23 13:40:57,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1891. [2018-07-23 13:40:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1891 states. [2018-07-23 13:40:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 3080 transitions. [2018-07-23 13:40:57,801 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 3080 transitions. Word has length 25 [2018-07-23 13:40:57,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:57,801 INFO L471 AbstractCegarLoop]: Abstraction has 1891 states and 3080 transitions. [2018-07-23 13:40:57,801 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:40:57,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 3080 transitions. [2018-07-23 13:40:57,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:40:57,803 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:57,803 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:57,803 INFO L414 AbstractCegarLoop]: === Iteration 165 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:40:57,803 INFO L82 PathProgramCache]: Analyzing trace with hash -209412774, now seen corresponding path program 1 times [2018-07-23 13:40:57,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:57,826 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:57,826 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:40:57,826 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:57,827 INFO L185 omatonBuilderFactory]: Interpolants [527816#(and (<= (+ product_working1 3) product_end0) (= product_end0 product_next)), 527817#(<= (+ product_working1 3) product_next), 527818#(<= (+ product_working1 3) product_begin0), 527819#(<= (+ product_working1 4) product_begin0), 527820#(<= (+ product_working1 4) product_working0), 527808#false, 527809#(= product_end1 product_next), 527810#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 527811#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0)), 527812#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 527813#(<= (+ product_begin1 2) product_next), 527814#(<= (+ product_working1 2) product_next), 527815#(and (<= (+ product_working1 2) product_begin0) (= product_end0 product_next)), 527807#true] [2018-07-23 13:40:57,827 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:57,827 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:40:57,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:40:57,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:40:57,827 INFO L87 Difference]: Start difference. First operand 1891 states and 3080 transitions. Second operand 14 states. [2018-07-23 13:41:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:00,480 INFO L93 Difference]: Finished difference Result 2086 states and 3386 transitions. [2018-07-23 13:41:00,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:41:00,481 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-07-23 13:41:00,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:00,483 INFO L225 Difference]: With dead ends: 2086 [2018-07-23 13:41:00,483 INFO L226 Difference]: Without dead ends: 2085 [2018-07-23 13:41:00,484 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:41:00,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2018-07-23 13:41:02,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1866. [2018-07-23 13:41:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1866 states. [2018-07-23 13:41:02,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 3042 transitions. [2018-07-23 13:41:02,790 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 3042 transitions. Word has length 25 [2018-07-23 13:41:02,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:02,790 INFO L471 AbstractCegarLoop]: Abstraction has 1866 states and 3042 transitions. [2018-07-23 13:41:02,790 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:41:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 3042 transitions. [2018-07-23 13:41:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:41:02,791 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:02,791 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:41:02,791 INFO L414 AbstractCegarLoop]: === Iteration 166 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:41:02,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1006660774, now seen corresponding path program 1 times [2018-07-23 13:41:02,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:02,807 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:02,807 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:02,807 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:41:02,808 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:02,808 INFO L185 omatonBuilderFactory]: Interpolants [535776#(and (<= (+ product_working1 3) product_begin1) (= product_end1 product_next)), 535777#(<= (+ product_working1 4) product_next), 535778#(<= (+ product_working1 4) product_begin0), 535779#(<= (+ product_working1 5) product_begin0), 535780#(<= (+ product_working1 5) product_working0), 535768#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 535769#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0)), 535770#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0)), 535771#(<= (+ product_begin1 2) product_next), 535772#(<= (+ product_working1 2) product_next), 535773#(and (<= (+ product_working1 2) product_begin0) (= product_end0 product_next)), 535774#(and (<= (+ product_working1 3) product_end0) (= product_end0 product_next)), 535775#(<= (+ product_working1 3) product_next), 535765#true, 535766#false, 535767#(= product_end1 product_next)] [2018-07-23 13:41:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:02,808 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:41:02,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:41:02,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:41:02,809 INFO L87 Difference]: Start difference. First operand 1866 states and 3042 transitions. Second operand 16 states. [2018-07-23 13:41:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:05,216 INFO L93 Difference]: Finished difference Result 1936 states and 3146 transitions. [2018-07-23 13:41:05,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:41:05,216 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-07-23 13:41:05,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:05,218 INFO L225 Difference]: With dead ends: 1936 [2018-07-23 13:41:05,218 INFO L226 Difference]: Without dead ends: 1935 [2018-07-23 13:41:05,219 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:41:05,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2018-07-23 13:41:07,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1796. [2018-07-23 13:41:07,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1796 states. [2018-07-23 13:41:07,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2921 transitions. [2018-07-23 13:41:07,431 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2921 transitions. Word has length 25 [2018-07-23 13:41:07,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:07,431 INFO L471 AbstractCegarLoop]: Abstraction has 1796 states and 2921 transitions. [2018-07-23 13:41:07,431 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:41:07,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2921 transitions. [2018-07-23 13:41:07,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 13:41:07,432 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:07,432 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:41:07,432 INFO L414 AbstractCegarLoop]: === Iteration 167 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:41:07,432 INFO L82 PathProgramCache]: Analyzing trace with hash -624347648, now seen corresponding path program 3 times [2018-07-23 13:41:07,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-23 13:41:07,444 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:07,444 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:41:07,445 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:07,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:07,445 INFO L185 omatonBuilderFactory]: Interpolants [543275#true, 543276#false, 543277#(= product_end0 product_next), 543278#(and (= product_end0 product_begin1) (= product_end1 product_next)), 543279#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1)), 543288#(not (= product_working0 product_working1)), 543280#(and (= product_end1 product_next) (<= (+ product_end0 1) product_end1)), 543281#(<= (+ product_end0 1) product_next), 543282#(<= (+ product_begin0 2) product_next), 543283#(and (= product_end1 product_next) (<= (+ product_begin0 2) product_begin1)), 543284#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next)), 543285#(<= (+ product_begin0 3) product_next), 543286#(<= (+ product_begin0 3) product_begin1), 543287#(<= (+ product_begin0 3) product_working1)] [2018-07-23 13:41:07,445 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-23 13:41:07,445 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:41:07,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:41:07,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:41:07,445 INFO L87 Difference]: Start difference. First operand 1796 states and 2921 transitions. Second operand 14 states. Received shutdown request... [2018-07-23 13:41:10,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 13:41:10,170 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-23 13:41:10,178 WARN L202 ceAbstractionStarter]: Timeout [2018-07-23 13:41:10,179 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:41:10 BoogieIcfgContainer [2018-07-23 13:41:10,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:41:10,180 INFO L168 Benchmark]: Toolchain (without parser) took 254720.11 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 824.2 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 285.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-07-23 13:41:10,181 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:41:10,182 INFO L168 Benchmark]: Boogie Preprocessor took 54.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:41:10,182 INFO L168 Benchmark]: RCFGBuilder took 299.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 13:41:10,182 INFO L168 Benchmark]: TraceAbstraction took 254361.61 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 824.2 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 275.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-07-23 13:41:10,185 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 299.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 254361.61 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 824.2 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 275.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 94). Cancelled while BasicCegarLoop was constructing difference of abstraction (1796states) and interpolant automaton (currently 39 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (1594 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 45). Cancelled while BasicCegarLoop was constructing difference of abstraction (1796states) and interpolant automaton (currently 39 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (1594 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 74). Cancelled while BasicCegarLoop was constructing difference of abstraction (1796states) and interpolant automaton (currently 39 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (1594 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 85). Cancelled while BasicCegarLoop was constructing difference of abstraction (1796states) and interpolant automaton (currently 39 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (1594 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 4 error locations. TIMEOUT Result, 254.2s OverallTime, 167 OverallIterations, 4 TraceHistogramMax, 144.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6260 SDtfs, 16399 SDslu, 15990 SDs, 0 SdLazy, 95985 SolverSat, 6704 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3913 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 3763 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22543 ImplicationChecksByTransitivity, 5.7s Time, 0.1s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1891occurred in iteration=164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 276/1493 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 106.0s AutomataMinimizationTime, 166 MinimizatonAttempts, 15973 StatesRemovedByMinimization, 163 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2883 NumberOfCodeBlocks, 2883 NumberOfCodeBlocksAsserted, 167 NumberOfCheckSat, 2716 ConstructedInterpolants, 0 QuantifiedInterpolants, 299247 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 167 InterpolantComputations, 10 PerfectInterpolantSequences, 276/1493 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-41-10-197.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-41-10-197.csv Completed graceful shutdown