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_WithProcedures.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:36:58,103 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:36:58,105 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:36:58,123 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:36:58,124 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:36:58,125 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:36:58,126 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:36:58,128 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:36:58,131 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:36:58,133 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:36:58,134 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:36:58,135 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:36:58,136 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:36:58,139 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:36:58,142 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:36:58,143 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:36:58,144 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:36:58,154 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:36:58,159 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:36:58,161 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:36:58,164 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:36:58,165 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:36:58,169 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:36:58,172 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:36:58,172 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:36:58,174 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:36:58,175 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:36:58,176 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:36:58,177 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:36:58,178 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:36:58,180 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:36:58,181 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:36:58,182 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:36:58,182 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:36:58,183 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:36:58,185 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:36:58,186 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:58,210 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:36:58,210 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:36:58,212 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:36:58,212 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:36:58,213 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:36:58,213 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:36:58,213 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:36:58,214 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:36:58,275 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:36:58,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:36:58,298 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:36:58,300 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:36:58,300 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:36:58,301 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl [2018-07-23 13:36:58,302 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl' [2018-07-23 13:36:58,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:36:58,365 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:36:58,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:36:58,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:36:58,367 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:36:58,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:58" (1/1) ... [2018-07-23 13:36:58,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:58" (1/1) ... [2018-07-23 13:36:58,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:58" (1/1) ... [2018-07-23 13:36:58,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:58" (1/1) ... [2018-07-23 13:36:58,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:58" (1/1) ... [2018-07-23 13:36:58,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:58" (1/1) ... [2018-07-23 13:36:58,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:58" (1/1) ... [2018-07-23 13:36:58,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:36:58,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:36:58,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:36:58,422 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:36:58,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:58" (1/1) ... [2018-07-23 13:36:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure l0l0 [2018-07-23 13:36:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure l1l0 [2018-07-23 13:36:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure l0l1 [2018-07-23 13:36:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure l1l1 [2018-07-23 13:36:58,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:36:58,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:36:58,509 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l0 [2018-07-23 13:36:58,509 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l0 [2018-07-23 13:36:58,509 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l1 [2018-07-23 13:36:58,510 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l1 [2018-07-23 13:36:58,732 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:36:58,734 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:36:58 BoogieIcfgContainer [2018-07-23 13:36:58,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:36:58,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:36:58,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:36:58,741 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:36:58,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:58" (1/2) ... [2018-07-23 13:36:58,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745f2aa8 and model type threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:36:58, skipping insertion in model container [2018-07-23 13:36:58,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:36:58" (2/2) ... [2018-07-23 13:36:58,746 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithProcedures.bpl [2018-07-23 13:36:58,756 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:36:58,766 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-07-23 13:36:58,814 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:36:58,815 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:36:58,816 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:36:58,816 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:36:58,816 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:36:58,816 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:36:58,816 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:36:58,817 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:36:58,817 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:36:58,835 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-07-23 13:36:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:36:58,845 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:58,846 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:58,847 INFO L414 AbstractCegarLoop]: === Iteration 1 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:36:58,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1282157605, now seen corresponding path program 1 times [2018-07-23 13:36:58,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:59,008 INFO L134 CoverageAnalysis]: 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,011 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:59,011 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-23 13:36:59,013 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:59,014 INFO L134 CoverageAnalysis]: 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,015 INFO L185 omatonBuilderFactory]: Interpolants [51#true, 52#false, 53#(<= (+ working1 1) next), 54#(not (= working1 next)), 55#(not (= working1 iter0)), 56#(not (= working1 working0))] [2018-07-23 13:36:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,016 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:36:59,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:36:59,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:36:59,032 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 6 states. [2018-07-23 13:36:59,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:59,277 INFO L93 Difference]: Finished difference Result 72 states and 100 transitions. [2018-07-23 13:36:59,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:36:59,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-07-23 13:36:59,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:59,297 INFO L225 Difference]: With dead ends: 72 [2018-07-23 13:36:59,297 INFO L226 Difference]: Without dead ends: 70 [2018-07-23 13:36:59,301 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:59,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-23 13:36:59,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2018-07-23 13:36:59,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-23 13:36:59,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2018-07-23 13:36:59,361 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 7 [2018-07-23 13:36:59,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:59,361 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2018-07-23 13:36:59,362 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:36:59,362 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2018-07-23 13:36:59,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:36:59,363 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:59,363 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:59,363 INFO L414 AbstractCegarLoop]: === Iteration 2 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:36:59,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1272619553, now seen corresponding path program 1 times [2018-07-23 13:36:59,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:59,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,405 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:59,405 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-23 13:36:59,406 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,406 INFO L185 omatonBuilderFactory]: Interpolants [304#(not (= working0 working1)), 299#true, 300#false, 301#(<= (+ working0 1) next), 302#(not (= working0 next)), 303#(not (= working0 iter1))] [2018-07-23 13:36:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,408 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:36:59,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:36:59,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:36:59,409 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 6 states. [2018-07-23 13:36:59,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:59,593 INFO L93 Difference]: Finished difference Result 81 states and 113 transitions. [2018-07-23 13:36:59,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:36:59,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-07-23 13:36:59,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:59,600 INFO L225 Difference]: With dead ends: 81 [2018-07-23 13:36:59,600 INFO L226 Difference]: Without dead ends: 79 [2018-07-23 13:36:59,602 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:59,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-23 13:36:59,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2018-07-23 13:36:59,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-23 13:36:59,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2018-07-23 13:36:59,623 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 7 [2018-07-23 13:36:59,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:59,623 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2018-07-23 13:36:59,624 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:36:59,624 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2018-07-23 13:36:59,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:36:59,625 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:59,625 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:59,626 INFO L414 AbstractCegarLoop]: === Iteration 3 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:36:59,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1601446133, now seen corresponding path program 1 times [2018-07-23 13:36:59,626 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,690 INFO L134 CoverageAnalysis]: 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,691 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:59,691 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:59,691 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,692 INFO L185 omatonBuilderFactory]: Interpolants [583#true, 584#false, 585#(<= (+ working0 2) (+ workload next)), 586#(<= (+ working0 2) next), 587#(not (= working0 next)), 588#(not (= working0 iter1)), 589#(not (= working0 working1))] [2018-07-23 13:36:59,693 INFO L134 CoverageAnalysis]: 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,693 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:59,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:59,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:59,694 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand 7 states. [2018-07-23 13:36:59,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:59,984 INFO L93 Difference]: Finished difference Result 122 states and 175 transitions. [2018-07-23 13:36:59,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:36:59,985 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-07-23 13:36:59,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:59,992 INFO L225 Difference]: With dead ends: 122 [2018-07-23 13:36:59,995 INFO L226 Difference]: Without dead ends: 120 [2018-07-23 13:36:59,996 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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:59,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-07-23 13:37:00,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 73. [2018-07-23 13:37:00,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-23 13:37:00,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2018-07-23 13:37:00,037 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 10 [2018-07-23 13:37:00,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:00,038 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2018-07-23 13:37:00,038 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:00,038 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2018-07-23 13:37:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:37:00,040 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:00,040 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:00,040 INFO L414 AbstractCegarLoop]: === Iteration 4 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:00,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1152651256, now seen corresponding path program 1 times [2018-07-23 13:37:00,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:00,086 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:37:00,086 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:00,089 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:37:00,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:00,089 INFO L134 CoverageAnalysis]: 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,090 INFO L185 omatonBuilderFactory]: Interpolants [992#(<= (+ working1 2) (+ workload next)), 993#(<= (+ working1 2) next), 994#(not (= working1 next)), 995#(not (= working1 iter0)), 996#(not (= working1 working0)), 990#true, 991#false] [2018-07-23 13:37:00,090 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:37:00,092 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:00,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:00,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:00,093 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand 7 states. [2018-07-23 13:37:00,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:00,304 INFO L93 Difference]: Finished difference Result 143 states and 208 transitions. [2018-07-23 13:37:00,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:37:00,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-07-23 13:37:00,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:00,307 INFO L225 Difference]: With dead ends: 143 [2018-07-23 13:37:00,307 INFO L226 Difference]: Without dead ends: 141 [2018-07-23 13:37:00,308 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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:37:00,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-23 13:37:00,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 85. [2018-07-23 13:37:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-23 13:37:00,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2018-07-23 13:37:00,327 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 10 [2018-07-23 13:37:00,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:00,328 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2018-07-23 13:37:00,328 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:00,328 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2018-07-23 13:37:00,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:37:00,330 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:00,330 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:00,331 INFO L414 AbstractCegarLoop]: === Iteration 5 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:00,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1536370777, now seen corresponding path program 1 times [2018-07-23 13:37:00,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:00,362 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:37:00,362 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:00,363 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:37:00,363 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:00,363 INFO L134 CoverageAnalysis]: 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,364 INFO L185 omatonBuilderFactory]: Interpolants [1463#true, 1464#false, 1465#(<= (+ working1 1) next), 1466#(<= (+ working1 1) iter0), 1467#(not (= iter0 working1)), 1468#(not (= working0 working1))] [2018-07-23 13:37:00,364 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:37:00,365 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:37:00,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:37:00,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:37:00,366 INFO L87 Difference]: Start difference. First operand 85 states and 122 transitions. Second operand 6 states. [2018-07-23 13:37:00,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:00,497 INFO L93 Difference]: Finished difference Result 152 states and 223 transitions. [2018-07-23 13:37:00,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:37:00,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-07-23 13:37:00,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:00,500 INFO L225 Difference]: With dead ends: 152 [2018-07-23 13:37:00,500 INFO L226 Difference]: Without dead ends: 150 [2018-07-23 13:37:00,501 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:00,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-23 13:37:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 96. [2018-07-23 13:37:00,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-23 13:37:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2018-07-23 13:37:00,539 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 11 [2018-07-23 13:37:00,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:00,540 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2018-07-23 13:37:00,540 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:37:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2018-07-23 13:37:00,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:37:00,542 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:00,542 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:00,543 INFO L414 AbstractCegarLoop]: === Iteration 6 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:00,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1150793287, now seen corresponding path program 1 times [2018-07-23 13:37:00,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:00,579 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:37:00,580 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:00,580 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:37:00,580 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:00,581 INFO L134 CoverageAnalysis]: 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,581 INFO L185 omatonBuilderFactory]: Interpolants [1968#false, 1969#(<= (+ working0 1) next), 1970#(<= (+ working0 1) iter1), 1971#(not (= iter1 working0)), 1972#(not (= working1 working0)), 1967#true] [2018-07-23 13:37:00,585 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:37:00,585 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:37:00,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:37:00,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:37:00,586 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand 6 states. [2018-07-23 13:37:00,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:00,709 INFO L93 Difference]: Finished difference Result 167 states and 245 transitions. [2018-07-23 13:37:00,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:37:00,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-07-23 13:37:00,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:00,712 INFO L225 Difference]: With dead ends: 167 [2018-07-23 13:37:00,712 INFO L226 Difference]: Without dead ends: 165 [2018-07-23 13:37:00,713 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:00,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-23 13:37:00,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 106. [2018-07-23 13:37:00,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-07-23 13:37:00,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2018-07-23 13:37:00,755 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 11 [2018-07-23 13:37:00,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:00,756 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2018-07-23 13:37:00,756 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:37:00,756 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2018-07-23 13:37:00,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:00,761 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:00,761 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:00,762 INFO L414 AbstractCegarLoop]: === Iteration 7 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:00,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1829652612, now seen corresponding path program 1 times [2018-07-23 13:37:00,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:00,813 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:37:00,813 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:00,814 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:37:00,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:00,815 INFO L134 CoverageAnalysis]: 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,815 INFO L185 omatonBuilderFactory]: Interpolants [2521#true, 2522#false, 2523#(<= (+ working0 3) (+ (* 2 workload) next)), 2524#(<= (+ working0 3) (+ workload next)), 2525#(not (= working0 next)), 2526#(not (= working0 iter1)), 2527#(not (= working0 working1))] [2018-07-23 13:37:00,815 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:37:00,816 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:00,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:00,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:00,817 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand 7 states. [2018-07-23 13:37:01,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:01,087 INFO L93 Difference]: Finished difference Result 241 states and 352 transitions. [2018-07-23 13:37:01,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:01,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-07-23 13:37:01,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:01,090 INFO L225 Difference]: With dead ends: 241 [2018-07-23 13:37:01,090 INFO L226 Difference]: Without dead ends: 239 [2018-07-23 13:37:01,091 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:01,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-07-23 13:37:01,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 151. [2018-07-23 13:37:01,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-23 13:37:01,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 221 transitions. [2018-07-23 13:37:01,144 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 221 transitions. Word has length 13 [2018-07-23 13:37:01,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:01,144 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 221 transitions. [2018-07-23 13:37:01,145 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:01,145 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 221 transitions. [2018-07-23 13:37:01,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:01,151 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:01,151 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:01,152 INFO L414 AbstractCegarLoop]: === Iteration 8 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:01,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1159232837, now seen corresponding path program 2 times [2018-07-23 13:37:01,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:01,202 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:01,202 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:01,202 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:01,203 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:01,203 INFO L134 CoverageAnalysis]: 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,203 INFO L185 omatonBuilderFactory]: Interpolants [3328#true, 3329#false, 3330#(<= (+ working1 3) (+ (* 2 workload) next)), 3331#(<= (+ working1 3) (+ workload next)), 3332#(<= (+ working1 3) next), 3333#(not (= working1 next)), 3334#(not (= working1 iter0)), 3335#(not (= working1 working0))] [2018-07-23 13:37:01,204 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:01,204 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:01,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:01,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:01,206 INFO L87 Difference]: Start difference. First operand 151 states and 221 transitions. Second operand 8 states. [2018-07-23 13:37:01,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:01,492 INFO L93 Difference]: Finished difference Result 285 states and 419 transitions. [2018-07-23 13:37:01,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:01,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-07-23 13:37:01,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:01,497 INFO L225 Difference]: With dead ends: 285 [2018-07-23 13:37:01,497 INFO L226 Difference]: Without dead ends: 283 [2018-07-23 13:37:01,499 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:01,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-07-23 13:37:01,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 198. [2018-07-23 13:37:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-07-23 13:37:01,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 292 transitions. [2018-07-23 13:37:01,557 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 292 transitions. Word has length 13 [2018-07-23 13:37:01,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:01,558 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 292 transitions. [2018-07-23 13:37:01,558 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:01,558 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 292 transitions. [2018-07-23 13:37:01,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:37:01,560 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:01,560 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:01,560 INFO L414 AbstractCegarLoop]: === Iteration 9 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:01,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1433054771, now seen corresponding path program 1 times [2018-07-23 13:37:01,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:01,589 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:01,590 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:01,590 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:37:01,590 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:01,591 INFO L185 omatonBuilderFactory]: Interpolants [4320#(<= 1 workload), 4321#(not (= next iter0)), 4322#(not (= next working0)), 4323#(not (= iter1 working0)), 4324#(not (= working1 working0)), 4318#true, 4319#false] [2018-07-23 13:37:01,591 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:01,591 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:01,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:01,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:01,592 INFO L87 Difference]: Start difference. First operand 198 states and 292 transitions. Second operand 7 states. [2018-07-23 13:37:01,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:01,820 INFO L93 Difference]: Finished difference Result 374 states and 561 transitions. [2018-07-23 13:37:01,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:01,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-07-23 13:37:01,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:01,823 INFO L225 Difference]: With dead ends: 374 [2018-07-23 13:37:01,823 INFO L226 Difference]: Without dead ends: 372 [2018-07-23 13:37:01,824 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:01,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-07-23 13:37:01,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 242. [2018-07-23 13:37:01,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-07-23 13:37:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 361 transitions. [2018-07-23 13:37:01,891 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 361 transitions. Word has length 14 [2018-07-23 13:37:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:01,892 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 361 transitions. [2018-07-23 13:37:01,892 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 361 transitions. [2018-07-23 13:37:01,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:37:01,897 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:01,897 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:01,897 INFO L414 AbstractCegarLoop]: === Iteration 10 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:01,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1436992942, now seen corresponding path program 1 times [2018-07-23 13:37:01,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:01,947 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:37:01,948 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:01,948 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:01,949 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:01,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:01,949 INFO L185 omatonBuilderFactory]: Interpolants [5584#(not (= working1 working0)), 5577#true, 5578#false, 5579#(<= (+ working0 1) next), 5580#(<= (+ workload working0 1) next), 5581#(<= (+ end1 working0 1) (* 2 iter1)), 5582#(or (not (= iter1 working0)) (<= (+ end1 3) iter1)), 5583#(not (= iter1 working0))] [2018-07-23 13:37:01,950 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:37:01,950 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:01,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:01,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:01,951 INFO L87 Difference]: Start difference. First operand 242 states and 361 transitions. Second operand 8 states. [2018-07-23 13:37:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:02,251 INFO L93 Difference]: Finished difference Result 367 states and 555 transitions. [2018-07-23 13:37:02,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:02,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-23 13:37:02,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:02,254 INFO L225 Difference]: With dead ends: 367 [2018-07-23 13:37:02,254 INFO L226 Difference]: Without dead ends: 365 [2018-07-23 13:37:02,256 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:02,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-07-23 13:37:02,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 242. [2018-07-23 13:37:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-07-23 13:37:02,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 361 transitions. [2018-07-23 13:37:02,334 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 361 transitions. Word has length 14 [2018-07-23 13:37:02,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:02,334 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 361 transitions. [2018-07-23 13:37:02,334 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:02,335 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 361 transitions. [2018-07-23 13:37:02,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:37:02,336 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:02,336 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:02,336 INFO L414 AbstractCegarLoop]: === Iteration 11 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:02,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1436993326, now seen corresponding path program 1 times [2018-07-23 13:37:02,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:02,369 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,371 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:02,371 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:02,371 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:02,372 INFO L134 CoverageAnalysis]: 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,372 INFO L185 omatonBuilderFactory]: Interpolants [6819#true, 6820#false, 6821#(<= 1 workload), 6822#(<= (+ iter0 1) next), 6823#(not (= next iter0)), 6824#(not (= iter1 iter0)), 6825#(not (= working1 iter0)), 6826#(not (= working1 working0))] [2018-07-23 13:37:02,372 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,373 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:02,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:02,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:02,374 INFO L87 Difference]: Start difference. First operand 242 states and 361 transitions. Second operand 8 states. [2018-07-23 13:37:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:02,651 INFO L93 Difference]: Finished difference Result 408 states and 613 transitions. [2018-07-23 13:37:02,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:02,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-23 13:37:02,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:02,654 INFO L225 Difference]: With dead ends: 408 [2018-07-23 13:37:02,655 INFO L226 Difference]: Without dead ends: 406 [2018-07-23 13:37:02,656 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:02,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-07-23 13:37:02,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 274. [2018-07-23 13:37:02,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-07-23 13:37:02,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 411 transitions. [2018-07-23 13:37:02,749 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 411 transitions. Word has length 14 [2018-07-23 13:37:02,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:02,750 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 411 transitions. [2018-07-23 13:37:02,750 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:02,750 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 411 transitions. [2018-07-23 13:37:02,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:37:02,751 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:02,751 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:02,752 INFO L414 AbstractCegarLoop]: === Iteration 12 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:02,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1791986342, now seen corresponding path program 1 times [2018-07-23 13:37:02,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:02,775 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,776 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:02,776 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:02,777 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:02,777 INFO L134 CoverageAnalysis]: 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,777 INFO L185 omatonBuilderFactory]: Interpolants [8208#false, 8209#(<= 1 workload), 8210#(<= (+ iter0 1) next), 8211#(not (= next iter0)), 8212#(not (= iter1 iter0)), 8213#(not (= iter1 working0)), 8214#(not (= working1 working0)), 8207#true] [2018-07-23 13:37:02,777 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,778 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:02,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:02,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:02,779 INFO L87 Difference]: Start difference. First operand 274 states and 411 transitions. Second operand 8 states. [2018-07-23 13:37:03,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:03,140 INFO L93 Difference]: Finished difference Result 429 states and 646 transitions. [2018-07-23 13:37:03,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:03,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-23 13:37:03,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:03,145 INFO L225 Difference]: With dead ends: 429 [2018-07-23 13:37:03,146 INFO L226 Difference]: Without dead ends: 427 [2018-07-23 13:37:03,147 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:03,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-07-23 13:37:03,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 287. [2018-07-23 13:37:03,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-07-23 13:37:03,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 429 transitions. [2018-07-23 13:37:03,260 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 429 transitions. Word has length 14 [2018-07-23 13:37:03,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:03,261 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 429 transitions. [2018-07-23 13:37:03,261 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 429 transitions. [2018-07-23 13:37:03,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:37:03,263 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:03,263 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:03,263 INFO L414 AbstractCegarLoop]: === Iteration 13 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:03,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1412559370, now seen corresponding path program 1 times [2018-07-23 13:37:03,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:03,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:37:03,281 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:03,281 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:37:03,281 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:03,282 INFO L134 CoverageAnalysis]: 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,282 INFO L185 omatonBuilderFactory]: Interpolants [9664#false, 9665#(<= 1 workload), 9666#(<= (+ iter0 1) end0), 9663#true] [2018-07-23 13:37:03,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:37:03,284 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:37:03,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:37:03,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:37:03,284 INFO L87 Difference]: Start difference. First operand 287 states and 429 transitions. Second operand 4 states. [2018-07-23 13:37:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:03,389 INFO L93 Difference]: Finished difference Result 428 states and 641 transitions. [2018-07-23 13:37:03,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:37:03,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-07-23 13:37:03,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:03,391 INFO L225 Difference]: With dead ends: 428 [2018-07-23 13:37:03,391 INFO L226 Difference]: Without dead ends: 273 [2018-07-23 13:37:03,396 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:37:03,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-07-23 13:37:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-07-23 13:37:03,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-07-23 13:37:03,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 399 transitions. [2018-07-23 13:37:03,488 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 399 transitions. Word has length 14 [2018-07-23 13:37:03,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:03,488 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 399 transitions. [2018-07-23 13:37:03,488 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:37:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 399 transitions. [2018-07-23 13:37:03,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:37:03,491 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:03,491 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:03,491 INFO L414 AbstractCegarLoop]: === Iteration 14 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:03,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1697430606, now seen corresponding path program 1 times [2018-07-23 13:37:03,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:37:03,512 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:03,512 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:37:03,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:03,514 INFO L134 CoverageAnalysis]: 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,514 INFO L185 omatonBuilderFactory]: Interpolants [11072#false, 11073#(<= 1 workload), 11074#(<= (+ iter1 1) end1), 11071#true] [2018-07-23 13:37:03,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:37:03,515 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:37:03,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:37:03,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:37:03,516 INFO L87 Difference]: Start difference. First operand 273 states and 399 transitions. Second operand 4 states. [2018-07-23 13:37:03,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:03,600 INFO L93 Difference]: Finished difference Result 399 states and 584 transitions. [2018-07-23 13:37:03,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:37:03,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-07-23 13:37:03,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:03,602 INFO L225 Difference]: With dead ends: 399 [2018-07-23 13:37:03,603 INFO L226 Difference]: Without dead ends: 225 [2018-07-23 13:37:03,604 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:37:03,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-07-23 13:37:03,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-07-23 13:37:03,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-23 13:37:03,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 316 transitions. [2018-07-23 13:37:03,668 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 316 transitions. Word has length 14 [2018-07-23 13:37:03,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:03,668 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 316 transitions. [2018-07-23 13:37:03,669 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:37:03,669 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 316 transitions. [2018-07-23 13:37:03,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:37:03,669 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:03,670 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:03,670 INFO L414 AbstractCegarLoop]: === Iteration 15 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:03,670 INFO L82 PathProgramCache]: Analyzing trace with hash 844488035, now seen corresponding path program 1 times [2018-07-23 13:37:03,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:03,694 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:03,694 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:03,695 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:37:03,695 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:03,695 INFO L134 CoverageAnalysis]: 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,695 INFO L185 omatonBuilderFactory]: Interpolants [12325#true, 12326#false, 12327#(<= 1 workload), 12328#(not (= next iter1)), 12329#(not (= next working1)), 12330#(not (= iter0 working1)), 12331#(not (= working0 working1))] [2018-07-23 13:37:03,695 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:03,696 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:03,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:03,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:03,696 INFO L87 Difference]: Start difference. First operand 225 states and 316 transitions. Second operand 7 states. [2018-07-23 13:37:03,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:03,862 INFO L93 Difference]: Finished difference Result 297 states and 415 transitions. [2018-07-23 13:37:03,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:03,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-07-23 13:37:03,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:03,865 INFO L225 Difference]: With dead ends: 297 [2018-07-23 13:37:03,865 INFO L226 Difference]: Without dead ends: 295 [2018-07-23 13:37:03,866 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:03,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-07-23 13:37:03,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 262. [2018-07-23 13:37:03,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-07-23 13:37:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 371 transitions. [2018-07-23 13:37:03,947 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 371 transitions. Word has length 14 [2018-07-23 13:37:03,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:03,947 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 371 transitions. [2018-07-23 13:37:03,947 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:03,947 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 371 transitions. [2018-07-23 13:37:03,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:37:03,948 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:03,948 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:03,948 INFO L414 AbstractCegarLoop]: === Iteration 16 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:03,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1052420626, now seen corresponding path program 1 times [2018-07-23 13:37:03,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:03,969 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:03,970 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:03,970 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:03,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:03,971 INFO L185 omatonBuilderFactory]: Interpolants [13472#(<= 1 workload), 13473#(<= (+ iter1 1) next), 13474#(not (= next iter1)), 13475#(not (= iter0 iter1)), 13476#(not (= iter0 working1)), 13477#(not (= working0 working1)), 13470#true, 13471#false] [2018-07-23 13:37:03,971 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:03,971 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:03,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:03,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:03,972 INFO L87 Difference]: Start difference. First operand 262 states and 371 transitions. Second operand 8 states. [2018-07-23 13:37:04,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:04,163 INFO L93 Difference]: Finished difference Result 326 states and 461 transitions. [2018-07-23 13:37:04,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:04,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-23 13:37:04,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:04,166 INFO L225 Difference]: With dead ends: 326 [2018-07-23 13:37:04,166 INFO L226 Difference]: Without dead ends: 324 [2018-07-23 13:37:04,167 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:04,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-07-23 13:37:04,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 301. [2018-07-23 13:37:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-07-23 13:37:04,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 429 transitions. [2018-07-23 13:37:04,268 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 429 transitions. Word has length 14 [2018-07-23 13:37:04,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:04,268 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 429 transitions. [2018-07-23 13:37:04,268 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:04,268 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 429 transitions. [2018-07-23 13:37:04,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:37:04,269 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:04,269 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:04,270 INFO L414 AbstractCegarLoop]: === Iteration 17 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:04,270 INFO L82 PathProgramCache]: Analyzing trace with hash 697427610, now seen corresponding path program 1 times [2018-07-23 13:37:04,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:04,288 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:04,289 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:04,289 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:04,289 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:04,290 INFO L134 CoverageAnalysis]: 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,290 INFO L185 omatonBuilderFactory]: Interpolants [14752#(not (= next iter1)), 14753#(not (= iter0 iter1)), 14754#(not (= working0 iter1)), 14755#(not (= working0 working1)), 14748#true, 14749#false, 14750#(<= 1 workload), 14751#(<= (+ iter1 1) next)] [2018-07-23 13:37:04,290 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:04,290 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:04,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:04,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:04,291 INFO L87 Difference]: Start difference. First operand 301 states and 429 transitions. Second operand 8 states. [2018-07-23 13:37:04,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:04,468 INFO L93 Difference]: Finished difference Result 319 states and 447 transitions. [2018-07-23 13:37:04,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:04,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-23 13:37:04,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:04,471 INFO L225 Difference]: With dead ends: 319 [2018-07-23 13:37:04,471 INFO L226 Difference]: Without dead ends: 317 [2018-07-23 13:37:04,472 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:04,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-07-23 13:37:04,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 303. [2018-07-23 13:37:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-07-23 13:37:04,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 431 transitions. [2018-07-23 13:37:04,571 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 431 transitions. Word has length 14 [2018-07-23 13:37:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:04,572 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 431 transitions. [2018-07-23 13:37:04,572 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 431 transitions. [2018-07-23 13:37:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:37:04,573 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:04,573 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:04,573 INFO L414 AbstractCegarLoop]: === Iteration 18 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:04,573 INFO L82 PathProgramCache]: Analyzing trace with hash 697427226, now seen corresponding path program 1 times [2018-07-23 13:37:04,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:04,613 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:37:04,614 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:04,614 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:04,614 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:04,615 INFO L185 omatonBuilderFactory]: Interpolants [16016#true, 16017#false, 16018#(<= (+ working1 1) next), 16019#(<= (+ working1 workload 1) next), 16020#(<= (+ working1 end0 1) (* 2 iter0)), 16021#(or (not (= iter0 working1)) (<= (+ end0 3) iter0)), 16022#(not (= iter0 working1)), 16023#(not (= working0 working1))] [2018-07-23 13:37:04,615 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:37:04,615 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:04,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:04,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:04,616 INFO L87 Difference]: Start difference. First operand 303 states and 431 transitions. Second operand 8 states. [2018-07-23 13:37:04,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:04,857 INFO L93 Difference]: Finished difference Result 335 states and 474 transitions. [2018-07-23 13:37:04,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:04,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-23 13:37:04,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:04,861 INFO L225 Difference]: With dead ends: 335 [2018-07-23 13:37:04,861 INFO L226 Difference]: Without dead ends: 333 [2018-07-23 13:37:04,862 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:04,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-07-23 13:37:04,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 322. [2018-07-23 13:37:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-07-23 13:37:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 456 transitions. [2018-07-23 13:37:04,970 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 456 transitions. Word has length 14 [2018-07-23 13:37:04,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:04,971 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 456 transitions. [2018-07-23 13:37:04,971 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:04,971 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 456 transitions. [2018-07-23 13:37:04,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:37:04,972 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:04,972 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:04,972 INFO L414 AbstractCegarLoop]: === Iteration 19 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:04,973 INFO L82 PathProgramCache]: Analyzing trace with hash 406900684, now seen corresponding path program 1 times [2018-07-23 13:37:04,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:05,000 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,001 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:05,001 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:05,001 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:05,002 INFO L134 CoverageAnalysis]: 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,002 INFO L185 omatonBuilderFactory]: Interpolants [17360#(<= (+ working0 2) next), 17361#(not (= next working0)), 17362#(not (= iter1 working0)), 17363#(not (= working1 working0)), 17354#true, 17355#false, 17356#(<= 1 workload), 17357#(<= (+ iter0 1) next), 17358#(<= (+ working0 1) next), 17359#(<= (+ end0 working0 1) (+ iter0 next))] [2018-07-23 13:37:05,002 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,003 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:05,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:05,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:05,003 INFO L87 Difference]: Start difference. First operand 322 states and 456 transitions. Second operand 10 states. [2018-07-23 13:37:05,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:05,366 INFO L93 Difference]: Finished difference Result 482 states and 683 transitions. [2018-07-23 13:37:05,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:37:05,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-07-23 13:37:05,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:05,369 INFO L225 Difference]: With dead ends: 482 [2018-07-23 13:37:05,369 INFO L226 Difference]: Without dead ends: 480 [2018-07-23 13:37:05,370 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=242, Invalid=570, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:37:05,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-07-23 13:37:05,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 331. [2018-07-23 13:37:05,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-07-23 13:37:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 470 transitions. [2018-07-23 13:37:05,496 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 470 transitions. Word has length 17 [2018-07-23 13:37:05,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:05,496 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 470 transitions. [2018-07-23 13:37:05,496 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:05,496 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 470 transitions. [2018-07-23 13:37:05,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:37:05,498 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:05,498 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:05,498 INFO L414 AbstractCegarLoop]: === Iteration 20 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:05,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2143481530, now seen corresponding path program 1 times [2018-07-23 13:37:05,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:05,537 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,538 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:05,538 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:05,538 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:05,538 INFO L134 CoverageAnalysis]: 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,539 INFO L185 omatonBuilderFactory]: Interpolants [19028#true, 19029#false, 19030#(<= 1 workload), 19031#(<= (+ iter1 1) next), 19032#(<= (+ working1 1) next), 19033#(<= (+ working1 end1 1) (+ iter1 next)), 19034#(<= (+ working1 2) next), 19035#(not (= next working1)), 19036#(not (= iter0 working1)), 19037#(not (= working0 working1))] [2018-07-23 13:37:05,539 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,539 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:05,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:05,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:05,540 INFO L87 Difference]: Start difference. First operand 331 states and 470 transitions. Second operand 10 states. [2018-07-23 13:37:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:06,083 INFO L93 Difference]: Finished difference Result 507 states and 718 transitions. [2018-07-23 13:37:06,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:37:06,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-07-23 13:37:06,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:06,088 INFO L225 Difference]: With dead ends: 507 [2018-07-23 13:37:06,088 INFO L226 Difference]: Without dead ends: 505 [2018-07-23 13:37:06,089 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=242, Invalid=570, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:37:06,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-07-23 13:37:06,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 286. [2018-07-23 13:37:06,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-07-23 13:37:06,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 400 transitions. [2018-07-23 13:37:06,255 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 400 transitions. Word has length 17 [2018-07-23 13:37:06,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:06,255 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 400 transitions. [2018-07-23 13:37:06,256 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 400 transitions. [2018-07-23 13:37:06,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:06,257 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:06,257 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:06,257 INFO L414 AbstractCegarLoop]: === Iteration 21 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:06,258 INFO L82 PathProgramCache]: Analyzing trace with hash -649882737, now seen corresponding path program 2 times [2018-07-23 13:37:06,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:06,280 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:06,280 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:06,280 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:06,281 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:06,281 INFO L134 CoverageAnalysis]: 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,281 INFO L185 omatonBuilderFactory]: Interpolants [20662#true, 20663#false, 20664#(<= end0 next), 20665#(<= (+ iter0 1) next), 20666#(not (= iter0 next)), 20667#(not (= working0 next)), 20668#(not (= working0 iter1)), 20669#(not (= working0 working1))] [2018-07-23 13:37:06,282 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:06,282 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:06,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:06,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:06,284 INFO L87 Difference]: Start difference. First operand 286 states and 400 transitions. Second operand 8 states. [2018-07-23 13:37:06,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:06,639 INFO L93 Difference]: Finished difference Result 487 states and 698 transitions. [2018-07-23 13:37:06,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:37:06,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-07-23 13:37:06,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:06,643 INFO L225 Difference]: With dead ends: 487 [2018-07-23 13:37:06,643 INFO L226 Difference]: Without dead ends: 485 [2018-07-23 13:37:06,644 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:37:06,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-07-23 13:37:06,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 437. [2018-07-23 13:37:06,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-07-23 13:37:06,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 636 transitions. [2018-07-23 13:37:06,867 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 636 transitions. Word has length 18 [2018-07-23 13:37:06,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:06,867 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 636 transitions. [2018-07-23 13:37:06,867 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:06,868 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 636 transitions. [2018-07-23 13:37:06,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:06,869 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:06,869 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:06,869 INFO L414 AbstractCegarLoop]: === Iteration 22 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:06,869 INFO L82 PathProgramCache]: Analyzing trace with hash -653820908, now seen corresponding path program 1 times [2018-07-23 13:37:06,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:06,907 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:06,908 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:06,908 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:06,908 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:06,910 INFO L134 CoverageAnalysis]: 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,910 INFO L185 omatonBuilderFactory]: Interpolants [22544#(<= 1 workload), 22545#(<= (+ iter0 1) next), 22546#(<= (+ working0 1) next), 22547#(<= (+ working0 1) iter1), 22548#(not (= iter1 working0)), 22549#(not (= working1 working0)), 22542#true, 22543#false] [2018-07-23 13:37:06,911 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:06,911 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:06,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:06,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:06,912 INFO L87 Difference]: Start difference. First operand 437 states and 636 transitions. Second operand 8 states. [2018-07-23 13:37:07,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:07,294 INFO L93 Difference]: Finished difference Result 500 states and 719 transitions. [2018-07-23 13:37:07,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:07,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-07-23 13:37:07,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:07,299 INFO L225 Difference]: With dead ends: 500 [2018-07-23 13:37:07,299 INFO L226 Difference]: Without dead ends: 498 [2018-07-23 13:37:07,300 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:07,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-07-23 13:37:07,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 421. [2018-07-23 13:37:07,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-07-23 13:37:07,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 615 transitions. [2018-07-23 13:37:07,530 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 615 transitions. Word has length 18 [2018-07-23 13:37:07,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:07,531 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 615 transitions. [2018-07-23 13:37:07,531 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:07,531 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 615 transitions. [2018-07-23 13:37:07,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:07,532 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:07,532 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:07,532 INFO L414 AbstractCegarLoop]: === Iteration 23 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:07,532 INFO L82 PathProgramCache]: Analyzing trace with hash -653821292, now seen corresponding path program 1 times [2018-07-23 13:37:07,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:07,554 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:37:07,555 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:07,555 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:07,555 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:07,555 INFO L134 CoverageAnalysis]: 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,556 INFO L185 omatonBuilderFactory]: Interpolants [24416#(<= end0 next), 24417#(or (not (= iter0 next)) (<= end0 iter0)), 24418#(not (= iter0 next)), 24419#(not (= iter0 iter1)), 24420#(not (= iter0 working1)), 24421#(not (= working0 working1)), 24414#true, 24415#false] [2018-07-23 13:37:07,556 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:37:07,556 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:07,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:07,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:07,557 INFO L87 Difference]: Start difference. First operand 421 states and 615 transitions. Second operand 8 states. [2018-07-23 13:37:07,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:07,947 INFO L93 Difference]: Finished difference Result 535 states and 771 transitions. [2018-07-23 13:37:07,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:07,948 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-07-23 13:37:07,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:07,951 INFO L225 Difference]: With dead ends: 535 [2018-07-23 13:37:07,951 INFO L226 Difference]: Without dead ends: 533 [2018-07-23 13:37:07,952 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:07,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-07-23 13:37:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 447. [2018-07-23 13:37:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-07-23 13:37:08,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 651 transitions. [2018-07-23 13:37:08,235 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 651 transitions. Word has length 18 [2018-07-23 13:37:08,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:08,235 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 651 transitions. [2018-07-23 13:37:08,235 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:08,235 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 651 transitions. [2018-07-23 13:37:08,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:08,236 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:08,237 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:08,237 INFO L414 AbstractCegarLoop]: === Iteration 24 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:08,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1008814308, now seen corresponding path program 1 times [2018-07-23 13:37:08,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:08,261 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:37:08,261 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:08,261 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:08,262 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:08,262 INFO L185 omatonBuilderFactory]: Interpolants [26400#true, 26401#false, 26402#(<= end0 next), 26403#(or (not (= iter0 next)) (<= end0 iter0)), 26404#(not (= iter0 next)), 26405#(not (= iter0 iter1)), 26406#(not (= working0 iter1)), 26407#(not (= working0 working1))] [2018-07-23 13:37:08,262 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:37:08,263 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:08,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:08,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:08,263 INFO L87 Difference]: Start difference. First operand 447 states and 651 transitions. Second operand 8 states. [2018-07-23 13:37:08,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:08,714 INFO L93 Difference]: Finished difference Result 557 states and 803 transitions. [2018-07-23 13:37:08,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:37:08,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-07-23 13:37:08,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:08,718 INFO L225 Difference]: With dead ends: 557 [2018-07-23 13:37:08,718 INFO L226 Difference]: Without dead ends: 555 [2018-07-23 13:37:08,719 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:37:08,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-07-23 13:37:09,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 462. [2018-07-23 13:37:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-07-23 13:37:09,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 674 transitions. [2018-07-23 13:37:09,025 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 674 transitions. Word has length 18 [2018-07-23 13:37:09,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:09,026 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 674 transitions. [2018-07-23 13:37:09,026 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 674 transitions. [2018-07-23 13:37:09,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:09,027 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:09,027 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:09,027 INFO L414 AbstractCegarLoop]: === Iteration 25 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:09,028 INFO L82 PathProgramCache]: Analyzing trace with hash 199858329, now seen corresponding path program 2 times [2018-07-23 13:37:09,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:09,055 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,056 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:09,056 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:09,056 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:09,057 INFO L134 CoverageAnalysis]: 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,057 INFO L185 omatonBuilderFactory]: Interpolants [28466#true, 28467#false, 28468#(<= 1 workload), 28469#(<= (+ iter0 1) next), 28470#(<= (+ iter0 1) iter1), 28471#(<= (+ iter0 2) iter1), 28472#(not (= iter1 iter0)), 28473#(not (= working1 iter0)), 28474#(not (= working1 working0))] [2018-07-23 13:37:09,058 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,058 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:09,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:09,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:09,059 INFO L87 Difference]: Start difference. First operand 462 states and 674 transitions. Second operand 9 states. [2018-07-23 13:37:09,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:09,565 INFO L93 Difference]: Finished difference Result 562 states and 811 transitions. [2018-07-23 13:37:09,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:37:09,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-07-23 13:37:09,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:09,569 INFO L225 Difference]: With dead ends: 562 [2018-07-23 13:37:09,569 INFO L226 Difference]: Without dead ends: 560 [2018-07-23 13:37:09,570 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:37:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-07-23 13:37:09,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 495. [2018-07-23 13:37:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2018-07-23 13:37:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 721 transitions. [2018-07-23 13:37:09,875 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 721 transitions. Word has length 18 [2018-07-23 13:37:09,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:09,875 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 721 transitions. [2018-07-23 13:37:09,875 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:09,875 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 721 transitions. [2018-07-23 13:37:09,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:09,876 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:09,877 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:09,877 INFO L414 AbstractCegarLoop]: === Iteration 26 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:09,877 INFO L82 PathProgramCache]: Analyzing trace with hash -155134687, now seen corresponding path program 1 times [2018-07-23 13:37:09,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:09,902 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:09,903 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:09,903 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:09,903 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:09,904 INFO L134 CoverageAnalysis]: 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,904 INFO L185 omatonBuilderFactory]: Interpolants [30624#(not (= iter1 iter0)), 30625#(not (= iter1 working0)), 30626#(not (= working1 working0)), 30619#true, 30620#false, 30621#(<= 1 workload), 30622#(<= (+ iter0 1) next), 30623#(<= (+ iter0 1) iter1)] [2018-07-23 13:37:09,904 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:09,904 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:09,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:09,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:09,905 INFO L87 Difference]: Start difference. First operand 495 states and 721 transitions. Second operand 8 states. [2018-07-23 13:37:10,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:10,312 INFO L93 Difference]: Finished difference Result 542 states and 779 transitions. [2018-07-23 13:37:10,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:10,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-07-23 13:37:10,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:10,316 INFO L225 Difference]: With dead ends: 542 [2018-07-23 13:37:10,316 INFO L226 Difference]: Without dead ends: 540 [2018-07-23 13:37:10,317 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:10,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-07-23 13:37:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 508. [2018-07-23 13:37:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-07-23 13:37:10,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 738 transitions. [2018-07-23 13:37:10,606 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 738 transitions. Word has length 18 [2018-07-23 13:37:10,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:10,606 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 738 transitions. [2018-07-23 13:37:10,606 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:10,606 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 738 transitions. [2018-07-23 13:37:10,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:10,607 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:10,607 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:10,608 INFO L414 AbstractCegarLoop]: === Iteration 27 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:10,608 INFO L82 PathProgramCache]: Analyzing trace with hash -155135071, now seen corresponding path program 1 times [2018-07-23 13:37:10,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:10,629 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:10,630 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:10,630 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:10,630 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:10,630 INFO L134 CoverageAnalysis]: 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,631 INFO L185 omatonBuilderFactory]: Interpolants [32743#true, 32744#false, 32745#(<= end0 next), 32746#(<= end0 iter1), 32747#(<= end0 working1), 32748#(or (not (= iter0 working1)) (<= end0 iter0)), 32749#(not (= iter0 working1)), 32750#(not (= working0 working1))] [2018-07-23 13:37:10,631 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:10,631 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:10,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:10,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:10,632 INFO L87 Difference]: Start difference. First operand 508 states and 738 transitions. Second operand 8 states. [2018-07-23 13:37:11,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:11,262 INFO L93 Difference]: Finished difference Result 840 states and 1224 transitions. [2018-07-23 13:37:11,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:37:11,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-07-23 13:37:11,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:11,267 INFO L225 Difference]: With dead ends: 840 [2018-07-23 13:37:11,267 INFO L226 Difference]: Without dead ends: 838 [2018-07-23 13:37:11,268 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:37:11,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2018-07-23 13:37:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 672. [2018-07-23 13:37:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2018-07-23 13:37:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 988 transitions. [2018-07-23 13:37:11,621 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 988 transitions. Word has length 18 [2018-07-23 13:37:11,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:11,621 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 988 transitions. [2018-07-23 13:37:11,621 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 988 transitions. [2018-07-23 13:37:11,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:11,623 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:11,623 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:11,623 INFO L414 AbstractCegarLoop]: === Iteration 28 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:11,623 INFO L82 PathProgramCache]: Analyzing trace with hash -216264415, now seen corresponding path program 2 times [2018-07-23 13:37:11,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:11,645 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:11,645 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:11,646 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:11,646 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:11,646 INFO L134 CoverageAnalysis]: 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,646 INFO L185 omatonBuilderFactory]: Interpolants [35795#true, 35796#false, 35797#(<= 1 workload), 35798#(<= (+ iter0 1) next), 35799#(<= (+ iter0 1) iter1), 35800#(<= (+ working0 1) iter1), 35801#(not (= iter1 working0)), 35802#(not (= working1 working0))] [2018-07-23 13:37:11,647 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:11,647 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:11,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:11,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:11,648 INFO L87 Difference]: Start difference. First operand 672 states and 988 transitions. Second operand 8 states. [2018-07-23 13:37:12,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:12,161 INFO L93 Difference]: Finished difference Result 733 states and 1065 transitions. [2018-07-23 13:37:12,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:12,161 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-07-23 13:37:12,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:12,166 INFO L225 Difference]: With dead ends: 733 [2018-07-23 13:37:12,166 INFO L226 Difference]: Without dead ends: 731 [2018-07-23 13:37:12,167 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:12,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-07-23 13:37:12,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 646. [2018-07-23 13:37:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-07-23 13:37:12,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 944 transitions. [2018-07-23 13:37:12,508 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 944 transitions. Word has length 18 [2018-07-23 13:37:12,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:12,508 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 944 transitions. [2018-07-23 13:37:12,508 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:12,508 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 944 transitions. [2018-07-23 13:37:12,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:12,510 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:12,510 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:12,510 INFO L414 AbstractCegarLoop]: === Iteration 29 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:12,510 INFO L82 PathProgramCache]: Analyzing trace with hash -216264799, now seen corresponding path program 2 times [2018-07-23 13:37:12,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:12,531 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:12,532 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:12,532 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:12,532 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:12,533 INFO L134 CoverageAnalysis]: 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,533 INFO L185 omatonBuilderFactory]: Interpolants [38577#true, 38578#false, 38579#(<= end0 next), 38580#(<= end0 iter1), 38581#(or (not (= iter0 iter1)) (<= end0 iter0)), 38582#(not (= iter0 iter1)), 38583#(not (= iter0 working1)), 38584#(not (= working0 working1))] [2018-07-23 13:37:12,533 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:12,533 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:12,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:12,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:12,534 INFO L87 Difference]: Start difference. First operand 646 states and 944 transitions. Second operand 8 states. [2018-07-23 13:37:13,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:13,167 INFO L93 Difference]: Finished difference Result 780 states and 1131 transitions. [2018-07-23 13:37:13,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:37:13,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-07-23 13:37:13,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:13,173 INFO L225 Difference]: With dead ends: 780 [2018-07-23 13:37:13,173 INFO L226 Difference]: Without dead ends: 778 [2018-07-23 13:37:13,174 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:37:13,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-07-23 13:37:13,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 630. [2018-07-23 13:37:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2018-07-23 13:37:13,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 921 transitions. [2018-07-23 13:37:13,552 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 921 transitions. Word has length 18 [2018-07-23 13:37:13,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:13,552 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 921 transitions. [2018-07-23 13:37:13,552 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:13,552 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 921 transitions. [2018-07-23 13:37:13,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:13,553 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:13,553 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:13,554 INFO L414 AbstractCegarLoop]: === Iteration 30 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:13,554 INFO L82 PathProgramCache]: Analyzing trace with hash -571257815, now seen corresponding path program 2 times [2018-07-23 13:37:13,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:13,593 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,593 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:13,594 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:13,594 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:13,594 INFO L134 CoverageAnalysis]: 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,594 INFO L185 omatonBuilderFactory]: Interpolants [41425#true, 41426#false, 41427#(<= end0 next), 41428#(<= end0 iter1), 41429#(or (not (= iter0 iter1)) (<= end0 iter0)), 41430#(or (not (= working0 iter1)) (<= end0 iter0)), 41431#(or (<= (+ end0 1) iter0) (not (= working0 iter1))), 41432#(not (= working0 iter1)), 41433#(not (= working0 working1))] [2018-07-23 13:37:13,595 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,595 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:13,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:13,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:13,596 INFO L87 Difference]: Start difference. First operand 630 states and 921 transitions. Second operand 9 states. [2018-07-23 13:37:14,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:14,234 INFO L93 Difference]: Finished difference Result 745 states and 1087 transitions. [2018-07-23 13:37:14,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:14,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-07-23 13:37:14,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:14,238 INFO L225 Difference]: With dead ends: 745 [2018-07-23 13:37:14,239 INFO L226 Difference]: Without dead ends: 744 [2018-07-23 13:37:14,239 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:14,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-07-23 13:37:14,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 624. [2018-07-23 13:37:14,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-07-23 13:37:14,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 910 transitions. [2018-07-23 13:37:14,543 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 910 transitions. Word has length 18 [2018-07-23 13:37:14,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:14,544 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 910 transitions. [2018-07-23 13:37:14,544 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:14,544 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 910 transitions. [2018-07-23 13:37:14,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:14,545 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:14,545 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:14,545 INFO L414 AbstractCegarLoop]: === Iteration 31 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:14,546 INFO L82 PathProgramCache]: Analyzing trace with hash -571168152, now seen corresponding path program 1 times [2018-07-23 13:37:14,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:14,566 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:14,567 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:14,567 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:14,567 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:14,567 INFO L185 omatonBuilderFactory]: Interpolants [44192#true, 44193#false, 44194#(<= end0 next), 44195#(<= end0 iter1), 44196#(<= (+ iter0 1) iter1), 44197#(not (= iter0 iter1)), 44198#(not (= working0 iter1)), 44199#(not (= working0 working1))] [2018-07-23 13:37:14,568 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:14,568 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:14,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:14,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:14,568 INFO L87 Difference]: Start difference. First operand 624 states and 910 transitions. Second operand 8 states. [2018-07-23 13:37:15,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:15,104 INFO L93 Difference]: Finished difference Result 767 states and 1100 transitions. [2018-07-23 13:37:15,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:15,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-07-23 13:37:15,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:15,109 INFO L225 Difference]: With dead ends: 767 [2018-07-23 13:37:15,109 INFO L226 Difference]: Without dead ends: 765 [2018-07-23 13:37:15,110 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:15,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-07-23 13:37:15,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 650. [2018-07-23 13:37:15,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-07-23 13:37:15,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 947 transitions. [2018-07-23 13:37:15,376 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 947 transitions. Word has length 18 [2018-07-23 13:37:15,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:15,377 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 947 transitions. [2018-07-23 13:37:15,377 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:15,377 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 947 transitions. [2018-07-23 13:37:15,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:15,378 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:15,378 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:15,378 INFO L414 AbstractCegarLoop]: === Iteration 32 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:15,378 INFO L82 PathProgramCache]: Analyzing trace with hash 948617211, now seen corresponding path program 2 times [2018-07-23 13:37:15,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:15,394 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:15,395 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:15,395 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:15,395 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:15,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:15,396 INFO L185 omatonBuilderFactory]: Interpolants [47056#(not (= working1 iter0)), 47057#(not (= working1 working0)), 47050#true, 47051#false, 47052#(<= end1 next), 47053#(<= (+ iter1 1) next), 47054#(not (= iter1 next)), 47055#(not (= working1 next))] [2018-07-23 13:37:15,396 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:15,396 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:15,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:15,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:15,397 INFO L87 Difference]: Start difference. First operand 650 states and 947 transitions. Second operand 8 states. [2018-07-23 13:37:15,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:15,881 INFO L93 Difference]: Finished difference Result 705 states and 1013 transitions. [2018-07-23 13:37:15,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:37:15,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-07-23 13:37:15,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:15,886 INFO L225 Difference]: With dead ends: 705 [2018-07-23 13:37:15,886 INFO L226 Difference]: Without dead ends: 703 [2018-07-23 13:37:15,887 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:37:15,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2018-07-23 13:37:16,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 672. [2018-07-23 13:37:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2018-07-23 13:37:16,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 976 transitions. [2018-07-23 13:37:16,279 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 976 transitions. Word has length 18 [2018-07-23 13:37:16,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:16,279 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 976 transitions. [2018-07-23 13:37:16,279 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:16,279 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 976 transitions. [2018-07-23 13:37:16,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:16,280 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:16,281 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:16,281 INFO L414 AbstractCegarLoop]: === Iteration 33 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:16,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1156549802, now seen corresponding path program 1 times [2018-07-23 13:37:16,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:16,301 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:37:16,301 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:16,301 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:16,301 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:16,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:16,302 INFO L185 omatonBuilderFactory]: Interpolants [49840#(not (= iter1 next)), 49841#(not (= iter1 iter0)), 49842#(not (= working1 iter0)), 49843#(not (= working1 working0)), 49836#true, 49837#false, 49838#(<= end1 next), 49839#(or (<= end1 iter1) (not (= iter1 next)))] [2018-07-23 13:37:16,302 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:37:16,302 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:16,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:16,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:16,303 INFO L87 Difference]: Start difference. First operand 672 states and 976 transitions. Second operand 8 states. [2018-07-23 13:37:16,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:16,801 INFO L93 Difference]: Finished difference Result 766 states and 1106 transitions. [2018-07-23 13:37:16,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:37:16,802 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-07-23 13:37:16,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:16,806 INFO L225 Difference]: With dead ends: 766 [2018-07-23 13:37:16,806 INFO L226 Difference]: Without dead ends: 764 [2018-07-23 13:37:16,807 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:37:16,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-07-23 13:37:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 686. [2018-07-23 13:37:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-07-23 13:37:17,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 997 transitions. [2018-07-23 13:37:17,225 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 997 transitions. Word has length 18 [2018-07-23 13:37:17,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:17,226 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 997 transitions. [2018-07-23 13:37:17,226 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:17,226 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 997 transitions. [2018-07-23 13:37:17,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:17,227 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:17,227 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:17,227 INFO L414 AbstractCegarLoop]: === Iteration 34 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:17,228 INFO L82 PathProgramCache]: Analyzing trace with hash 801556786, now seen corresponding path program 1 times [2018-07-23 13:37:17,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:17,246 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:37:17,246 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:17,247 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:17,247 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:17,247 INFO L185 omatonBuilderFactory]: Interpolants [52768#true, 52769#false, 52770#(<= end1 next), 52771#(or (<= end1 iter1) (not (= iter1 next))), 52772#(not (= iter1 next)), 52773#(not (= iter1 iter0)), 52774#(not (= iter1 working0)), 52775#(not (= working1 working0))] [2018-07-23 13:37:17,247 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:37:17,248 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:17,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:17,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:17,248 INFO L87 Difference]: Start difference. First operand 686 states and 997 transitions. Second operand 8 states. [2018-07-23 13:37:17,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:17,806 INFO L93 Difference]: Finished difference Result 781 states and 1129 transitions. [2018-07-23 13:37:17,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:17,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-07-23 13:37:17,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:17,811 INFO L225 Difference]: With dead ends: 781 [2018-07-23 13:37:17,812 INFO L226 Difference]: Without dead ends: 779 [2018-07-23 13:37:17,814 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:17,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-07-23 13:37:18,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 707. [2018-07-23 13:37:18,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2018-07-23 13:37:18,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1026 transitions. [2018-07-23 13:37:18,263 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1026 transitions. Word has length 18 [2018-07-23 13:37:18,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:18,263 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1026 transitions. [2018-07-23 13:37:18,263 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:18,263 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1026 transitions. [2018-07-23 13:37:18,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:18,265 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:18,265 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:18,265 INFO L414 AbstractCegarLoop]: === Iteration 35 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:18,265 INFO L82 PathProgramCache]: Analyzing trace with hash 801556402, now seen corresponding path program 1 times [2018-07-23 13:37:18,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:18,283 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:18,283 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:18,283 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:18,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:18,284 INFO L134 CoverageAnalysis]: 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,284 INFO L185 omatonBuilderFactory]: Interpolants [55766#true, 55767#false, 55768#(<= 1 workload), 55769#(<= (+ iter1 1) next), 55770#(<= (+ working1 1) next), 55771#(<= (+ working1 1) iter0), 55772#(not (= iter0 working1)), 55773#(not (= working0 working1))] [2018-07-23 13:37:18,284 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:18,284 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:18,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:18,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:18,285 INFO L87 Difference]: Start difference. First operand 707 states and 1026 transitions. Second operand 8 states. [2018-07-23 13:37:18,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:18,819 INFO L93 Difference]: Finished difference Result 774 states and 1115 transitions. [2018-07-23 13:37:18,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:18,820 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-07-23 13:37:18,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:18,824 INFO L225 Difference]: With dead ends: 774 [2018-07-23 13:37:18,824 INFO L226 Difference]: Without dead ends: 772 [2018-07-23 13:37:18,824 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:18,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2018-07-23 13:37:19,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 683. [2018-07-23 13:37:19,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2018-07-23 13:37:19,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 993 transitions. [2018-07-23 13:37:19,290 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 993 transitions. Word has length 18 [2018-07-23 13:37:19,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:19,291 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 993 transitions. [2018-07-23 13:37:19,291 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:19,291 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 993 transitions. [2018-07-23 13:37:19,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:19,292 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:19,292 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:19,292 INFO L414 AbstractCegarLoop]: === Iteration 36 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:19,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1011848743, now seen corresponding path program 2 times [2018-07-23 13:37:19,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:19,313 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:19,314 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:19,314 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:19,314 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:19,314 INFO L134 CoverageAnalysis]: 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,314 INFO L185 omatonBuilderFactory]: Interpolants [58710#true, 58711#false, 58712#(<= end1 next), 58713#(<= end1 iter0), 58714#(or (<= end1 iter1) (not (= iter1 iter0))), 58715#(or (<= end1 iter1) (not (= working1 iter0))), 58716#(or (<= (+ end1 1) iter1) (not (= working1 iter0))), 58717#(not (= working1 iter0)), 58718#(not (= working1 working0))] [2018-07-23 13:37:19,315 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:19,315 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:19,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:19,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:19,316 INFO L87 Difference]: Start difference. First operand 683 states and 993 transitions. Second operand 9 states. [2018-07-23 13:37:20,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:20,096 INFO L93 Difference]: Finished difference Result 907 states and 1338 transitions. [2018-07-23 13:37:20,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:20,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-07-23 13:37:20,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:20,101 INFO L225 Difference]: With dead ends: 907 [2018-07-23 13:37:20,101 INFO L226 Difference]: Without dead ends: 906 [2018-07-23 13:37:20,102 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:20,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-07-23 13:37:20,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 746. [2018-07-23 13:37:20,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-07-23 13:37:20,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1095 transitions. [2018-07-23 13:37:20,691 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1095 transitions. Word has length 18 [2018-07-23 13:37:20,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:20,691 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1095 transitions. [2018-07-23 13:37:20,691 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:20,691 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1095 transitions. [2018-07-23 13:37:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:20,692 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:20,692 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:20,693 INFO L414 AbstractCegarLoop]: === Iteration 37 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:20,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1011759784, now seen corresponding path program 1 times [2018-07-23 13:37:20,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:20,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:20,720 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:20,720 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:20,720 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:20,720 INFO L134 CoverageAnalysis]: 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,720 INFO L185 omatonBuilderFactory]: Interpolants [62048#(<= end1 iter0), 62049#(<= (+ iter1 1) iter0), 62050#(not (= iter1 iter0)), 62051#(not (= working1 iter0)), 62052#(not (= working1 working0)), 62045#true, 62046#false, 62047#(<= end1 next)] [2018-07-23 13:37:20,721 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:20,721 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:20,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:20,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:20,723 INFO L87 Difference]: Start difference. First operand 746 states and 1095 transitions. Second operand 8 states. [2018-07-23 13:37:21,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:21,386 INFO L93 Difference]: Finished difference Result 914 states and 1326 transitions. [2018-07-23 13:37:21,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:21,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-07-23 13:37:21,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:21,390 INFO L225 Difference]: With dead ends: 914 [2018-07-23 13:37:21,391 INFO L226 Difference]: Without dead ends: 912 [2018-07-23 13:37:21,391 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:21,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2018-07-23 13:37:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 761. [2018-07-23 13:37:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-07-23 13:37:21,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1117 transitions. [2018-07-23 13:37:21,753 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1117 transitions. Word has length 18 [2018-07-23 13:37:21,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:21,753 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1117 transitions. [2018-07-23 13:37:21,753 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1117 transitions. [2018-07-23 13:37:21,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:21,754 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:21,755 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:21,755 INFO L414 AbstractCegarLoop]: === Iteration 38 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:21,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1366841759, now seen corresponding path program 1 times [2018-07-23 13:37:21,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:21,770 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:21,770 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:21,770 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:21,770 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:21,771 INFO L134 CoverageAnalysis]: 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,771 INFO L185 omatonBuilderFactory]: Interpolants [65424#(not (= iter1 iter0)), 65425#(not (= iter1 working0)), 65426#(not (= working1 working0)), 65419#true, 65420#false, 65421#(<= end1 next), 65422#(<= end1 iter0), 65423#(or (<= end1 iter1) (not (= iter1 iter0)))] [2018-07-23 13:37:21,771 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:21,771 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:21,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:21,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:21,772 INFO L87 Difference]: Start difference. First operand 761 states and 1117 transitions. Second operand 8 states. [2018-07-23 13:37:22,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:22,510 INFO L93 Difference]: Finished difference Result 933 states and 1368 transitions. [2018-07-23 13:37:22,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:37:22,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-07-23 13:37:22,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:22,516 INFO L225 Difference]: With dead ends: 933 [2018-07-23 13:37:22,516 INFO L226 Difference]: Without dead ends: 931 [2018-07-23 13:37:22,517 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:37:22,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2018-07-23 13:37:22,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 781. [2018-07-23 13:37:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2018-07-23 13:37:22,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1145 transitions. [2018-07-23 13:37:22,917 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1145 transitions. Word has length 18 [2018-07-23 13:37:22,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:22,917 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1145 transitions. [2018-07-23 13:37:22,918 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:22,918 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1145 transitions. [2018-07-23 13:37:22,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:22,919 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:22,919 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:22,919 INFO L414 AbstractCegarLoop]: === Iteration 39 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:22,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1366842143, now seen corresponding path program 1 times [2018-07-23 13:37:22,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:22,934 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:22,934 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:22,934 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:22,934 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:22,935 INFO L134 CoverageAnalysis]: 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,935 INFO L185 omatonBuilderFactory]: Interpolants [68881#(not (= iter0 working1)), 68880#(<= (+ working1 1) iter0), 68882#(not (= working0 working1)), 68875#true, 68877#(<= 1 workload), 68876#false, 68879#(<= (+ iter1 1) iter0), 68878#(<= (+ iter1 1) next)] [2018-07-23 13:37:22,935 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:22,935 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:22,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:22,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:22,936 INFO L87 Difference]: Start difference. First operand 781 states and 1145 transitions. Second operand 8 states. [2018-07-23 13:37:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:23,440 INFO L93 Difference]: Finished difference Result 821 states and 1189 transitions. [2018-07-23 13:37:23,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:23,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-07-23 13:37:23,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:23,444 INFO L225 Difference]: With dead ends: 821 [2018-07-23 13:37:23,444 INFO L226 Difference]: Without dead ends: 819 [2018-07-23 13:37:23,445 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:23,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-07-23 13:37:23,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 741. [2018-07-23 13:37:23,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-07-23 13:37:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1081 transitions. [2018-07-23 13:37:23,791 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1081 transitions. Word has length 18 [2018-07-23 13:37:23,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:23,791 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1081 transitions. [2018-07-23 13:37:23,791 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1081 transitions. [2018-07-23 13:37:23,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:23,792 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:23,793 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:23,793 INFO L414 AbstractCegarLoop]: === Iteration 40 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:23,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1427971487, now seen corresponding path program 2 times [2018-07-23 13:37:23,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:23,807 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:23,807 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:23,807 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:23,808 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:23,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:37:23,808 INFO L185 omatonBuilderFactory]: Interpolants [72023#true, 72025#(<= end1 next), 72024#false, 72027#(<= end1 working0), 72026#(<= end1 iter0), 72029#(not (= iter1 working0)), 72028#(or (<= end1 iter1) (not (= iter1 working0))), 72030#(not (= working1 working0))] [2018-07-23 13:37:23,808 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:23,808 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:23,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:23,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:23,809 INFO L87 Difference]: Start difference. First operand 741 states and 1081 transitions. Second operand 8 states. [2018-07-23 13:37:24,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:24,579 INFO L93 Difference]: Finished difference Result 941 states and 1359 transitions. [2018-07-23 13:37:24,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:37:24,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-07-23 13:37:24,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:24,584 INFO L225 Difference]: With dead ends: 941 [2018-07-23 13:37:24,585 INFO L226 Difference]: Without dead ends: 939 [2018-07-23 13:37:24,585 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:37:24,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2018-07-23 13:37:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 792. [2018-07-23 13:37:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-07-23 13:37:25,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1155 transitions. [2018-07-23 13:37:25,098 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1155 transitions. Word has length 18 [2018-07-23 13:37:25,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:25,098 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1155 transitions. [2018-07-23 13:37:25,098 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1155 transitions. [2018-07-23 13:37:25,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:25,102 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:25,102 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:25,102 INFO L414 AbstractCegarLoop]: === Iteration 41 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:25,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1782964887, now seen corresponding path program 2 times [2018-07-23 13:37:25,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:25,128 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:25,128 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:25,128 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:25,128 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:25,129 INFO L134 CoverageAnalysis]: 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,129 INFO L185 omatonBuilderFactory]: Interpolants [75521#(<= (+ iter1 1) iter0), 75520#(<= (+ iter1 1) next), 75523#(not (= iter0 iter1)), 75522#(<= (+ iter1 2) iter0), 75525#(not (= working0 working1)), 75524#(not (= working0 iter1)), 75517#true, 75519#(<= 1 workload), 75518#false] [2018-07-23 13:37:25,129 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:25,129 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:25,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:25,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:25,130 INFO L87 Difference]: Start difference. First operand 792 states and 1155 transitions. Second operand 9 states. [2018-07-23 13:37:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:25,847 INFO L93 Difference]: Finished difference Result 936 states and 1355 transitions. [2018-07-23 13:37:25,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:37:25,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-07-23 13:37:25,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:25,852 INFO L225 Difference]: With dead ends: 936 [2018-07-23 13:37:25,852 INFO L226 Difference]: Without dead ends: 934 [2018-07-23 13:37:25,853 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:37:25,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2018-07-23 13:37:26,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 827. [2018-07-23 13:37:26,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2018-07-23 13:37:26,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1202 transitions. [2018-07-23 13:37:26,391 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1202 transitions. Word has length 18 [2018-07-23 13:37:26,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:26,391 INFO L471 AbstractCegarLoop]: Abstraction has 827 states and 1202 transitions. [2018-07-23 13:37:26,391 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:26,391 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1202 transitions. [2018-07-23 13:37:26,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:37:26,393 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:26,393 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:37:26,393 INFO L414 AbstractCegarLoop]: === Iteration 42 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:26,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1622613706, now seen corresponding path program 1 times [2018-07-23 13:37:26,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:26,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:26,432 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:26,433 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:37:26,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:26,433 INFO L134 CoverageAnalysis]: 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,433 INFO L185 omatonBuilderFactory]: Interpolants [79089#(<= (+ end0 working0) (+ iter0 next)), 79088#(<= working0 next), 79091#(not (= next working0)), 79090#(<= (+ working0 1) next), 79093#(not (= working1 working0)), 79092#(not (= iter1 working0)), 79083#false, 79082#true, 79085#(<= (+ iter0 1) next), 79084#(<= 1 workload), 79087#(and (= iter0 working0) (<= iter0 next)), 79086#(<= iter0 next)] [2018-07-23 13:37:26,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:26,434 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:37:26,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:37:26,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:26,434 INFO L87 Difference]: Start difference. First operand 827 states and 1202 transitions. Second operand 12 states. [2018-07-23 13:37:27,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:27,475 INFO L93 Difference]: Finished difference Result 1574 states and 2302 transitions. [2018-07-23 13:37:27,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 13:37:27,475 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:37:27,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:27,483 INFO L225 Difference]: With dead ends: 1574 [2018-07-23 13:37:27,483 INFO L226 Difference]: Without dead ends: 1572 [2018-07-23 13:37:27,485 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=390, Invalid=1092, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:37:27,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2018-07-23 13:37:28,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1454. [2018-07-23 13:37:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2018-07-23 13:37:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2142 transitions. [2018-07-23 13:37:28,097 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2142 transitions. Word has length 21 [2018-07-23 13:37:28,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:28,097 INFO L471 AbstractCegarLoop]: Abstraction has 1454 states and 2142 transitions. [2018-07-23 13:37:28,097 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:37:28,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2142 transitions. [2018-07-23 13:37:28,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:37:28,099 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:28,100 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:37:28,100 INFO L414 AbstractCegarLoop]: === Iteration 43 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:28,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1005591262, now seen corresponding path program 1 times [2018-07-23 13:37:28,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:28,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:28,123 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:28,123 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:37:28,124 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:28,124 INFO L134 CoverageAnalysis]: 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,124 INFO L185 omatonBuilderFactory]: Interpolants [85205#false, 85204#true, 85207#(<= (+ iter1 1) next), 85206#(<= 1 workload), 85209#(and (<= iter1 next) (= iter1 working1)), 85208#(<= iter1 next), 85211#(<= (+ working1 end1) (+ iter1 next)), 85210#(<= working1 next), 85213#(not (= working1 next)), 85212#(<= (+ working1 1) next), 85215#(not (= working1 working0)), 85214#(not (= working1 iter0))] [2018-07-23 13:37:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:28,124 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:37:28,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:37:28,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:28,125 INFO L87 Difference]: Start difference. First operand 1454 states and 2142 transitions. Second operand 12 states. [2018-07-23 13:37:29,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:29,399 INFO L93 Difference]: Finished difference Result 2649 states and 3932 transitions. [2018-07-23 13:37:29,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 13:37:29,399 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:37:29,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:29,411 INFO L225 Difference]: With dead ends: 2649 [2018-07-23 13:37:29,412 INFO L226 Difference]: Without dead ends: 2647 [2018-07-23 13:37:29,414 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=390, Invalid=1092, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:37:29,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2018-07-23 13:37:30,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2484. [2018-07-23 13:37:30,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2484 states. [2018-07-23 13:37:30,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2484 states and 3704 transitions. [2018-07-23 13:37:30,213 INFO L78 Accepts]: Start accepts. Automaton has 2484 states and 3704 transitions. Word has length 21 [2018-07-23 13:37:30,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:30,213 INFO L471 AbstractCegarLoop]: Abstraction has 2484 states and 3704 transitions. [2018-07-23 13:37:30,213 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:37:30,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2484 states and 3704 transitions. [2018-07-23 13:37:30,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:37:30,215 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:30,215 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:37:30,215 INFO L414 AbstractCegarLoop]: === Iteration 44 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:30,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1621422890, now seen corresponding path program 2 times [2018-07-23 13:37:30,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:30,235 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:30,235 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:30,235 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:30,236 INFO L134 CoverageAnalysis]: 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,236 INFO L185 omatonBuilderFactory]: Interpolants [95537#false, 95536#true, 95539#(and (<= end0 next) (= iter0 working0)), 95538#(<= end0 next), 95541#(<= (+ working0 2) next), 95540#(<= (+ end0 working0 1) (+ iter0 next)), 95543#(not (= iter1 working0)), 95542#(<= (+ working0 2) iter1), 95544#(not (= working1 working0))] [2018-07-23 13:37:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:30,236 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:30,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:30,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:30,237 INFO L87 Difference]: Start difference. First operand 2484 states and 3704 transitions. Second operand 9 states. [2018-07-23 13:37:31,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:31,273 INFO L93 Difference]: Finished difference Result 2521 states and 3747 transitions. [2018-07-23 13:37:31,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:31,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-07-23 13:37:31,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:31,283 INFO L225 Difference]: With dead ends: 2521 [2018-07-23 13:37:31,284 INFO L226 Difference]: Without dead ends: 2520 [2018-07-23 13:37:31,285 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:31,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2018-07-23 13:37:32,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 2484. [2018-07-23 13:37:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2484 states. [2018-07-23 13:37:32,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2484 states and 3700 transitions. [2018-07-23 13:37:32,103 INFO L78 Accepts]: Start accepts. Automaton has 2484 states and 3700 transitions. Word has length 22 [2018-07-23 13:37:32,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:32,103 INFO L471 AbstractCegarLoop]: Abstraction has 2484 states and 3700 transitions. [2018-07-23 13:37:32,103 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:32,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2484 states and 3700 transitions. [2018-07-23 13:37:32,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:37:32,105 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:32,105 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:32,105 INFO L414 AbstractCegarLoop]: === Iteration 45 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:32,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1982566808, now seen corresponding path program 1 times [2018-07-23 13:37:32,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:32,121 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:32,121 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:32,122 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:32,122 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:32,122 INFO L134 CoverageAnalysis]: 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,122 INFO L185 omatonBuilderFactory]: Interpolants [105569#(<= end0 next), 105568#false, 105571#(and (= iter0 working0) (<= (+ iter0 1) next)), 105570#(<= (+ iter0 1) next), 105573#(<= (+ working0 1) iter1), 105572#(<= (+ working0 1) next), 105575#(not (= working1 working0)), 105574#(not (= iter1 working0)), 105567#true] [2018-07-23 13:37:32,122 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:32,123 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:32,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:32,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:32,123 INFO L87 Difference]: Start difference. First operand 2484 states and 3700 transitions. Second operand 9 states. [2018-07-23 13:37:33,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:33,117 INFO L93 Difference]: Finished difference Result 2741 states and 4062 transitions. [2018-07-23 13:37:33,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:37:33,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-07-23 13:37:33,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:33,129 INFO L225 Difference]: With dead ends: 2741 [2018-07-23 13:37:33,129 INFO L226 Difference]: Without dead ends: 2739 [2018-07-23 13:37:33,131 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:37:33,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2739 states. [2018-07-23 13:37:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2739 to 2594. [2018-07-23 13:37:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2594 states. [2018-07-23 13:37:34,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 3858 transitions. [2018-07-23 13:37:34,081 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 3858 transitions. Word has length 22 [2018-07-23 13:37:34,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:34,081 INFO L471 AbstractCegarLoop]: Abstraction has 2594 states and 3858 transitions. [2018-07-23 13:37:34,081 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:34,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3858 transitions. [2018-07-23 13:37:34,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:37:34,083 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:34,083 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:34,083 INFO L414 AbstractCegarLoop]: === Iteration 46 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:34,083 INFO L82 PathProgramCache]: Analyzing trace with hash -767743653, now seen corresponding path program 2 times [2018-07-23 13:37:34,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:34,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:34,099 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:34,099 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:34,099 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:34,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:34,100 INFO L185 omatonBuilderFactory]: Interpolants [116273#false, 116272#true, 116275#(<= (+ iter0 1) next), 116274#(<= 1 workload), 116277#(<= iter0 iter1), 116276#(<= iter0 next), 116279#(not (= iter1 iter0)), 116278#(<= (+ iter0 1) iter1), 116281#(not (= working1 working0)), 116280#(not (= working1 iter0))] [2018-07-23 13:37:34,100 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:34,100 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:34,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:34,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:34,101 INFO L87 Difference]: Start difference. First operand 2594 states and 3858 transitions. Second operand 10 states. [2018-07-23 13:37:35,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:35,698 INFO L93 Difference]: Finished difference Result 3321 states and 4947 transitions. [2018-07-23 13:37:35,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:37:35,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-07-23 13:37:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:35,708 INFO L225 Difference]: With dead ends: 3321 [2018-07-23 13:37:35,709 INFO L226 Difference]: Without dead ends: 3319 [2018-07-23 13:37:35,712 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=336, Invalid=854, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:37:35,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2018-07-23 13:37:36,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 2735. [2018-07-23 13:37:36,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2735 states. [2018-07-23 13:37:36,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 4072 transitions. [2018-07-23 13:37:36,599 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 4072 transitions. Word has length 22 [2018-07-23 13:37:36,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:36,599 INFO L471 AbstractCegarLoop]: Abstraction has 2735 states and 4072 transitions. [2018-07-23 13:37:36,599 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:36,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 4072 transitions. [2018-07-23 13:37:36,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:37:36,601 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:36,601 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:36,601 INFO L414 AbstractCegarLoop]: === Iteration 47 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:36,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1122647006, now seen corresponding path program 1 times [2018-07-23 13:37:36,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:36,615 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:37:36,615 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:36,615 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:36,615 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:36,616 INFO L185 omatonBuilderFactory]: Interpolants [128449#(not (= iter1 iter0)), 128448#(<= (+ iter0 1) iter1), 128451#(not (= working1 working0)), 128450#(not (= iter1 working0)), 128445#false, 128444#true, 128447#(<= (+ iter0 1) next), 128446#(<= end0 next)] [2018-07-23 13:37:36,616 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:37:36,616 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:36,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:36,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:36,617 INFO L87 Difference]: Start difference. First operand 2735 states and 4072 transitions. Second operand 8 states. [2018-07-23 13:37:37,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:37,757 INFO L93 Difference]: Finished difference Result 2960 states and 4385 transitions. [2018-07-23 13:37:37,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:37,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-07-23 13:37:37,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:37,766 INFO L225 Difference]: With dead ends: 2960 [2018-07-23 13:37:37,766 INFO L226 Difference]: Without dead ends: 2958 [2018-07-23 13:37:37,768 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:37,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2018-07-23 13:37:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2737. [2018-07-23 13:37:38,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2737 states. [2018-07-23 13:37:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2737 states and 4072 transitions. [2018-07-23 13:37:38,959 INFO L78 Accepts]: Start accepts. Automaton has 2737 states and 4072 transitions. Word has length 22 [2018-07-23 13:37:38,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:38,959 INFO L471 AbstractCegarLoop]: Abstraction has 2737 states and 4072 transitions. [2018-07-23 13:37:38,959 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:38,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2737 states and 4072 transitions. [2018-07-23 13:37:38,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:37:38,961 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:38,961 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:38,961 INFO L414 AbstractCegarLoop]: === Iteration 48 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:38,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1183866397, now seen corresponding path program 1 times [2018-07-23 13:37:38,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:38,979 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:38,979 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:38,980 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:38,980 INFO L134 CoverageAnalysis]: 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,980 INFO L185 omatonBuilderFactory]: Interpolants [139862#true, 139863#false, 139866#(<= (+ end0 working0) (+ iter1 iter0)), 139867#(<= (+ end0 working0 1) (+ iter1 iter0)), 139864#(<= end0 next), 139865#(<= end0 iter1), 139870#(not (= working1 working0)), 139868#(<= (+ working0 2) iter1), 139869#(not (= iter1 working0))] [2018-07-23 13:37:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:38,980 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:38,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:38,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:38,981 INFO L87 Difference]: Start difference. First operand 2737 states and 4072 transitions. Second operand 9 states. [2018-07-23 13:37:40,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:40,133 INFO L93 Difference]: Finished difference Result 2904 states and 4306 transitions. [2018-07-23 13:37:40,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:40,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-07-23 13:37:40,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:40,144 INFO L225 Difference]: With dead ends: 2904 [2018-07-23 13:37:40,144 INFO L226 Difference]: Without dead ends: 2903 [2018-07-23 13:37:40,146 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:40,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2018-07-23 13:37:41,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 2719. [2018-07-23 13:37:41,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2719 states. [2018-07-23 13:37:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 4036 transitions. [2018-07-23 13:37:41,375 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 4036 transitions. Word has length 22 [2018-07-23 13:37:41,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:41,375 INFO L471 AbstractCegarLoop]: Abstraction has 2719 states and 4036 transitions. [2018-07-23 13:37:41,375 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 4036 transitions. [2018-07-23 13:37:41,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:37:41,377 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:41,377 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:41,377 INFO L414 AbstractCegarLoop]: === Iteration 49 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:41,377 INFO L82 PathProgramCache]: Analyzing trace with hash 15880131, now seen corresponding path program 1 times [2018-07-23 13:37:41,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:41,391 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:41,391 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:41,391 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:41,391 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:41,392 INFO L134 CoverageAnalysis]: 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,392 INFO L185 omatonBuilderFactory]: Interpolants [151136#(not (= working1 working0)), 151130#false, 151131#(<= end0 next), 151129#true, 151134#(<= (+ working0 1) iter1), 151135#(not (= iter1 working0)), 151132#(<= (+ iter0 1) next), 151133#(<= (+ iter0 1) iter1)] [2018-07-23 13:37:41,392 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:41,392 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:41,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:41,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:41,393 INFO L87 Difference]: Start difference. First operand 2719 states and 4036 transitions. Second operand 8 states. [2018-07-23 13:37:42,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:42,504 INFO L93 Difference]: Finished difference Result 3086 states and 4558 transitions. [2018-07-23 13:37:42,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:42,505 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-07-23 13:37:42,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:42,512 INFO L225 Difference]: With dead ends: 3086 [2018-07-23 13:37:42,513 INFO L226 Difference]: Without dead ends: 3084 [2018-07-23 13:37:42,514 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:42,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2018-07-23 13:37:43,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 2747. [2018-07-23 13:37:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2747 states. [2018-07-23 13:37:43,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2747 states to 2747 states and 4080 transitions. [2018-07-23 13:37:43,502 INFO L78 Accepts]: Start accepts. Automaton has 2747 states and 4080 transitions. Word has length 22 [2018-07-23 13:37:43,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:43,503 INFO L471 AbstractCegarLoop]: Abstraction has 2747 states and 4080 transitions. [2018-07-23 13:37:43,503 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:43,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2747 states and 4080 transitions. [2018-07-23 13:37:43,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:37:43,505 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:43,505 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:43,505 INFO L414 AbstractCegarLoop]: === Iteration 50 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:43,505 INFO L82 PathProgramCache]: Analyzing trace with hash 627807824, now seen corresponding path program 1 times [2018-07-23 13:37:43,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:43,536 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:43,537 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:43,537 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:43,537 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:43,538 INFO L185 omatonBuilderFactory]: Interpolants [162819#true, 162822#(<= (+ end1 iter0) (* 2 iter1)), 162823#(<= (+ end1 iter0) (+ (* 2 iter1) 1)), 162820#false, 162821#(<= (+ workload iter0) next), 162826#(or (<= (+ end1 1) iter1) (not (= iter1 working0))), 162827#(not (= iter1 working0)), 162824#(and (<= (+ end1 iter0) (+ (* 2 iter1) 1)) (= iter0 working0)), 162825#(<= (+ end1 working0) (+ (* 2 iter1) 1)), 162828#(not (= working1 working0))] [2018-07-23 13:37:43,538 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:43,538 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:43,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:43,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:43,539 INFO L87 Difference]: Start difference. First operand 2747 states and 4080 transitions. Second operand 10 states. [2018-07-23 13:37:44,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:44,895 INFO L93 Difference]: Finished difference Result 3253 states and 4807 transitions. [2018-07-23 13:37:44,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:37:44,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-07-23 13:37:44,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:44,901 INFO L225 Difference]: With dead ends: 3253 [2018-07-23 13:37:44,901 INFO L226 Difference]: Without dead ends: 3251 [2018-07-23 13:37:44,902 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:37:44,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3251 states. [2018-07-23 13:37:45,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3251 to 2802. [2018-07-23 13:37:45,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2802 states. [2018-07-23 13:37:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 4162 transitions. [2018-07-23 13:37:45,832 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 4162 transitions. Word has length 22 [2018-07-23 13:37:45,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:45,832 INFO L471 AbstractCegarLoop]: Abstraction has 2802 states and 4162 transitions. [2018-07-23 13:37:45,832 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:45,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 4162 transitions. [2018-07-23 13:37:45,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:37:45,835 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:45,835 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:37:45,835 INFO L414 AbstractCegarLoop]: === Iteration 51 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:45,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1964547658, now seen corresponding path program 2 times [2018-07-23 13:37:45,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:45,851 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:45,851 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:45,851 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:45,851 INFO L134 CoverageAnalysis]: 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,852 INFO L185 omatonBuilderFactory]: Interpolants [174967#true, 174970#(and (<= end1 next) (= iter1 working1)), 174971#(<= (+ working1 end1 1) (+ iter1 next)), 174968#false, 174969#(<= end1 next), 174974#(not (= iter0 working1)), 174975#(not (= working0 working1)), 174972#(<= (+ working1 2) next), 174973#(<= (+ working1 2) iter0)] [2018-07-23 13:37:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:45,852 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:45,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:45,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:45,852 INFO L87 Difference]: Start difference. First operand 2802 states and 4162 transitions. Second operand 9 states. [2018-07-23 13:37:46,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:46,819 INFO L93 Difference]: Finished difference Result 2833 states and 4197 transitions. [2018-07-23 13:37:46,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:46,819 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-07-23 13:37:46,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:46,824 INFO L225 Difference]: With dead ends: 2833 [2018-07-23 13:37:46,825 INFO L226 Difference]: Without dead ends: 2832 [2018-07-23 13:37:46,826 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:46,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2018-07-23 13:37:47,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2802. [2018-07-23 13:37:47,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2802 states. [2018-07-23 13:37:47,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 4158 transitions. [2018-07-23 13:37:47,837 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 4158 transitions. Word has length 22 [2018-07-23 13:37:47,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:47,838 INFO L471 AbstractCegarLoop]: Abstraction has 2802 states and 4158 transitions. [2018-07-23 13:37:47,838 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 4158 transitions. [2018-07-23 13:37:47,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:37:47,840 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:47,841 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:47,841 INFO L414 AbstractCegarLoop]: === Iteration 52 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:47,841 INFO L82 PathProgramCache]: Analyzing trace with hash -430310174, now seen corresponding path program 1 times [2018-07-23 13:37:47,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:47,863 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:47,864 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:47,864 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:47,864 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:47,864 INFO L134 CoverageAnalysis]: 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,865 INFO L185 omatonBuilderFactory]: Interpolants [186258#true, 186259#false, 186262#(and (<= (+ iter1 1) next) (= iter1 working1)), 186263#(<= (+ working1 1) next), 186260#(<= end1 next), 186261#(<= (+ iter1 1) next), 186266#(not (= working0 working1)), 186264#(<= (+ working1 1) iter0), 186265#(not (= iter0 working1))] [2018-07-23 13:37:47,865 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:47,865 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:47,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:47,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:47,866 INFO L87 Difference]: Start difference. First operand 2802 states and 4158 transitions. Second operand 9 states. [2018-07-23 13:37:49,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:49,165 INFO L93 Difference]: Finished difference Result 3077 states and 4552 transitions. [2018-07-23 13:37:49,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:37:49,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-07-23 13:37:49,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:49,169 INFO L225 Difference]: With dead ends: 3077 [2018-07-23 13:37:49,170 INFO L226 Difference]: Without dead ends: 3075 [2018-07-23 13:37:49,171 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:37:49,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2018-07-23 13:37:50,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 2917. [2018-07-23 13:37:50,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2917 states. [2018-07-23 13:37:50,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 4324 transitions. [2018-07-23 13:37:50,149 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 4324 transitions. Word has length 22 [2018-07-23 13:37:50,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:50,149 INFO L471 AbstractCegarLoop]: Abstraction has 2917 states and 4324 transitions. [2018-07-23 13:37:50,149 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:50,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 4324 transitions. [2018-07-23 13:37:50,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:37:50,151 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:50,151 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:50,151 INFO L414 AbstractCegarLoop]: === Iteration 53 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:50,152 INFO L82 PathProgramCache]: Analyzing trace with hash -203850887, now seen corresponding path program 1 times [2018-07-23 13:37:50,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:50,168 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:50,168 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:50,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:50,169 INFO L134 CoverageAnalysis]: 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,169 INFO L185 omatonBuilderFactory]: Interpolants [198289#(not (= working0 working1)), 198288#(not (= iter0 working1)), 198283#(<= end1 next), 198282#false, 198281#true, 198287#(<= (+ working1 2) iter0), 198286#(<= (+ working1 end1 1) (+ iter1 iter0)), 198285#(<= (+ working1 end1) (+ iter1 iter0)), 198284#(<= end1 iter0)] [2018-07-23 13:37:50,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:50,169 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:50,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:50,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:50,170 INFO L87 Difference]: Start difference. First operand 2917 states and 4324 transitions. Second operand 9 states. [2018-07-23 13:37:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:51,373 INFO L93 Difference]: Finished difference Result 3087 states and 4560 transitions. [2018-07-23 13:37:51,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:51,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-07-23 13:37:51,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:51,377 INFO L225 Difference]: With dead ends: 3087 [2018-07-23 13:37:51,377 INFO L226 Difference]: Without dead ends: 3086 [2018-07-23 13:37:51,378 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3086 states. [2018-07-23 13:37:52,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3086 to 2915. [2018-07-23 13:37:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2915 states. [2018-07-23 13:37:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 4314 transitions. [2018-07-23 13:37:52,437 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 4314 transitions. Word has length 22 [2018-07-23 13:37:52,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:52,437 INFO L471 AbstractCegarLoop]: Abstraction has 2915 states and 4314 transitions. [2018-07-23 13:37:52,437 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 4314 transitions. [2018-07-23 13:37:52,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:37:52,439 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:52,439 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:52,439 INFO L414 AbstractCegarLoop]: === Iteration 54 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:52,439 INFO L82 PathProgramCache]: Analyzing trace with hash 345073063, now seen corresponding path program 1 times [2018-07-23 13:37:52,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:52,456 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:52,457 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:52,457 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:52,457 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:52,457 INFO L134 CoverageAnalysis]: 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,458 INFO L185 omatonBuilderFactory]: Interpolants [210307#false, 210306#true, 210311#(<= (+ working1 1) iter0), 210310#(<= (+ iter1 1) iter0), 210309#(<= (+ iter1 1) next), 210308#(<= end1 next), 210313#(not (= working0 working1)), 210312#(not (= iter0 working1))] [2018-07-23 13:37:52,458 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:52,458 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:52,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:52,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:52,458 INFO L87 Difference]: Start difference. First operand 2915 states and 4314 transitions. Second operand 8 states. [2018-07-23 13:37:53,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:53,757 INFO L93 Difference]: Finished difference Result 3266 states and 4816 transitions. [2018-07-23 13:37:53,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:53,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-07-23 13:37:53,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:53,762 INFO L225 Difference]: With dead ends: 3266 [2018-07-23 13:37:53,762 INFO L226 Difference]: Without dead ends: 3264 [2018-07-23 13:37:53,763 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2018-07-23 13:37:54,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 2934. [2018-07-23 13:37:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2934 states. [2018-07-23 13:37:54,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 4340 transitions. [2018-07-23 13:37:54,897 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 4340 transitions. Word has length 22 [2018-07-23 13:37:54,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:54,897 INFO L471 AbstractCegarLoop]: Abstraction has 2934 states and 4340 transitions. [2018-07-23 13:37:54,897 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:54,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 4340 transitions. [2018-07-23 13:37:54,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:37:54,901 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:54,901 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:54,901 INFO L414 AbstractCegarLoop]: === Iteration 55 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:54,902 INFO L82 PathProgramCache]: Analyzing trace with hash -619973631, now seen corresponding path program 2 times [2018-07-23 13:37:54,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:54,920 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:54,920 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:54,920 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:54,920 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:54,921 INFO L134 CoverageAnalysis]: 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,921 INFO L185 omatonBuilderFactory]: Interpolants [222739#(not (= working0 working1)), 222738#(not (= working0 iter1)), 222737#(not (= iter0 iter1)), 222736#(<= (+ iter1 1) iter0), 222731#false, 222730#true, 222735#(<= iter1 iter0), 222734#(<= iter1 next), 222733#(<= (+ iter1 1) next), 222732#(<= 1 workload)] [2018-07-23 13:37:54,921 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:54,921 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:54,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:54,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:54,922 INFO L87 Difference]: Start difference. First operand 2934 states and 4340 transitions. Second operand 10 states. [2018-07-23 13:37:56,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:56,837 INFO L93 Difference]: Finished difference Result 3688 states and 5467 transitions. [2018-07-23 13:37:56,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:37:56,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-07-23 13:37:56,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:56,841 INFO L225 Difference]: With dead ends: 3688 [2018-07-23 13:37:56,841 INFO L226 Difference]: Without dead ends: 3686 [2018-07-23 13:37:56,842 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=336, Invalid=854, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:37:56,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2018-07-23 13:37:57,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3074. [2018-07-23 13:37:57,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3074 states. [2018-07-23 13:37:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 4552 transitions. [2018-07-23 13:37:57,944 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 4552 transitions. Word has length 22 [2018-07-23 13:37:57,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:57,944 INFO L471 AbstractCegarLoop]: Abstraction has 3074 states and 4552 transitions. [2018-07-23 13:37:57,944 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:57,944 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 4552 transitions. [2018-07-23 13:37:57,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:37:57,947 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:57,947 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:57,947 INFO L414 AbstractCegarLoop]: === Iteration 56 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:37:57,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1613894486, now seen corresponding path program 1 times [2018-07-23 13:37:57,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:57,967 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:57,967 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:57,967 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:57,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:57,968 INFO L185 omatonBuilderFactory]: Interpolants [236323#(not (= working0 working1)), 236322#(not (= iter0 working1)), 236321#(or (<= (+ end0 1) iter0) (not (= iter0 working1))), 236320#(<= (+ working1 end0) (+ (* 2 iter0) 1)), 236315#false, 236314#true, 236319#(and (<= (+ end0 iter1) (+ (* 2 iter0) 1)) (= iter1 working1)), 236318#(<= (+ end0 iter1) (+ (* 2 iter0) 1)), 236317#(<= (+ end0 iter1) (* 2 iter0)), 236316#(<= (+ workload iter1) next)] [2018-07-23 13:37:57,968 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:57,968 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:57,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:57,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:57,968 INFO L87 Difference]: Start difference. First operand 3074 states and 4552 transitions. Second operand 10 states. [2018-07-23 13:37:59,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:59,545 INFO L93 Difference]: Finished difference Result 3608 states and 5324 transitions. [2018-07-23 13:37:59,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:37:59,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-07-23 13:37:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:59,552 INFO L225 Difference]: With dead ends: 3608 [2018-07-23 13:37:59,552 INFO L226 Difference]: Without dead ends: 3606 [2018-07-23 13:37:59,554 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:37:59,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2018-07-23 13:38:00,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 3133. [2018-07-23 13:38:00,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2018-07-23 13:38:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 4640 transitions. [2018-07-23 13:38:00,741 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 4640 transitions. Word has length 22 [2018-07-23 13:38:00,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:00,741 INFO L471 AbstractCegarLoop]: Abstraction has 3133 states and 4640 transitions. [2018-07-23 13:38:00,741 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:38:00,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 4640 transitions. [2018-07-23 13:38:00,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:38:00,743 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:00,744 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:00,744 INFO L414 AbstractCegarLoop]: === Iteration 57 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:38:00,744 INFO L82 PathProgramCache]: Analyzing trace with hash -682508600, now seen corresponding path program 2 times [2018-07-23 13:38:00,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-23 13:38:00,760 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:00,760 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:38:00,760 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:00,760 INFO L134 CoverageAnalysis]: 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,761 INFO L185 omatonBuilderFactory]: Interpolants [249843#(not (= iter1 working0)), 249842#(not (= next working0)), 249841#(<= (+ working0 2) next), 249840#(<= (+ end0 working0 1) (+ iter0 next)), 249844#(not (= working1 working0)), 249835#false, 249834#true, 249839#(<= (+ working0 1) next), 249838#(and (= iter0 working0) (<= (+ iter0 1) next)), 249837#(<= (+ iter0 1) next), 249836#(<= end0 next)] [2018-07-23 13:38:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-23 13:38:00,761 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:00,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:00,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:00,762 INFO L87 Difference]: Start difference. First operand 3133 states and 4640 transitions. Second operand 11 states. [2018-07-23 13:38:02,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:02,039 INFO L93 Difference]: Finished difference Result 3236 states and 4771 transitions. [2018-07-23 13:38:02,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:38:02,039 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-07-23 13:38:02,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:02,043 INFO L225 Difference]: With dead ends: 3236 [2018-07-23 13:38:02,043 INFO L226 Difference]: Without dead ends: 3235 [2018-07-23 13:38:02,044 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:38:02,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2018-07-23 13:38:03,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 3144. [2018-07-23 13:38:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3144 states. [2018-07-23 13:38:03,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3144 states to 3144 states and 4654 transitions. [2018-07-23 13:38:03,174 INFO L78 Accepts]: Start accepts. Automaton has 3144 states and 4654 transitions. Word has length 25 [2018-07-23 13:38:03,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:03,175 INFO L471 AbstractCegarLoop]: Abstraction has 3144 states and 4654 transitions. [2018-07-23 13:38:03,175 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:03,175 INFO L276 IsEmpty]: Start isEmpty. Operand 3144 states and 4654 transitions. [2018-07-23 13:38:03,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:38:03,177 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:03,177 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:38:03,177 INFO L414 AbstractCegarLoop]: === Iteration 58 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:38:03,177 INFO L82 PathProgramCache]: Analyzing trace with hash -548371823, now seen corresponding path program 1 times [2018-07-23 13:38:03,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:03,195 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:03,196 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:03,196 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:38:03,196 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:03,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:38:03,196 INFO L185 omatonBuilderFactory]: Interpolants [262644#(not (= iter1 working0)), 262645#(not (= working1 working0)), 262640#(<= (+ working0 1) next), 262641#(<= (+ workload working0 1) next), 262642#(<= (+ end1 working0 1) (* 2 iter1)), 262643#(or (not (= iter1 working0)) (<= (+ end1 3) iter1)), 262636#false, 262637#(<= end0 next), 262638#(<= (+ iter0 1) next), 262639#(and (= iter0 working0) (<= (+ iter0 1) next)), 262635#true] [2018-07-23 13:38:03,196 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:03,197 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:03,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:03,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:03,197 INFO L87 Difference]: Start difference. First operand 3144 states and 4654 transitions. Second operand 11 states. [2018-07-23 13:38:04,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:04,775 INFO L93 Difference]: Finished difference Result 3658 states and 5404 transitions. [2018-07-23 13:38:04,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 13:38:04,775 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-07-23 13:38:04,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:04,780 INFO L225 Difference]: With dead ends: 3658 [2018-07-23 13:38:04,780 INFO L226 Difference]: Without dead ends: 3656 [2018-07-23 13:38:04,782 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=242, Invalid=1164, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:38:04,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2018-07-23 13:38:06,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 3270. [2018-07-23 13:38:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3270 states. [2018-07-23 13:38:06,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 4837 transitions. [2018-07-23 13:38:06,126 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 4837 transitions. Word has length 25 [2018-07-23 13:38:06,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:06,126 INFO L471 AbstractCegarLoop]: Abstraction has 3270 states and 4837 transitions. [2018-07-23 13:38:06,126 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:06,126 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 4837 transitions. [2018-07-23 13:38:06,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:38:06,129 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:06,129 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:06,130 INFO L414 AbstractCegarLoop]: === Iteration 59 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:38:06,130 INFO L82 PathProgramCache]: Analyzing trace with hash -843643870, now seen corresponding path program 1 times [2018-07-23 13:38:06,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:38:06,153 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:06,154 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:38:06,154 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:06,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:06,154 INFO L185 omatonBuilderFactory]: Interpolants [276564#(not (= working0 iter1)), 276565#(not (= working0 working1)), 276560#(or (<= (+ end0 1) iter0) (not (= iter0 next))), 276561#(or (<= (+ end0 1) iter0) (not (= iter0 iter1))), 276562#(or (<= (+ end0 1) iter0) (not (= working0 iter1))), 276563#(or (<= (+ end0 2) iter0) (not (= working0 iter1))), 276556#true, 276557#false, 276558#(<= end0 next), 276559#(or (not (= iter0 next)) (<= (+ end0 end1) (+ iter1 iter0)))] [2018-07-23 13:38:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:38:06,155 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:38:06,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:38:06,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:38:06,155 INFO L87 Difference]: Start difference. First operand 3270 states and 4837 transitions. Second operand 10 states. [2018-07-23 13:38:07,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:07,746 INFO L93 Difference]: Finished difference Result 3411 states and 5033 transitions. [2018-07-23 13:38:07,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:38:07,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-07-23 13:38:07,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:07,751 INFO L225 Difference]: With dead ends: 3411 [2018-07-23 13:38:07,752 INFO L226 Difference]: Without dead ends: 3410 [2018-07-23 13:38:07,753 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:38:07,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3410 states. [2018-07-23 13:38:09,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3410 to 3284. [2018-07-23 13:38:09,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3284 states. [2018-07-23 13:38:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3284 states to 3284 states and 4859 transitions. [2018-07-23 13:38:09,027 INFO L78 Accepts]: Start accepts. Automaton has 3284 states and 4859 transitions. Word has length 25 [2018-07-23 13:38:09,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:09,028 INFO L471 AbstractCegarLoop]: Abstraction has 3284 states and 4859 transitions. [2018-07-23 13:38:09,028 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:38:09,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3284 states and 4859 transitions. [2018-07-23 13:38:09,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:38:09,031 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:09,031 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:09,031 INFO L414 AbstractCegarLoop]: === Iteration 60 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:38:09,031 INFO L82 PathProgramCache]: Analyzing trace with hash -843554207, now seen corresponding path program 1 times [2018-07-23 13:38:09,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:09,044 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:09,045 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:09,045 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:38:09,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:09,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:09,046 INFO L185 omatonBuilderFactory]: Interpolants [289988#true, 289989#false, 289990#(<= 1 workload), 289991#(<= (+ iter0 1) next), 289996#(not (= working0 iter1)), 289997#(not (= working0 working1)), 289992#(<= iter0 next), 289993#(or (<= end1 iter1) (not (= iter0 next))), 289994#(not (= iter0 next)), 289995#(not (= iter0 iter1))] [2018-07-23 13:38:09,046 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:09,046 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:38:09,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:38:09,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:38:09,046 INFO L87 Difference]: Start difference. First operand 3284 states and 4859 transitions. Second operand 10 states. [2018-07-23 13:38:10,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:10,926 INFO L93 Difference]: Finished difference Result 3561 states and 5284 transitions. [2018-07-23 13:38:10,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:38:10,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-07-23 13:38:10,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:10,931 INFO L225 Difference]: With dead ends: 3561 [2018-07-23 13:38:10,931 INFO L226 Difference]: Without dead ends: 3559 [2018-07-23 13:38:10,933 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:38:10,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3559 states. [2018-07-23 13:38:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3559 to 3286. [2018-07-23 13:38:12,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3286 states. [2018-07-23 13:38:12,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3286 states to 3286 states and 4860 transitions. [2018-07-23 13:38:12,353 INFO L78 Accepts]: Start accepts. Automaton has 3286 states and 4860 transitions. Word has length 25 [2018-07-23 13:38:12,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:12,353 INFO L471 AbstractCegarLoop]: Abstraction has 3286 states and 4860 transitions. [2018-07-23 13:38:12,353 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:38:12,353 INFO L276 IsEmpty]: Start isEmpty. Operand 3286 states and 4860 transitions. [2018-07-23 13:38:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:38:12,357 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:12,357 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:38:12,357 INFO L414 AbstractCegarLoop]: === Iteration 61 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:38:12,357 INFO L82 PathProgramCache]: Analyzing trace with hash -760804007, now seen corresponding path program 1 times [2018-07-23 13:38:12,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:12,377 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:12,377 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:38:12,378 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:12,378 INFO L134 CoverageAnalysis]: 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:12,378 INFO L185 omatonBuilderFactory]: Interpolants [303728#(not (= working0 next)), 303729#(not (= working0 iter1)), 303730#(not (= working0 working1)), 303724#(and (<= (+ iter0 2) end1) (= end1 next)), 303725#(<= (+ iter0 2) next), 303726#(<= (+ iter0 1) next), 303727#(not (= iter0 next)), 303720#true, 303721#false, 303722#(<= 1 workload), 303723#(<= (+ iter0 2) (+ workload next))] [2018-07-23 13:38:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:12,378 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:12,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:12,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:12,379 INFO L87 Difference]: Start difference. First operand 3286 states and 4860 transitions. Second operand 11 states. [2018-07-23 13:38:14,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:14,077 INFO L93 Difference]: Finished difference Result 3882 states and 5733 transitions. [2018-07-23 13:38:14,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:38:14,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-07-23 13:38:14,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:14,082 INFO L225 Difference]: With dead ends: 3882 [2018-07-23 13:38:14,082 INFO L226 Difference]: Without dead ends: 3880 [2018-07-23 13:38:14,084 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:38:14,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3880 states. [2018-07-23 13:38:15,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3880 to 3586. [2018-07-23 13:38:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3586 states. [2018-07-23 13:38:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3586 states and 5319 transitions. [2018-07-23 13:38:15,427 INFO L78 Accepts]: Start accepts. Automaton has 3586 states and 5319 transitions. Word has length 25 [2018-07-23 13:38:15,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:15,427 INFO L471 AbstractCegarLoop]: Abstraction has 3586 states and 5319 transitions. [2018-07-23 13:38:15,427 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:15,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3586 states and 5319 transitions. [2018-07-23 13:38:15,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:38:15,430 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:15,431 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:15,431 INFO L414 AbstractCegarLoop]: === Iteration 62 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:38:15,431 INFO L82 PathProgramCache]: Analyzing trace with hash -764742562, now seen corresponding path program 1 times [2018-07-23 13:38:15,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:15,453 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:15,453 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:15,453 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:38:15,453 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:15,454 INFO L134 CoverageAnalysis]: 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:15,454 INFO L185 omatonBuilderFactory]: Interpolants [318704#(not (= iter0 next)), 318705#(not (= iter0 iter1)), 318706#(not (= iter0 working1)), 318707#(not (= working0 working1)), 318700#(<= (+ iter0 1) next), 318701#(and (= end1 next) (<= (+ iter0 1) iter1)), 318702#(and (<= (+ iter0 2) end1) (= end1 next)), 318703#(<= (+ iter0 2) next), 318697#true, 318698#false, 318699#(<= 1 workload)] [2018-07-23 13:38:15,454 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:15,454 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:15,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:15,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:15,455 INFO L87 Difference]: Start difference. First operand 3586 states and 5319 transitions. Second operand 11 states. [2018-07-23 13:38:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:17,113 INFO L93 Difference]: Finished difference Result 3739 states and 5530 transitions. [2018-07-23 13:38:17,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:38:17,113 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-07-23 13:38:17,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:17,118 INFO L225 Difference]: With dead ends: 3739 [2018-07-23 13:38:17,118 INFO L226 Difference]: Without dead ends: 3737 [2018-07-23 13:38:17,119 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:38:17,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2018-07-23 13:38:18,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 3565. [2018-07-23 13:38:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3565 states. [2018-07-23 13:38:18,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 3565 states and 5287 transitions. [2018-07-23 13:38:18,449 INFO L78 Accepts]: Start accepts. Automaton has 3565 states and 5287 transitions. Word has length 25 [2018-07-23 13:38:18,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:18,449 INFO L471 AbstractCegarLoop]: Abstraction has 3565 states and 5287 transitions. [2018-07-23 13:38:18,449 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:18,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3565 states and 5287 transitions. [2018-07-23 13:38:18,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:38:18,451 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:18,451 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:18,452 INFO L414 AbstractCegarLoop]: === Iteration 63 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:38:18,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1119735578, now seen corresponding path program 2 times [2018-07-23 13:38:18,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:18,471 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:38:18,471 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:18,471 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:38:18,472 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:18,472 INFO L134 CoverageAnalysis]: 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:18,472 INFO L185 omatonBuilderFactory]: Interpolants [333333#(<= (+ end0 1) (+ workload next)), 333332#(<= 1 workload), 333335#(<= (+ end0 1) next), 333334#(and (= end1 next) (<= (+ end0 1) end1)), 333331#false, 333330#true, 333340#(not (= working0 working1)), 333337#(not (= iter0 next)), 333336#(or (<= (+ end0 1) iter0) (not (= iter0 next))), 333339#(not (= working0 iter1)), 333338#(not (= iter0 iter1))] [2018-07-23 13:38:18,472 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:38:18,473 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:18,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:18,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:18,473 INFO L87 Difference]: Start difference. First operand 3565 states and 5287 transitions. Second operand 11 states. [2018-07-23 13:38:19,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:19,989 INFO L93 Difference]: Finished difference Result 3781 states and 5599 transitions. [2018-07-23 13:38:19,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:38:19,990 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-07-23 13:38:19,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:19,994 INFO L225 Difference]: With dead ends: 3781 [2018-07-23 13:38:19,994 INFO L226 Difference]: Without dead ends: 3779 [2018-07-23 13:38:19,995 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:38:19,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3779 states. [2018-07-23 13:38:21,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3779 to 3649. [2018-07-23 13:38:21,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states. [2018-07-23 13:38:21,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 5423 transitions. [2018-07-23 13:38:21,410 INFO L78 Accepts]: Start accepts. Automaton has 3649 states and 5423 transitions. Word has length 25 [2018-07-23 13:38:21,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:21,410 INFO L471 AbstractCegarLoop]: Abstraction has 3649 states and 5423 transitions. [2018-07-23 13:38:21,410 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:21,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 5423 transitions. [2018-07-23 13:38:21,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:38:21,413 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:21,414 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:38:21,414 INFO L414 AbstractCegarLoop]: === Iteration 64 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:38:21,414 INFO L82 PathProgramCache]: Analyzing trace with hash -266056341, now seen corresponding path program 1 times [2018-07-23 13:38:21,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:21,428 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:21,428 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:21,428 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:38:21,429 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:21,429 INFO L134 CoverageAnalysis]: 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:21,429 INFO L185 omatonBuilderFactory]: Interpolants [348231#true, 348241#(not (= working0 working1)), 348240#(not (= iter0 working1)), 348237#(<= (+ end0 1) iter1), 348236#(<= (+ end0 1) next), 348239#(or (<= (+ end0 1) iter0) (not (= iter0 working1))), 348238#(<= (+ end0 1) working1), 348233#(<= end0 next), 348232#false, 348235#(and (= end1 next) (<= (+ end0 1) end1)), 348234#(and (<= end0 iter1) (= end1 next))] [2018-07-23 13:38:21,429 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:21,429 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:21,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:21,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:21,430 INFO L87 Difference]: Start difference. First operand 3649 states and 5423 transitions. Second operand 11 states. [2018-07-23 13:38:23,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:23,058 INFO L93 Difference]: Finished difference Result 3933 states and 5840 transitions. [2018-07-23 13:38:23,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:38:23,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-07-23 13:38:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:23,063 INFO L225 Difference]: With dead ends: 3933 [2018-07-23 13:38:23,063 INFO L226 Difference]: Without dead ends: 3931 [2018-07-23 13:38:23,064 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:38:23,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3931 states. [2018-07-23 13:38:24,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3931 to 3390. [2018-07-23 13:38:24,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3390 states. [2018-07-23 13:38:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 3390 states and 5040 transitions. [2018-07-23 13:38:24,425 INFO L78 Accepts]: Start accepts. Automaton has 3390 states and 5040 transitions. Word has length 25 [2018-07-23 13:38:24,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:24,426 INFO L471 AbstractCegarLoop]: Abstraction has 3390 states and 5040 transitions. [2018-07-23 13:38:24,426 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3390 states and 5040 transitions. [2018-07-23 13:38:24,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:38:24,428 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:24,428 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:38:24,428 INFO L414 AbstractCegarLoop]: === Iteration 65 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:38:24,428 INFO L82 PathProgramCache]: Analyzing trace with hash -327186069, now seen corresponding path program 2 times [2018-07-23 13:38:24,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:24,446 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:24,447 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:24,447 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:38:24,447 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:24,447 INFO L134 CoverageAnalysis]: 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:24,448 INFO L185 omatonBuilderFactory]: Interpolants [362917#(<= (+ end0 1) next), 362916#(and (= end1 next) (<= (+ end0 1) end1)), 362919#(or (<= (+ end0 1) iter0) (not (= iter0 iter1))), 362918#(<= (+ end0 1) iter1), 362913#false, 362912#true, 362915#(and (<= end0 iter1) (= end1 next)), 362914#(<= end0 next), 362921#(not (= iter0 working1)), 362920#(not (= iter0 iter1)), 362922#(not (= working0 working1))] [2018-07-23 13:38:24,448 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:24,448 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:24,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:24,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:24,448 INFO L87 Difference]: Start difference. First operand 3390 states and 5040 transitions. Second operand 11 states. [2018-07-23 13:38:26,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:26,226 INFO L93 Difference]: Finished difference Result 3713 states and 5498 transitions. [2018-07-23 13:38:26,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:38:26,227 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-07-23 13:38:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:26,230 INFO L225 Difference]: With dead ends: 3713 [2018-07-23 13:38:26,231 INFO L226 Difference]: Without dead ends: 3711 [2018-07-23 13:38:26,232 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:38:26,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2018-07-23 13:38:27,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3317. [2018-07-23 13:38:27,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3317 states. [2018-07-23 13:38:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4921 transitions. [2018-07-23 13:38:27,626 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4921 transitions. Word has length 25 [2018-07-23 13:38:27,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:27,626 INFO L471 AbstractCegarLoop]: Abstraction has 3317 states and 4921 transitions. [2018-07-23 13:38:27,627 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:27,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4921 transitions. [2018-07-23 13:38:27,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:38:27,629 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:27,629 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:38:27,629 INFO L414 AbstractCegarLoop]: === Iteration 66 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:38:27,629 INFO L82 PathProgramCache]: Analyzing trace with hash -682179085, now seen corresponding path program 1 times [2018-07-23 13:38:27,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:27,647 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:38:27,648 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:27,648 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:38:27,648 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:27,648 INFO L134 CoverageAnalysis]: 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:27,648 INFO L185 omatonBuilderFactory]: Interpolants [377013#true, 377015#(<= end0 next), 377014#false, 377024#(not (= working0 working1)), 377021#(or (<= (+ end0 1) iter0) (not (= working0 iter1))), 377020#(or (<= (+ end0 1) iter0) (not (= iter0 iter1))), 377023#(not (= working0 iter1)), 377022#(or (<= (+ end0 2) iter0) (not (= working0 iter1))), 377017#(and (= end1 next) (<= (+ end0 1) end1)), 377016#(and (<= end0 iter1) (= end1 next)), 377019#(<= (+ end0 1) iter1), 377018#(<= (+ end0 1) next)] [2018-07-23 13:38:27,649 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:38:27,649 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:38:27,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:38:27,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:38:27,649 INFO L87 Difference]: Start difference. First operand 3317 states and 4921 transitions. Second operand 12 states. [2018-07-23 13:38:29,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:29,290 INFO L93 Difference]: Finished difference Result 3507 states and 5215 transitions. [2018-07-23 13:38:29,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:38:29,290 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-07-23 13:38:29,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:29,294 INFO L225 Difference]: With dead ends: 3507 [2018-07-23 13:38:29,294 INFO L226 Difference]: Without dead ends: 3506 [2018-07-23 13:38:29,296 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=242, Invalid=570, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:38:29,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2018-07-23 13:38:30,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3311. [2018-07-23 13:38:30,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3311 states. [2018-07-23 13:38:30,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 4896 transitions. [2018-07-23 13:38:30,707 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 4896 transitions. Word has length 25 [2018-07-23 13:38:30,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:30,707 INFO L471 AbstractCegarLoop]: Abstraction has 3311 states and 4896 transitions. [2018-07-23 13:38:30,707 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:38:30,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 4896 transitions. [2018-07-23 13:38:30,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:38:30,709 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:30,709 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:30,709 INFO L414 AbstractCegarLoop]: === Iteration 67 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:38:30,710 INFO L82 PathProgramCache]: Analyzing trace with hash -682089422, now seen corresponding path program 1 times [2018-07-23 13:38:30,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:30,724 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:38:30,724 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:30,724 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:38:30,724 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:30,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:30,725 INFO L185 omatonBuilderFactory]: Interpolants [390695#true, 390705#(not (= working0 working1)), 390704#(not (= working0 iter1)), 390701#(<= (+ end0 1) iter1), 390700#(<= (+ end0 1) next), 390703#(not (= iter0 iter1)), 390702#(<= (+ iter0 2) iter1), 390697#(<= end0 next), 390696#false, 390699#(and (= end1 next) (<= (+ end0 1) end1)), 390698#(and (<= end0 iter1) (= end1 next))] [2018-07-23 13:38:30,725 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:38:30,725 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:30,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:30,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:30,725 INFO L87 Difference]: Start difference. First operand 3311 states and 4896 transitions. Second operand 11 states. [2018-07-23 13:38:32,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:32,506 INFO L93 Difference]: Finished difference Result 3779 states and 5560 transitions. [2018-07-23 13:38:32,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:38:32,507 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-07-23 13:38:32,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:32,511 INFO L225 Difference]: With dead ends: 3779 [2018-07-23 13:38:32,511 INFO L226 Difference]: Without dead ends: 3777 [2018-07-23 13:38:32,512 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=241, Invalid=571, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:38:32,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3777 states. [2018-07-23 13:38:33,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3777 to 3309. [2018-07-23 13:38:33,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3309 states. [2018-07-23 13:38:33,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3309 states to 3309 states and 4898 transitions. [2018-07-23 13:38:33,893 INFO L78 Accepts]: Start accepts. Automaton has 3309 states and 4898 transitions. Word has length 25 [2018-07-23 13:38:33,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:33,894 INFO L471 AbstractCegarLoop]: Abstraction has 3309 states and 4898 transitions. [2018-07-23 13:38:33,894 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:33,894 INFO L276 IsEmpty]: Start isEmpty. Operand 3309 states and 4898 transitions. [2018-07-23 13:38:33,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:38:33,896 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:33,896 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:33,896 INFO L414 AbstractCegarLoop]: === Iteration 68 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:38:33,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1834260598, now seen corresponding path program 2 times [2018-07-23 13:38:33,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:33,915 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-23 13:38:33,916 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:33,916 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:38:33,916 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:33,916 INFO L134 CoverageAnalysis]: 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:33,916 INFO L185 omatonBuilderFactory]: Interpolants [404918#true, 404919#false, 404928#(not (= working1 working0)), 404926#(not (= working1 next)), 404927#(not (= working1 iter0)), 404924#(<= (+ working1 end1 1) (+ iter1 next)), 404925#(<= (+ working1 2) next), 404922#(and (<= (+ iter1 1) next) (= iter1 working1)), 404923#(<= (+ working1 1) next), 404920#(<= end1 next), 404921#(<= (+ iter1 1) next)] [2018-07-23 13:38:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-23 13:38:33,917 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:33,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:33,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:33,917 INFO L87 Difference]: Start difference. First operand 3309 states and 4898 transitions. Second operand 11 states. [2018-07-23 13:38:35,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:35,505 INFO L93 Difference]: Finished difference Result 3453 states and 5091 transitions. [2018-07-23 13:38:35,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:38:35,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-07-23 13:38:35,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:35,509 INFO L225 Difference]: With dead ends: 3453 [2018-07-23 13:38:35,509 INFO L226 Difference]: Without dead ends: 3452 [2018-07-23 13:38:35,510 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:38:35,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3452 states. [2018-07-23 13:38:36,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3452 to 3335. [2018-07-23 13:38:36,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3335 states. [2018-07-23 13:38:36,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 3335 states and 4934 transitions. [2018-07-23 13:38:36,968 INFO L78 Accepts]: Start accepts. Automaton has 3335 states and 4934 transitions. Word has length 25 [2018-07-23 13:38:36,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:36,969 INFO L471 AbstractCegarLoop]: Abstraction has 3335 states and 4934 transitions. [2018-07-23 13:38:36,969 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:36,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4934 transitions. [2018-07-23 13:38:36,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:38:36,971 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:36,971 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:38:36,971 INFO L414 AbstractCegarLoop]: === Iteration 69 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:38:36,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1045899279, now seen corresponding path program 1 times [2018-07-23 13:38:36,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:36,992 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:36,992 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:36,992 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:38:36,993 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:36,993 INFO L134 CoverageAnalysis]: 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:36,993 INFO L185 omatonBuilderFactory]: Interpolants [418535#true, 418544#(not (= iter0 working1)), 418545#(not (= working0 working1)), 418542#(<= (+ working1 end0 1) (* 2 iter0)), 418543#(or (not (= iter0 working1)) (<= (+ end0 3) iter0)), 418540#(<= (+ working1 1) next), 418541#(<= (+ working1 workload 1) next), 418538#(<= (+ iter1 1) next), 418539#(and (<= (+ iter1 1) next) (= iter1 working1)), 418536#false, 418537#(<= end1 next)] [2018-07-23 13:38:36,993 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:36,993 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:36,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:36,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:36,994 INFO L87 Difference]: Start difference. First operand 3335 states and 4934 transitions. Second operand 11 states. [2018-07-23 13:38:39,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:39,080 INFO L93 Difference]: Finished difference Result 3881 states and 5736 transitions. [2018-07-23 13:38:39,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 13:38:39,080 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-07-23 13:38:39,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:39,085 INFO L225 Difference]: With dead ends: 3881 [2018-07-23 13:38:39,085 INFO L226 Difference]: Without dead ends: 3879 [2018-07-23 13:38:39,086 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=242, Invalid=1164, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:38:39,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3879 states. [2018-07-23 13:38:40,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3879 to 3492. [2018-07-23 13:38:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3492 states. [2018-07-23 13:38:40,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3492 states to 3492 states and 5163 transitions. [2018-07-23 13:38:40,655 INFO L78 Accepts]: Start accepts. Automaton has 3492 states and 5163 transitions. Word has length 25 [2018-07-23 13:38:40,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:40,655 INFO L471 AbstractCegarLoop]: Abstraction has 3492 states and 5163 transitions. [2018-07-23 13:38:40,655 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:40,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3492 states and 5163 transitions. [2018-07-23 13:38:40,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:38:40,658 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:40,658 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:40,659 INFO L414 AbstractCegarLoop]: === Iteration 70 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:38:40,659 INFO L82 PathProgramCache]: Analyzing trace with hash -746629056, now seen corresponding path program 1 times [2018-07-23 13:38:40,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:38:40,674 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:40,674 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:38:40,675 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:40,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:40,675 INFO L185 omatonBuilderFactory]: Interpolants [433350#(or (not (= iter1 next)) (<= (+ end1 1) iter1)), 433351#(or (<= (+ end1 1) iter1) (not (= iter1 iter0))), 433348#(<= end1 next), 433349#(or (not (= iter1 next)) (<= (+ end0 end1) (+ iter1 iter0))), 433346#true, 433347#false, 433354#(not (= working1 iter0)), 433355#(not (= working1 working0)), 433352#(or (<= (+ end1 1) iter1) (not (= working1 iter0))), 433353#(or (not (= working1 iter0)) (<= (+ end1 2) iter1))] [2018-07-23 13:38:40,675 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:38:40,675 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:38:40,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:38:40,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:38:40,675 INFO L87 Difference]: Start difference. First operand 3492 states and 5163 transitions. Second operand 10 states. [2018-07-23 13:38:42,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:42,446 INFO L93 Difference]: Finished difference Result 3625 states and 5347 transitions. [2018-07-23 13:38:42,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:38:42,446 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-07-23 13:38:42,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:42,451 INFO L225 Difference]: With dead ends: 3625 [2018-07-23 13:38:42,451 INFO L226 Difference]: Without dead ends: 3624 [2018-07-23 13:38:42,452 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:38:42,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3624 states. [2018-07-23 13:38:44,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3624 to 3506. [2018-07-23 13:38:44,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3506 states. [2018-07-23 13:38:44,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3506 states to 3506 states and 5185 transitions. [2018-07-23 13:38:44,090 INFO L78 Accepts]: Start accepts. Automaton has 3506 states and 5185 transitions. Word has length 25 [2018-07-23 13:38:44,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:44,090 INFO L471 AbstractCegarLoop]: Abstraction has 3506 states and 5185 transitions. [2018-07-23 13:38:44,090 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:38:44,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3506 states and 5185 transitions. [2018-07-23 13:38:44,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:38:44,093 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:44,093 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:44,093 INFO L414 AbstractCegarLoop]: === Iteration 71 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:38:44,093 INFO L82 PathProgramCache]: Analyzing trace with hash -746540097, now seen corresponding path program 1 times [2018-07-23 13:38:44,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:44,109 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:44,110 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:44,110 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:38:44,110 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:44,110 INFO L134 CoverageAnalysis]: 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,111 INFO L185 omatonBuilderFactory]: Interpolants [447654#(<= iter1 next), 447655#(or (not (= iter1 next)) (<= end0 iter0)), 447652#(<= 1 workload), 447653#(<= (+ iter1 1) next), 447650#true, 447651#false, 447658#(not (= working1 iter0)), 447659#(not (= working1 working0)), 447656#(not (= iter1 next)), 447657#(not (= iter1 iter0))] [2018-07-23 13:38:44,111 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:44,111 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:38:44,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:38:44,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:38:44,111 INFO L87 Difference]: Start difference. First operand 3506 states and 5185 transitions. Second operand 10 states. [2018-07-23 13:38:46,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:46,055 INFO L93 Difference]: Finished difference Result 3779 states and 5600 transitions. [2018-07-23 13:38:46,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:38:46,055 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-07-23 13:38:46,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:46,059 INFO L225 Difference]: With dead ends: 3779 [2018-07-23 13:38:46,059 INFO L226 Difference]: Without dead ends: 3777 [2018-07-23 13:38:46,060 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:38:46,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3777 states. [2018-07-23 13:38:47,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3777 to 3508. [2018-07-23 13:38:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3508 states. [2018-07-23 13:38:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3508 states to 3508 states and 5186 transitions. [2018-07-23 13:38:47,665 INFO L78 Accepts]: Start accepts. Automaton has 3508 states and 5186 transitions. Word has length 25 [2018-07-23 13:38:47,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:47,666 INFO L471 AbstractCegarLoop]: Abstraction has 3508 states and 5186 transitions. [2018-07-23 13:38:47,666 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:38:47,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3508 states and 5186 transitions. [2018-07-23 13:38:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:38:47,668 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:47,668 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:38:47,668 INFO L414 AbstractCegarLoop]: === Iteration 72 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:38:47,668 INFO L82 PathProgramCache]: Analyzing trace with hash -2007923005, now seen corresponding path program 1 times [2018-07-23 13:38:47,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:47,683 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:47,683 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:47,683 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:38:47,683 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:47,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:38:47,683 INFO L185 omatonBuilderFactory]: Interpolants [462263#false, 462262#true, 462272#(not (= working1 working0)), 462271#(not (= working1 iter0)), 462270#(not (= working1 next)), 462269#(not (= iter1 next)), 462268#(<= (+ iter1 1) next), 462267#(<= (+ iter1 2) next), 462266#(and (= end0 next) (<= (+ iter1 2) end0)), 462265#(<= (+ iter1 2) (+ workload next)), 462264#(<= 1 workload)] [2018-07-23 13:38:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:47,684 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:47,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:47,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:47,684 INFO L87 Difference]: Start difference. First operand 3508 states and 5186 transitions. Second operand 11 states. [2018-07-23 13:38:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:49,672 INFO L93 Difference]: Finished difference Result 4106 states and 6063 transitions. [2018-07-23 13:38:49,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:38:49,672 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-07-23 13:38:49,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:49,676 INFO L225 Difference]: With dead ends: 4106 [2018-07-23 13:38:49,676 INFO L226 Difference]: Without dead ends: 4104 [2018-07-23 13:38:49,677 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:38:49,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4104 states. [2018-07-23 13:38:51,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4104 to 3808. [2018-07-23 13:38:51,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3808 states. [2018-07-23 13:38:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3808 states to 3808 states and 5645 transitions. [2018-07-23 13:38:51,367 INFO L78 Accepts]: Start accepts. Automaton has 3808 states and 5645 transitions. Word has length 25 [2018-07-23 13:38:51,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:51,368 INFO L471 AbstractCegarLoop]: Abstraction has 3808 states and 5645 transitions. [2018-07-23 13:38:51,368 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:51,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3808 states and 5645 transitions. [2018-07-23 13:38:51,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:38:51,370 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:51,370 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:38:51,370 INFO L414 AbstractCegarLoop]: === Iteration 73 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:38:51,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1294788559, now seen corresponding path program 2 times [2018-07-23 13:38:51,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:51,393 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:51,393 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:38:51,394 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:51,394 INFO L134 CoverageAnalysis]: 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:51,394 INFO L185 omatonBuilderFactory]: Interpolants [478135#(and (= end0 next) (<= (+ end1 1) end0)), 478134#(<= (+ end1 1) (+ workload next)), 478133#(<= 1 workload), 478132#false, 478131#true, 478141#(not (= working1 working0)), 478140#(not (= working1 iter0)), 478139#(not (= iter1 iter0)), 478138#(not (= iter1 next)), 478137#(or (not (= iter1 next)) (<= (+ end1 1) iter1)), 478136#(<= (+ end1 1) next)] [2018-07-23 13:38:51,394 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:51,394 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:51,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:51,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:51,395 INFO L87 Difference]: Start difference. First operand 3808 states and 5645 transitions. Second operand 11 states. [2018-07-23 13:38:53,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:53,313 INFO L93 Difference]: Finished difference Result 4020 states and 5953 transitions. [2018-07-23 13:38:53,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:38:53,313 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-07-23 13:38:53,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:53,319 INFO L225 Difference]: With dead ends: 4020 [2018-07-23 13:38:53,319 INFO L226 Difference]: Without dead ends: 4018 [2018-07-23 13:38:53,320 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:38:53,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4018 states. [2018-07-23 13:38:55,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4018 to 3902. [2018-07-23 13:38:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3902 states. [2018-07-23 13:38:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3902 states to 3902 states and 5795 transitions. [2018-07-23 13:38:55,099 INFO L78 Accepts]: Start accepts. Automaton has 3902 states and 5795 transitions. Word has length 25 [2018-07-23 13:38:55,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:55,100 INFO L471 AbstractCegarLoop]: Abstraction has 3902 states and 5795 transitions. [2018-07-23 13:38:55,100 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3902 states and 5795 transitions. [2018-07-23 13:38:55,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:38:55,102 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:55,102 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:38:55,102 INFO L414 AbstractCegarLoop]: === Iteration 74 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:38:55,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1649781575, now seen corresponding path program 1 times [2018-07-23 13:38:55,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:55,121 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:55,121 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:55,121 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:38:55,121 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:55,122 INFO L134 CoverageAnalysis]: 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:55,122 INFO L185 omatonBuilderFactory]: Interpolants [494023#(not (= iter1 next)), 494022#(<= (+ iter1 2) next), 494021#(and (= end0 next) (<= (+ iter1 2) end0)), 494020#(and (= end0 next) (<= (+ iter1 1) iter0)), 494019#(<= (+ iter1 1) next), 494018#(<= 1 workload), 494017#false, 494016#true, 494026#(not (= working1 working0)), 494025#(not (= iter1 working0)), 494024#(not (= iter1 iter0))] [2018-07-23 13:38:55,122 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:55,122 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:55,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:55,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:55,123 INFO L87 Difference]: Start difference. First operand 3902 states and 5795 transitions. Second operand 11 states. [2018-07-23 13:38:57,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:57,361 INFO L93 Difference]: Finished difference Result 4050 states and 5999 transitions. [2018-07-23 13:38:57,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:38:57,361 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-07-23 13:38:57,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:57,366 INFO L225 Difference]: With dead ends: 4050 [2018-07-23 13:38:57,366 INFO L226 Difference]: Without dead ends: 4048 [2018-07-23 13:38:57,368 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:38:57,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4048 states. [2018-07-23 13:38:59,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4048 to 3881. [2018-07-23 13:38:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3881 states. [2018-07-23 13:38:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3881 states to 3881 states and 5763 transitions. [2018-07-23 13:38:59,145 INFO L78 Accepts]: Start accepts. Automaton has 3881 states and 5763 transitions. Word has length 25 [2018-07-23 13:38:59,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:59,146 INFO L471 AbstractCegarLoop]: Abstraction has 3881 states and 5763 transitions. [2018-07-23 13:38:59,146 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3881 states and 5763 transitions. [2018-07-23 13:38:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:38:59,148 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:59,148 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:38:59,148 INFO L414 AbstractCegarLoop]: === Iteration 75 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:38:59,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1238220129, now seen corresponding path program 3 times [2018-07-23 13:38:59,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:59,165 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:59,165 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:38:59,165 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:59,165 INFO L134 CoverageAnalysis]: 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:59,165 INFO L185 omatonBuilderFactory]: Interpolants [509911#(or (<= (+ end1 1) iter1) (not (= working1 iter0))), 509910#(or (<= (+ end1 1) iter1) (not (= iter1 iter0))), 509909#(<= (+ end1 1) iter0), 509908#(<= (+ end1 1) next), 509907#(and (= end0 next) (<= (+ end1 1) end0)), 509906#(<= (+ end1 1) (+ workload next)), 509905#(<= 1 workload), 509904#false, 509903#true, 509914#(not (= working1 working0)), 509913#(not (= working1 iter0)), 509912#(or (not (= working1 iter0)) (<= (+ end1 2) iter1))] [2018-07-23 13:38:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:59,166 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:38:59,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:38:59,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:38:59,166 INFO L87 Difference]: Start difference. First operand 3881 states and 5763 transitions. Second operand 12 states. [2018-07-23 13:39:01,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:01,125 INFO L93 Difference]: Finished difference Result 4100 states and 6121 transitions. [2018-07-23 13:39:01,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:39:01,125 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-07-23 13:39:01,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:01,130 INFO L225 Difference]: With dead ends: 4100 [2018-07-23 13:39:01,130 INFO L226 Difference]: Without dead ends: 4099 [2018-07-23 13:39:01,131 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:39:01,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4099 states. [2018-07-23 13:39:02,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 3881. [2018-07-23 13:39:02,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3881 states. [2018-07-23 13:39:02,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3881 states to 3881 states and 5751 transitions. [2018-07-23 13:39:02,874 INFO L78 Accepts]: Start accepts. Automaton has 3881 states and 5751 transitions. Word has length 25 [2018-07-23 13:39:02,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:02,874 INFO L471 AbstractCegarLoop]: Abstraction has 3881 states and 5751 transitions. [2018-07-23 13:39:02,874 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:39:02,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3881 states and 5751 transitions. [2018-07-23 13:39:02,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:39:02,877 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:02,878 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:02,878 INFO L414 AbstractCegarLoop]: === Iteration 76 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:39:02,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1238131170, now seen corresponding path program 1 times [2018-07-23 13:39:02,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:02,890 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:39:02,891 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:02,891 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:39:02,891 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:02,891 INFO L134 CoverageAnalysis]: 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:02,891 INFO L185 omatonBuilderFactory]: Interpolants [525899#true, 525900#false, 525901#(<= end1 next), 525902#(and (= end0 next) (<= end1 iter0)), 525903#(and (= end0 next) (<= (+ end1 1) end0)), 525904#(<= (+ end1 1) next), 525905#(<= (+ end1 1) iter0), 525906#(<= (+ iter1 2) iter0), 525907#(not (= iter1 iter0)), 525908#(not (= working1 iter0)), 525909#(not (= working1 working0))] [2018-07-23 13:39:02,891 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:39:02,892 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:39:02,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:39:02,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:39:02,892 INFO L87 Difference]: Start difference. First operand 3881 states and 5751 transitions. Second operand 11 states. [2018-07-23 13:39:05,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:05,018 INFO L93 Difference]: Finished difference Result 4334 states and 6405 transitions. [2018-07-23 13:39:05,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:39:05,018 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-07-23 13:39:05,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:05,023 INFO L225 Difference]: With dead ends: 4334 [2018-07-23 13:39:05,023 INFO L226 Difference]: Without dead ends: 4332 [2018-07-23 13:39:05,024 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=241, Invalid=571, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:39:05,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4332 states. [2018-07-23 13:39:06,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4332 to 3884. [2018-07-23 13:39:06,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3884 states. [2018-07-23 13:39:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3884 states to 3884 states and 5761 transitions. [2018-07-23 13:39:06,802 INFO L78 Accepts]: Start accepts. Automaton has 3884 states and 5761 transitions. Word has length 25 [2018-07-23 13:39:06,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:06,803 INFO L471 AbstractCegarLoop]: Abstraction has 3884 states and 5761 transitions. [2018-07-23 13:39:06,803 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:39:06,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3884 states and 5761 transitions. [2018-07-23 13:39:06,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:39:06,805 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:06,805 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:39:06,805 INFO L414 AbstractCegarLoop]: === Iteration 77 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:39:06,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1593213145, now seen corresponding path program 2 times [2018-07-23 13:39:06,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:06,825 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:06,826 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:06,826 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:39:06,826 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:06,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:39:06,826 INFO L185 omatonBuilderFactory]: Interpolants [542392#(not (= working1 working0)), 542382#true, 542383#false, 542384#(<= 1 workload), 542385#(<= (+ end1 1) (+ workload next)), 542386#(and (= end0 next) (<= (+ end1 1) end0)), 542387#(<= (+ end1 1) next), 542388#(<= (+ end1 1) iter0), 542389#(or (<= (+ end1 1) iter1) (not (= iter1 iter0))), 542390#(not (= iter1 iter0)), 542391#(not (= iter1 working0))] [2018-07-23 13:39:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:06,827 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:39:06,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:39:06,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:39:06,827 INFO L87 Difference]: Start difference. First operand 3884 states and 5761 transitions. Second operand 11 states. [2018-07-23 13:39:08,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:08,939 INFO L93 Difference]: Finished difference Result 4233 states and 6284 transitions. [2018-07-23 13:39:08,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:39:08,940 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-07-23 13:39:08,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:08,944 INFO L225 Difference]: With dead ends: 4233 [2018-07-23 13:39:08,944 INFO L226 Difference]: Without dead ends: 4231 [2018-07-23 13:39:08,945 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:39:08,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4231 states. [2018-07-23 13:39:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4231 to 3898. [2018-07-23 13:39:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2018-07-23 13:39:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5767 transitions. [2018-07-23 13:39:10,780 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5767 transitions. Word has length 25 [2018-07-23 13:39:10,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:10,780 INFO L471 AbstractCegarLoop]: Abstraction has 3898 states and 5767 transitions. [2018-07-23 13:39:10,780 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:39:10,780 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5767 transitions. [2018-07-23 13:39:10,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:39:10,782 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:10,783 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:39:10,783 INFO L414 AbstractCegarLoop]: === Iteration 78 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:39:10,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1654342873, now seen corresponding path program 3 times [2018-07-23 13:39:10,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:10,801 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:10,801 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:39:10,802 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:10,802 INFO L134 CoverageAnalysis]: 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:10,802 INFO L185 omatonBuilderFactory]: Interpolants [558680#(<= (+ end1 1) (+ workload next)), 558681#(and (= end0 next) (<= (+ end1 1) end0)), 558682#(<= (+ end1 1) next), 558683#(<= (+ end1 1) iter0), 558684#(<= (+ end1 1) working0), 558685#(or (<= (+ end1 1) iter1) (not (= iter1 working0))), 558686#(not (= iter1 working0)), 558687#(not (= working1 working0)), 558677#true, 558678#false, 558679#(<= 1 workload)] [2018-07-23 13:39:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:10,802 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:39:10,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:39:10,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:39:10,803 INFO L87 Difference]: Start difference. First operand 3898 states and 5767 transitions. Second operand 11 states. [2018-07-23 13:39:12,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:12,968 INFO L93 Difference]: Finished difference Result 4193 states and 6183 transitions. [2018-07-23 13:39:12,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:39:12,969 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-07-23 13:39:12,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:12,973 INFO L225 Difference]: With dead ends: 4193 [2018-07-23 13:39:12,973 INFO L226 Difference]: Without dead ends: 4191 [2018-07-23 13:39:12,974 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:39:12,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4191 states. [2018-07-23 13:39:14,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4191 to 3545. [2018-07-23 13:39:14,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3545 states. [2018-07-23 13:39:14,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3545 states to 3545 states and 5244 transitions. [2018-07-23 13:39:14,661 INFO L78 Accepts]: Start accepts. Automaton has 3545 states and 5244 transitions. Word has length 25 [2018-07-23 13:39:14,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:14,661 INFO L471 AbstractCegarLoop]: Abstraction has 3545 states and 5244 transitions. [2018-07-23 13:39:14,661 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:39:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3545 states and 5244 transitions. [2018-07-23 13:39:14,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 13:39:14,664 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:14,664 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:14,664 INFO L414 AbstractCegarLoop]: === Iteration 79 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:39:14,664 INFO L82 PathProgramCache]: Analyzing trace with hash 787908893, now seen corresponding path program 3 times [2018-07-23 13:39:14,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:14,682 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-23 13:39:14,683 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:14,683 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:39:14,683 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:14,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:39:14,683 INFO L185 omatonBuilderFactory]: Interpolants [574184#true, 574185#false, 574186#(<= end0 next), 574187#(<= (+ iter0 1) next), 574188#(<= (+ iter0 1) iter1), 574189#(<= (+ iter0 2) iter1), 574190#(not (= iter1 iter0)), 574191#(not (= working1 iter0)), 574192#(not (= working1 working0))] [2018-07-23 13:39:14,684 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-23 13:39:14,684 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:39:14,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:39:14,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:39:14,684 INFO L87 Difference]: Start difference. First operand 3545 states and 5244 transitions. Second operand 9 states. [2018-07-23 13:39:16,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:16,656 INFO L93 Difference]: Finished difference Result 3941 states and 5794 transitions. [2018-07-23 13:39:16,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:39:16,656 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-07-23 13:39:16,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:16,661 INFO L225 Difference]: With dead ends: 3941 [2018-07-23 13:39:16,661 INFO L226 Difference]: Without dead ends: 3939 [2018-07-23 13:39:16,662 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:39:16,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states. [2018-07-23 13:39:18,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 3561. [2018-07-23 13:39:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3561 states. [2018-07-23 13:39:18,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3561 states to 3561 states and 5266 transitions. [2018-07-23 13:39:18,399 INFO L78 Accepts]: Start accepts. Automaton has 3561 states and 5266 transitions. Word has length 26 [2018-07-23 13:39:18,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:18,399 INFO L471 AbstractCegarLoop]: Abstraction has 3561 states and 5266 transitions. [2018-07-23 13:39:18,399 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:39:18,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3561 states and 5266 transitions. [2018-07-23 13:39:18,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 13:39:18,402 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:18,402 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:18,403 INFO L414 AbstractCegarLoop]: === Iteration 80 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:39:18,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1399836586, now seen corresponding path program 1 times [2018-07-23 13:39:18,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:39:18,418 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:18,419 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:39:18,419 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:18,419 INFO L134 CoverageAnalysis]: 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:18,419 INFO L185 omatonBuilderFactory]: Interpolants [589213#true, 589214#false, 589215#(<= end0 next), 589216#(<= end0 iter1), 589217#(<= (+ iter0 1) iter1), 589218#(<= (+ iter0 2) iter1), 589219#(not (= iter1 iter0)), 589220#(not (= working1 iter0)), 589221#(not (= working1 working0))] [2018-07-23 13:39:18,419 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:39:18,420 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:39:18,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:39:18,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:39:18,420 INFO L87 Difference]: Start difference. First operand 3561 states and 5266 transitions. Second operand 9 states. [2018-07-23 13:39:20,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:20,546 INFO L93 Difference]: Finished difference Result 4069 states and 5985 transitions. [2018-07-23 13:39:20,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:39:20,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-07-23 13:39:20,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:20,551 INFO L225 Difference]: With dead ends: 4069 [2018-07-23 13:39:20,551 INFO L226 Difference]: Without dead ends: 4067 [2018-07-23 13:39:20,552 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:39:20,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2018-07-23 13:39:22,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 3477. [2018-07-23 13:39:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3477 states. [2018-07-23 13:39:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3477 states to 3477 states and 5132 transitions. [2018-07-23 13:39:22,297 INFO L78 Accepts]: Start accepts. Automaton has 3477 states and 5132 transitions. Word has length 26 [2018-07-23 13:39:22,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:22,297 INFO L471 AbstractCegarLoop]: Abstraction has 3477 states and 5132 transitions. [2018-07-23 13:39:22,297 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:39:22,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3477 states and 5132 transitions. [2018-07-23 13:39:22,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 13:39:22,299 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:22,299 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:22,299 INFO L414 AbstractCegarLoop]: === Iteration 81 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:39:22,299 INFO L82 PathProgramCache]: Analyzing trace with hash -2111506926, now seen corresponding path program 1 times [2018-07-23 13:39:22,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:39:22,310 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:22,310 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:39:22,311 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:22,311 INFO L134 CoverageAnalysis]: 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:22,311 INFO L185 omatonBuilderFactory]: Interpolants [604331#false, 604330#true, 604333#(<= end0 iter1), 604332#(<= end0 next), 604335#(and (= iter0 working0) (<= (+ iter0 1) iter1)), 604334#(<= (+ iter0 1) iter1), 604337#(not (= iter1 working0)), 604336#(<= (+ working0 1) iter1), 604338#(not (= working1 working0))] [2018-07-23 13:39:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:39:22,311 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:39:22,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:39:22,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:39:22,312 INFO L87 Difference]: Start difference. First operand 3477 states and 5132 transitions. Second operand 9 states. [2018-07-23 13:39:24,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:24,451 INFO L93 Difference]: Finished difference Result 4012 states and 5890 transitions. [2018-07-23 13:39:24,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:39:24,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-07-23 13:39:24,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:24,456 INFO L225 Difference]: With dead ends: 4012 [2018-07-23 13:39:24,456 INFO L226 Difference]: Without dead ends: 4010 [2018-07-23 13:39:24,457 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:39:24,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4010 states. [2018-07-23 13:39:26,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4010 to 3427. [2018-07-23 13:39:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3427 states. [2018-07-23 13:39:26,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 5054 transitions. [2018-07-23 13:39:26,211 INFO L78 Accepts]: Start accepts. Automaton has 3427 states and 5054 transitions. Word has length 26 [2018-07-23 13:39:26,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:26,211 INFO L471 AbstractCegarLoop]: Abstraction has 3427 states and 5054 transitions. [2018-07-23 13:39:26,211 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:39:26,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3427 states and 5054 transitions. [2018-07-23 13:39:26,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 13:39:26,214 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:26,215 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:26,215 INFO L414 AbstractCegarLoop]: === Iteration 82 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:39:26,215 INFO L82 PathProgramCache]: Analyzing trace with hash -538919271, now seen corresponding path program 3 times [2018-07-23 13:39:26,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-23 13:39:26,229 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:26,229 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:39:26,230 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:26,230 INFO L134 CoverageAnalysis]: 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:26,230 INFO L185 omatonBuilderFactory]: Interpolants [619241#(not (= working0 working1)), 619240#(not (= working0 iter1)), 619233#true, 619235#(<= end1 next), 619234#false, 619237#(<= (+ iter1 1) iter0), 619236#(<= (+ iter1 1) next), 619239#(not (= iter0 iter1)), 619238#(<= (+ iter1 2) iter0)] [2018-07-23 13:39:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-23 13:39:26,231 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:39:26,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:39:26,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:39:26,231 INFO L87 Difference]: Start difference. First operand 3427 states and 5054 transitions. Second operand 9 states. [2018-07-23 13:39:28,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:28,331 INFO L93 Difference]: Finished difference Result 3823 states and 5604 transitions. [2018-07-23 13:39:28,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:39:28,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-07-23 13:39:28,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:28,336 INFO L225 Difference]: With dead ends: 3823 [2018-07-23 13:39:28,336 INFO L226 Difference]: Without dead ends: 3821 [2018-07-23 13:39:28,337 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:39:28,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2018-07-23 13:39:30,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 3443. [2018-07-23 13:39:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3443 states. [2018-07-23 13:39:30,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 5076 transitions. [2018-07-23 13:39:30,133 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 5076 transitions. Word has length 26 [2018-07-23 13:39:30,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:30,133 INFO L471 AbstractCegarLoop]: Abstraction has 3443 states and 5076 transitions. [2018-07-23 13:39:30,133 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:39:30,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 5076 transitions. [2018-07-23 13:39:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 13:39:30,135 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:30,135 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:30,135 INFO L414 AbstractCegarLoop]: === Iteration 83 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:39:30,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1694948846, now seen corresponding path program 1 times [2018-07-23 13:39:30,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:39:30,153 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:30,153 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:39:30,153 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:30,153 INFO L134 CoverageAnalysis]: 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:30,154 INFO L185 omatonBuilderFactory]: Interpolants [633791#false, 633790#true, 633793#(<= end1 iter0), 633792#(<= end1 next), 633795#(and (<= (+ iter1 1) iter0) (= iter1 working1)), 633794#(<= (+ iter1 1) iter0), 633797#(not (= iter0 working1)), 633796#(<= (+ working1 1) iter0), 633798#(not (= working0 working1))] [2018-07-23 13:39:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:39:30,154 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:39:30,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:39:30,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:39:30,154 INFO L87 Difference]: Start difference. First operand 3443 states and 5076 transitions. Second operand 9 states. [2018-07-23 13:39:32,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:32,400 INFO L93 Difference]: Finished difference Result 3990 states and 5852 transitions. [2018-07-23 13:39:32,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:39:32,401 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-07-23 13:39:32,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:32,405 INFO L225 Difference]: With dead ends: 3990 [2018-07-23 13:39:32,405 INFO L226 Difference]: Without dead ends: 3988 [2018-07-23 13:39:32,406 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:39:32,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3988 states. [2018-07-23 13:39:34,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3988 to 3412. [2018-07-23 13:39:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3412 states. [2018-07-23 13:39:34,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3412 states to 3412 states and 5028 transitions. [2018-07-23 13:39:34,158 INFO L78 Accepts]: Start accepts. Automaton has 3412 states and 5028 transitions. Word has length 26 [2018-07-23 13:39:34,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:34,158 INFO L471 AbstractCegarLoop]: Abstraction has 3412 states and 5028 transitions. [2018-07-23 13:39:34,158 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:39:34,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3412 states and 5028 transitions. [2018-07-23 13:39:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 13:39:34,160 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:34,160 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:34,160 INFO L414 AbstractCegarLoop]: === Iteration 84 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:39:34,160 INFO L82 PathProgramCache]: Analyzing trace with hash 729902152, now seen corresponding path program 1 times [2018-07-23 13:39:34,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:39:34,173 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:34,173 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:39:34,173 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39: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:39:34,174 INFO L185 omatonBuilderFactory]: Interpolants [648619#true, 648621#(<= end1 next), 648620#false, 648623#(<= (+ iter1 1) iter0), 648622#(<= end1 iter0), 648625#(not (= iter0 iter1)), 648624#(<= (+ iter1 2) iter0), 648627#(not (= working0 working1)), 648626#(not (= working0 iter1))] [2018-07-23 13:39:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:39:34,174 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:39:34,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:39:34,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:39:34,175 INFO L87 Difference]: Start difference. First operand 3412 states and 5028 transitions. Second operand 9 states. [2018-07-23 13:39:36,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:36,633 INFO L93 Difference]: Finished difference Result 3873 states and 5676 transitions. [2018-07-23 13:39:36,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:39:36,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-07-23 13:39:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:36,636 INFO L225 Difference]: With dead ends: 3873 [2018-07-23 13:39:36,636 INFO L226 Difference]: Without dead ends: 3871 [2018-07-23 13:39:36,637 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:39:36,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3871 states. [2018-07-23 13:39:38,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3871 to 3309. [2018-07-23 13:39:38,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3309 states. [2018-07-23 13:39:38,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3309 states to 3309 states and 4864 transitions. [2018-07-23 13:39:38,372 INFO L78 Accepts]: Start accepts. Automaton has 3309 states and 4864 transitions. Word has length 26 [2018-07-23 13:39:38,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:38,373 INFO L471 AbstractCegarLoop]: Abstraction has 3309 states and 4864 transitions. [2018-07-23 13:39:38,373 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:39:38,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3309 states and 4864 transitions. [2018-07-23 13:39:38,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:39:38,376 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:38,376 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:38,376 INFO L414 AbstractCegarLoop]: === Iteration 85 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:39:38,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1263161747, now seen corresponding path program 2 times [2018-07-23 13:39:38,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:38,399 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:38,399 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:39:38,399 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:38,399 INFO L134 CoverageAnalysis]: 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:38,399 INFO L185 omatonBuilderFactory]: Interpolants [663016#(not (= working0 iter1)), 663017#(not (= working0 working1)), 663010#(<= (* 2 end0) (+ workload iter0 next)), 663011#(<= (+ (* 2 end0) 1) (+ workload iter0 next)), 663008#true, 663009#false, 663014#(not (= iter0 next)), 663015#(not (= working0 next)), 663012#(<= (+ iter0 3) (+ workload next)), 663013#(<= (+ iter0 2) (+ workload next))] [2018-07-23 13:39:38,399 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:38,400 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:39:38,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:39:38,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:39:38,400 INFO L87 Difference]: Start difference. First operand 3309 states and 4864 transitions. Second operand 10 states. [2018-07-23 13:39:40,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:40,630 INFO L93 Difference]: Finished difference Result 3625 states and 5291 transitions. [2018-07-23 13:39:40,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:39:40,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-07-23 13:39:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:40,634 INFO L225 Difference]: With dead ends: 3625 [2018-07-23 13:39:40,635 INFO L226 Difference]: Without dead ends: 3623 [2018-07-23 13:39:40,636 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:39:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2018-07-23 13:39:42,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3411. [2018-07-23 13:39:42,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3411 states. [2018-07-23 13:39:42,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3411 states to 3411 states and 5008 transitions. [2018-07-23 13:39:42,519 INFO L78 Accepts]: Start accepts. Automaton has 3411 states and 5008 transitions. Word has length 29 [2018-07-23 13:39:42,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:42,519 INFO L471 AbstractCegarLoop]: Abstraction has 3411 states and 5008 transitions. [2018-07-23 13:39:42,519 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:39:42,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3411 states and 5008 transitions. [2018-07-23 13:39:42,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:39:42,522 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:42,522 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:42,522 INFO L414 AbstractCegarLoop]: === Iteration 86 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:39:42,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1259223192, now seen corresponding path program 2 times [2018-07-23 13:39:42,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:42,536 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:39:42,536 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:42,536 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:39:42,536 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:42,537 INFO L185 omatonBuilderFactory]: Interpolants [677130#(not (= iter0 working1)), 677131#(not (= working0 working1)), 677128#(not (= iter0 next)), 677129#(not (= iter0 iter1)), 677122#true, 677123#false, 677126#(<= iter0 next), 677127#(or (<= end1 iter1) (not (= iter0 next))), 677124#(<= end0 next), 677125#(<= (+ iter0 1) next)] [2018-07-23 13:39:42,537 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:39:42,537 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:39:42,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:39:42,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:39:42,538 INFO L87 Difference]: Start difference. First operand 3411 states and 5008 transitions. Second operand 10 states. [2018-07-23 13:39:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:44,703 INFO L93 Difference]: Finished difference Result 3682 states and 5400 transitions. [2018-07-23 13:39:44,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:39:44,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-07-23 13:39:44,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:44,708 INFO L225 Difference]: With dead ends: 3682 [2018-07-23 13:39:44,708 INFO L226 Difference]: Without dead ends: 3680 [2018-07-23 13:39:44,709 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:39:44,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2018-07-23 13:39:46,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3422. [2018-07-23 13:39:46,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3422 states. [2018-07-23 13:39:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 3422 states and 5023 transitions. [2018-07-23 13:39:46,622 INFO L78 Accepts]: Start accepts. Automaton has 3422 states and 5023 transitions. Word has length 29 [2018-07-23 13:39:46,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:46,622 INFO L471 AbstractCegarLoop]: Abstraction has 3422 states and 5023 transitions. [2018-07-23 13:39:46,622 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:39:46,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3422 states and 5023 transitions. [2018-07-23 13:39:46,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:39:46,625 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:46,625 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:46,626 INFO L414 AbstractCegarLoop]: === Iteration 87 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:39:46,626 INFO L82 PathProgramCache]: Analyzing trace with hash 904319839, now seen corresponding path program 2 times [2018-07-23 13:39:46,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-23 13:39:46,640 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:46,640 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:39:46,640 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:46,640 INFO L134 CoverageAnalysis]: 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:46,640 INFO L185 omatonBuilderFactory]: Interpolants [691386#(not (= working0 working1)), 691384#(not (= iter0 iter1)), 691385#(not (= working0 iter1)), 691378#true, 691379#false, 691382#(or (<= (+ end1 1) iter1) (not (= iter0 next))), 691383#(not (= iter0 next)), 691380#(<= end0 next), 691381#(<= (+ iter0 1) next)] [2018-07-23 13:39:46,641 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-23 13:39:46,641 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:39:46,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:39:46,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:39:46,641 INFO L87 Difference]: Start difference. First operand 3422 states and 5023 transitions. Second operand 9 states. [2018-07-23 13:39:48,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:48,661 INFO L93 Difference]: Finished difference Result 3641 states and 5314 transitions. [2018-07-23 13:39:48,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:39:48,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-07-23 13:39:48,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:48,665 INFO L225 Difference]: With dead ends: 3641 [2018-07-23 13:39:48,665 INFO L226 Difference]: Without dead ends: 3639 [2018-07-23 13:39:48,666 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:39:48,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3639 states. [2018-07-23 13:39:50,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3639 to 3420. [2018-07-23 13:39:50,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3420 states. [2018-07-23 13:39:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3420 states to 3420 states and 5021 transitions. [2018-07-23 13:39:50,585 INFO L78 Accepts]: Start accepts. Automaton has 3420 states and 5021 transitions. Word has length 29 [2018-07-23 13:39:50,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:50,585 INFO L471 AbstractCegarLoop]: Abstraction has 3420 states and 5021 transitions. [2018-07-23 13:39:50,585 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:39:50,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3420 states and 5021 transitions. [2018-07-23 13:39:50,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:39:50,587 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:50,587 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:50,588 INFO L414 AbstractCegarLoop]: === Iteration 88 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:39:50,588 INFO L82 PathProgramCache]: Analyzing trace with hash 987070039, now seen corresponding path program 3 times [2018-07-23 13:39:50,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:50,605 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:50,605 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:39:50,605 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:50,605 INFO L134 CoverageAnalysis]: 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:50,605 INFO L185 omatonBuilderFactory]: Interpolants [705546#(not (= working0 next)), 705547#(not (= working0 iter1)), 705544#(<= (+ iter0 2) next), 705545#(not (= iter0 next)), 705548#(not (= working0 working1)), 705538#false, 705539#(<= (* 2 end0) (+ workload iter0 next)), 705537#true, 705542#(and (<= (+ iter0 3) end1) (= end1 next)), 705543#(<= (+ iter0 3) next), 705540#(<= (+ (* 2 end0) 1) (+ workload iter0 next)), 705541#(<= (+ iter0 3) (+ workload next))] [2018-07-23 13:39:50,606 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:50,606 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:39:50,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:39:50,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:39:50,606 INFO L87 Difference]: Start difference. First operand 3420 states and 5021 transitions. Second operand 12 states. [2018-07-23 13:39:52,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:52,809 INFO L93 Difference]: Finished difference Result 3801 states and 5543 transitions. [2018-07-23 13:39:52,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:39:52,810 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-07-23 13:39:52,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:52,814 INFO L225 Difference]: With dead ends: 3801 [2018-07-23 13:39:52,814 INFO L226 Difference]: Without dead ends: 3799 [2018-07-23 13:39:52,815 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:39:52,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3799 states. [2018-07-23 13:39:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3799 to 3547. [2018-07-23 13:39:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3547 states. [2018-07-23 13:39:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 5208 transitions. [2018-07-23 13:39:54,782 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 5208 transitions. Word has length 29 [2018-07-23 13:39:54,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:54,783 INFO L471 AbstractCegarLoop]: Abstraction has 3547 states and 5208 transitions. [2018-07-23 13:39:54,783 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:39:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 5208 transitions. [2018-07-23 13:39:54,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:39:54,785 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:54,785 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:54,785 INFO L414 AbstractCegarLoop]: === Iteration 89 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:39:54,785 INFO L82 PathProgramCache]: Analyzing trace with hash 983131868, now seen corresponding path program 1 times [2018-07-23 13:39:54,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:39:54,803 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:54,803 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:39:54,803 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:54,803 INFO L134 CoverageAnalysis]: 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:54,804 INFO L185 omatonBuilderFactory]: Interpolants [720282#(not (= iter1 working0)), 720283#(not (= working1 working0)), 720280#(<= (+ working0 1) next), 720281#(<= (+ working0 1) iter1), 720274#false, 720275#(<= 1 workload), 720273#true, 720278#(and (= end1 next) (<= iter0 iter1)), 720279#(and (= end1 next) (<= (+ iter0 1) end1)), 720276#(<= (+ iter0 1) next), 720277#(<= iter0 next)] [2018-07-23 13:39:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:39:54,804 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:39:54,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:39:54,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:39:54,805 INFO L87 Difference]: Start difference. First operand 3547 states and 5208 transitions. Second operand 11 states. [2018-07-23 13:39:57,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:57,348 INFO L93 Difference]: Finished difference Result 3952 states and 5785 transitions. [2018-07-23 13:39:57,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:39:57,348 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-07-23 13:39:57,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:57,353 INFO L225 Difference]: With dead ends: 3952 [2018-07-23 13:39:57,353 INFO L226 Difference]: Without dead ends: 3950 [2018-07-23 13:39:57,354 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=227, Invalid=585, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:39:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3950 states. [2018-07-23 13:39:59,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3950 to 3525. [2018-07-23 13:39:59,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3525 states. [2018-07-23 13:39:59,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3525 states and 5180 transitions. [2018-07-23 13:39:59,448 INFO L78 Accepts]: Start accepts. Automaton has 3525 states and 5180 transitions. Word has length 29 [2018-07-23 13:39:59,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:59,448 INFO L471 AbstractCegarLoop]: Abstraction has 3525 states and 5180 transitions. [2018-07-23 13:39:59,448 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:39:59,448 INFO L276 IsEmpty]: Start isEmpty. Operand 3525 states and 5180 transitions. [2018-07-23 13:39:59,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:39:59,450 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:59,450 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:59,451 INFO L414 AbstractCegarLoop]: === Iteration 90 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:39:59,451 INFO L82 PathProgramCache]: Analyzing trace with hash 983131484, now seen corresponding path program 3 times [2018-07-23 13:39:59,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:59,466 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:39:59,466 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:59,466 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:39:59,466 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:59,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:39:59,467 INFO L185 omatonBuilderFactory]: Interpolants [735275#false, 735274#true, 735279#(and (<= (+ iter0 2) end1) (= end1 next)), 735278#(and (= end1 next) (<= (+ iter0 1) iter1)), 735277#(<= (+ iter0 1) next), 735276#(<= end0 next), 735283#(not (= iter0 working1)), 735282#(not (= iter0 iter1)), 735281#(not (= iter0 next)), 735280#(<= (+ iter0 2) next), 735284#(not (= working0 working1))] [2018-07-23 13:39:59,467 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:39:59,467 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:39:59,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:39:59,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:39:59,467 INFO L87 Difference]: Start difference. First operand 3525 states and 5180 transitions. Second operand 11 states. [2018-07-23 13:40:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:02,005 INFO L93 Difference]: Finished difference Result 3893 states and 5708 transitions. [2018-07-23 13:40:02,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:40:02,005 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-07-23 13:40:02,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:02,010 INFO L225 Difference]: With dead ends: 3893 [2018-07-23 13:40:02,010 INFO L226 Difference]: Without dead ends: 3891 [2018-07-23 13:40:02,011 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:40:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3891 states. [2018-07-23 13:40:04,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3891 to 3651. [2018-07-23 13:40:04,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3651 states. [2018-07-23 13:40:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 5369 transitions. [2018-07-23 13:40:04,153 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 5369 transitions. Word has length 29 [2018-07-23 13:40:04,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:04,153 INFO L471 AbstractCegarLoop]: Abstraction has 3651 states and 5369 transitions. [2018-07-23 13:40:04,153 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:40:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 5369 transitions. [2018-07-23 13:40:04,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:40:04,156 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:04,156 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:04,156 INFO L414 AbstractCegarLoop]: === Iteration 91 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:40:04,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1481907752, now seen corresponding path program 1 times [2018-07-23 13:40:04,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:40:04,171 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:04,171 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:40:04,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:04,172 INFO L134 CoverageAnalysis]: 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,172 INFO L185 omatonBuilderFactory]: Interpolants [750395#(<= 1 workload), 750394#false, 750393#true, 750399#(and (= end1 next) (<= (+ iter0 1) end1)), 750398#(and (= end1 next) (<= iter0 iter1)), 750397#(<= iter0 next), 750396#(<= (+ iter0 1) next), 750403#(not (= working1 working0)), 750402#(not (= iter1 working0)), 750401#(not (= iter1 iter0)), 750400#(<= (+ iter0 1) iter1)] [2018-07-23 13:40:04,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:40:04,172 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:40:04,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:40:04,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:40:04,172 INFO L87 Difference]: Start difference. First operand 3651 states and 5369 transitions. Second operand 11 states. [2018-07-23 13:40:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:07,452 INFO L93 Difference]: Finished difference Result 4812 states and 7078 transitions. [2018-07-23 13:40:07,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:40:07,453 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-07-23 13:40:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:07,458 INFO L225 Difference]: With dead ends: 4812 [2018-07-23 13:40:07,458 INFO L226 Difference]: Without dead ends: 4810 [2018-07-23 13:40:07,460 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:40:07,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2018-07-23 13:40:09,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4121. [2018-07-23 13:40:09,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4121 states. [2018-07-23 13:40:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4121 states to 4121 states and 6087 transitions. [2018-07-23 13:40:09,887 INFO L78 Accepts]: Start accepts. Automaton has 4121 states and 6087 transitions. Word has length 29 [2018-07-23 13:40:09,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:09,887 INFO L471 AbstractCegarLoop]: Abstraction has 4121 states and 6087 transitions. [2018-07-23 13:40:09,887 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:40:09,887 INFO L276 IsEmpty]: Start isEmpty. Operand 4121 states and 6087 transitions. [2018-07-23 13:40:09,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:40:09,889 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:09,890 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:09,890 INFO L414 AbstractCegarLoop]: === Iteration 92 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:40:09,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1420688361, now seen corresponding path program 1 times [2018-07-23 13:40:09,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:40:09,905 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:09,905 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:40:09,905 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:09,906 INFO L134 CoverageAnalysis]: 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:09,906 INFO L185 omatonBuilderFactory]: Interpolants [768314#(not (= working1 working0)), 768313#(not (= iter1 working0)), 768312#(<= (+ working0 1) iter1), 768307#(<= (+ iter0 1) next), 768306#(<= 1 workload), 768305#false, 768304#true, 768311#(<= (+ iter0 1) iter1), 768310#(and (= end1 next) (<= (+ iter0 1) end1)), 768309#(and (= end1 next) (<= iter0 iter1)), 768308#(<= iter0 next)] [2018-07-23 13:40:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:40:09,906 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:40:09,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:40:09,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:40:09,907 INFO L87 Difference]: Start difference. First operand 4121 states and 6087 transitions. Second operand 11 states. [2018-07-23 13:40:13,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:13,341 INFO L93 Difference]: Finished difference Result 4922 states and 7248 transitions. [2018-07-23 13:40:13,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:40:13,342 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-07-23 13:40:13,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:13,348 INFO L225 Difference]: With dead ends: 4922 [2018-07-23 13:40:13,348 INFO L226 Difference]: Without dead ends: 4920 [2018-07-23 13:40:13,350 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=233, Invalid=579, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:40:13,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4920 states. [2018-07-23 13:40:15,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4920 to 4061. [2018-07-23 13:40:15,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4061 states. [2018-07-23 13:40:15,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4061 states to 4061 states and 5988 transitions. [2018-07-23 13:40:15,812 INFO L78 Accepts]: Start accepts. Automaton has 4061 states and 5988 transitions. Word has length 29 [2018-07-23 13:40:15,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:15,812 INFO L471 AbstractCegarLoop]: Abstraction has 4061 states and 5988 transitions. [2018-07-23 13:40:15,812 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:40:15,812 INFO L276 IsEmpty]: Start isEmpty. Operand 4061 states and 5988 transitions. [2018-07-23 13:40:15,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:40:15,814 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:15,815 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:15,815 INFO L414 AbstractCegarLoop]: === Iteration 93 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:40:15,815 INFO L82 PathProgramCache]: Analyzing trace with hash -474699493, now seen corresponding path program 4 times [2018-07-23 13:40:15,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-07-23 13:40:15,835 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:15,835 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:40:15,836 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:15,836 INFO L134 CoverageAnalysis]: 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:15,836 INFO L185 omatonBuilderFactory]: Interpolants [786328#(not (= working0 working1)), 786319#(<= end0 next), 786318#false, 786317#true, 786323#(or (<= (+ end0 1) iter0) (not (= iter0 next))), 786322#(<= (+ end0 1) next), 786321#(and (= end1 next) (<= (+ end0 1) end1)), 786320#(and (<= end0 iter1) (= end1 next)), 786327#(not (= working0 iter1)), 786326#(not (= working0 next)), 786325#(or (<= (+ end0 2) iter0) (not (= working0 next))), 786324#(or (<= (+ end0 1) iter0) (not (= working0 next)))] [2018-07-23 13:40:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-07-23 13:40:15,836 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:40:15,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:40:15,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:40:15,837 INFO L87 Difference]: Start difference. First operand 4061 states and 5988 transitions. Second operand 12 states. [2018-07-23 13:40:18,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:18,678 INFO L93 Difference]: Finished difference Result 4233 states and 6241 transitions. [2018-07-23 13:40:18,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:40:18,678 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-07-23 13:40:18,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:18,684 INFO L225 Difference]: With dead ends: 4233 [2018-07-23 13:40:18,684 INFO L226 Difference]: Without dead ends: 4232 [2018-07-23 13:40:18,685 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:40:18,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4232 states. [2018-07-23 13:40:21,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4232 to 3882. [2018-07-23 13:40:21,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3882 states. [2018-07-23 13:40:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3882 states to 3882 states and 5730 transitions. [2018-07-23 13:40:21,100 INFO L78 Accepts]: Start accepts. Automaton has 3882 states and 5730 transitions. Word has length 29 [2018-07-23 13:40:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:21,100 INFO L471 AbstractCegarLoop]: Abstraction has 3882 states and 5730 transitions. [2018-07-23 13:40:21,100 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:40:21,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3882 states and 5730 transitions. [2018-07-23 13:40:21,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:40:21,103 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:21,103 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:21,103 INFO L414 AbstractCegarLoop]: === Iteration 94 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:40:21,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2006031348, now seen corresponding path program 1 times [2018-07-23 13:40:21,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-23 13:40:21,117 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:21,117 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:40:21,117 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:21,117 INFO L134 CoverageAnalysis]: 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,118 INFO L185 omatonBuilderFactory]: Interpolants [802604#false, 802605#(<= end0 next), 802606#(and (<= end0 iter1) (= end1 next)), 802607#(and (= end1 next) (<= (+ end0 1) end1)), 802603#true, 802612#(not (= working0 iter1)), 802613#(not (= working0 working1)), 802608#(<= (+ end0 1) next), 802609#(<= (+ iter0 2) next), 802610#(not (= iter0 next)), 802611#(not (= working0 next))] [2018-07-23 13:40:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-23 13:40:21,118 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:40:21,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:40:21,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:40:21,118 INFO L87 Difference]: Start difference. First operand 3882 states and 5730 transitions. Second operand 11 states. [2018-07-23 13:40:24,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:24,038 INFO L93 Difference]: Finished difference Result 4266 states and 6268 transitions. [2018-07-23 13:40:24,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 13:40:24,039 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-07-23 13:40:24,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:24,044 INFO L225 Difference]: With dead ends: 4266 [2018-07-23 13:40:24,044 INFO L226 Difference]: Without dead ends: 4264 [2018-07-23 13:40:24,046 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=245, Invalid=877, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:40:24,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4264 states. [2018-07-23 13:40:26,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4264 to 3417. [2018-07-23 13:40:26,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3417 states. [2018-07-23 13:40:26,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 3417 states and 5047 transitions. [2018-07-23 13:40:26,275 INFO L78 Accepts]: Start accepts. Automaton has 3417 states and 5047 transitions. Word has length 29 [2018-07-23 13:40:26,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:26,276 INFO L471 AbstractCegarLoop]: Abstraction has 3417 states and 5047 transitions. [2018-07-23 13:40:26,276 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:40:26,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 5047 transitions. [2018-07-23 13:40:26,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:40:26,278 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:26,278 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:26,278 INFO L414 AbstractCegarLoop]: === Iteration 95 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:40:26,278 INFO L82 PathProgramCache]: Analyzing trace with hash -478637664, now seen corresponding path program 2 times [2018-07-23 13:40:26,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:40:26,301 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:26,301 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:40:26,301 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:26,302 INFO L185 omatonBuilderFactory]: Interpolants [818028#(<= 1 workload), 818029#(<= (+ iter0 1) next), 818030#(and (= end1 next) (<= (+ iter0 1) iter1)), 818031#(and (<= (+ iter0 2) end1) (= end1 next)), 818026#true, 818027#false, 818036#(not (= iter1 working0)), 818037#(not (= working1 working0)), 818032#(<= (+ iter0 2) next), 818033#(and (= iter0 working0) (<= (+ iter0 1) next)), 818034#(<= (+ working0 1) next), 818035#(<= (+ working0 1) iter1)] [2018-07-23 13:40:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:40:26,302 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:40:26,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:40:26,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:40:26,303 INFO L87 Difference]: Start difference. First operand 3417 states and 5047 transitions. Second operand 12 states. [2018-07-23 13:40:29,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:29,723 INFO L93 Difference]: Finished difference Result 4483 states and 6607 transitions. [2018-07-23 13:40:29,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:40:29,723 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-07-23 13:40:29,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:29,727 INFO L225 Difference]: With dead ends: 4483 [2018-07-23 13:40:29,728 INFO L226 Difference]: Without dead ends: 4481 [2018-07-23 13:40:29,728 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:40:29,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4481 states. [2018-07-23 13:40:32,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4481 to 3901. [2018-07-23 13:40:32,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3901 states. [2018-07-23 13:40:32,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 5762 transitions. [2018-07-23 13:40:32,250 INFO L78 Accepts]: Start accepts. Automaton has 3901 states and 5762 transitions. Word has length 29 [2018-07-23 13:40:32,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:32,251 INFO L471 AbstractCegarLoop]: Abstraction has 3901 states and 5762 transitions. [2018-07-23 13:40:32,251 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:40:32,251 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 5762 transitions. [2018-07-23 13:40:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:40:32,255 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:32,255 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:32,255 INFO L414 AbstractCegarLoop]: === Iteration 96 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:40:32,255 INFO L82 PathProgramCache]: Analyzing trace with hash -478638048, now seen corresponding path program 4 times [2018-07-23 13:40:32,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:32,274 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:40:32,274 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:32,274 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:40:32,275 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:32,275 INFO L134 CoverageAnalysis]: 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:32,275 INFO L185 omatonBuilderFactory]: Interpolants [834844#(and (= end1 next) (<= (+ end0 1) end1)), 834845#(<= (+ end0 1) next), 834846#(<= (+ iter0 2) next), 834847#(not (= iter0 next)), 834840#true, 834841#false, 834842#(<= end0 next), 834843#(and (<= end0 iter1) (= end1 next)), 834848#(not (= iter0 iter1)), 834849#(not (= iter0 working1)), 834850#(not (= working0 working1))] [2018-07-23 13:40:32,275 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:40:32,275 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:40:32,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:40:32,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:40:32,276 INFO L87 Difference]: Start difference. First operand 3901 states and 5762 transitions. Second operand 11 states. [2018-07-23 13:40:35,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:35,737 INFO L93 Difference]: Finished difference Result 4463 states and 6547 transitions. [2018-07-23 13:40:35,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:40:35,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-07-23 13:40:35,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:35,742 INFO L225 Difference]: With dead ends: 4463 [2018-07-23 13:40:35,742 INFO L226 Difference]: Without dead ends: 4461 [2018-07-23 13:40:35,743 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=321, Invalid=869, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:40:35,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4461 states. [2018-07-23 13:40:38,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4461 to 3965. [2018-07-23 13:40:38,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3965 states. [2018-07-23 13:40:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 5852 transitions. [2018-07-23 13:40:38,298 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 5852 transitions. Word has length 29 [2018-07-23 13:40:38,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:38,299 INFO L471 AbstractCegarLoop]: Abstraction has 3965 states and 5852 transitions. [2018-07-23 13:40:38,299 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:40:38,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 5852 transitions. [2018-07-23 13:40:38,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:40:38,301 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:38,301 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:38,301 INFO L414 AbstractCegarLoop]: === Iteration 97 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:40:38,301 INFO L82 PathProgramCache]: Analyzing trace with hash 570846522, now seen corresponding path program 1 times [2018-07-23 13:40:38,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:38,318 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:38,318 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:38,319 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:40:38,319 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:38,319 INFO L185 omatonBuilderFactory]: Interpolants [851756#false, 851757#(<= 1 workload), 851758#(<= (+ iter0 1) next), 851759#(and (= end1 next) (<= (+ iter0 1) iter1)), 851755#true, 851764#(and (= iter0 working0) (<= (+ iter0 1) iter1)), 851765#(<= (+ working0 1) iter1), 851766#(not (= iter1 working0)), 851767#(not (= working1 working0)), 851760#(and (<= (+ iter0 2) end1) (= end1 next)), 851761#(<= (+ iter0 2) next), 851762#(<= (+ iter0 2) iter1), 851763#(<= (+ iter0 1) iter1)] [2018-07-23 13:40:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:38,319 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:40:38,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:40:38,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:40:38,320 INFO L87 Difference]: Start difference. First operand 3965 states and 5852 transitions. Second operand 13 states. [2018-07-23 13:40:43,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:43,291 INFO L93 Difference]: Finished difference Result 5093 states and 7513 transitions. [2018-07-23 13:40:43,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:40:43,291 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-07-23 13:40:43,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:43,297 INFO L225 Difference]: With dead ends: 5093 [2018-07-23 13:40:43,297 INFO L226 Difference]: Without dead ends: 5091 [2018-07-23 13:40:43,298 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=246, Invalid=684, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:40:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5091 states. [2018-07-23 13:40:46,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5091 to 4401. [2018-07-23 13:40:46,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4401 states. [2018-07-23 13:40:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4401 states to 4401 states and 6510 transitions. [2018-07-23 13:40:46,121 INFO L78 Accepts]: Start accepts. Automaton has 4401 states and 6510 transitions. Word has length 29 [2018-07-23 13:40:46,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:46,122 INFO L471 AbstractCegarLoop]: Abstraction has 4401 states and 6510 transitions. [2018-07-23 13:40:46,122 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:40:46,122 INFO L276 IsEmpty]: Start isEmpty. Operand 4401 states and 6510 transitions. [2018-07-23 13:40:46,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:40:46,125 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:46,125 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:46,125 INFO L414 AbstractCegarLoop]: === Iteration 98 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:40:46,126 INFO L82 PathProgramCache]: Analyzing trace with hash -540945094, now seen corresponding path program 2 times [2018-07-23 13:40:46,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:46,147 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:46,147 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:46,148 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:40:46,148 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:46,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:40:46,148 INFO L185 omatonBuilderFactory]: Interpolants [870797#(<= (+ iter1 2) (+ workload next)), 870796#(<= (+ iter1 3) (+ workload next)), 870799#(not (= working1 next)), 870798#(not (= iter1 next)), 870793#false, 870792#true, 870795#(<= (+ (* 2 end1) 1) (+ workload iter1 next)), 870794#(<= (* 2 end1) (+ workload iter1 next)), 870801#(not (= working1 working0)), 870800#(not (= working1 iter0))] [2018-07-23 13:40:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:46,148 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:40:46,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:40:46,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:40:46,149 INFO L87 Difference]: Start difference. First operand 4401 states and 6510 transitions. Second operand 10 states. [2018-07-23 13:40:49,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:49,393 INFO L93 Difference]: Finished difference Result 4721 states and 6944 transitions. [2018-07-23 13:40:49,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:40:49,393 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-07-23 13:40:49,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:49,399 INFO L225 Difference]: With dead ends: 4721 [2018-07-23 13:40:49,399 INFO L226 Difference]: Without dead ends: 4719 [2018-07-23 13:40:49,400 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:40:49,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4719 states. [2018-07-23 13:40:52,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4719 to 4507. [2018-07-23 13:40:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4507 states. [2018-07-23 13:40:52,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4507 states to 4507 states and 6661 transitions. [2018-07-23 13:40:52,374 INFO L78 Accepts]: Start accepts. Automaton has 4507 states and 6661 transitions. Word has length 29 [2018-07-23 13:40:52,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:52,374 INFO L471 AbstractCegarLoop]: Abstraction has 4507 states and 6661 transitions. [2018-07-23 13:40:52,374 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:40:52,374 INFO L276 IsEmpty]: Start isEmpty. Operand 4507 states and 6661 transitions. [2018-07-23 13:40:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:40:52,377 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:52,377 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:52,377 INFO L414 AbstractCegarLoop]: === Iteration 99 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:40:52,377 INFO L82 PathProgramCache]: Analyzing trace with hash 172278311, now seen corresponding path program 2 times [2018-07-23 13:40:52,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:52,388 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-23 13:40:52,388 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:52,388 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:40:52,389 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:52,389 INFO L134 CoverageAnalysis]: 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:52,389 INFO L185 omatonBuilderFactory]: Interpolants [889293#(<= (+ iter1 1) next), 889292#(<= end1 next), 889295#(not (= iter1 next)), 889294#(or (<= (+ end0 1) iter0) (not (= iter1 next))), 889291#false, 889290#true, 889297#(not (= working1 iter0)), 889296#(not (= iter1 iter0)), 889298#(not (= working1 working0))] [2018-07-23 13:40:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-23 13:40:52,390 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:40:52,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:40:52,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:40:52,390 INFO L87 Difference]: Start difference. First operand 4507 states and 6661 transitions. Second operand 9 states. [2018-07-23 13:40:55,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:55,512 INFO L93 Difference]: Finished difference Result 4725 states and 6951 transitions. [2018-07-23 13:40:55,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:40:55,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-07-23 13:40:55,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:55,516 INFO L225 Difference]: With dead ends: 4725 [2018-07-23 13:40:55,517 INFO L226 Difference]: Without dead ends: 4723 [2018-07-23 13:40:55,517 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:40:55,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4723 states. [2018-07-23 13:40:58,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4723 to 4504. [2018-07-23 13:40:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4504 states. [2018-07-23 13:40:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4504 states to 4504 states and 6658 transitions. [2018-07-23 13:40:58,450 INFO L78 Accepts]: Start accepts. Automaton has 4504 states and 6658 transitions. Word has length 29 [2018-07-23 13:40:58,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:58,450 INFO L471 AbstractCegarLoop]: Abstraction has 4504 states and 6658 transitions. [2018-07-23 13:40:58,450 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:40:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 4504 states and 6658 transitions. [2018-07-23 13:40:58,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:40:58,452 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:58,453 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:58,453 INFO L414 AbstractCegarLoop]: === Iteration 100 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:40:58,453 INFO L82 PathProgramCache]: Analyzing trace with hash -182803664, now seen corresponding path program 1 times [2018-07-23 13:40:58,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:58,464 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:40:58,464 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:58,464 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:40:58,464 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:58,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:58,465 INFO L185 omatonBuilderFactory]: Interpolants [907789#(<= iter1 next), 907788#(<= (+ iter1 1) next), 907791#(not (= iter1 next)), 907790#(or (not (= iter1 next)) (<= end0 iter0)), 907785#true, 907787#(<= end1 next), 907786#false, 907793#(not (= iter1 working0)), 907792#(not (= iter1 iter0)), 907794#(not (= working1 working0))] [2018-07-23 13:40:58,465 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:40:58,465 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:40:58,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:40:58,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:40:58,465 INFO L87 Difference]: Start difference. First operand 4504 states and 6658 transitions. Second operand 10 states. [2018-07-23 13:41:01,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:01,832 INFO L93 Difference]: Finished difference Result 4778 states and 7053 transitions. [2018-07-23 13:41:01,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:41:01,832 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-07-23 13:41:01,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:01,837 INFO L225 Difference]: With dead ends: 4778 [2018-07-23 13:41:01,837 INFO L226 Difference]: Without dead ends: 4776 [2018-07-23 13:41:01,838 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:41:01,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4776 states. [2018-07-23 13:41:04,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4776 to 4516. [2018-07-23 13:41:04,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4516 states. [2018-07-23 13:41:04,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4516 states to 4516 states and 6674 transitions. [2018-07-23 13:41:04,780 INFO L78 Accepts]: Start accepts. Automaton has 4516 states and 6674 transitions. Word has length 29 [2018-07-23 13:41:04,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:04,780 INFO L471 AbstractCegarLoop]: Abstraction has 4516 states and 6674 transitions. [2018-07-23 13:41:04,780 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:41:04,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4516 states and 6674 transitions. [2018-07-23 13:41:04,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:41:04,782 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:04,783 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:41:04,783 INFO L414 AbstractCegarLoop]: === Iteration 101 === [l1l0Err0AssertViolationASSERT, l0l1Err0AssertViolationASSERT, l1l1Err0AssertViolationASSERT, l1l1Err1AssertViolationASSERT]=== [2018-07-23 13:41:04,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1089104597, now seen corresponding path program 3 times [2018-07-23 13:41:04,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:04,804 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:04,805 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:04,805 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:41:04,805 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:04,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:04,806 INFO L185 omatonBuilderFactory]: Interpolants [926430#(not (= working1 next)), 926431#(not (= working1 iter0)), 926428#(<= (+ iter1 2) next), 926429#(not (= iter1 next)), 926426#(and (= end0 next) (<= (+ iter1 3) end0)), 926427#(<= (+ iter1 3) next), 926424#(<= (+ (* 2 end1) 1) (+ workload iter1 next)), 926425#(<= (+ iter1 3) (+ workload next)), 926422#false, 926423#(<= (* 2 end1) (+ workload iter1 next)), 926421#true, 926432#(not (= working1 working0))] [2018-07-23 13:41:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:04,806 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:41:04,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:41:04,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:41:04,806 INFO L87 Difference]: Start difference. First operand 4516 states and 6674 transitions. Second operand 12 states. [2018-07-23 13:41:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:08,120 INFO L93 Difference]: Finished difference Result 4905 states and 7210 transitions. [2018-07-23 13:41:08,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:41:08,120 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-07-23 13:41:08,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:08,126 INFO L225 Difference]: With dead ends: 4905 [2018-07-23 13:41:08,126 INFO L226 Difference]: Without dead ends: 4903 [2018-07-23 13:41:08,127 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:41:08,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4903 states. Received shutdown request... [2018-07-23 13:41:11,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4903 to 4651. [2018-07-23 13:41:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4651 states. [2018-07-23 13:41:11,226 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-23 13:41:11,231 WARN L202 ceAbstractionStarter]: Timeout [2018-07-23 13:41:11,231 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:41:11 BoogieIcfgContainer [2018-07-23 13:41:11,231 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:41:11,232 INFO L168 Benchmark]: Toolchain (without parser) took 252867.63 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-07-23 13:41:11,233 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:41:11,234 INFO L168 Benchmark]: Boogie Preprocessor took 55.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:41:11,234 INFO L168 Benchmark]: RCFGBuilder took 312.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 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:11,235 INFO L168 Benchmark]: TraceAbstraction took 252495.27 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-07-23 13:41:11,237 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 312.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 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 252495.27 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 66). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 99). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 112). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 121). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 48 locations, 4 error locations. TIMEOUT Result, 252.4s OverallTime, 101 OverallIterations, 3 TraceHistogramMax, 140.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6441 SDtfs, 12235 SDslu, 9630 SDs, 0 SdLazy, 42116 SolverSat, 11077 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2496 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 1959 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8657 ImplicationChecksByTransitivity, 2.6s Time, 0.1s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4516occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 72/792 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 109.2s AutomataMinimizationTime, 101 MinimizatonAttempts, 23576 StatesRemovedByMinimization, 98 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2161 NumberOfCodeBlocks, 2161 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 2060 ConstructedInterpolants, 0 QuantifiedInterpolants, 202234 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 101 InterpolantComputations, 5 PerfectInterpolantSequences, 72/792 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_WithProcedures.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-41-11-247.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithProcedures.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-41-11-247.csv Completed graceful shutdown