java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_search.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:16:43,254 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:16:43,256 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:16:43,268 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:16:43,269 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:16:43,270 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:16:43,271 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:16:43,273 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:16:43,274 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:16:43,275 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:16:43,276 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:16:43,277 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:16:43,278 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:16:43,279 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:16:43,280 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:16:43,281 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:16:43,282 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:16:43,287 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:16:43,289 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:16:43,290 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:16:43,293 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:16:43,294 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:16:43,298 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:16:43,298 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:16:43,298 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:16:43,300 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:16:43,301 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:16:43,305 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:16:43,306 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:16:43,308 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:16:43,309 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:16:43,310 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:16:43,310 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:16:43,310 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:16:43,311 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:16:43,312 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:16:43,312 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:16:43,328 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:16:43,329 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:16:43,332 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:16:43,332 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:16:43,333 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:16:43,333 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:16:43,333 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:16:43,333 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:16:43,404 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:16:43,417 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:16:43,421 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:16:43,422 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:16:43,423 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:16:43,423 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_search.i_5.bpl [2018-09-26 08:16:43,424 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_search.i_5.bpl' [2018-09-26 08:16:43,496 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:16:43,500 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:16:43,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:16:43,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:16:43,503 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:16:43,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:43" (1/1) ... [2018-09-26 08:16:43,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:43" (1/1) ... [2018-09-26 08:16:43,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:16:43,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:16:43,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:16:43,551 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:16:43,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:43" (1/1) ... [2018-09-26 08:16:43,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:43" (1/1) ... [2018-09-26 08:16:43,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:43" (1/1) ... [2018-09-26 08:16:43,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:43" (1/1) ... [2018-09-26 08:16:43,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:43" (1/1) ... [2018-09-26 08:16:43,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:43" (1/1) ... [2018-09-26 08:16:43,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:43" (1/1) ... [2018-09-26 08:16:43,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:16:43,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:16:43,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:16:43,593 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:16:43,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:43" (1/1) ... [2018-09-26 08:16:43,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:16:43,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:16:43,961 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:16:43,962 INFO L202 PluginConnector]: Adding new model linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:16:43 BoogieIcfgContainer [2018-09-26 08:16:43,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:16:43,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:16:43,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:16:43,967 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:16:43,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:43" (1/2) ... [2018-09-26 08:16:43,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44cb9392 and model type linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:16:43, skipping insertion in model container [2018-09-26 08:16:43,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:16:43" (2/2) ... [2018-09-26 08:16:43,971 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_search.i_5.bpl [2018-09-26 08:16:43,982 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:16:43,992 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:16:44,044 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:16:44,045 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:16:44,045 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:16:44,046 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:16:44,046 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:16:44,046 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:16:44,046 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:16:44,047 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:16:44,047 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:16:44,063 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-26 08:16:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:16:44,073 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:44,074 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:16:44,075 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:44,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:44,082 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-09-26 08:16:44,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:44,485 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:16:44,486 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:16:44,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:16:44,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:16:44,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:16:44,511 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-09-26 08:16:44,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:44,683 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-09-26 08:16:44,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:16:44,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-26 08:16:44,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:44,707 INFO L225 Difference]: With dead ends: 10 [2018-09-26 08:16:44,708 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:16:44,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:16:44,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:16:44,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:16:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:16:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:16:44,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-09-26 08:16:44,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:44,773 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:16:44,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:16:44,774 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:16:44,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:16:44,775 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:44,775 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-09-26 08:16:44,775 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:44,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:44,776 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-09-26 08:16:44,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:45,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:45,054 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:45,054 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:16:45,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:16:45,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:16:45,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:16:45,060 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-09-26 08:16:45,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:45,195 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:16:45,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:16:45,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-09-26 08:16:45,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:45,197 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:16:45,197 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:16:45,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:16:45,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:16:45,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:16:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:16:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:16:45,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-09-26 08:16:45,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:45,211 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:16:45,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:16:45,212 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:16:45,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:16:45,212 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:45,212 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-09-26 08:16:45,213 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:45,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:45,213 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-09-26 08:16:45,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:45,501 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:45,502 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:16:45,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:16:45,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:16:45,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:16:45,504 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-09-26 08:16:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:45,667 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:16:45,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:16:45,668 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-09-26 08:16:45,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:45,669 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:16:45,670 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:16:45,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:16:45,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:16:45,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:16:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:16:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:16:45,682 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-09-26 08:16:45,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:45,682 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:16:45,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:16:45,683 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:16:45,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:16:45,684 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:45,685 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-09-26 08:16:45,685 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:45,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:45,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-09-26 08:16:45,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:45,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:45,936 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:45,938 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:16:45,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:16:45,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:16:45,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:16:45,940 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 7 states. [2018-09-26 08:16:46,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:46,137 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:16:46,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:16:46,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-09-26 08:16:46,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:46,138 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:16:46,138 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:16:46,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:16:46,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:16:46,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:16:46,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:16:46,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:16:46,145 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-09-26 08:16:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:46,146 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:16:46,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:16:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:16:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:16:46,147 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:46,147 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-09-26 08:16:46,148 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:46,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:46,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-09-26 08:16:46,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:46,451 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:46,451 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:16:46,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:16:46,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:16:46,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:16:46,455 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-09-26 08:16:46,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:46,688 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:16:46,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:16:46,688 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:16:46,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:46,689 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:16:46,690 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:16:46,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:16:46,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:16:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:16:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:16:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:16:46,700 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-09-26 08:16:46,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:46,701 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:16:46,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:16:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:16:46,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:16:46,702 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:46,702 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-09-26 08:16:46,704 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:46,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:46,705 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-09-26 08:16:46,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:46,953 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:46,953 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:16:46,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:16:46,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:16:46,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:16:46,955 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 9 states. [2018-09-26 08:16:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:47,225 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 08:16:47,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:16:47,228 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-09-26 08:16:47,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:47,229 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:16:47,229 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:16:47,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:16:47,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:16:47,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:16:47,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:16:47,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:16:47,243 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-09-26 08:16:47,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:47,244 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:16:47,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:16:47,244 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:16:47,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:16:47,245 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:47,245 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-09-26 08:16:47,245 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:47,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:47,247 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-09-26 08:16:47,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:47,530 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:47,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:16:47,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:16:47,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:16:47,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:16:47,532 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-09-26 08:16:47,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:47,807 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-26 08:16:47,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:16:47,808 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-26 08:16:47,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:47,809 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:16:47,809 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:16:47,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:16:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:16:47,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:16:47,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:16:47,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-26 08:16:47,818 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-09-26 08:16:47,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:47,818 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-26 08:16:47,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:16:47,818 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-26 08:16:47,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:16:47,819 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:47,819 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-09-26 08:16:47,820 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:47,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:47,821 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-09-26 08:16:47,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:48,184 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:48,184 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:16:48,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:16:48,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:16:48,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:16:48,186 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 11 states. [2018-09-26 08:16:48,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:48,475 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 08:16:48,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:16:48,475 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-26 08:16:48,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:48,476 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:16:48,476 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:16:48,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:16:48,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:16:48,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:16:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:16:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 08:16:48,489 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-09-26 08:16:48,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:48,489 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 08:16:48,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:16:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 08:16:48,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:16:48,491 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:48,491 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-09-26 08:16:48,492 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:48,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:48,492 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-09-26 08:16:48,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:48,879 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:48,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:16:48,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:16:48,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:16:48,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:16:48,880 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-09-26 08:16:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:49,227 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-26 08:16:49,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:16:49,227 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-26 08:16:49,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:49,228 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:16:49,228 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:16:49,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:16:49,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:16:49,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:16:49,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:16:49,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:16:49,246 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-09-26 08:16:49,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:49,246 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:16:49,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:16:49,246 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:16:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:16:49,247 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:49,247 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-09-26 08:16:49,248 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:49,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:49,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-09-26 08:16:49,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:49,604 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:49,604 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:16:49,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:16:49,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:16:49,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:16:49,605 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 13 states. [2018-09-26 08:16:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:49,970 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 08:16:49,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:16:49,970 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-09-26 08:16:49,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:49,971 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:16:49,971 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:16:49,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:16:49,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:16:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:16:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:16:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 08:16:49,981 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-09-26 08:16:49,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:49,981 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 08:16:49,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:16:49,981 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 08:16:49,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:16:49,982 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:49,982 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-09-26 08:16:49,983 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:49,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:49,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-09-26 08:16:49,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:50,373 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:50,373 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:16:50,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:16:50,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:16:50,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:16:50,374 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-09-26 08:16:50,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:50,840 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-26 08:16:50,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:16:50,841 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-09-26 08:16:50,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:50,841 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:16:50,842 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:16:50,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:16:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:16:50,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:16:50,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:16:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 08:16:50,858 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-09-26 08:16:50,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:50,860 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 08:16:50,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:16:50,861 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 08:16:50,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:16:50,861 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:50,862 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-09-26 08:16:50,862 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:50,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:50,862 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-09-26 08:16:50,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:51,193 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:51,193 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:16:51,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:16:51,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:16:51,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:16:51,195 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2018-09-26 08:16:51,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:51,625 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 08:16:51,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:16:51,626 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2018-09-26 08:16:51,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:51,627 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:16:51,627 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:16:51,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:16:51,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:16:51,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:16:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:16:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:16:51,643 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-09-26 08:16:51,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:51,643 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:16:51,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:16:51,643 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:16:51,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:16:51,644 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:51,644 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-09-26 08:16:51,644 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:51,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:51,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-09-26 08:16:51,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:52,079 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:52,080 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:52,080 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:16:52,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:16:52,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:16:52,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:16:52,082 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-09-26 08:16:52,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:52,533 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-26 08:16:52,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:16:52,534 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-09-26 08:16:52,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:52,535 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:16:52,535 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:16:52,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:16:52,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:16:52,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:16:52,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:16:52,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 08:16:52,546 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-09-26 08:16:52,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:52,547 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 08:16:52,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:16:52,547 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 08:16:52,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:16:52,548 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:52,548 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-09-26 08:16:52,548 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:52,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:52,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-09-26 08:16:52,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:52,992 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:52,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:16:52,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:16:52,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:16:52,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:16:52,994 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 17 states. [2018-09-26 08:16:53,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:53,599 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 08:16:53,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:16:53,600 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-09-26 08:16:53,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:53,600 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:16:53,601 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:16:53,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:16:53,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:16:53,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:16:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:16:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 08:16:53,618 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-09-26 08:16:53,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:53,618 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 08:16:53,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:16:53,619 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 08:16:53,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:16:53,620 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:53,621 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-09-26 08:16:53,621 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:53,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:53,623 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-09-26 08:16:53,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:54,244 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:54,245 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:54,245 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:16:54,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:16:54,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:16:54,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:16:54,247 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-09-26 08:16:54,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:54,572 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-26 08:16:54,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:16:54,572 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-09-26 08:16:54,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:54,573 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:16:54,573 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:16:54,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:16:54,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:16:54,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:16:54,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:16:54,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:16:54,586 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-09-26 08:16:54,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:54,587 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:16:54,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:16:54,587 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:16:54,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:16:54,588 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:54,588 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-09-26 08:16:54,591 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:54,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:54,591 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-09-26 08:16:54,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:55,064 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:55,065 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:55,065 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:16:55,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:16:55,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:16:55,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:16:55,066 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 19 states. [2018-09-26 08:16:55,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:55,705 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 08:16:55,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:16:55,705 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2018-09-26 08:16:55,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:55,709 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:16:55,709 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:16:55,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=144, Invalid=1046, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:16:55,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:16:55,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:16:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:16:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 08:16:55,724 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-09-26 08:16:55,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:55,725 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 08:16:55,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:16:55,725 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 08:16:55,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:16:55,726 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:55,726 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-09-26 08:16:55,726 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:55,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:55,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-09-26 08:16:55,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:56,416 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:56,416 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:16:56,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:16:56,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:16:56,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:16:56,418 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-09-26 08:16:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:57,227 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-26 08:16:57,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:16:57,228 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-09-26 08:16:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:57,228 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:16:57,229 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:16:57,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=1179, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:16:57,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:16:57,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:16:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:16:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-26 08:16:57,246 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-09-26 08:16:57,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:57,248 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-26 08:16:57,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:16:57,248 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-26 08:16:57,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:16:57,255 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:57,255 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-09-26 08:16:57,255 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:57,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:57,256 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2018-09-26 08:16:57,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:57,696 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:57,696 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:16:57,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:16:57,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:16:57,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:16:57,698 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 21 states. [2018-09-26 08:16:58,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:58,317 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-26 08:16:58,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:16:58,318 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2018-09-26 08:16:58,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:58,318 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:16:58,318 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:16:58,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=1320, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:16:58,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:16:58,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:16:58,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:16:58,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:16:58,331 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-09-26 08:16:58,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:58,332 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:16:58,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:16:58,332 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:16:58,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:16:58,333 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:58,333 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-09-26 08:16:58,333 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:58,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:58,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2018-09-26 08:16:58,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:58,834 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:58,834 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:58,834 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:16:58,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:16:58,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:16:58,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:16:58,836 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 23 states. [2018-09-26 08:16:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:59,479 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 08:16:59,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:16:59,480 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2018-09-26 08:16:59,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:59,480 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:16:59,480 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:16:59,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=1546, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:16:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:16:59,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:16:59,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:16:59,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-26 08:16:59,499 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-09-26 08:16:59,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:59,499 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-26 08:16:59,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:16:59,500 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-26 08:16:59,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:16:59,500 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:59,501 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-09-26 08:16:59,501 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:59,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:59,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2018-09-26 08:16:59,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:59,992 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:59,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:16:59,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:16:59,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:16:59,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:16:59,995 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 23 states. [2018-09-26 08:17:00,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:00,618 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 08:17:00,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:17:00,618 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2018-09-26 08:17:00,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:00,619 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:17:00,619 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:17:00,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=1626, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:17:00,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:17:00,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:17:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:17:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 08:17:00,633 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-09-26 08:17:00,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:00,634 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 08:17:00,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:17:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 08:17:00,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:17:00,635 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:00,635 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-09-26 08:17:00,635 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:00,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:00,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2018-09-26 08:17:00,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 40 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:00,743 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:00,743 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:17:00,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:17:00,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:17:00,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:17:00,745 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 22 states. [2018-09-26 08:17:00,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:00,920 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 08:17:00,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:17:00,921 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 44 [2018-09-26 08:17:00,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:00,921 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:17:00,921 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:17:00,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:17:00,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:17:00,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:17:00,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:17:00,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:17:00,923 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-09-26 08:17:00,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:00,923 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:17:00,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:17:00,924 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:17:00,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:17:00,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:17:01,280 WARN L178 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 181 [2018-09-26 08:17:01,487 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 175 [2018-09-26 08:17:01,491 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 11 103) the Hoare annotation is: false [2018-09-26 08:17:01,491 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 11 103) the Hoare annotation is: true [2018-09-26 08:17:01,491 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 11 103) no Hoare annotation was computed. [2018-09-26 08:17:01,492 INFO L422 ceAbstractionStarter]: At program point L91(lines 91 101) the Hoare annotation is: false [2018-09-26 08:17:01,494 INFO L422 ceAbstractionStarter]: At program point L75(lines 75 92) the Hoare annotation is: (let ((.cse3 (div ULTIMATE.start_linear_search_~j~5 4294967296)) (.cse0 (* 4294967296 (div ~SIZE 4294967296)))) (let ((.cse5 (+ .cse0 ULTIMATE.start_linear_search_~j~5 1)) (.cse4 (+ (* 4294967296 .cse3) ~SIZE))) (let ((.cse2 (<= .cse5 .cse4)) (.cse1 (= ~SIZE (+ .cse0 ULTIMATE.start_linear_search_~n)))) (or (and (or (<= (+ .cse0 ULTIMATE.start_linear_search_~j~5 2147483639) ~SIZE) .cse1) .cse2 (<= ULTIMATE.start_linear_search_~j~5 9) (<= 9 ULTIMATE.start_linear_search_~j~5)) (and (<= 12 ULTIMATE.start_linear_search_~j~5) (<= ULTIMATE.start_linear_search_~j~5 12) (or (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483636) ~SIZE) .cse1) .cse2) (and .cse2 (<= 5 ULTIMATE.start_linear_search_~j~5) (or (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483643) ~SIZE) .cse1) (<= ULTIMATE.start_linear_search_~j~5 5)) (and (<= ULTIMATE.start_linear_search_~j~5 16) (<= 16 ULTIMATE.start_linear_search_~j~5) .cse2 (or (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483632) ~SIZE) .cse1)) (and (or (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483630) ~SIZE) .cse1) (<= 18 ULTIMATE.start_linear_search_~j~5) (<= ULTIMATE.start_linear_search_~j~5 18) .cse2) (and (or .cse1 (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483647) ~SIZE)) (<= ULTIMATE.start_linear_search_~j~5 1) .cse2 (<= 1 ULTIMATE.start_linear_search_~j~5)) (and (<= ULTIMATE.start_linear_search_~j~5 0) (or (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483648) ~SIZE) .cse1) (< 0 (+ .cse3 1)) .cse2) (and (or (<= (+ .cse0 ULTIMATE.start_linear_search_~j~5 2147483641) ~SIZE) .cse1) .cse2 (<= 7 ULTIMATE.start_linear_search_~j~5) (<= ULTIMATE.start_linear_search_~j~5 7)) (and (<= ULTIMATE.start_linear_search_~j~5 4) (<= 4 ULTIMATE.start_linear_search_~j~5) (or .cse1 (<= (+ .cse0 ULTIMATE.start_linear_search_~j~5 2147483644) ~SIZE)) .cse2) (and (<= ULTIMATE.start_linear_search_~j~5 2) (<= 2 ULTIMATE.start_linear_search_~j~5) (or (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483646) ~SIZE) .cse1) .cse2) (and (<= 15 ULTIMATE.start_linear_search_~j~5) (<= ULTIMATE.start_linear_search_~j~5 15) .cse2 (or (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483633) ~SIZE) .cse1)) (and (<= ULTIMATE.start_linear_search_~j~5 17) (<= 17 ULTIMATE.start_linear_search_~j~5) (or .cse1 (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483631) ~SIZE)) .cse2) (and (<= 13 ULTIMATE.start_linear_search_~j~5) .cse2 (<= ULTIMATE.start_linear_search_~j~5 13) (or (<= (+ .cse0 ULTIMATE.start_linear_search_~j~5 2147483635) ~SIZE) .cse1)) (and (<= ULTIMATE.start_linear_search_~j~5 8) (<= 8 ULTIMATE.start_linear_search_~j~5) .cse2 (or (<= (+ .cse0 ULTIMATE.start_linear_search_~j~5 2147483640) ~SIZE) .cse1)) (and (<= ULTIMATE.start_linear_search_~j~5 3) (or (<= (+ .cse0 ULTIMATE.start_linear_search_~j~5 2147483645) ~SIZE) .cse1) .cse2 (<= 3 ULTIMATE.start_linear_search_~j~5)) (and (or .cse1 (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483637) ~SIZE)) .cse2 (<= ULTIMATE.start_linear_search_~j~5 11) (<= 11 ULTIMATE.start_linear_search_~j~5)) (and (<= 14 ULTIMATE.start_linear_search_~j~5) (or (<= (+ .cse0 ULTIMATE.start_linear_search_~j~5 2147483634) ~SIZE) .cse1) (<= (+ .cse0 15) .cse4) (<= ULTIMATE.start_linear_search_~j~5 14)) (and (<= ULTIMATE.start_linear_search_~j~5 10) (<= 10 ULTIMATE.start_linear_search_~j~5) (or (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483638) ~SIZE) .cse1) .cse2) (and (<= ULTIMATE.start_linear_search_~j~5 19) (<= .cse5 (+ (* 8589934592 .cse3) ~SIZE)) (<= 19 ULTIMATE.start_linear_search_~j~5) (or .cse1 (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483629) ~SIZE))) (and (<= 6 ULTIMATE.start_linear_search_~j~5) (<= ULTIMATE.start_linear_search_~j~5 6) .cse2 (or (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483642) ~SIZE) .cse1)))))) [2018-09-26 08:17:01,496 INFO L422 ceAbstractionStarter]: At program point L100(lines 65 100) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div ~SIZE 4294967296)))) (let ((.cse1 (= ~SIZE (+ .cse0 ULTIMATE.start_linear_search_~n)))) (or (and (or (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483630) ~SIZE) .cse1) (<= 18 ULTIMATE.start_linear_search_~j~5) (<= ULTIMATE.start_linear_search_~j~5 18)) (and (<= 14 ULTIMATE.start_linear_search_~j~5) (or (<= (+ .cse0 ULTIMATE.start_linear_search_~j~5 2147483634) ~SIZE) .cse1) (<= ULTIMATE.start_linear_search_~j~5 14)) (and (<= 13 ULTIMATE.start_linear_search_~j~5) (<= ULTIMATE.start_linear_search_~j~5 13) (or (<= (+ .cse0 ULTIMATE.start_linear_search_~j~5 2147483635) ~SIZE) .cse1)) (and (<= ULTIMATE.start_linear_search_~j~5 17) (<= 17 ULTIMATE.start_linear_search_~j~5) (or .cse1 (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483631) ~SIZE))) (and (or .cse1 (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483637) ~SIZE)) (<= ULTIMATE.start_linear_search_~j~5 11) (<= 11 ULTIMATE.start_linear_search_~j~5)) (and (<= ULTIMATE.start_linear_search_~j~5 19) (<= 19 ULTIMATE.start_linear_search_~j~5) (or .cse1 (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483629) ~SIZE))) (and (<= ULTIMATE.start_linear_search_~j~5 10) (<= 10 ULTIMATE.start_linear_search_~j~5) (or (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483638) ~SIZE) .cse1)) (and (or (<= (+ .cse0 ULTIMATE.start_linear_search_~j~5 2147483641) ~SIZE) .cse1) (<= 7 ULTIMATE.start_linear_search_~j~5) (<= ULTIMATE.start_linear_search_~j~5 7)) (and (<= ULTIMATE.start_linear_search_~j~5 16) (<= 16 ULTIMATE.start_linear_search_~j~5) (or (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483632) ~SIZE) .cse1)) (and (<= 15 ULTIMATE.start_linear_search_~j~5) (<= ULTIMATE.start_linear_search_~j~5 15) (or (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483633) ~SIZE) .cse1)) (and (<= 12 ULTIMATE.start_linear_search_~j~5) (<= ULTIMATE.start_linear_search_~j~5 12) (or (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483636) ~SIZE) .cse1)) (and (<= ULTIMATE.start_linear_search_~j~5 4) (<= 4 ULTIMATE.start_linear_search_~j~5) (or .cse1 (<= (+ .cse0 ULTIMATE.start_linear_search_~j~5 2147483644) ~SIZE))) (and (<= 6 ULTIMATE.start_linear_search_~j~5) (<= ULTIMATE.start_linear_search_~j~5 6) (or (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483642) ~SIZE) .cse1)) (and (<= 5 ULTIMATE.start_linear_search_~j~5) (or (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483643) ~SIZE) .cse1) (<= ULTIMATE.start_linear_search_~j~5 5)) (and (or (<= (+ .cse0 ULTIMATE.start_linear_search_~j~5 2147483639) ~SIZE) .cse1) (<= ULTIMATE.start_linear_search_~j~5 9) (<= 9 ULTIMATE.start_linear_search_~j~5)) (let ((.cse2 (div ULTIMATE.start_linear_search_~j~5 4294967296))) (and (<= ULTIMATE.start_linear_search_~j~5 0) (or (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483648) ~SIZE) .cse1) (< 0 (+ .cse2 1)) (<= (+ .cse0 ULTIMATE.start_linear_search_~j~5 1) (+ (* 4294967296 .cse2) ~SIZE)))) (and (or .cse1 (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483647) ~SIZE)) (<= ULTIMATE.start_linear_search_~j~5 1) (<= 1 ULTIMATE.start_linear_search_~j~5)) (and (<= ULTIMATE.start_linear_search_~j~5 2) (<= 2 ULTIMATE.start_linear_search_~j~5) (or (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 2147483646) ~SIZE) .cse1)) (and (<= ULTIMATE.start_linear_search_~j~5 3) (or (<= (+ .cse0 ULTIMATE.start_linear_search_~j~5 2147483645) ~SIZE) .cse1) (<= 3 ULTIMATE.start_linear_search_~j~5)) (and (<= ULTIMATE.start_linear_search_~j~5 8) (<= 8 ULTIMATE.start_linear_search_~j~5) (or (<= (+ .cse0 ULTIMATE.start_linear_search_~j~5 2147483640) ~SIZE) .cse1))))) [2018-09-26 08:17:01,497 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 102) the Hoare annotation is: false [2018-09-26 08:17:01,534 INFO L202 PluginConnector]: Adding new model linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:17:01 BoogieIcfgContainer [2018-09-26 08:17:01,534 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:17:01,535 INFO L168 Benchmark]: Toolchain (without parser) took 18038.02 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 546.8 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 12.4 MB). Peak memory consumption was 559.2 MB. Max. memory is 7.1 GB. [2018-09-26 08:17:01,537 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:17:01,537 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:17:01,538 INFO L168 Benchmark]: Boogie Preprocessor took 41.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:17:01,538 INFO L168 Benchmark]: RCFGBuilder took 369.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:17:01,542 INFO L168 Benchmark]: TraceAbstraction took 17571.23 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 546.8 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 1.8 MB). Peak memory consumption was 548.7 MB. Max. memory is 7.1 GB. [2018-09-26 08:17:01,551 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 369.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17571.23 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 546.8 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 1.8 MB). Peak memory consumption was 548.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 102]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 2147483639 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n) && 4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE) && linear_search_~j~5 <= 9) && 9 <= linear_search_~j~5) || (((12 <= linear_search_~j~5 && linear_search_~j~5 <= 12) && (linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483636 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n)) && 4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE)) || (((4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE && 5 <= linear_search_~j~5) && (linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483643 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n)) && linear_search_~j~5 <= 5)) || (((linear_search_~j~5 <= 16 && 16 <= linear_search_~j~5) && 4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE) && (linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483632 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n))) || ((((linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483630 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n) && 18 <= linear_search_~j~5) && linear_search_~j~5 <= 18) && 4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE)) || ((((~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n || linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483647 <= ~SIZE) && linear_search_~j~5 <= 1) && 4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE) && 1 <= linear_search_~j~5)) || (((linear_search_~j~5 <= 0 && (linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483648 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n)) && 0 < linear_search_~j~5 / 4294967296 + 1) && 4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE)) || ((((4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 2147483641 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n) && 4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE) && 7 <= linear_search_~j~5) && linear_search_~j~5 <= 7)) || (((linear_search_~j~5 <= 4 && 4 <= linear_search_~j~5) && (~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n || 4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 2147483644 <= ~SIZE)) && 4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE)) || (((linear_search_~j~5 <= 2 && 2 <= linear_search_~j~5) && (linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483646 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n)) && 4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE)) || (((15 <= linear_search_~j~5 && linear_search_~j~5 <= 15) && 4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE) && (linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483633 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n))) || (((linear_search_~j~5 <= 17 && 17 <= linear_search_~j~5) && (~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n || linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483631 <= ~SIZE)) && 4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE)) || (((13 <= linear_search_~j~5 && 4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE) && linear_search_~j~5 <= 13) && (4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 2147483635 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n))) || (((linear_search_~j~5 <= 8 && 8 <= linear_search_~j~5) && 4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE) && (4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 2147483640 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n))) || (((linear_search_~j~5 <= 3 && (4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 2147483645 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n)) && 4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE) && 3 <= linear_search_~j~5)) || ((((~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n || linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483637 <= ~SIZE) && 4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE) && linear_search_~j~5 <= 11) && 11 <= linear_search_~j~5)) || (((14 <= linear_search_~j~5 && (4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 2147483634 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n)) && 4294967296 * (~SIZE / 4294967296) + 15 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE) && linear_search_~j~5 <= 14)) || (((linear_search_~j~5 <= 10 && 10 <= linear_search_~j~5) && (linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483638 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n)) && 4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE)) || (((linear_search_~j~5 <= 19 && 4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 1 <= 8589934592 * (linear_search_~j~5 / 4294967296) + ~SIZE) && 19 <= linear_search_~j~5) && (~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n || linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483629 <= ~SIZE))) || (((6 <= linear_search_~j~5 && linear_search_~j~5 <= 6) && 4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE) && (linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483642 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n)) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((((((((((((((((((linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483630 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n) && 18 <= linear_search_~j~5) && linear_search_~j~5 <= 18) || ((14 <= linear_search_~j~5 && (4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 2147483634 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n)) && linear_search_~j~5 <= 14)) || ((13 <= linear_search_~j~5 && linear_search_~j~5 <= 13) && (4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 2147483635 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n))) || ((linear_search_~j~5 <= 17 && 17 <= linear_search_~j~5) && (~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n || linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483631 <= ~SIZE))) || (((~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n || linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483637 <= ~SIZE) && linear_search_~j~5 <= 11) && 11 <= linear_search_~j~5)) || ((linear_search_~j~5 <= 19 && 19 <= linear_search_~j~5) && (~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n || linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483629 <= ~SIZE))) || ((linear_search_~j~5 <= 10 && 10 <= linear_search_~j~5) && (linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483638 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n))) || (((4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 2147483641 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n) && 7 <= linear_search_~j~5) && linear_search_~j~5 <= 7)) || ((linear_search_~j~5 <= 16 && 16 <= linear_search_~j~5) && (linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483632 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n))) || ((15 <= linear_search_~j~5 && linear_search_~j~5 <= 15) && (linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483633 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n))) || ((12 <= linear_search_~j~5 && linear_search_~j~5 <= 12) && (linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483636 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n))) || ((linear_search_~j~5 <= 4 && 4 <= linear_search_~j~5) && (~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n || 4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 2147483644 <= ~SIZE))) || ((6 <= linear_search_~j~5 && linear_search_~j~5 <= 6) && (linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483642 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n))) || ((5 <= linear_search_~j~5 && (linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483643 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n)) && linear_search_~j~5 <= 5)) || (((4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 2147483639 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n) && linear_search_~j~5 <= 9) && 9 <= linear_search_~j~5)) || (((linear_search_~j~5 <= 0 && (linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483648 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n)) && 0 < linear_search_~j~5 / 4294967296 + 1) && 4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE)) || (((~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n || linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483647 <= ~SIZE) && linear_search_~j~5 <= 1) && 1 <= linear_search_~j~5)) || ((linear_search_~j~5 <= 2 && 2 <= linear_search_~j~5) && (linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 2147483646 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n))) || ((linear_search_~j~5 <= 3 && (4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 2147483645 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n)) && 3 <= linear_search_~j~5)) || ((linear_search_~j~5 <= 8 && 8 <= linear_search_~j~5) && (4294967296 * (~SIZE / 4294967296) + linear_search_~j~5 + 2147483640 <= ~SIZE || ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 17.4s OverallTime, 21 OverallIterations, 21 TraceHistogramMax, 8.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 61 SDtfs, 197 SDslu, 175 SDs, 0 SdLazy, 6467 SolverSat, 196 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 487 GetRequests, 21 SyntacticMatches, 18 SemanticMatches, 448 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=20, 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.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 46 NumberOfFragments, 1429 HoareAnnotationTreeSize, 6 FomulaSimplifications, 486 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 1280 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 483 ConstructedInterpolants, 0 QuantifiedInterpolants, 375912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 1 PerfectInterpolantSequences, 40/3080 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/linear_search.i_5.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-17-01-579.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/linear_search.i_5.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-17-01-579.csv Received shutdown request...