java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/random/RanFile042.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:03:06,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:03:06,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:03:06,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:03:06,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:03:06,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:03:06,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:03:06,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:03:06,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:03:06,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:03:06,353 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:03:06,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:03:06,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:03:06,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:03:06,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:03:06,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:03:06,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:03:06,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:03:06,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:03:06,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:03:06,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:03:06,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:03:06,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:03:06,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:03:06,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:03:06,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:03:06,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:03:06,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:03:06,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:03:06,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:03:06,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:03:06,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:03:06,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:03:06,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:03:06,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:03:06,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:03:06,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:03:06,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:03:06,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:03:06,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:03:06,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:03:06,408 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:03:06,421 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:03:06,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:03:06,427 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:03:06,427 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:03:06,429 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile042.bpl [2019-08-05 10:03:06,429 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile042.bpl' [2019-08-05 10:03:06,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:03:06,501 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:03:06,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:03:06,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:03:06,502 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:03:06,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RanFile042.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/1) ... [2019-08-05 10:03:06,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RanFile042.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/1) ... [2019-08-05 10:03:06,550 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:03:06,550 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:03:06,550 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:03:06,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:03:06,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:03:06,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:03:06,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:03:06,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RanFile042.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/1) ... [2019-08-05 10:03:06,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RanFile042.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/1) ... [2019-08-05 10:03:06,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RanFile042.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/1) ... [2019-08-05 10:03:06,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RanFile042.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/1) ... [2019-08-05 10:03:06,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RanFile042.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/1) ... [2019-08-05 10:03:06,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RanFile042.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/1) ... [2019-08-05 10:03:06,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RanFile042.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/1) ... [2019-08-05 10:03:06,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:03:06,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:03:06,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:03:06,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:03:06,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RanFile042.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:03:06,680 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:03:06,681 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:03:06,681 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:03:08,149 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:03:08,150 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:03:08,151 INFO L202 PluginConnector]: Adding new model RanFile042.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:03:08 BoogieIcfgContainer [2019-08-05 10:03:08,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:03:08,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:03:08,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:03:08,156 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:03:08,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile042.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/2) ... [2019-08-05 10:03:08,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76643a84 and model type RanFile042.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:03:08, skipping insertion in model container [2019-08-05 10:03:08,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile042.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:03:08" (2/2) ... [2019-08-05 10:03:08,160 INFO L109 eAbstractionObserver]: Analyzing ICFG RanFile042.bpl [2019-08-05 10:03:08,168 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:03:08,175 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 10:03:08,204 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 10:03:08,230 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:03:08,231 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:03:08,231 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:03:08,231 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:03:08,232 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:03:08,232 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:03:08,232 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:03:08,232 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:03:08,233 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:03:08,250 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-08-05 10:03:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:03:08,258 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:08,259 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:08,262 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:08,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:08,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1712068816, now seen corresponding path program 1 times [2019-08-05 10:03:08,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:08,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:03:08,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:08,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:08,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:08,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:03:08,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:03:08,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:03:08,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:03:08,934 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 7 states. [2019-08-05 10:03:09,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:09,983 INFO L93 Difference]: Finished difference Result 33 states and 50 transitions. [2019-08-05 10:03:09,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:03:09,985 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 10:03:09,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:09,996 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:03:09,996 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:03:09,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:03:10,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:03:10,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-08-05 10:03:10,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:03:10,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. [2019-08-05 10:03:10,034 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 47 transitions. Word has length 10 [2019-08-05 10:03:10,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:10,035 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 47 transitions. [2019-08-05 10:03:10,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:03:10,036 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 47 transitions. [2019-08-05 10:03:10,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:03:10,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:10,037 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:10,037 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:10,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:10,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1534542140, now seen corresponding path program 1 times [2019-08-05 10:03:10,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:10,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:03:10,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:10,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:10,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:10,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:10,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:10,651 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 30 [2019-08-05 10:03:10,653 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:10,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:10,830 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:10,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:10,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:03:10,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:03:10,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:03:10,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:03:10,985 INFO L87 Difference]: Start difference. First operand 29 states and 47 transitions. Second operand 8 states. [2019-08-05 10:03:11,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:11,829 INFO L93 Difference]: Finished difference Result 41 states and 65 transitions. [2019-08-05 10:03:11,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:03:11,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-08-05 10:03:11,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:11,833 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:03:11,833 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:03:11,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:03:11,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:03:11,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2019-08-05 10:03:11,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:03:11,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 60 transitions. [2019-08-05 10:03:11,841 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 60 transitions. Word has length 11 [2019-08-05 10:03:11,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:11,841 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 60 transitions. [2019-08-05 10:03:11,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:03:11,842 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 60 transitions. [2019-08-05 10:03:11,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:03:11,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:11,843 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:11,843 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:11,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:11,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1535940457, now seen corresponding path program 1 times [2019-08-05 10:03:11,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:11,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:03:11,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:03:11,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:11,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:03:11,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:03:11,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:03:11,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:03:11,927 INFO L87 Difference]: Start difference. First operand 36 states and 60 transitions. Second operand 4 states. [2019-08-05 10:03:12,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:12,141 INFO L93 Difference]: Finished difference Result 59 states and 93 transitions. [2019-08-05 10:03:12,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:03:12,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-08-05 10:03:12,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:12,145 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:03:12,145 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:03:12,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:03:12,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:03:12,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2019-08-05 10:03:12,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:03:12,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2019-08-05 10:03:12,154 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 11 [2019-08-05 10:03:12,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:12,155 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2019-08-05 10:03:12,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:03:12,155 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2019-08-05 10:03:12,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:03:12,156 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:12,156 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:12,156 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:12,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:12,157 INFO L82 PathProgramCache]: Analyzing trace with hash 326164221, now seen corresponding path program 1 times [2019-08-05 10:03:12,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:12,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:03:12,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:12,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:12,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:03:12,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:03:12,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:03:12,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:03:12,218 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand 3 states. [2019-08-05 10:03:12,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:12,312 INFO L93 Difference]: Finished difference Result 49 states and 82 transitions. [2019-08-05 10:03:12,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:03:12,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-08-05 10:03:12,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:12,320 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:03:12,321 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:03:12,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:03:12,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:03:12,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:03:12,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:03:12,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 79 transitions. [2019-08-05 10:03:12,326 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 79 transitions. Word has length 12 [2019-08-05 10:03:12,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:12,327 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 79 transitions. [2019-08-05 10:03:12,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:03:12,327 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 79 transitions. [2019-08-05 10:03:12,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:03:12,328 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:12,328 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:12,328 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:12,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:12,329 INFO L82 PathProgramCache]: Analyzing trace with hash 369530307, now seen corresponding path program 1 times [2019-08-05 10:03:12,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:12,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:03:12,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:12,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:12,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:12,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:12,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 10:03:12,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:03:12,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:03:12,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:03:12,635 INFO L87 Difference]: Start difference. First operand 48 states and 79 transitions. Second operand 9 states. [2019-08-05 10:03:13,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:13,066 INFO L93 Difference]: Finished difference Result 62 states and 93 transitions. [2019-08-05 10:03:13,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:03:13,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-08-05 10:03:13,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:13,069 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:03:13,069 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:03:13,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:03:13,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:03:13,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2019-08-05 10:03:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:03:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2019-08-05 10:03:13,077 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 12 [2019-08-05 10:03:13,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:13,077 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2019-08-05 10:03:13,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:03:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2019-08-05 10:03:13,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:03:13,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:13,079 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:13,079 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:13,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:13,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2005440904, now seen corresponding path program 1 times [2019-08-05 10:03:13,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:13,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:03:13,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:13,217 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:13,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:13,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:13,386 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-08-05 10:03:13,388 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:13,583 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 35 [2019-08-05 10:03:13,585 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:13,642 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:13,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:13,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:03:13,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:03:13,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:03:13,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:03:13,750 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 8 states. [2019-08-05 10:03:14,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:14,273 INFO L93 Difference]: Finished difference Result 60 states and 93 transitions. [2019-08-05 10:03:14,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:03:14,274 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:03:14,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:14,275 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:03:14,276 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:03:14,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:03:14,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:03:14,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2019-08-05 10:03:14,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:03:14,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 86 transitions. [2019-08-05 10:03:14,282 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 86 transitions. Word has length 12 [2019-08-05 10:03:14,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:14,282 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 86 transitions. [2019-08-05 10:03:14,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:03:14,283 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 86 transitions. [2019-08-05 10:03:14,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:03:14,284 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:14,284 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:14,284 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:14,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:14,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2006839221, now seen corresponding path program 1 times [2019-08-05 10:03:14,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:14,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:03:14,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:14,399 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:14,400 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:14,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:14,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:14,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:14,507 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:14,858 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2019-08-05 10:03:14,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:14,899 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:14,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:15,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:03:15,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:15,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:15,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:03:15,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:03:15,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:03:15,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:03:15,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:03:15,424 INFO L87 Difference]: Start difference. First operand 53 states and 86 transitions. Second operand 9 states. [2019-08-05 10:03:16,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:16,706 INFO L93 Difference]: Finished difference Result 62 states and 97 transitions. [2019-08-05 10:03:16,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:03:16,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-08-05 10:03:16,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:16,708 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:03:16,709 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:03:16,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:03:16,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:03:16,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2019-08-05 10:03:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:03:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 91 transitions. [2019-08-05 10:03:16,715 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 91 transitions. Word has length 12 [2019-08-05 10:03:16,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:16,715 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 91 transitions. [2019-08-05 10:03:16,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:03:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 91 transitions. [2019-08-05 10:03:16,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:03:16,716 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:16,716 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:16,717 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:16,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:16,717 INFO L82 PathProgramCache]: Analyzing trace with hash -642378292, now seen corresponding path program 1 times [2019-08-05 10:03:16,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:16,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:03:16,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:16,741 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:16,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:03:16,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:16,829 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:16,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:17,124 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-08-05 10:03:17,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-08-05 10:03:17,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:17,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:17,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:17,136 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:17,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:17,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:17,636 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 128 [2019-08-05 10:03:17,640 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-08-05 10:03:17,878 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-08-05 10:03:17,882 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-08-05 10:03:18,729 WARN L188 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 101 [2019-08-05 10:03:27,807 WARN L188 SmtUtils]: Spent 8.77 s on a formula simplification that was a NOOP. DAG size: 118 [2019-08-05 10:03:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:27,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:27,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:03:27,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:03:27,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:03:27,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:03:27,827 INFO L87 Difference]: Start difference. First operand 56 states and 91 transitions. Second operand 8 states. [2019-08-05 10:03:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:41,604 INFO L93 Difference]: Finished difference Result 67 states and 104 transitions. [2019-08-05 10:03:41,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:03:41,605 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:03:41,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:41,606 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:03:41,606 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:03:41,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:03:41,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:03:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2019-08-05 10:03:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:03:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 89 transitions. [2019-08-05 10:03:41,612 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 89 transitions. Word has length 12 [2019-08-05 10:03:41,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:41,612 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 89 transitions. [2019-08-05 10:03:41,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:03:41,613 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 89 transitions. [2019-08-05 10:03:41,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:03:41,614 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:41,614 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:41,614 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:41,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:41,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1521220926, now seen corresponding path program 1 times [2019-08-05 10:03:41,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:41,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:03:41,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:41,654 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:41,765 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:41,766 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:41,768 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:41,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:41,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:41,935 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2019-08-05 10:03:41,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:42,104 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 30 [2019-08-05 10:03:42,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:42,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:42,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:43,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:43,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:43,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 10:03:43,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:03:43,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:03:43,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=67, Unknown=1, NotChecked=0, Total=90 [2019-08-05 10:03:43,261 INFO L87 Difference]: Start difference. First operand 55 states and 89 transitions. Second operand 10 states. [2019-08-05 10:03:45,345 WARN L188 SmtUtils]: Spent 642.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-08-05 10:03:45,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:45,425 INFO L93 Difference]: Finished difference Result 66 states and 103 transitions. [2019-08-05 10:03:45,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:03:45,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-08-05 10:03:45,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:45,426 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:03:45,427 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:03:45,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=27, Invalid=82, Unknown=1, NotChecked=0, Total=110 [2019-08-05 10:03:45,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:03:45,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-08-05 10:03:45,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:03:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 94 transitions. [2019-08-05 10:03:45,432 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 94 transitions. Word has length 13 [2019-08-05 10:03:45,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:45,432 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 94 transitions. [2019-08-05 10:03:45,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:03:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 94 transitions. [2019-08-05 10:03:45,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:03:45,433 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:45,433 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:45,433 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:45,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:45,434 INFO L82 PathProgramCache]: Analyzing trace with hash 100133656, now seen corresponding path program 1 times [2019-08-05 10:03:45,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:45,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:03:45,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:45,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:45,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:03:45,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:03:45,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:03:45,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:03:45,484 INFO L87 Difference]: Start difference. First operand 58 states and 94 transitions. Second operand 3 states. [2019-08-05 10:03:45,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:45,535 INFO L93 Difference]: Finished difference Result 51 states and 81 transitions. [2019-08-05 10:03:45,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:03:45,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-08-05 10:03:45,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:45,536 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:03:45,537 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:03:45,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:03:45,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:03:45,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:03:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:03:45,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 72 transitions. [2019-08-05 10:03:45,541 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 72 transitions. Word has length 13 [2019-08-05 10:03:45,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:45,541 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 72 transitions. [2019-08-05 10:03:45,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:03:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 72 transitions. [2019-08-05 10:03:45,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:03:45,542 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:45,542 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:45,543 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:45,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:45,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2082473923, now seen corresponding path program 1 times [2019-08-05 10:03:45,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:45,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:03:45,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:45,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:45,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:45,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:45,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:45,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:45,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:45,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:03:47,729 WARN L188 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 106 DAG size of output: 62 [2019-08-05 10:03:47,731 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:47,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:47,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:03:47,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:03:47,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:03:47,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:03:47,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:03:47,799 INFO L87 Difference]: Start difference. First operand 47 states and 72 transitions. Second operand 9 states. [2019-08-05 10:03:50,869 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-08-05 10:03:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:51,185 INFO L93 Difference]: Finished difference Result 51 states and 75 transitions. [2019-08-05 10:03:51,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:03:51,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-08-05 10:03:51,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:51,186 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:03:51,186 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:03:51,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:03:51,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:03:51,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2019-08-05 10:03:51,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:03:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 71 transitions. [2019-08-05 10:03:51,191 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 71 transitions. Word has length 13 [2019-08-05 10:03:51,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:51,191 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 71 transitions. [2019-08-05 10:03:51,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:03:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 71 transitions. [2019-08-05 10:03:51,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:03:51,193 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:51,193 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:51,194 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:51,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:51,194 INFO L82 PathProgramCache]: Analyzing trace with hash 2082490103, now seen corresponding path program 1 times [2019-08-05 10:03:51,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:51,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:03:51,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:51,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:51,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:51,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:51,359 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:51,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:51,361 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:51,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:51,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:51,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:51,585 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:03:51,941 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 59 [2019-08-05 10:03:51,943 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:52,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:03:52,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:03:52,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:03:52,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:03:52,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:03:52,012 INFO L87 Difference]: Start difference. First operand 46 states and 71 transitions. Second operand 9 states. [2019-08-05 10:03:52,470 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-08-05 10:03:52,643 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-08-05 10:03:53,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:53,090 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2019-08-05 10:03:53,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:03:53,090 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-08-05 10:03:53,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:53,091 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:03:53,091 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:03:53,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:03:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:03:53,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2019-08-05 10:03:53,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:03:53,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 73 transitions. [2019-08-05 10:03:53,095 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 73 transitions. Word has length 13 [2019-08-05 10:03:53,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:53,095 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 73 transitions. [2019-08-05 10:03:53,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:03:53,096 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 73 transitions. [2019-08-05 10:03:53,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:03:53,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:53,096 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:53,097 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:53,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:53,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2083888420, now seen corresponding path program 2 times [2019-08-05 10:03:53,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:53,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:03:53,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:53,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:53,155 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:53,156 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:53,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:53,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:53,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:53,330 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:53,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:53,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:53,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:53,416 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:53,416 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:53,418 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:53,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:03:53,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:53,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:53,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:03:53,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:03:53,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:03:53,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:03:53,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:03:53,683 INFO L87 Difference]: Start difference. First operand 48 states and 73 transitions. Second operand 10 states. [2019-08-05 10:03:54,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:54,478 INFO L93 Difference]: Finished difference Result 58 states and 84 transitions. [2019-08-05 10:03:54,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:03:54,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-08-05 10:03:54,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:54,479 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:03:54,480 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:03:54,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:03:54,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:03:54,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2019-08-05 10:03:54,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:03:54,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 77 transitions. [2019-08-05 10:03:54,483 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 77 transitions. Word has length 13 [2019-08-05 10:03:54,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:54,484 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 77 transitions. [2019-08-05 10:03:54,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:03:54,484 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 77 transitions. [2019-08-05 10:03:54,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:03:54,485 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:54,485 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:54,485 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:54,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:54,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1211600246, now seen corresponding path program 1 times [2019-08-05 10:03:54,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:54,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:03:54,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:54,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:54,530 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:54,531 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:54,613 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:03:54,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:54,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:54,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:54,977 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-08-05 10:03:54,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:55,247 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 43 [2019-08-05 10:03:55,268 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:55,305 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:55,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:55,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:03:55,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:03:55,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:03:55,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:03:55,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:03:55,419 INFO L87 Difference]: Start difference. First operand 50 states and 77 transitions. Second operand 9 states. [2019-08-05 10:03:59,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:59,000 INFO L93 Difference]: Finished difference Result 60 states and 89 transitions. [2019-08-05 10:03:59,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:03:59,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-08-05 10:03:59,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:59,002 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:03:59,002 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:03:59,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:03:59,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:03:59,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:03:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:03:59,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 84 transitions. [2019-08-05 10:03:59,006 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 84 transitions. Word has length 14 [2019-08-05 10:03:59,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:59,007 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 84 transitions. [2019-08-05 10:03:59,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:03:59,007 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 84 transitions. [2019-08-05 10:03:59,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:03:59,007 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:59,007 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:59,008 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:59,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:59,008 INFO L82 PathProgramCache]: Analyzing trace with hash 132182391, now seen corresponding path program 1 times [2019-08-05 10:03:59,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:03:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:03:59,067 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:03:59,088 INFO L202 PluginConnector]: Adding new model RanFile042.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:03:59 BoogieIcfgContainer [2019-08-05 10:03:59,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:03:59,090 INFO L168 Benchmark]: Toolchain (without parser) took 52589.63 ms. Allocated memory was 138.4 MB in the beginning and 343.9 MB in the end (delta: 205.5 MB). Free memory was 108.0 MB in the beginning and 279.1 MB in the end (delta: -171.1 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:03:59,091 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 138.4 MB. Free memory was 109.7 MB in the beginning and 109.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:03:59,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.20 ms. Allocated memory is still 138.4 MB. Free memory was 107.8 MB in the beginning and 106.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:03:59,093 INFO L168 Benchmark]: Boogie Preprocessor took 59.58 ms. Allocated memory is still 138.4 MB. Free memory was 105.8 MB in the beginning and 104.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:03:59,094 INFO L168 Benchmark]: RCFGBuilder took 1538.11 ms. Allocated memory is still 138.4 MB. Free memory was 104.3 MB in the beginning and 63.0 MB in the end (delta: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:03:59,094 INFO L168 Benchmark]: TraceAbstraction took 50935.65 ms. Allocated memory was 138.4 MB in the beginning and 343.9 MB in the end (delta: 205.5 MB). Free memory was 62.7 MB in the beginning and 279.1 MB in the end (delta: -216.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:03:59,098 INFO L335 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.25 ms. Allocated memory is still 138.4 MB. Free memory was 109.7 MB in the beginning and 109.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.20 ms. Allocated memory is still 138.4 MB. Free memory was 107.8 MB in the beginning and 106.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.58 ms. Allocated memory is still 138.4 MB. Free memory was 105.8 MB in the beginning and 104.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1538.11 ms. Allocated memory is still 138.4 MB. Free memory was 104.3 MB in the beginning and 63.0 MB in the end (delta: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 50935.65 ms. Allocated memory was 138.4 MB in the beginning and 343.9 MB in the end (delta: 205.5 MB). Free memory was 62.7 MB in the beginning and 279.1 MB in the end (delta: -216.3 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 142]: assertion can be violated assertion can be violated We found a FailurePath: [L9] emntcyx := emntcyx + zjwdcwa + 50 + oesehyb; [L10] qrrswwv := qrrswwv + qrrswwv + vuiiwzs + 29 + 30; [L11] zjwdcwa := zjwdcwa + vuiiwzs; [L12] COND TRUE emntcyx < 93 + 42 || qrrswwv < vuiiwzs - emntcyx + zjwdcwa - 87 [L13] qrrswwv := qrrswwv + qrrswwv; [L16] vuiiwzs := vuiiwzs + 86 + zjwdcwa + 6 + 91; VAL [emntcyx=-543, oesehyb=106, qrrswwv=1218, vuiiwzs=606, zjwdcwa=-319] [L17] COND FALSE !(emntcyx < 22 + emntcyx + 90 + zjwdcwa + oesehyb + 100) VAL [emntcyx=-543, oesehyb=106, qrrswwv=1218, vuiiwzs=606, zjwdcwa=-319] [L36] COND TRUE zjwdcwa < 95 - 91 + emntcyx - vuiiwzs - 68 || zjwdcwa < 57 + qrrswwv + qrrswwv [L37] qrrswwv := qrrswwv + zjwdcwa; VAL [emntcyx=-543, oesehyb=106, qrrswwv=899, vuiiwzs=606, zjwdcwa=-319] [L49] COND TRUE zjwdcwa < 48 + oesehyb + 52 + 100 [L50] COND FALSE !(qrrswwv < oesehyb + vuiiwzs) [L53] zjwdcwa := oesehyb - zjwdcwa + 60; [L55] qrrswwv := oesehyb + zjwdcwa - qrrswwv; [L56] COND TRUE emntcyx < emntcyx - 95 - emntcyx + oesehyb && vuiiwzs > vuiiwzs + 64 + emntcyx + emntcyx - 11 [L57] emntcyx := vuiiwzs - 41 - 8; VAL [emntcyx=557, oesehyb=106, qrrswwv=-308, vuiiwzs=606, zjwdcwa=485] [L49] COND FALSE !(zjwdcwa < 48 + oesehyb + 52 + 100) VAL [emntcyx=557, oesehyb=106, qrrswwv=-308, vuiiwzs=606, zjwdcwa=485] [L62] COND FALSE !(zjwdcwa < qrrswwv + 15 + 79 + 97 + zjwdcwa + 100) [L78] qrrswwv := qrrswwv + zjwdcwa; [L79] COND FALSE !(zjwdcwa > 68 + zjwdcwa + 35 + oesehyb) VAL [emntcyx=557, oesehyb=106, qrrswwv=177, vuiiwzs=606, zjwdcwa=485] [L83] COND FALSE !(vuiiwzs < 21 + zjwdcwa + 100 || zjwdcwa < 8 - qrrswwv + 48 + vuiiwzs) [L97] COND FALSE !(vuiiwzs < 38 - 39 - 46 - vuiiwzs + 17 && zjwdcwa < vuiiwzs + vuiiwzs - zjwdcwa - vuiiwzs) VAL [emntcyx=557, oesehyb=106, qrrswwv=177, vuiiwzs=606, zjwdcwa=485] [L104] COND FALSE !(vuiiwzs < 89 + 2 + 32 + 100 && vuiiwzs < 96 - qrrswwv) [L111] zjwdcwa := zjwdcwa + emntcyx + 41 + 90 + emntcyx; VAL [emntcyx=557, oesehyb=106, qrrswwv=177, vuiiwzs=606, zjwdcwa=1730] [L112] COND TRUE emntcyx < 8 + oesehyb + 3 + vuiiwzs + 100 [L113] vuiiwzs := vuiiwzs - oesehyb - 0 - vuiiwzs; [L114] COND FALSE !(qrrswwv < emntcyx - zjwdcwa) [L118] COND TRUE emntcyx > 94 - 94 - 89 [L119] qrrswwv := emntcyx + vuiiwzs; VAL [emntcyx=557, oesehyb=106, qrrswwv=451, vuiiwzs=-106, zjwdcwa=1730] [L112] COND FALSE !(emntcyx < 8 + oesehyb + 3 + vuiiwzs + 100) [L125] qrrswwv := qrrswwv + 65 + 14 + qrrswwv; [L126] zjwdcwa := zjwdcwa + qrrswwv + zjwdcwa + qrrswwv; [L127] qrrswwv := qrrswwv + 65 + qrrswwv; VAL [emntcyx=557, oesehyb=106, qrrswwv=2027, vuiiwzs=-106, zjwdcwa=5422] [L128] COND FALSE !(zjwdcwa > zjwdcwa - 58 + oesehyb - 49 + 1 || qrrswwv < emntcyx - 87) [L138] emntcyx := emntcyx + emntcyx; VAL [emntcyx=1114, oesehyb=106, qrrswwv=2027, vuiiwzs=-106, zjwdcwa=5422] [L140] assert emntcyx < emntcyx - emntcyx + qrrswwv || qrrswwv < zjwdcwa + emntcyx - vuiiwzs + 43; VAL [emntcyx=1114, oesehyb=106, qrrswwv=2027, vuiiwzs=-106, zjwdcwa=5422] [L141] assert qrrswwv < 52 + zjwdcwa + 28 + 52 - vuiiwzs; VAL [emntcyx=1114, oesehyb=106, qrrswwv=2027, vuiiwzs=-106, zjwdcwa=5422] [L142] assert qrrswwv < qrrswwv - 68 + 10 + vuiiwzs + 90 && vuiiwzs < emntcyx - 51 - qrrswwv + 11; VAL [emntcyx=1114, oesehyb=106, qrrswwv=2027, vuiiwzs=-106, zjwdcwa=5422] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 3 error locations. UNSAFE Result, 50.8s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 29.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 401 SDtfs, 113 SDslu, 90 SDs, 0 SdLazy, 3066 SolverSat, 49 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 25.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 22.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 76 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 20.8s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 157 ConstructedInterpolants, 62 QuantifiedInterpolants, 85507 SizeOfPredicates, 33 NumberOfNonLiveVariables, 553 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 10/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...