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/Interactive/input/boogie/Luxembourg-sophisticated.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 09:52:25,793 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 09:52:25,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 09:52:25,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 09:52:25,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 09:52:25,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 09:52:25,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 09:52:25,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 09:52:25,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 09:52:25,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 09:52:25,832 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 09:52:25,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 09:52:25,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 09:52:25,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 09:52:25,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 09:52:25,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 09:52:25,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 09:52:25,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 09:52:25,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 09:52:25,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 09:52:25,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 09:52:25,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 09:52:25,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 09:52:25,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 09:52:25,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 09:52:25,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 09:52:25,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 09:52:25,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 09:52:25,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 09:52:25,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 09:52:25,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 09:52:25,867 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 09:52:25,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 09:52:25,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 09:52:25,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 09:52:25,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 09:52:25,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 09:52:25,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 09:52:25,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 09:52:25,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 09:52:25,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 09:52:25,929 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 09:52:25,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 09:52:25,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 09:52:25,953 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 09:52:25,954 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 09:52:25,955 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl [2019-08-05 09:52:25,956 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl' [2019-08-05 09:52:25,994 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 09:52:25,995 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 09:52:25,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 09:52:25,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 09:52:25,997 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 09:52:26,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:25" (1/1) ... [2019-08-05 09:52:26,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:25" (1/1) ... [2019-08-05 09:52:26,031 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 09:52:26,032 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 09:52:26,032 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 09:52:26,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 09:52:26,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 09:52:26,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 09:52:26,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 09:52:26,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:25" (1/1) ... [2019-08-05 09:52:26,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:25" (1/1) ... [2019-08-05 09:52:26,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:25" (1/1) ... [2019-08-05 09:52:26,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:25" (1/1) ... [2019-08-05 09:52:26,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:25" (1/1) ... [2019-08-05 09:52:26,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:25" (1/1) ... [2019-08-05 09:52:26,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:25" (1/1) ... [2019-08-05 09:52:26,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 09:52:26,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 09:52:26,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 09:52:26,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 09:52:26,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:25" (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 09:52:26,137 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 09:52:26,137 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 09:52:26,137 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 09:52:26,400 INFO L275 CfgBuilder]: Using library mode [2019-08-05 09:52:26,400 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 09:52:26,402 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:52:26 BoogieIcfgContainer [2019-08-05 09:52:26,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 09:52:26,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 09:52:26,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 09:52:26,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 09:52:26,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:25" (1/2) ... [2019-08-05 09:52:26,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28569c77 and model type Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 09:52:26, skipping insertion in model container [2019-08-05 09:52:26,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:52:26" (2/2) ... [2019-08-05 09:52:26,410 INFO L109 eAbstractionObserver]: Analyzing ICFG Luxembourg-sophisticated.bpl [2019-08-05 09:52:26,420 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 09:52:26,428 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 09:52:26,445 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 09:52:26,472 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 09:52:26,473 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 09:52:26,473 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 09:52:26,473 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 09:52:26,474 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 09:52:26,474 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 09:52:26,474 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 09:52:26,474 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 09:52:26,474 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 09:52:26,489 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 09:52:26,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 09:52:26,498 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:26,501 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 09:52:26,504 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:26,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:26,513 INFO L82 PathProgramCache]: Analyzing trace with hash 30208, now seen corresponding path program 1 times [2019-08-05 09:52:26,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:26,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 09:52:26,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:26,655 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 09:52:26,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:26,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 09:52:26,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:52:26,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:52:26,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:26,679 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 09:52:26,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:26,757 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 09:52:26,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:52:26,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 09:52:26,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:26,790 INFO L225 Difference]: With dead ends: 9 [2019-08-05 09:52:26,790 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 09:52:26,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 09:52:26,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 09:52:26,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 09:52:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 09:52:26,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 09:52:26,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 09:52:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:26,867 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 09:52:26,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:52:26,867 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 09:52:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 09:52:26,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:26,868 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 09:52:26,868 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:26,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:26,869 INFO L82 PathProgramCache]: Analyzing trace with hash 943158, now seen corresponding path program 1 times [2019-08-05 09:52:26,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:26,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 09:52:26,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:26,906 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:26,984 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 09:52:26,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:26,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 09:52:26,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 09:52:26,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 09:52:26,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 09:52:26,988 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 09:52:27,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:27,075 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 09:52:27,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 09:52:27,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 09:52:27,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:27,077 INFO L225 Difference]: With dead ends: 6 [2019-08-05 09:52:27,077 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 09:52:27,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 09:52:27,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 09:52:27,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 09:52:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 09:52:27,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 09:52:27,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 09:52:27,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:27,081 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 09:52:27,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 09:52:27,081 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 09:52:27,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 09:52:27,082 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:27,082 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 09:52:27,083 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:27,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:27,084 INFO L82 PathProgramCache]: Analyzing trace with hash 29244608, now seen corresponding path program 2 times [2019-08-05 09:52:27,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:27,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 09:52:27,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:27,155 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:27,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:27,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:27,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:27,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 09:52:27,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 09:52:27,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 09:52:27,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 09:52:27,372 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 09:52:27,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:27,415 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 09:52:27,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 09:52:27,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 09:52:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:27,416 INFO L225 Difference]: With dead ends: 7 [2019-08-05 09:52:27,416 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 09:52:27,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 09:52:27,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 09:52:27,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 09:52:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 09:52:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 09:52:27,419 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 09:52:27,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:27,419 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 09:52:27,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 09:52:27,420 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 09:52:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 09:52:27,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:27,420 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 09:52:27,421 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:27,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:27,421 INFO L82 PathProgramCache]: Analyzing trace with hash 906589558, now seen corresponding path program 3 times [2019-08-05 09:52:27,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:27,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 09:52:27,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:27,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:27,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:27,560 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:27,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:27,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 09:52:27,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 09:52:27,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 09:52:27,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 09:52:27,613 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 09:52:27,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:27,670 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 09:52:27,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 09:52:27,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 09:52:27,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:27,671 INFO L225 Difference]: With dead ends: 8 [2019-08-05 09:52:27,671 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 09:52:27,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 09:52:27,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 09:52:27,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 09:52:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 09:52:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 09:52:27,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 09:52:27,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:27,674 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 09:52:27,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 09:52:27,674 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 09:52:27,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 09:52:27,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:27,675 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 09:52:27,675 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:27,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:27,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1960488064, now seen corresponding path program 4 times [2019-08-05 09:52:27,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:27,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 09:52:27,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:27,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:27,778 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:27,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:27,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:27,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:27,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:27,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 09:52:27,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 09:52:27,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 09:52:27,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 09:52:27,924 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 09:52:27,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:27,960 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 09:52:27,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 09:52:27,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 09:52:27,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:27,966 INFO L225 Difference]: With dead ends: 9 [2019-08-05 09:52:27,966 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 09:52:27,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 09:52:27,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 09:52:27,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 09:52:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 09:52:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 09:52:27,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 09:52:27,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:27,973 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 09:52:27,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 09:52:27,973 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 09:52:27,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 09:52:27,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:27,974 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 09:52:27,974 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:27,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:27,975 INFO L82 PathProgramCache]: Analyzing trace with hash -645581130, now seen corresponding path program 5 times [2019-08-05 09:52:27,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:28,006 WARN L254 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 09:52:28,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:28,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:28,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:28,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:28,272 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:28,369 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:28,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:28,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 09:52:28,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 09:52:28,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 09:52:28,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 09:52:28,414 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 09:52:28,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:28,441 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 09:52:28,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 09:52:28,442 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 09:52:28,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:28,443 INFO L225 Difference]: With dead ends: 10 [2019-08-05 09:52:28,443 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 09:52:28,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 09:52:28,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 09:52:28,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 09:52:28,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 09:52:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 09:52:28,447 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 09:52:28,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:28,447 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 09:52:28,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 09:52:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 09:52:28,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 09:52:28,448 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:28,448 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 09:52:28,448 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:28,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:28,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1461828160, now seen corresponding path program 6 times [2019-08-05 09:52:28,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:28,489 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 09:52:28,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:28,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:28,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:28,550 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:28,573 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:28,589 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:28,638 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:28,690 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:28,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:28,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 09:52:28,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 09:52:28,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 09:52:28,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 09:52:28,693 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 09:52:28,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:28,725 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 09:52:28,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 09:52:28,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 09:52:28,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:28,726 INFO L225 Difference]: With dead ends: 11 [2019-08-05 09:52:28,726 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 09:52:28,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 09:52:28,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 09:52:28,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 09:52:28,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 09:52:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 09:52:28,729 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 09:52:28,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:28,729 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 09:52:28,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 09:52:28,729 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 09:52:28,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 09:52:28,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:28,730 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 09:52:28,730 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:28,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:28,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1927960586, now seen corresponding path program 7 times [2019-08-05 09:52:28,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:28,784 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 09:52:28,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:28,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:28,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:28,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:29,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:29,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:29,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:29,232 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:29,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:29,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 09:52:29,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 09:52:29,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 09:52:29,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 09:52:29,283 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 09:52:29,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:29,329 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 09:52:29,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 09:52:29,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 09:52:29,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:29,336 INFO L225 Difference]: With dead ends: 12 [2019-08-05 09:52:29,336 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 09:52:29,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 09:52:29,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 09:52:29,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 09:52:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 09:52:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 09:52:29,339 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 09:52:29,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:29,340 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 09:52:29,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 09:52:29,340 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 09:52:29,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 09:52:29,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:29,340 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 09:52:29,341 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:29,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:29,341 INFO L82 PathProgramCache]: Analyzing trace with hash 362770688, now seen corresponding path program 8 times [2019-08-05 09:52:29,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:29,432 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 09:52:29,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:29,459 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:29,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:29,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:29,542 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:29,578 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:29,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:29,623 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:29,647 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:29,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:29,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 09:52:29,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 09:52:29,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 09:52:29,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 09:52:29,686 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 09:52:29,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:29,722 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 09:52:29,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 09:52:29,723 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 09:52:29,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:29,724 INFO L225 Difference]: With dead ends: 13 [2019-08-05 09:52:29,724 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 09:52:29,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 09:52:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 09:52:29,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 09:52:29,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 09:52:29,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 09:52:29,727 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 09:52:29,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:29,728 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 09:52:29,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 09:52:29,728 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 09:52:29,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 09:52:29,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:29,729 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 09:52:29,729 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:29,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:29,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1639003850, now seen corresponding path program 9 times [2019-08-05 09:52:29,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:29,808 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 09:52:29,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:29,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:29,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:29,894 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:29,907 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:29,927 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:29,943 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:29,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:29,978 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:29,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:30,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:30,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 09:52:30,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 09:52:30,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 09:52:30,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 09:52:30,052 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 09:52:30,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:30,109 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 09:52:30,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 09:52:30,110 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 09:52:30,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:30,110 INFO L225 Difference]: With dead ends: 14 [2019-08-05 09:52:30,110 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 09:52:30,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 09:52:30,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 09:52:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 09:52:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 09:52:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 09:52:30,114 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 09:52:30,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:30,114 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 09:52:30,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 09:52:30,114 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 09:52:30,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 09:52:30,115 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:30,115 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 09:52:30,115 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:30,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:30,115 INFO L82 PathProgramCache]: Analyzing trace with hash 730494912, now seen corresponding path program 10 times [2019-08-05 09:52:30,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:30,215 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 09:52:30,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:30,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:30,413 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:30,534 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:30,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:30,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:30,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:30,654 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:30,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:30,727 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:30,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:30,786 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:30,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:30,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 09:52:30,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 09:52:30,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 09:52:30,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 09:52:30,789 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 09:52:30,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:30,850 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 09:52:30,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 09:52:30,851 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 09:52:30,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:30,851 INFO L225 Difference]: With dead ends: 15 [2019-08-05 09:52:30,851 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 09:52:30,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 09:52:30,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 09:52:30,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 09:52:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 09:52:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 09:52:30,854 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 09:52:30,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:30,854 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 09:52:30,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 09:52:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 09:52:30,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 09:52:30,855 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:30,855 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 09:52:30,855 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:30,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:30,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1170512502, now seen corresponding path program 11 times [2019-08-05 09:52:30,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:30,996 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 09:52:30,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:31,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:31,092 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:31,100 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:31,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:31,130 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:31,168 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:31,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:31,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:31,228 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:31,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:31,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:31,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:31,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 09:52:31,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 09:52:31,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 09:52:31,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 09:52:31,356 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 09:52:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:31,411 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 09:52:31,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 09:52:31,412 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 09:52:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:31,412 INFO L225 Difference]: With dead ends: 16 [2019-08-05 09:52:31,412 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 09:52:31,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 09:52:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 09:52:31,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 09:52:31,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 09:52:31,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 09:52:31,416 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 09:52:31,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:31,416 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 09:52:31,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 09:52:31,417 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 09:52:31,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 09:52:31,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:31,417 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 09:52:31,417 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:31,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:31,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1926155904, now seen corresponding path program 12 times [2019-08-05 09:52:31,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:31,736 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 09:52:31,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:31,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:31,916 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:32,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:32,268 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:32,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:32,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:32,536 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:32,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:32,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:32,586 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:32,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:32,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:32,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:32,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 09:52:32,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 09:52:32,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 09:52:32,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 09:52:32,663 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 09:52:32,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:32,693 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 09:52:32,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 09:52:32,693 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 09:52:32,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:32,694 INFO L225 Difference]: With dead ends: 17 [2019-08-05 09:52:32,695 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 09:52:32,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 09:52:32,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 09:52:32,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 09:52:32,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 09:52:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 09:52:32,698 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 09:52:32,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:32,698 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 09:52:32,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 09:52:32,699 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 09:52:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 09:52:32,699 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:32,699 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 09:52:32,699 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:32,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:32,700 INFO L82 PathProgramCache]: Analyzing trace with hash -418702410, now seen corresponding path program 13 times [2019-08-05 09:52:32,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:33,224 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 09:52:33,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:33,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:33,416 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:33,434 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:33,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:33,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:33,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:33,497 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:33,507 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:33,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:33,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:33,562 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:33,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:33,661 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:33,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:33,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 09:52:33,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 09:52:33,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 09:52:33,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 09:52:33,685 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 09:52:33,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:33,715 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 09:52:33,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 09:52:33,716 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 09:52:33,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:33,717 INFO L225 Difference]: With dead ends: 18 [2019-08-05 09:52:33,717 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 09:52:33,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 09:52:33,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 09:52:33,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 09:52:33,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 09:52:33,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 09:52:33,721 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 09:52:33,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:33,721 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 09:52:33,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 09:52:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 09:52:33,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 09:52:33,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:33,722 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 09:52:33,722 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:33,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:33,722 INFO L82 PathProgramCache]: Analyzing trace with hash -94866112, now seen corresponding path program 14 times [2019-08-05 09:52:33,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:34,595 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 09:52:34,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:34,640 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:34,676 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:34,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:34,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:34,761 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:34,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:34,782 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:34,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:34,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:34,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:34,842 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:34,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:34,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:34,906 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:35,079 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:35,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:35,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 09:52:35,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 09:52:35,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 09:52:35,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 09:52:35,082 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 09:52:35,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:35,209 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 09:52:35,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 09:52:35,210 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 09:52:35,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:35,211 INFO L225 Difference]: With dead ends: 19 [2019-08-05 09:52:35,211 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 09:52:35,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 09:52:35,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 09:52:35,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 09:52:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 09:52:35,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 09:52:35,285 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 09:52:35,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:35,285 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 09:52:35,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 09:52:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 09:52:35,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 09:52:35,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:35,286 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 09:52:35,287 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:35,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:35,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1354124534, now seen corresponding path program 15 times [2019-08-05 09:52:35,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:37,615 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 09:52:37,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:37,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:37,661 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:37,734 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:37,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:37,750 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:37,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:37,781 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:37,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:37,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:37,843 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:37,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:37,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:37,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:37,905 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:37,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:37,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:37,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 09:52:37,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 09:52:37,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 09:52:37,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 09:52:37,973 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 09:52:38,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:38,248 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 09:52:38,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 09:52:38,252 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 09:52:38,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:38,253 INFO L225 Difference]: With dead ends: 20 [2019-08-05 09:52:38,253 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 09:52:38,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 09:52:38,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 09:52:38,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 09:52:38,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 09:52:38,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 09:52:38,258 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 09:52:38,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:38,259 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 09:52:38,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 09:52:38,259 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 09:52:38,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 09:52:38,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:38,259 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 09:52:38,262 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:38,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:38,262 INFO L82 PathProgramCache]: Analyzing trace with hash -971805696, now seen corresponding path program 16 times [2019-08-05 09:52:38,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:40,200 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 09:52:40,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:40,225 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:40,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:40,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:40,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:40,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:40,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:40,338 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:40,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:40,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:40,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:40,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:40,397 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:40,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:40,679 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:40,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:40,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:40,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:40,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 09:52:40,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 09:52:40,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 09:52:40,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 09:52:40,888 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 09:52:40,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:40,934 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 09:52:40,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 09:52:40,934 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 09:52:40,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:40,935 INFO L225 Difference]: With dead ends: 21 [2019-08-05 09:52:40,935 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 09:52:40,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 09:52:40,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 09:52:40,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 09:52:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 09:52:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 09:52:40,939 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 09:52:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:40,939 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 09:52:40,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 09:52:40,940 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 09:52:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 09:52:40,940 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:40,940 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 09:52:40,940 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:40,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:40,941 INFO L82 PathProgramCache]: Analyzing trace with hash -61198794, now seen corresponding path program 17 times [2019-08-05 09:52:40,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:47,307 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 09:52:47,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:47,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:47,390 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:47,397 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:47,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:47,426 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:47,437 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:47,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:47,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:47,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:47,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:47,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:47,538 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:47,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:47,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:47,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:47,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:47,631 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:47,648 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:47,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:47,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 09:52:47,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 09:52:47,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 09:52:47,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 09:52:47,651 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 09:52:47,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:47,708 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 09:52:47,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 09:52:47,709 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 09:52:47,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:47,709 INFO L225 Difference]: With dead ends: 22 [2019-08-05 09:52:47,709 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 09:52:47,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 09:52:47,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 09:52:47,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 09:52:47,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 09:52:47,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 09:52:47,714 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 09:52:47,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:47,714 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 09:52:47,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 09:52:47,715 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 09:52:47,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 09:52:47,717 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:47,718 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 09:52:47,718 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:47,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:47,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1897155904, now seen corresponding path program 18 times [2019-08-05 09:52:47,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:59,036 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 09:52:59,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:59,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:59,074 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:59,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:59,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:59,102 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:59,110 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:59,121 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:59,133 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:59,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:59,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:59,170 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:59,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:59,201 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:59,221 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:59,253 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:59,268 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:59,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:59,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:52:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:59,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:59,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 09:52:59,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 09:52:59,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 09:52:59,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 09:52:59,319 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 09:52:59,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:59,373 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 09:52:59,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 09:52:59,377 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 09:52:59,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:59,377 INFO L225 Difference]: With dead ends: 23 [2019-08-05 09:52:59,377 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 09:52:59,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 09:52:59,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 09:52:59,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 09:52:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 09:52:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 09:52:59,381 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 09:52:59,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:59,381 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 09:52:59,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 09:52:59,381 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 09:52:59,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 09:52:59,382 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:59,382 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 09:52:59,382 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:59,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:59,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1317715830, now seen corresponding path program 19 times [2019-08-05 09:52:59,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:28,202 WARN L254 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 09:53:28,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:28,224 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:28,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:28,538 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:28,746 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2019-08-05 09:53:28,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:28,968 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:29,197 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:29,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:29,654 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:29,677 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:29,687 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:29,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:29,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:29,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:29,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:29,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:29,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:29,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:29,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:29,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:29,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:29,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 09:53:29,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 09:53:29,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 09:53:29,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 09:53:29,844 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 09:53:29,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:29,870 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 09:53:29,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 09:53:29,870 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 09:53:29,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:29,871 INFO L225 Difference]: With dead ends: 24 [2019-08-05 09:53:29,871 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 09:53:29,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 09:53:29,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 09:53:29,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 09:53:29,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 09:53:29,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 09:53:29,875 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 09:53:29,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:29,875 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 09:53:29,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 09:53:29,875 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 09:53:29,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 09:53:29,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:29,876 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 09:53:29,876 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:29,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:29,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2100475520, now seen corresponding path program 20 times [2019-08-05 09:53:29,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:48,371 WARN L254 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 09:54:48,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:48,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:54:48,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:54:48,424 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:54:48,432 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:54:48,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:54:48,449 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:54:48,458 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:54:48,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:54:48,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:54:48,490 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:54:48,504 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:54:48,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:54:48,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:54:48,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:54:48,630 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:54:48,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:54:48,744 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:54:48,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:54:48,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:54:48,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:54:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:48,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:48,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 09:54:48,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 09:54:48,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 09:54:48,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 09:54:48,883 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 09:54:48,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:48,959 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 09:54:48,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 09:54:48,959 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 09:54:48,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:48,960 INFO L225 Difference]: With dead ends: 25 [2019-08-05 09:54:48,960 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 09:54:48,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 09:54:48,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 09:54:48,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 09:54:48,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 09:54:48,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 09:54:48,964 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 09:54:48,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:48,964 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 09:54:48,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 09:54:48,965 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 09:54:48,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 09:54:48,965 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:48,965 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 09:54:48,966 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:48,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:48,966 INFO L82 PathProgramCache]: Analyzing trace with hash -690224970, now seen corresponding path program 21 times [2019-08-05 09:54:48,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy Received shutdown request... [2019-08-05 09:55:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-08-05 09:55:39,576 INFO L285 seRefinementStrategy]: Strategy FixedRefinementStrategy was unsuccessful and could not determine trace feasibility. [2019-08-05 09:55:39,576 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 09:55:39,588 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 09:55:39,589 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, Merged: Merged: Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4 [2019-08-05 09:55:39,590 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 09:55:39,590 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, Merged: Merged: Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4 [2019-08-05 09:55:39,590 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 09:55:39,591 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, Merged: Merged: Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4 [2019-08-05 09:55:39,591 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 09:55:39,591 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, Merged: Merged: Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4 [2019-08-05 09:55:39,591 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 09:55:39,592 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, Merged: Merged: Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4 [2019-08-05 09:55:39,592 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 09:55:39,592 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, Merged: Merged: Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4 [2019-08-05 09:55:39,592 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 09:55:39,593 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, Merged: Merged: Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4 [2019-08-05 09:55:39,593 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 09:55:39,593 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, Merged: Merged: Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4 [2019-08-05 09:55:39,594 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 09:55:39,594 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, Merged: Merged: Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4 [2019-08-05 09:55:39,595 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 09:55:39,595 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, Merged: Merged: Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4 [2019-08-05 09:55:39,595 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 09:55:39,596 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, Merged: Merged: Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4 [2019-08-05 09:55:39,596 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 09:55:39,597 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, Merged: Merged: Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4 [2019-08-05 09:55:39,597 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 09:55:39,597 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, Merged: Merged: Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4 [2019-08-05 09:55:39,597 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 09:55:39,598 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, Merged: Merged: Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4 [2019-08-05 09:55:39,598 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 09:55:39,599 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, Merged: Merged: Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4 [2019-08-05 09:55:39,599 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 09:55:39,599 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, Merged: Merged: Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4 [2019-08-05 09:55:39,599 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 09:55:39,599 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, Merged: Merged: Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4 [2019-08-05 09:55:39,600 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 09:55:39,600 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, Merged: Merged: Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4 [2019-08-05 09:55:39,600 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 09:55:39,601 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, Merged: Merged: Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4 [2019-08-05 09:55:39,601 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 09:55:39,601 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, Merged: Merged: Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4 [2019-08-05 09:55:39,601 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 09:55:39,601 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, Merged: Merged: Merged: Merged: Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, Merged: BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:18/2-26/7, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:19/4-25/6, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4, BPL: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Interactive/input/boogie/Luxembourg-sophisticated.bpl:28/2-30/4 [2019-08-05 09:55:39,613 WARN L226 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-08-05 09:55:39,613 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 09:55:39 BoogieIcfgContainer [2019-08-05 09:55:39,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 09:55:39,616 INFO L168 Benchmark]: Toolchain (without parser) took 193620.16 ms. Allocated memory was 132.1 MB in the beginning and 5.1 GB in the end (delta: 5.0 GB). Free memory was 108.5 MB in the beginning and 883.9 MB in the end (delta: -775.4 MB). Peak memory consumption was 4.8 GB. Max. memory is 7.1 GB. [2019-08-05 09:55:39,617 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.30 ms. Allocated memory is still 132.1 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 09:55:39,618 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.24 ms. Allocated memory is still 132.1 MB. Free memory was 108.5 MB in the beginning and 106.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 09:55:39,618 INFO L168 Benchmark]: Boogie Preprocessor took 25.28 ms. Allocated memory is still 132.1 MB. Free memory was 106.6 MB in the beginning and 105.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 09:55:39,622 INFO L168 Benchmark]: RCFGBuilder took 341.64 ms. Allocated memory is still 132.1 MB. Free memory was 105.4 MB in the beginning and 96.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-08-05 09:55:39,623 INFO L168 Benchmark]: TraceAbstraction took 193210.43 ms. Allocated memory was 132.1 MB in the beginning and 5.1 GB in the end (delta: 5.0 GB). Free memory was 95.7 MB in the beginning and 883.9 MB in the end (delta: -788.2 MB). Peak memory consumption was 4.8 GB. Max. memory is 7.1 GB. [2019-08-05 09:55:39,628 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.30 ms. Allocated memory is still 132.1 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 38.24 ms. Allocated memory is still 132.1 MB. Free memory was 108.5 MB in the beginning and 106.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.28 ms. Allocated memory is still 132.1 MB. Free memory was 106.6 MB in the beginning and 105.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 341.64 ms. Allocated memory is still 132.1 MB. Free memory was 105.4 MB in the beginning and 96.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 193210.43 ms. Allocated memory was 132.1 MB in the beginning and 5.1 GB in the end (delta: 5.0 GB). Free memory was 95.7 MB in the beginning and 883.9 MB in the end (delta: -788.2 MB). Peak memory consumption was 4.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 29]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L15] x := 0; [L16] y := 1000; [L20] x := x + 1; [L21] y := y - 1; [L20] x := x + 1; [L21] y := y - 1; [L20] x := x + 1; [L21] y := y - 1; [L20] x := x + 1; [L21] y := y - 1; [L20] x := x + 1; [L21] y := y - 1; [L20] x := x + 1; [L21] y := y - 1; [L20] x := x + 1; [L21] y := y - 1; [L20] x := x + 1; [L21] y := y - 1; [L20] x := x + 1; [L21] y := y - 1; [L20] x := x + 1; [L21] y := y - 1; [L20] x := x + 1; [L21] y := y - 1; [L20] x := x + 1; [L21] y := y - 1; [L20] x := x + 1; [L21] y := y - 1; [L20] x := x + 1; [L21] y := y - 1; [L20] x := x + 1; [L21] y := y - 1; [L20] x := x + 1; [L21] y := y - 1; [L20] x := x + 1; [L21] y := y - 1; [L20] x := x + 1; [L21] y := y - 1; [L20] x := x + 1; [L21] y := y - 1; [L20] x := x + 1; [L21] y := y - 1; [L20] x := x + 1; [L21] y := y - 1; [L28] COND TRUE x == 1000 [L29] assert y <= 0; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNKNOWN Result, 193.1s OverallTime, 22 OverallIterations, 21 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 65 SDtfs, 2 SDslu, 80 SDs, 0 SdLazy, 332 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=21, 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.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 179.8s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 10878 SizeOfPredicates, 41 NumberOfNonLiveVariables, 399 ConjunctsInSsa, 252 ConjunctsInUnsatCore, 21 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1540 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Completed graceful shutdown