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/nested.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:17:18,821 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:17:18,824 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:17:18,838 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:17:18,838 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:17:18,839 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:17:18,840 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:17:18,842 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:17:18,844 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:17:18,845 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:17:18,846 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:17:18,846 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:17:18,847 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:17:18,848 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:17:18,849 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:17:18,850 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:17:18,851 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:17:18,855 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:17:18,860 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:17:18,862 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:17:18,864 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:17:18,865 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:17:18,868 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:17:18,869 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:17:18,869 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:17:18,871 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:17:18,872 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:17:18,876 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:17:18,877 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:17:18,878 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:17:18,878 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:17:18,881 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:17:18,881 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:17:18,881 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:17:18,884 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:17:18,888 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:17:18,889 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:17:18,909 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:17:18,910 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:17:18,911 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:17:18,911 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:17:18,912 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:17:18,912 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:17:18,912 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:17:18,912 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:17:18,967 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:17:18,982 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:17:18,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:17:18,990 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:17:18,991 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:17:18,992 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested.i_4.bpl [2018-09-26 08:17:18,992 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested.i_4.bpl' [2018-09-26 08:17:19,047 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:17:19,050 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:17:19,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:17:19,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:17:19,052 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:17:19,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:19" (1/1) ... [2018-09-26 08:17:19,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:19" (1/1) ... [2018-09-26 08:17:19,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:17:19,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:17:19,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:17:19,092 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:17:19,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:19" (1/1) ... [2018-09-26 08:17:19,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:19" (1/1) ... [2018-09-26 08:17:19,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:19" (1/1) ... [2018-09-26 08:17:19,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:19" (1/1) ... [2018-09-26 08:17:19,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:19" (1/1) ... [2018-09-26 08:17:19,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:19" (1/1) ... [2018-09-26 08:17:19,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:19" (1/1) ... [2018-09-26 08:17:19,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:17:19,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:17:19,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:17:19,114 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:17:19,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:19" (1/1) ... [2018-09-26 08:17:19,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:17:19,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:17:19,427 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:17:19,428 INFO L202 PluginConnector]: Adding new model nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:17:19 BoogieIcfgContainer [2018-09-26 08:17:19,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:17:19,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:17:19,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:17:19,434 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:17:19,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:19" (1/2) ... [2018-09-26 08:17:19,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c27522 and model type nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:17:19, skipping insertion in model container [2018-09-26 08:17:19,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:17:19" (2/2) ... [2018-09-26 08:17:19,441 INFO L112 eAbstractionObserver]: Analyzing ICFG nested.i_4.bpl [2018-09-26 08:17:19,453 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:17:19,467 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:17:19,528 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:17:19,529 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:17:19,529 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:17:19,529 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:17:19,530 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:17:19,530 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:17:19,530 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:17:19,530 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:17:19,530 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:17:19,552 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-09-26 08:17:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:17:19,573 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:19,574 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:17:19,576 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:19,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:19,587 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-09-26 08:17:19,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:19,681 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:17:19,684 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:17:19,685 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:17:19,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:17:19,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:17:19,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:17:19,709 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-09-26 08:17:19,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:19,745 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2018-09-26 08:17:19,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:17:19,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-26 08:17:19,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:19,759 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:17:19,759 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:17:19,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:17:19,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:17:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-09-26 08:17:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:17:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-09-26 08:17:19,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 4 [2018-09-26 08:17:19,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:19,804 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-09-26 08:17:19,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:17:19,804 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-09-26 08:17:19,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:17:19,805 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:19,805 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:17:19,805 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:19,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:19,806 INFO L82 PathProgramCache]: Analyzing trace with hash 209100445, now seen corresponding path program 1 times [2018-09-26 08:17:19,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:19,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:19,853 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:17:19,854 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:17:19,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:17:19,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:17:19,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:17:19,863 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2018-09-26 08:17:19,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:19,924 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-09-26 08:17:19,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:17:19,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-09-26 08:17:19,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:19,927 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:17:19,927 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:17:19,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:17:19,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:17:19,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:17:19,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:17:19,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-09-26 08:17:19,940 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-09-26 08:17:19,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:19,940 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-09-26 08:17:19,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:17:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-09-26 08:17:19,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:17:19,941 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:19,941 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:17:19,942 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:19,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:19,942 INFO L82 PathProgramCache]: Analyzing trace with hash -850198025, now seen corresponding path program 1 times [2018-09-26 08:17:19,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:19,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:19,979 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:19,979 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:17:19,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:17:19,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:17:19,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:17:19,981 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 5 states. [2018-09-26 08:17:20,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:20,028 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-09-26 08:17:20,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:17:20,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-09-26 08:17:20,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:20,030 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:17:20,030 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:17:20,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:17:20,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:17:20,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:17:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:17:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-09-26 08:17:20,037 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-09-26 08:17:20,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:20,037 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-09-26 08:17:20,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:17:20,038 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-09-26 08:17:20,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:17:20,038 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:20,039 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:17:20,039 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:20,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:20,040 INFO L82 PathProgramCache]: Analyzing trace with hash -928778543, now seen corresponding path program 2 times [2018-09-26 08:17:20,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:20,089 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:20,089 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:20,090 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:17:20,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:17:20,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:17:20,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:17:20,091 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2018-09-26 08:17:20,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:20,160 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-09-26 08:17:20,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:17:20,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-09-26 08:17:20,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:20,163 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:17:20,164 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:17:20,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:17:20,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:17:20,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:17:20,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:17:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-09-26 08:17:20,179 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-09-26 08:17:20,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:20,180 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-09-26 08:17:20,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:17:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-09-26 08:17:20,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:17:20,181 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:20,181 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2018-09-26 08:17:20,186 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:20,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:20,187 INFO L82 PathProgramCache]: Analyzing trace with hash 864754987, now seen corresponding path program 3 times [2018-09-26 08:17:20,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:20,235 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:20,236 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:20,236 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:17:20,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:17:20,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:17:20,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:17:20,238 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2018-09-26 08:17:20,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:20,290 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-09-26 08:17:20,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:17:20,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-09-26 08:17:20,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:20,292 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:17:20,292 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:17:20,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:17:20,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:17:20,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:17:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:17:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-09-26 08:17:20,299 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-09-26 08:17:20,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:20,300 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-09-26 08:17:20,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:17:20,300 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-09-26 08:17:20,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:17:20,301 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:20,301 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1] [2018-09-26 08:17:20,302 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:20,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:20,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2126375675, now seen corresponding path program 4 times [2018-09-26 08:17:20,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:20,354 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:20,354 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:17:20,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:17:20,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:17:20,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:17:20,362 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 8 states. [2018-09-26 08:17:20,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:20,450 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-09-26 08:17:20,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:17:20,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:17:20,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:20,454 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:17:20,454 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:17:20,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:17:20,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:17:20,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:17:20,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:17:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-09-26 08:17:20,463 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-09-26 08:17:20,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:20,463 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-09-26 08:17:20,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:17:20,464 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-09-26 08:17:20,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:17:20,464 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:20,465 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 2, 1, 1, 1, 1, 1] [2018-09-26 08:17:20,465 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:20,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:20,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1025146463, now seen corresponding path program 5 times [2018-09-26 08:17:20,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:20,510 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:20,510 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:17:20,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:17:20,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:17:20,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:17:20,512 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 9 states. [2018-09-26 08:17:20,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:20,594 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-09-26 08:17:20,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:17:20,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-09-26 08:17:20,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:20,596 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:17:20,596 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:17:20,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:17:20,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:17:20,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:17:20,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:17:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-09-26 08:17:20,613 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-09-26 08:17:20,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:20,613 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-09-26 08:17:20,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:17:20,614 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-09-26 08:17:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:17:20,615 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:20,616 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 2, 1, 1, 1, 1, 1] [2018-09-26 08:17:20,616 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:20,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:20,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1685977401, now seen corresponding path program 6 times [2018-09-26 08:17:20,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:20,662 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:20,663 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:17:20,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:17:20,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:17:20,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:17:20,666 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2018-09-26 08:17:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:20,747 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-09-26 08:17:20,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:17:20,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-09-26 08:17:20,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:20,749 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:17:20,750 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:17:20,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:17:20,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:17:20,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:17:20,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:17:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-09-26 08:17:20,759 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-09-26 08:17:20,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:20,760 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-09-26 08:17:20,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:17:20,760 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-09-26 08:17:20,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:17:20,763 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:20,763 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 2, 1, 1, 1, 1, 1] [2018-09-26 08:17:20,763 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:20,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:20,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1089349011, now seen corresponding path program 7 times [2018-09-26 08:17:20,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:20,819 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:20,820 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:17:20,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:17:20,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:17:20,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:17:20,823 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 11 states. [2018-09-26 08:17:20,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:20,901 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-09-26 08:17:20,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:17:20,901 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-09-26 08:17:20,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:20,902 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:17:20,902 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:17:20,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:17:20,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:17:20,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:17:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:17:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-09-26 08:17:20,909 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-09-26 08:17:20,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:20,909 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-09-26 08:17:20,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:17:20,910 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-09-26 08:17:20,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:17:20,911 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:20,911 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 2, 1, 1, 1, 1, 1] [2018-09-26 08:17:20,911 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:20,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:20,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1039883411, now seen corresponding path program 8 times [2018-09-26 08:17:20,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:20,964 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:20,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:17:20,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:17:20,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:17:20,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:17:20,966 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 12 states. [2018-09-26 08:17:21,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:21,034 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-09-26 08:17:21,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:17:21,035 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-09-26 08:17:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:21,036 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:17:21,036 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:17:21,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:17:21,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:17:21,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:17:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:17:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-09-26 08:17:21,043 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-09-26 08:17:21,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:21,044 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-09-26 08:17:21,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:17:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-09-26 08:17:21,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:17:21,045 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:21,046 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 2, 1, 1, 1, 1, 1] [2018-09-26 08:17:21,047 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:21,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:21,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1467159239, now seen corresponding path program 9 times [2018-09-26 08:17:21,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:21,136 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:21,137 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:21,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:17:21,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:17:21,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:17:21,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:17:21,139 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 13 states. [2018-09-26 08:17:21,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:21,238 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-09-26 08:17:21,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:17:21,239 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-09-26 08:17:21,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:21,240 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:17:21,240 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:17:21,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:17:21,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:17:21,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:17:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:17:21,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-09-26 08:17:21,258 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-09-26 08:17:21,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:21,258 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-09-26 08:17:21,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:17:21,258 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-09-26 08:17:21,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:17:21,259 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:21,260 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 2, 1, 1, 1, 1, 1] [2018-09-26 08:17:21,260 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:21,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:21,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1258492833, now seen corresponding path program 10 times [2018-09-26 08:17:21,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:21,305 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-26 08:17:21,305 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:21,307 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:17:21,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:17:21,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:17:21,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:17:21,308 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 4 states. [2018-09-26 08:17:21,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:21,327 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-09-26 08:17:21,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:17:21,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-09-26 08:17:21,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:21,329 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:17:21,329 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:17:21,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:17:21,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:17:21,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2018-09-26 08:17:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:17:21,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-09-26 08:17:21,357 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 28 [2018-09-26 08:17:21,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:21,358 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-09-26 08:17:21,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:17:21,358 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-09-26 08:17:21,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:17:21,360 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:21,361 INFO L375 BasicCegarLoop]: trace histogram [22, 20, 3, 2, 2, 1, 1, 1] [2018-09-26 08:17:21,361 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:21,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:21,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1680906619, now seen corresponding path program 11 times [2018-09-26 08:17:21,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:21,417 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-09-26 08:17:21,418 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:21,418 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:17:21,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:17:21,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:17:21,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:17:21,421 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states. [2018-09-26 08:17:21,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:21,454 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-09-26 08:17:21,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:17:21,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-09-26 08:17:21,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:21,457 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:17:21,457 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:17:21,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:17:21,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:17:21,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 77. [2018-09-26 08:17:21,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:17:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-09-26 08:17:21,488 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 52 [2018-09-26 08:17:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:21,492 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-09-26 08:17:21,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:17:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-09-26 08:17:21,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:17:21,498 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:21,498 INFO L375 BasicCegarLoop]: trace histogram [33, 30, 4, 3, 3, 1, 1, 1] [2018-09-26 08:17:21,498 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:21,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:21,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1350520491, now seen corresponding path program 12 times [2018-09-26 08:17:21,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:21,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 0 proven. 738 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-09-26 08:17:21,599 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:21,600 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:17:21,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:17:21,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:17:21,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:17:21,603 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 6 states. [2018-09-26 08:17:21,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:21,641 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-09-26 08:17:21,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:17:21,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2018-09-26 08:17:21,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:21,643 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:17:21,643 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:17:21,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:17:21,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:17:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 101. [2018-09-26 08:17:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:17:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-09-26 08:17:21,684 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 76 [2018-09-26 08:17:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:21,685 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-09-26 08:17:21,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:17:21,687 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-09-26 08:17:21,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:17:21,690 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:21,691 INFO L375 BasicCegarLoop]: trace histogram [44, 40, 5, 4, 4, 1, 1, 1] [2018-09-26 08:17:21,691 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:21,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:21,691 INFO L82 PathProgramCache]: Analyzing trace with hash -220374225, now seen corresponding path program 13 times [2018-09-26 08:17:21,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:21,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1912 backedges. 0 proven. 1472 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-09-26 08:17:21,790 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:21,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:17:21,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:17:21,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:17:21,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:17:21,792 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 7 states. [2018-09-26 08:17:21,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:21,831 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-09-26 08:17:21,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:17:21,832 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-09-26 08:17:21,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:21,833 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:17:21,834 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:17:21,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:17:21,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:17:21,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 125. [2018-09-26 08:17:21,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:17:21,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-09-26 08:17:21,869 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 100 [2018-09-26 08:17:21,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:21,870 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-09-26 08:17:21,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:17:21,870 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-09-26 08:17:21,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:17:21,872 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:21,872 INFO L375 BasicCegarLoop]: trace histogram [55, 50, 6, 5, 5, 1, 1, 1] [2018-09-26 08:17:21,873 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:21,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:21,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1446024969, now seen corresponding path program 14 times [2018-09-26 08:17:21,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3000 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-09-26 08:17:22,002 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:22,002 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:17:22,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:17:22,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:17:22,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:17:22,003 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 8 states. [2018-09-26 08:17:22,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:22,060 INFO L93 Difference]: Finished difference Result 173 states and 180 transitions. [2018-09-26 08:17:22,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:17:22,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 124 [2018-09-26 08:17:22,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:22,062 INFO L225 Difference]: With dead ends: 173 [2018-09-26 08:17:22,062 INFO L226 Difference]: Without dead ends: 171 [2018-09-26 08:17:22,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:17:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-26 08:17:22,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 149. [2018-09-26 08:17:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:17:22,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 155 transitions. [2018-09-26 08:17:22,108 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 155 transitions. Word has length 124 [2018-09-26 08:17:22,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:22,109 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 155 transitions. [2018-09-26 08:17:22,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:17:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2018-09-26 08:17:22,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:17:22,117 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:22,117 INFO L375 BasicCegarLoop]: trace histogram [66, 60, 7, 6, 6, 1, 1, 1] [2018-09-26 08:17:22,118 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:22,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:22,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1667523811, now seen corresponding path program 15 times [2018-09-26 08:17:22,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4332 backedges. 0 proven. 3672 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-09-26 08:17:22,328 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:22,328 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:17:22,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:17:22,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:17:22,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:17:22,329 INFO L87 Difference]: Start difference. First operand 149 states and 155 transitions. Second operand 9 states. [2018-09-26 08:17:22,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:22,404 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2018-09-26 08:17:22,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:17:22,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-09-26 08:17:22,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:22,406 INFO L225 Difference]: With dead ends: 197 [2018-09-26 08:17:22,406 INFO L226 Difference]: Without dead ends: 195 [2018-09-26 08:17:22,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:17:22,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-26 08:17:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2018-09-26 08:17:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:17:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 180 transitions. [2018-09-26 08:17:22,455 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 180 transitions. Word has length 148 [2018-09-26 08:17:22,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:22,455 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 180 transitions. [2018-09-26 08:17:22,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:17:22,456 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 180 transitions. [2018-09-26 08:17:22,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 08:17:22,457 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:22,458 INFO L375 BasicCegarLoop]: trace histogram [77, 70, 8, 7, 7, 1, 1, 1] [2018-09-26 08:17:22,458 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:22,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:22,459 INFO L82 PathProgramCache]: Analyzing trace with hash 107136189, now seen corresponding path program 16 times [2018-09-26 08:17:22,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:22,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5908 backedges. 0 proven. 5138 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-09-26 08:17:22,658 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:22,659 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:17:22,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:17:22,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:17:22,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:17:22,660 INFO L87 Difference]: Start difference. First operand 173 states and 180 transitions. Second operand 10 states. [2018-09-26 08:17:22,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:22,737 INFO L93 Difference]: Finished difference Result 221 states and 230 transitions. [2018-09-26 08:17:22,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:17:22,737 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 172 [2018-09-26 08:17:22,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:22,739 INFO L225 Difference]: With dead ends: 221 [2018-09-26 08:17:22,739 INFO L226 Difference]: Without dead ends: 219 [2018-09-26 08:17:22,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:17:22,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-26 08:17:22,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 197. [2018-09-26 08:17:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 08:17:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 205 transitions. [2018-09-26 08:17:22,795 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 205 transitions. Word has length 172 [2018-09-26 08:17:22,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:22,796 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 205 transitions. [2018-09-26 08:17:22,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:17:22,796 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 205 transitions. [2018-09-26 08:17:22,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 08:17:22,799 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:22,799 INFO L375 BasicCegarLoop]: trace histogram [88, 80, 9, 8, 8, 1, 1, 1] [2018-09-26 08:17:22,799 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:22,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:22,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1927956841, now seen corresponding path program 17 times [2018-09-26 08:17:22,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:23,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7728 backedges. 0 proven. 6848 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-09-26 08:17:23,083 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:23,083 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:17:23,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:17:23,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:17:23,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:17:23,085 INFO L87 Difference]: Start difference. First operand 197 states and 205 transitions. Second operand 11 states. [2018-09-26 08:17:23,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:23,203 INFO L93 Difference]: Finished difference Result 245 states and 255 transitions. [2018-09-26 08:17:23,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:17:23,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 196 [2018-09-26 08:17:23,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:23,205 INFO L225 Difference]: With dead ends: 245 [2018-09-26 08:17:23,205 INFO L226 Difference]: Without dead ends: 243 [2018-09-26 08:17:23,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:17:23,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-09-26 08:17:23,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 221. [2018-09-26 08:17:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-26 08:17:23,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 230 transitions. [2018-09-26 08:17:23,301 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 230 transitions. Word has length 196 [2018-09-26 08:17:23,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:23,301 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 230 transitions. [2018-09-26 08:17:23,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:17:23,302 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 230 transitions. [2018-09-26 08:17:23,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-26 08:17:23,305 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:23,305 INFO L375 BasicCegarLoop]: trace histogram [99, 90, 10, 9, 9, 1, 1, 1] [2018-09-26 08:17:23,305 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:23,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:23,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1486407055, now seen corresponding path program 18 times [2018-09-26 08:17:23,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9792 backedges. 0 proven. 8802 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-09-26 08:17:23,599 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:23,599 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:17:23,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:17:23,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:17:23,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:17:23,600 INFO L87 Difference]: Start difference. First operand 221 states and 230 transitions. Second operand 12 states. [2018-09-26 08:17:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:23,706 INFO L93 Difference]: Finished difference Result 247 states and 257 transitions. [2018-09-26 08:17:23,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:17:23,706 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 220 [2018-09-26 08:17:23,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:23,708 INFO L225 Difference]: With dead ends: 247 [2018-09-26 08:17:23,709 INFO L226 Difference]: Without dead ends: 245 [2018-09-26 08:17:23,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:17:23,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-26 08:17:23,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-09-26 08:17:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-26 08:17:23,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 255 transitions. [2018-09-26 08:17:23,805 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 255 transitions. Word has length 220 [2018-09-26 08:17:23,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:23,806 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 255 transitions. [2018-09-26 08:17:23,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:17:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 255 transitions. [2018-09-26 08:17:23,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-26 08:17:23,809 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:23,809 INFO L375 BasicCegarLoop]: trace histogram [110, 100, 11, 10, 10, 1, 1, 1] [2018-09-26 08:17:23,810 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:23,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:23,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1732333643, now seen corresponding path program 19 times [2018-09-26 08:17:23,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 12082 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-26 08:17:25,029 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:17:25,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-09-26 08:17:25,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:17:25,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:17:25,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:17:25,038 INFO L87 Difference]: Start difference. First operand 245 states and 255 transitions. Second operand 103 states. [2018-09-26 08:17:28,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:28,832 INFO L93 Difference]: Finished difference Result 10235 states and 10695 transitions. [2018-09-26 08:17:28,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:17:28,833 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 244 [2018-09-26 08:17:28,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:28,834 INFO L225 Difference]: With dead ends: 10235 [2018-09-26 08:17:28,834 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:17:28,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:17:28,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:17:28,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:17:28,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:17:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:17:28,855 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 244 [2018-09-26 08:17:28,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:28,855 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:17:28,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:17:28,855 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:17:28,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:17:28,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:18:22,557 WARN L178 SmtUtils]: Spent 53.67 s on a formula simplification. DAG size of input: 5090 DAG size of output: 1364 [2018-09-26 08:19:13,334 WARN L178 SmtUtils]: Spent 50.76 s on a formula simplification. DAG size of input: 5090 DAG size of output: 1364 [2018-09-26 08:19:14,069 WARN L178 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 680 DAG size of output: 671 [2018-09-26 08:19:15,040 WARN L178 SmtUtils]: Spent 968.00 ms on a formula simplification. DAG size of input: 680 DAG size of output: 671 [2018-09-26 08:19:22,688 WARN L178 SmtUtils]: Spent 7.64 s on a formula simplification. DAG size of input: 1364 DAG size of output: 369 [2018-09-26 08:19:27,807 WARN L178 SmtUtils]: Spent 5.11 s on a formula simplification. DAG size of input: 1364 DAG size of output: 369 [2018-09-26 08:19:28,408 WARN L178 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 671 DAG size of output: 68 [2018-09-26 08:19:28,889 WARN L178 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 671 DAG size of output: 68 [2018-09-26 08:19:28,891 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 71) no Hoare annotation was computed. [2018-09-26 08:19:28,893 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 71) the Hoare annotation is: true [2018-09-26 08:19:28,896 INFO L422 ceAbstractionStarter]: At program point L61(lines 31 61) the Hoare annotation is: (let ((.cse0 (<= 10 ULTIMATE.start_main_~m~5))) (or (and (<= 70 ULTIMATE.start_main_~k~5) .cse0 (<= (+ ULTIMATE.start_main_~i~5 3) ULTIMATE.start_main_~n~5)) (and (<= (+ ULTIMATE.start_main_~i~5 10) ULTIMATE.start_main_~n~5) (<= 0 ULTIMATE.start_main_~k~5) .cse0) (and (<= (+ ULTIMATE.start_main_~i~5 7) ULTIMATE.start_main_~n~5) .cse0 (<= 30 ULTIMATE.start_main_~k~5)) (and (<= 100 ULTIMATE.start_main_~k~5) .cse0) (and .cse0 (<= (+ ULTIMATE.start_main_~i~5 2) ULTIMATE.start_main_~n~5) (<= 80 ULTIMATE.start_main_~k~5)) (and (<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5) (<= 90 ULTIMATE.start_main_~k~5) .cse0) (and (<= (+ ULTIMATE.start_main_~i~5 8) ULTIMATE.start_main_~n~5) (<= 20 ULTIMATE.start_main_~k~5) .cse0) (and (<= 60 ULTIMATE.start_main_~k~5) .cse0 (<= (+ ULTIMATE.start_main_~i~5 4) ULTIMATE.start_main_~n~5)) (and (<= 50 ULTIMATE.start_main_~k~5) (<= (+ ULTIMATE.start_main_~i~5 5) ULTIMATE.start_main_~n~5) .cse0) (and (<= 40 ULTIMATE.start_main_~k~5) (<= (+ ULTIMATE.start_main_~i~5 6) ULTIMATE.start_main_~n~5) .cse0) (and (<= 10 ULTIMATE.start_main_~k~5) (<= (+ ULTIMATE.start_main_~i~5 9) ULTIMATE.start_main_~n~5) .cse0))) [2018-09-26 08:19:28,896 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 71) no Hoare annotation was computed. [2018-09-26 08:19:28,896 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 50) the Hoare annotation is: false [2018-09-26 08:19:28,907 INFO L422 ceAbstractionStarter]: At program point L53(lines 53 62) the Hoare annotation is: (let ((.cse33 (<= (+ ULTIMATE.start_main_~j~5 7) ULTIMATE.start_main_~m~5)) (.cse38 (<= (+ ULTIMATE.start_main_~j~5 5) ULTIMATE.start_main_~m~5)) (.cse30 (<= (+ ULTIMATE.start_main_~j~5 1) ULTIMATE.start_main_~m~5)) (.cse39 (<= (+ ULTIMATE.start_main_~j~5 3) ULTIMATE.start_main_~m~5)) (.cse3 (<= (+ ULTIMATE.start_main_~j~5 10) ULTIMATE.start_main_~m~5)) (.cse10 (<= (+ ULTIMATE.start_main_~j~5 4) ULTIMATE.start_main_~m~5)) (.cse34 (<= (+ ULTIMATE.start_main_~j~5 8) ULTIMATE.start_main_~m~5)) (.cse31 (<= (+ ULTIMATE.start_main_~j~5 2) ULTIMATE.start_main_~m~5)) (.cse28 (<= (+ ULTIMATE.start_main_~j~5 9) ULTIMATE.start_main_~m~5)) (.cse4 (<= 10 ULTIMATE.start_main_~m~5)) (.cse22 (<= (+ ULTIMATE.start_main_~j~5 6) ULTIMATE.start_main_~m~5))) (let ((.cse7 (<= 90 ULTIMATE.start_main_~k~5)) (.cse27 (<= 70 ULTIMATE.start_main_~k~5)) (.cse29 (<= 60 ULTIMATE.start_main_~k~5)) (.cse36 (<= 10 ULTIMATE.start_main_~k~5)) (.cse25 (<= 20 ULTIMATE.start_main_~k~5)) (.cse1 (and .cse4 .cse22)) (.cse35 (<= 50 ULTIMATE.start_main_~k~5)) (.cse15 (and .cse28 .cse4)) (.cse11 (and .cse31 .cse4)) (.cse17 (<= (+ ULTIMATE.start_main_~i~5 8) ULTIMATE.start_main_~n~5)) (.cse24 (<= 40 ULTIMATE.start_main_~k~5)) (.cse6 (<= (+ ULTIMATE.start_main_~i~5 6) ULTIMATE.start_main_~n~5)) (.cse23 (and .cse4 .cse34)) (.cse32 (<= 80 ULTIMATE.start_main_~k~5)) (.cse0 (<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5)) (.cse20 (and .cse4 .cse10)) (.cse2 (<= (+ ULTIMATE.start_main_~i~5 10) ULTIMATE.start_main_~n~5)) (.cse19 (<= (+ ULTIMATE.start_main_~i~5 7) ULTIMATE.start_main_~n~5)) (.cse8 (and .cse3 .cse4)) (.cse37 (<= 30 ULTIMATE.start_main_~k~5)) (.cse13 (and .cse4 .cse39)) (.cse12 (<= (+ ULTIMATE.start_main_~i~5 3) ULTIMATE.start_main_~n~5)) (.cse16 (<= (+ ULTIMATE.start_main_~i~5 5) ULTIMATE.start_main_~n~5)) (.cse18 (and .cse30 .cse4)) (.cse9 (<= (+ ULTIMATE.start_main_~i~5 9) ULTIMATE.start_main_~n~5)) (.cse26 (and .cse38 .cse4)) (.cse14 (<= (+ ULTIMATE.start_main_~i~5 2) ULTIMATE.start_main_~n~5)) (.cse5 (and .cse33 .cse4)) (.cse21 (<= (+ ULTIMATE.start_main_~i~5 4) ULTIMATE.start_main_~n~5))) (or (and .cse0 .cse1 (<= 94 ULTIMATE.start_main_~k~5)) (and .cse2 .cse3 (<= 0 ULTIMATE.start_main_~k~5) .cse4) (and .cse5 .cse6 (<= 43 ULTIMATE.start_main_~k~5)) (and .cse0 .cse7 .cse8) (and .cse9 (<= 16 ULTIMATE.start_main_~k~5) .cse4 .cse10) (and (<= 78 ULTIMATE.start_main_~k~5) .cse11 .cse12) (and .cse0 .cse13 (<= 97 ULTIMATE.start_main_~k~5)) (and (<= 88 ULTIMATE.start_main_~k~5) .cse11 .cse14) (and .cse5 (<= 83 ULTIMATE.start_main_~k~5) .cse14) (and .cse15 .cse16 (<= 51 ULTIMATE.start_main_~k~5)) (and .cse17 (<= 29 ULTIMATE.start_main_~k~5) .cse18) (and .cse17 (<= 28 ULTIMATE.start_main_~k~5) .cse11) (and (<= 71 ULTIMATE.start_main_~k~5) .cse15 .cse12) (and .cse19 .cse20 (<= 36 ULTIMATE.start_main_~k~5)) (and .cse0 .cse15 (<= 91 ULTIMATE.start_main_~k~5)) (and (<= 74 ULTIMATE.start_main_~k~5) .cse12 .cse1) (and .cse11 .cse21 (<= 68 ULTIMATE.start_main_~k~5)) (and .cse15 .cse17 (<= 21 ULTIMATE.start_main_~k~5)) (and .cse9 (<= 14 ULTIMATE.start_main_~k~5) .cse4 .cse22) (and (<= 61 ULTIMATE.start_main_~k~5) .cse15 .cse21) (and .cse15 .cse19 (<= 31 ULTIMATE.start_main_~k~5)) (and .cse19 .cse18 (<= 39 ULTIMATE.start_main_~k~5)) (and (<= 72 ULTIMATE.start_main_~k~5) .cse23 .cse12) (and .cse0 (<= 99 ULTIMATE.start_main_~k~5) .cse18) (and .cse5 (<= 53 ULTIMATE.start_main_~k~5) .cse16) (and .cse0 (<= 98 ULTIMATE.start_main_~k~5) .cse11) (and (<= 54 ULTIMATE.start_main_~k~5) .cse16 .cse1) (and .cse8 .cse24 .cse6) (and .cse13 .cse19 (<= 37 ULTIMATE.start_main_~k~5)) (and .cse8 .cse17 .cse25) (and .cse19 .cse26 (<= 35 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 92 ULTIMATE.start_main_~k~5) .cse23) (and .cse27 .cse4 .cse21) (and .cse7 .cse4 .cse14) (and .cse2 .cse28 (<= 1 ULTIMATE.start_main_~k~5) .cse4) (and .cse29 .cse21 .cse8) (and .cse1 (<= 64 ULTIMATE.start_main_~k~5) .cse21) (and .cse13 (<= 87 ULTIMATE.start_main_~k~5) .cse14) (and .cse17 (<= 24 ULTIMATE.start_main_~k~5) .cse1) (and .cse27 .cse8 .cse12) (and (<= 89 ULTIMATE.start_main_~k~5) .cse18 .cse14) (and .cse2 .cse4 .cse22 (<= 4 ULTIMATE.start_main_~k~5)) (and .cse6 (<= 47 ULTIMATE.start_main_~k~5) .cse13) (and .cse18 (<= 79 ULTIMATE.start_main_~k~5) .cse12) (and .cse30 (<= 19 ULTIMATE.start_main_~k~5) .cse9 .cse4) (and .cse0 .cse5 (<= 93 ULTIMATE.start_main_~k~5)) (and .cse19 (<= 34 ULTIMATE.start_main_~k~5) .cse1) (and .cse20 .cse21 (<= 66 ULTIMATE.start_main_~k~5)) (and (<= 56 ULTIMATE.start_main_~k~5) .cse20 .cse16) (and .cse19 .cse5 (<= 33 ULTIMATE.start_main_~k~5)) (and .cse2 .cse31 .cse4 (<= 8 ULTIMATE.start_main_~k~5)) (and (<= 65 ULTIMATE.start_main_~k~5) .cse21 .cse26) (and (<= 45 ULTIMATE.start_main_~k~5) .cse6 .cse26) (and (<= 81 ULTIMATE.start_main_~k~5) .cse15 .cse14) (and .cse18 (<= 69 ULTIMATE.start_main_~k~5) .cse21) (and .cse19 (<= 38 ULTIMATE.start_main_~k~5) .cse11) (and .cse4 .cse12 .cse32) (and .cse2 (<= 3 ULTIMATE.start_main_~k~5) .cse33 .cse4) (and (<= 46 ULTIMATE.start_main_~k~5) .cse20 .cse6) (and .cse9 .cse4 (<= 12 ULTIMATE.start_main_~k~5) .cse34) (and .cse17 .cse23 (<= 22 ULTIMATE.start_main_~k~5)) (and .cse35 .cse16 .cse8) (and (<= 32 ULTIMATE.start_main_~k~5) .cse19 .cse23) (and .cse2 (<= 6 ULTIMATE.start_main_~k~5) .cse4 .cse10) (and .cse16 .cse29 .cse4) (and .cse6 (<= 48 ULTIMATE.start_main_~k~5) .cse11) (and .cse31 (<= 18 ULTIMATE.start_main_~k~5) .cse9 .cse4) (and .cse2 .cse36 .cse4) (and .cse17 .cse13 (<= 27 ULTIMATE.start_main_~k~5)) (and .cse0 .cse26 (<= 95 ULTIMATE.start_main_~k~5)) (and .cse26 .cse17 (<= 25 ULTIMATE.start_main_~k~5)) (and .cse16 .cse23 (<= 52 ULTIMATE.start_main_~k~5)) (and .cse2 .cse30 .cse4 (<= 9 ULTIMATE.start_main_~k~5)) (and .cse28 .cse9 (<= 11 ULTIMATE.start_main_~k~5) .cse4) (and .cse6 .cse1 (<= 44 ULTIMATE.start_main_~k~5)) (and .cse36 .cse9 .cse3 .cse4) (and .cse17 (<= 26 ULTIMATE.start_main_~k~5) .cse20) (and .cse6 .cse18 (<= 49 ULTIMATE.start_main_~k~5)) (and .cse25 .cse9 .cse4) (and (<= 84 ULTIMATE.start_main_~k~5) .cse1 .cse14) (and .cse17 .cse4 .cse37) (and .cse35 .cse6 .cse4) (and (<= 41 ULTIMATE.start_main_~k~5) .cse6 .cse15) (and (<= 82 ULTIMATE.start_main_~k~5) .cse23 .cse14) (and .cse0 (<= 100 ULTIMATE.start_main_~k~5) .cse4) (and .cse11 .cse16 (<= 58 ULTIMATE.start_main_~k~5)) (and .cse2 .cse38 .cse4 (<= 5 ULTIMATE.start_main_~k~5)) (and (<= 76 ULTIMATE.start_main_~k~5) .cse20 .cse12) (and .cse17 (<= 23 ULTIMATE.start_main_~k~5) .cse5) (and .cse24 .cse19 .cse4) (and .cse21 .cse13 (<= 67 ULTIMATE.start_main_~k~5)) (and .cse16 (<= 57 ULTIMATE.start_main_~k~5) .cse13) (and .cse9 .cse4 (<= 17 ULTIMATE.start_main_~k~5) .cse39) (and .cse26 .cse16 (<= 55 ULTIMATE.start_main_~k~5)) (and .cse23 .cse21 (<= 62 ULTIMATE.start_main_~k~5)) (and (<= 42 ULTIMATE.start_main_~k~5) .cse6 .cse23) (and .cse8 .cse14 .cse32) (and (<= 73 ULTIMATE.start_main_~k~5) .cse12 .cse5) (and .cse20 .cse14 (<= 86 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 7 ULTIMATE.start_main_~k~5) .cse4 .cse39) (and .cse26 .cse12 (<= 75 ULTIMATE.start_main_~k~5)) (and .cse0 .cse20 (<= 96 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 2 ULTIMATE.start_main_~k~5) .cse4 .cse34) (and .cse19 .cse8 .cse37) (and (<= 77 ULTIMATE.start_main_~k~5) .cse13 .cse12) (and .cse16 (<= 59 ULTIMATE.start_main_~k~5) .cse18) (and .cse9 (<= 15 ULTIMATE.start_main_~k~5) .cse38 .cse4) (and .cse9 (<= 13 ULTIMATE.start_main_~k~5) .cse33 .cse4) (and .cse26 (<= 85 ULTIMATE.start_main_~k~5) .cse14) (and .cse5 .cse21 (<= 63 ULTIMATE.start_main_~k~5))))) [2018-09-26 08:19:28,907 INFO L422 ceAbstractionStarter]: At program point L44(lines 44 49) the Hoare annotation is: false [2018-09-26 08:19:28,915 INFO L422 ceAbstractionStarter]: At program point L70(lines 48 70) the Hoare annotation is: (let ((.cse33 (<= (+ ULTIMATE.start_main_~j~5 7) ULTIMATE.start_main_~m~5)) (.cse38 (<= (+ ULTIMATE.start_main_~j~5 5) ULTIMATE.start_main_~m~5)) (.cse30 (<= (+ ULTIMATE.start_main_~j~5 1) ULTIMATE.start_main_~m~5)) (.cse39 (<= (+ ULTIMATE.start_main_~j~5 3) ULTIMATE.start_main_~m~5)) (.cse3 (<= (+ ULTIMATE.start_main_~j~5 10) ULTIMATE.start_main_~m~5)) (.cse10 (<= (+ ULTIMATE.start_main_~j~5 4) ULTIMATE.start_main_~m~5)) (.cse34 (<= (+ ULTIMATE.start_main_~j~5 8) ULTIMATE.start_main_~m~5)) (.cse31 (<= (+ ULTIMATE.start_main_~j~5 2) ULTIMATE.start_main_~m~5)) (.cse28 (<= (+ ULTIMATE.start_main_~j~5 9) ULTIMATE.start_main_~m~5)) (.cse4 (<= 10 ULTIMATE.start_main_~m~5)) (.cse22 (<= (+ ULTIMATE.start_main_~j~5 6) ULTIMATE.start_main_~m~5))) (let ((.cse7 (<= 90 ULTIMATE.start_main_~k~5)) (.cse27 (<= 70 ULTIMATE.start_main_~k~5)) (.cse29 (<= 60 ULTIMATE.start_main_~k~5)) (.cse36 (<= 10 ULTIMATE.start_main_~k~5)) (.cse25 (<= 20 ULTIMATE.start_main_~k~5)) (.cse1 (and .cse4 .cse22)) (.cse35 (<= 50 ULTIMATE.start_main_~k~5)) (.cse15 (and .cse28 .cse4)) (.cse11 (and .cse31 .cse4)) (.cse17 (<= (+ ULTIMATE.start_main_~i~5 8) ULTIMATE.start_main_~n~5)) (.cse24 (<= 40 ULTIMATE.start_main_~k~5)) (.cse6 (<= (+ ULTIMATE.start_main_~i~5 6) ULTIMATE.start_main_~n~5)) (.cse23 (and .cse4 .cse34)) (.cse32 (<= 80 ULTIMATE.start_main_~k~5)) (.cse0 (<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5)) (.cse20 (and .cse4 .cse10)) (.cse2 (<= (+ ULTIMATE.start_main_~i~5 10) ULTIMATE.start_main_~n~5)) (.cse19 (<= (+ ULTIMATE.start_main_~i~5 7) ULTIMATE.start_main_~n~5)) (.cse8 (and .cse3 .cse4)) (.cse37 (<= 30 ULTIMATE.start_main_~k~5)) (.cse13 (and .cse4 .cse39)) (.cse12 (<= (+ ULTIMATE.start_main_~i~5 3) ULTIMATE.start_main_~n~5)) (.cse16 (<= (+ ULTIMATE.start_main_~i~5 5) ULTIMATE.start_main_~n~5)) (.cse18 (and .cse30 .cse4)) (.cse9 (<= (+ ULTIMATE.start_main_~i~5 9) ULTIMATE.start_main_~n~5)) (.cse26 (and .cse38 .cse4)) (.cse14 (<= (+ ULTIMATE.start_main_~i~5 2) ULTIMATE.start_main_~n~5)) (.cse5 (and .cse33 .cse4)) (.cse21 (<= (+ ULTIMATE.start_main_~i~5 4) ULTIMATE.start_main_~n~5))) (or (and .cse0 .cse1 (<= 94 ULTIMATE.start_main_~k~5)) (and .cse2 .cse3 (<= 0 ULTIMATE.start_main_~k~5) .cse4) (and .cse5 .cse6 (<= 43 ULTIMATE.start_main_~k~5)) (and .cse0 .cse7 .cse8) (and .cse9 (<= 16 ULTIMATE.start_main_~k~5) .cse4 .cse10) (and (<= 78 ULTIMATE.start_main_~k~5) .cse11 .cse12) (and .cse0 .cse13 (<= 97 ULTIMATE.start_main_~k~5)) (and (<= 88 ULTIMATE.start_main_~k~5) .cse11 .cse14) (and .cse5 (<= 83 ULTIMATE.start_main_~k~5) .cse14) (and .cse15 .cse16 (<= 51 ULTIMATE.start_main_~k~5)) (and .cse17 (<= 29 ULTIMATE.start_main_~k~5) .cse18) (and .cse17 (<= 28 ULTIMATE.start_main_~k~5) .cse11) (and (<= 71 ULTIMATE.start_main_~k~5) .cse15 .cse12) (and .cse19 .cse20 (<= 36 ULTIMATE.start_main_~k~5)) (and .cse0 .cse15 (<= 91 ULTIMATE.start_main_~k~5)) (and (<= 74 ULTIMATE.start_main_~k~5) .cse12 .cse1) (and .cse11 .cse21 (<= 68 ULTIMATE.start_main_~k~5)) (and .cse15 .cse17 (<= 21 ULTIMATE.start_main_~k~5)) (and .cse9 (<= 14 ULTIMATE.start_main_~k~5) .cse4 .cse22) (and (<= 61 ULTIMATE.start_main_~k~5) .cse15 .cse21) (and .cse15 .cse19 (<= 31 ULTIMATE.start_main_~k~5)) (and .cse19 .cse18 (<= 39 ULTIMATE.start_main_~k~5)) (and (<= 72 ULTIMATE.start_main_~k~5) .cse23 .cse12) (and .cse0 (<= 99 ULTIMATE.start_main_~k~5) .cse18) (and .cse5 (<= 53 ULTIMATE.start_main_~k~5) .cse16) (and .cse0 (<= 98 ULTIMATE.start_main_~k~5) .cse11) (and (<= 54 ULTIMATE.start_main_~k~5) .cse16 .cse1) (and .cse8 .cse24 .cse6) (and .cse13 .cse19 (<= 37 ULTIMATE.start_main_~k~5)) (and .cse8 .cse17 .cse25) (and .cse19 .cse26 (<= 35 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 92 ULTIMATE.start_main_~k~5) .cse23) (and .cse27 .cse4 .cse21) (and .cse7 .cse4 .cse14) (and .cse2 .cse28 (<= 1 ULTIMATE.start_main_~k~5) .cse4) (and .cse29 .cse21 .cse8) (and .cse1 (<= 64 ULTIMATE.start_main_~k~5) .cse21) (and .cse13 (<= 87 ULTIMATE.start_main_~k~5) .cse14) (and .cse17 (<= 24 ULTIMATE.start_main_~k~5) .cse1) (and .cse27 .cse8 .cse12) (and (<= 89 ULTIMATE.start_main_~k~5) .cse18 .cse14) (and .cse2 .cse4 .cse22 (<= 4 ULTIMATE.start_main_~k~5)) (and .cse6 (<= 47 ULTIMATE.start_main_~k~5) .cse13) (and .cse18 (<= 79 ULTIMATE.start_main_~k~5) .cse12) (and .cse30 (<= 19 ULTIMATE.start_main_~k~5) .cse9 .cse4) (and .cse0 .cse5 (<= 93 ULTIMATE.start_main_~k~5)) (and .cse19 (<= 34 ULTIMATE.start_main_~k~5) .cse1) (and .cse20 .cse21 (<= 66 ULTIMATE.start_main_~k~5)) (and (<= 56 ULTIMATE.start_main_~k~5) .cse20 .cse16) (and .cse19 .cse5 (<= 33 ULTIMATE.start_main_~k~5)) (and .cse2 .cse31 .cse4 (<= 8 ULTIMATE.start_main_~k~5)) (and (<= 65 ULTIMATE.start_main_~k~5) .cse21 .cse26) (and (<= 45 ULTIMATE.start_main_~k~5) .cse6 .cse26) (and (<= 81 ULTIMATE.start_main_~k~5) .cse15 .cse14) (and .cse18 (<= 69 ULTIMATE.start_main_~k~5) .cse21) (and .cse19 (<= 38 ULTIMATE.start_main_~k~5) .cse11) (and .cse4 .cse12 .cse32) (and .cse2 (<= 3 ULTIMATE.start_main_~k~5) .cse33 .cse4) (and (<= 46 ULTIMATE.start_main_~k~5) .cse20 .cse6) (and .cse9 .cse4 (<= 12 ULTIMATE.start_main_~k~5) .cse34) (and .cse17 .cse23 (<= 22 ULTIMATE.start_main_~k~5)) (and .cse35 .cse16 .cse8) (and (<= 32 ULTIMATE.start_main_~k~5) .cse19 .cse23) (and .cse2 (<= 6 ULTIMATE.start_main_~k~5) .cse4 .cse10) (and .cse16 .cse29 .cse4) (and .cse6 (<= 48 ULTIMATE.start_main_~k~5) .cse11) (and .cse31 (<= 18 ULTIMATE.start_main_~k~5) .cse9 .cse4) (and .cse2 .cse36 .cse4) (and .cse17 .cse13 (<= 27 ULTIMATE.start_main_~k~5)) (and .cse0 .cse26 (<= 95 ULTIMATE.start_main_~k~5)) (and .cse26 .cse17 (<= 25 ULTIMATE.start_main_~k~5)) (and .cse16 .cse23 (<= 52 ULTIMATE.start_main_~k~5)) (and .cse2 .cse30 .cse4 (<= 9 ULTIMATE.start_main_~k~5)) (and .cse28 .cse9 (<= 11 ULTIMATE.start_main_~k~5) .cse4) (and .cse6 .cse1 (<= 44 ULTIMATE.start_main_~k~5)) (and .cse36 .cse9 .cse3 .cse4) (and .cse17 (<= 26 ULTIMATE.start_main_~k~5) .cse20) (and .cse6 .cse18 (<= 49 ULTIMATE.start_main_~k~5)) (and .cse25 .cse9 .cse4) (and (<= 84 ULTIMATE.start_main_~k~5) .cse1 .cse14) (and .cse17 .cse4 .cse37) (and .cse35 .cse6 .cse4) (and (<= 41 ULTIMATE.start_main_~k~5) .cse6 .cse15) (and (<= 82 ULTIMATE.start_main_~k~5) .cse23 .cse14) (and .cse0 (<= 100 ULTIMATE.start_main_~k~5) .cse4) (and .cse11 .cse16 (<= 58 ULTIMATE.start_main_~k~5)) (and .cse2 .cse38 .cse4 (<= 5 ULTIMATE.start_main_~k~5)) (and (<= 76 ULTIMATE.start_main_~k~5) .cse20 .cse12) (and .cse17 (<= 23 ULTIMATE.start_main_~k~5) .cse5) (and .cse24 .cse19 .cse4) (and .cse21 .cse13 (<= 67 ULTIMATE.start_main_~k~5)) (and .cse16 (<= 57 ULTIMATE.start_main_~k~5) .cse13) (and .cse9 .cse4 (<= 17 ULTIMATE.start_main_~k~5) .cse39) (and .cse26 .cse16 (<= 55 ULTIMATE.start_main_~k~5)) (and .cse23 .cse21 (<= 62 ULTIMATE.start_main_~k~5)) (and (<= 42 ULTIMATE.start_main_~k~5) .cse6 .cse23) (and .cse8 .cse14 .cse32) (and (<= 73 ULTIMATE.start_main_~k~5) .cse12 .cse5) (and .cse20 .cse14 (<= 86 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 7 ULTIMATE.start_main_~k~5) .cse4 .cse39) (and .cse26 .cse12 (<= 75 ULTIMATE.start_main_~k~5)) (and .cse0 .cse20 (<= 96 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 2 ULTIMATE.start_main_~k~5) .cse4 .cse34) (and .cse19 .cse8 .cse37) (and (<= 77 ULTIMATE.start_main_~k~5) .cse13 .cse12) (and .cse16 (<= 59 ULTIMATE.start_main_~k~5) .cse18) (and .cse9 (<= 15 ULTIMATE.start_main_~k~5) .cse38 .cse4) (and .cse9 (<= 13 ULTIMATE.start_main_~k~5) .cse33 .cse4) (and .cse26 (<= 85 ULTIMATE.start_main_~k~5) .cse14) (and .cse5 .cse21 (<= 63 ULTIMATE.start_main_~k~5))))) [2018-09-26 08:19:28,916 INFO L422 ceAbstractionStarter]: At program point L34(lines 34 45) the Hoare annotation is: (let ((.cse0 (<= 10 ULTIMATE.start_main_~m~5))) (or (and (<= 70 ULTIMATE.start_main_~k~5) .cse0 (<= (+ ULTIMATE.start_main_~i~5 3) ULTIMATE.start_main_~n~5)) (and (<= (+ ULTIMATE.start_main_~i~5 10) ULTIMATE.start_main_~n~5) (<= 0 ULTIMATE.start_main_~k~5) .cse0) (and (<= (+ ULTIMATE.start_main_~i~5 7) ULTIMATE.start_main_~n~5) .cse0 (<= 30 ULTIMATE.start_main_~k~5)) (and (<= 100 ULTIMATE.start_main_~k~5) .cse0) (and .cse0 (<= (+ ULTIMATE.start_main_~i~5 2) ULTIMATE.start_main_~n~5) (<= 80 ULTIMATE.start_main_~k~5)) (and (<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5) (<= 90 ULTIMATE.start_main_~k~5) .cse0) (and (<= (+ ULTIMATE.start_main_~i~5 8) ULTIMATE.start_main_~n~5) (<= 20 ULTIMATE.start_main_~k~5) .cse0) (and (<= 60 ULTIMATE.start_main_~k~5) .cse0 (<= (+ ULTIMATE.start_main_~i~5 4) ULTIMATE.start_main_~n~5)) (and (<= 50 ULTIMATE.start_main_~k~5) (<= (+ ULTIMATE.start_main_~i~5 5) ULTIMATE.start_main_~n~5) .cse0) (and (<= 40 ULTIMATE.start_main_~k~5) (<= (+ ULTIMATE.start_main_~i~5 6) ULTIMATE.start_main_~n~5) .cse0) (and (<= 10 ULTIMATE.start_main_~k~5) (<= (+ ULTIMATE.start_main_~i~5 9) ULTIMATE.start_main_~n~5) .cse0))) [2018-09-26 08:19:28,982 INFO L202 PluginConnector]: Adding new model nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:19:28 BoogieIcfgContainer [2018-09-26 08:19:28,982 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:19:28,983 INFO L168 Benchmark]: Toolchain (without parser) took 129935.78 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -436.1 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-09-26 08:19:28,985 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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:19:28,985 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.75 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:19:28,986 INFO L168 Benchmark]: Boogie Preprocessor took 21.36 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:19:28,986 INFO L168 Benchmark]: RCFGBuilder took 314.79 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:19:28,987 INFO L168 Benchmark]: TraceAbstraction took 129552.06 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -446.7 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-09-26 08:19:28,991 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.19 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 39.75 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 21.36 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 314.79 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 129552.06 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -446.7 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: 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: 53]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5) && 94 <= main_~k~5) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 10 <= main_~m~5) && 0 <= main_~k~5) && 10 <= main_~m~5)) || (((main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 6 <= main_~n~5) && 43 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 90 <= main_~k~5) && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5)) || (((main_~i~5 + 9 <= main_~n~5 && 16 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 4 <= main_~m~5)) || ((78 <= main_~k~5 && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && 97 <= main_~k~5)) || ((88 <= main_~k~5 && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && 83 <= main_~k~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5) && 51 <= main_~k~5)) || ((main_~i~5 + 8 <= main_~n~5 && 29 <= main_~k~5) && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 28 <= main_~k~5) && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5)) || ((71 <= main_~k~5 && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 7 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && 36 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && 91 <= main_~k~5)) || ((74 <= main_~k~5 && main_~i~5 + 3 <= main_~n~5) && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5)) || (((main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 68 <= main_~k~5)) || (((main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 8 <= main_~n~5) && 21 <= main_~k~5)) || (((main_~i~5 + 9 <= main_~n~5 && 14 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 6 <= main_~m~5)) || ((61 <= main_~k~5 && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5)) || (((main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 7 <= main_~n~5) && 31 <= main_~k~5)) || ((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && 39 <= main_~k~5)) || ((72 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 1 <= main_~n~5 && 99 <= main_~k~5) && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5)) || (((main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && 53 <= main_~k~5) && main_~i~5 + 5 <= main_~n~5)) || ((main_~i~5 + 1 <= main_~n~5 && 98 <= main_~k~5) && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5)) || ((54 <= main_~k~5 && main_~i~5 + 5 <= main_~n~5) && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5)) || (((main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && 40 <= main_~k~5) && main_~i~5 + 6 <= main_~n~5)) || (((10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && main_~i~5 + 7 <= main_~n~5) && 37 <= main_~k~5)) || (((main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 8 <= main_~n~5) && 20 <= main_~k~5)) || ((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && 35 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 92 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5)) || ((70 <= main_~k~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5)) || ((90 <= main_~k~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 9 <= main_~m~5) && 1 <= main_~k~5) && 10 <= main_~m~5)) || ((60 <= main_~k~5 && main_~i~5 + 4 <= main_~n~5) && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5)) || (((10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5) && 64 <= main_~k~5) && main_~i~5 + 4 <= main_~n~5)) || (((10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && 87 <= main_~k~5) && main_~i~5 + 2 <= main_~n~5)) || ((main_~i~5 + 8 <= main_~n~5 && 24 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5)) || ((70 <= main_~k~5 && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((89 <= main_~k~5 && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~i~5 + 10 <= main_~n~5 && 10 <= main_~m~5) && main_~j~5 + 6 <= main_~m~5) && 4 <= main_~k~5)) || ((main_~i~5 + 6 <= main_~n~5 && 47 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5)) || (((main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && 79 <= main_~k~5) && main_~i~5 + 3 <= main_~n~5)) || (((main_~j~5 + 1 <= main_~m~5 && 19 <= main_~k~5) && main_~i~5 + 9 <= main_~n~5) && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && 93 <= main_~k~5)) || ((main_~i~5 + 7 <= main_~n~5 && 34 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5)) || (((10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 66 <= main_~k~5)) || ((56 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5)) || ((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && 33 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 2 <= main_~m~5) && 10 <= main_~m~5) && 8 <= main_~k~5)) || ((65 <= main_~k~5 && main_~i~5 + 4 <= main_~n~5) && main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5)) || ((45 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5)) || ((81 <= main_~k~5 && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && 69 <= main_~k~5) && main_~i~5 + 4 <= main_~n~5)) || ((main_~i~5 + 7 <= main_~n~5 && 38 <= main_~k~5) && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5)) || ((10 <= main_~m~5 && main_~i~5 + 3 <= main_~n~5) && 80 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && 3 <= main_~k~5) && main_~j~5 + 7 <= main_~m~5) && 10 <= main_~m~5)) || ((46 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 6 <= main_~n~5)) || (((main_~i~5 + 9 <= main_~n~5 && 10 <= main_~m~5) && 12 <= main_~k~5) && main_~j~5 + 8 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && 22 <= main_~k~5)) || ((50 <= main_~k~5 && main_~i~5 + 5 <= main_~n~5) && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5)) || ((32 <= main_~k~5 && main_~i~5 + 7 <= main_~n~5) && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5)) || (((main_~i~5 + 10 <= main_~n~5 && 6 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 4 <= main_~m~5)) || ((main_~i~5 + 5 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 6 <= main_~n~5 && 48 <= main_~k~5) && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5)) || (((main_~j~5 + 2 <= main_~m~5 && 18 <= main_~k~5) && main_~i~5 + 9 <= main_~n~5) && 10 <= main_~m~5)) || ((main_~i~5 + 10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && 27 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && 95 <= main_~k~5)) || (((main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 8 <= main_~n~5) && 25 <= main_~k~5)) || ((main_~i~5 + 5 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && 52 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 1 <= main_~m~5) && 10 <= main_~m~5) && 9 <= main_~k~5)) || (((main_~j~5 + 9 <= main_~m~5 && main_~i~5 + 9 <= main_~n~5) && 11 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 6 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5) && 44 <= main_~k~5)) || (((10 <= main_~k~5 && main_~i~5 + 9 <= main_~n~5) && main_~j~5 + 10 <= main_~m~5) && 10 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 26 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5)) || ((main_~i~5 + 6 <= main_~n~5 && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && 49 <= main_~k~5)) || ((20 <= main_~k~5 && main_~i~5 + 9 <= main_~n~5) && 10 <= main_~m~5)) || ((84 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || ((main_~i~5 + 8 <= main_~n~5 && 10 <= main_~m~5) && 30 <= main_~k~5)) || ((50 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && 10 <= main_~m~5)) || ((41 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5)) || ((82 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || ((main_~i~5 + 1 <= main_~n~5 && 100 <= main_~k~5) && 10 <= main_~m~5)) || (((main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5) && 58 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5) && 5 <= main_~k~5)) || ((76 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 8 <= main_~n~5 && 23 <= main_~k~5) && main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5)) || ((40 <= main_~k~5 && main_~i~5 + 7 <= main_~n~5) && 10 <= main_~m~5)) || ((main_~i~5 + 4 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && 67 <= main_~k~5)) || ((main_~i~5 + 5 <= main_~n~5 && 57 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5)) || (((main_~i~5 + 9 <= main_~n~5 && 10 <= main_~m~5) && 17 <= main_~k~5) && main_~j~5 + 3 <= main_~m~5)) || (((main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5) && 55 <= main_~k~5)) || (((10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 62 <= main_~k~5)) || ((42 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5)) || (((main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5) && 80 <= main_~k~5)) || ((73 <= main_~k~5 && main_~i~5 + 3 <= main_~n~5) && main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5)) || (((10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5) && 86 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && 7 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 3 <= main_~m~5)) || (((main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && 75 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && 96 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && 2 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 8 <= main_~m~5)) || ((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && 30 <= main_~k~5)) || ((77 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 5 <= main_~n~5 && 59 <= main_~k~5) && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5)) || (((main_~i~5 + 9 <= main_~n~5 && 15 <= main_~k~5) && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5)) || (((main_~i~5 + 9 <= main_~n~5 && 13 <= main_~k~5) && main_~j~5 + 7 <= main_~m~5) && 10 <= main_~m~5)) || (((main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && 85 <= main_~k~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 63 <= main_~k~5) - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5) && 94 <= main_~k~5) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 10 <= main_~m~5) && 0 <= main_~k~5) && 10 <= main_~m~5)) || (((main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 6 <= main_~n~5) && 43 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 90 <= main_~k~5) && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5)) || (((main_~i~5 + 9 <= main_~n~5 && 16 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 4 <= main_~m~5)) || ((78 <= main_~k~5 && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && 97 <= main_~k~5)) || ((88 <= main_~k~5 && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && 83 <= main_~k~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5) && 51 <= main_~k~5)) || ((main_~i~5 + 8 <= main_~n~5 && 29 <= main_~k~5) && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 28 <= main_~k~5) && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5)) || ((71 <= main_~k~5 && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 7 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && 36 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && 91 <= main_~k~5)) || ((74 <= main_~k~5 && main_~i~5 + 3 <= main_~n~5) && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5)) || (((main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 68 <= main_~k~5)) || (((main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 8 <= main_~n~5) && 21 <= main_~k~5)) || (((main_~i~5 + 9 <= main_~n~5 && 14 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 6 <= main_~m~5)) || ((61 <= main_~k~5 && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5)) || (((main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 7 <= main_~n~5) && 31 <= main_~k~5)) || ((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && 39 <= main_~k~5)) || ((72 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 1 <= main_~n~5 && 99 <= main_~k~5) && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5)) || (((main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && 53 <= main_~k~5) && main_~i~5 + 5 <= main_~n~5)) || ((main_~i~5 + 1 <= main_~n~5 && 98 <= main_~k~5) && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5)) || ((54 <= main_~k~5 && main_~i~5 + 5 <= main_~n~5) && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5)) || (((main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && 40 <= main_~k~5) && main_~i~5 + 6 <= main_~n~5)) || (((10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && main_~i~5 + 7 <= main_~n~5) && 37 <= main_~k~5)) || (((main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 8 <= main_~n~5) && 20 <= main_~k~5)) || ((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && 35 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 92 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5)) || ((70 <= main_~k~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5)) || ((90 <= main_~k~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 9 <= main_~m~5) && 1 <= main_~k~5) && 10 <= main_~m~5)) || ((60 <= main_~k~5 && main_~i~5 + 4 <= main_~n~5) && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5)) || (((10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5) && 64 <= main_~k~5) && main_~i~5 + 4 <= main_~n~5)) || (((10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && 87 <= main_~k~5) && main_~i~5 + 2 <= main_~n~5)) || ((main_~i~5 + 8 <= main_~n~5 && 24 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5)) || ((70 <= main_~k~5 && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((89 <= main_~k~5 && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~i~5 + 10 <= main_~n~5 && 10 <= main_~m~5) && main_~j~5 + 6 <= main_~m~5) && 4 <= main_~k~5)) || ((main_~i~5 + 6 <= main_~n~5 && 47 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5)) || (((main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && 79 <= main_~k~5) && main_~i~5 + 3 <= main_~n~5)) || (((main_~j~5 + 1 <= main_~m~5 && 19 <= main_~k~5) && main_~i~5 + 9 <= main_~n~5) && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && 93 <= main_~k~5)) || ((main_~i~5 + 7 <= main_~n~5 && 34 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5)) || (((10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 66 <= main_~k~5)) || ((56 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5)) || ((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && 33 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 2 <= main_~m~5) && 10 <= main_~m~5) && 8 <= main_~k~5)) || ((65 <= main_~k~5 && main_~i~5 + 4 <= main_~n~5) && main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5)) || ((45 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5)) || ((81 <= main_~k~5 && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && 69 <= main_~k~5) && main_~i~5 + 4 <= main_~n~5)) || ((main_~i~5 + 7 <= main_~n~5 && 38 <= main_~k~5) && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5)) || ((10 <= main_~m~5 && main_~i~5 + 3 <= main_~n~5) && 80 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && 3 <= main_~k~5) && main_~j~5 + 7 <= main_~m~5) && 10 <= main_~m~5)) || ((46 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 6 <= main_~n~5)) || (((main_~i~5 + 9 <= main_~n~5 && 10 <= main_~m~5) && 12 <= main_~k~5) && main_~j~5 + 8 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && 22 <= main_~k~5)) || ((50 <= main_~k~5 && main_~i~5 + 5 <= main_~n~5) && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5)) || ((32 <= main_~k~5 && main_~i~5 + 7 <= main_~n~5) && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5)) || (((main_~i~5 + 10 <= main_~n~5 && 6 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 4 <= main_~m~5)) || ((main_~i~5 + 5 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 6 <= main_~n~5 && 48 <= main_~k~5) && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5)) || (((main_~j~5 + 2 <= main_~m~5 && 18 <= main_~k~5) && main_~i~5 + 9 <= main_~n~5) && 10 <= main_~m~5)) || ((main_~i~5 + 10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && 27 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && 95 <= main_~k~5)) || (((main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 8 <= main_~n~5) && 25 <= main_~k~5)) || ((main_~i~5 + 5 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && 52 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 1 <= main_~m~5) && 10 <= main_~m~5) && 9 <= main_~k~5)) || (((main_~j~5 + 9 <= main_~m~5 && main_~i~5 + 9 <= main_~n~5) && 11 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 6 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5) && 44 <= main_~k~5)) || (((10 <= main_~k~5 && main_~i~5 + 9 <= main_~n~5) && main_~j~5 + 10 <= main_~m~5) && 10 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 26 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5)) || ((main_~i~5 + 6 <= main_~n~5 && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && 49 <= main_~k~5)) || ((20 <= main_~k~5 && main_~i~5 + 9 <= main_~n~5) && 10 <= main_~m~5)) || ((84 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || ((main_~i~5 + 8 <= main_~n~5 && 10 <= main_~m~5) && 30 <= main_~k~5)) || ((50 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && 10 <= main_~m~5)) || ((41 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5)) || ((82 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || ((main_~i~5 + 1 <= main_~n~5 && 100 <= main_~k~5) && 10 <= main_~m~5)) || (((main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5) && 58 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5) && 5 <= main_~k~5)) || ((76 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 8 <= main_~n~5 && 23 <= main_~k~5) && main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5)) || ((40 <= main_~k~5 && main_~i~5 + 7 <= main_~n~5) && 10 <= main_~m~5)) || ((main_~i~5 + 4 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && 67 <= main_~k~5)) || ((main_~i~5 + 5 <= main_~n~5 && 57 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5)) || (((main_~i~5 + 9 <= main_~n~5 && 10 <= main_~m~5) && 17 <= main_~k~5) && main_~j~5 + 3 <= main_~m~5)) || (((main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5) && 55 <= main_~k~5)) || (((10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 62 <= main_~k~5)) || ((42 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5)) || (((main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5) && 80 <= main_~k~5)) || ((73 <= main_~k~5 && main_~i~5 + 3 <= main_~n~5) && main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5)) || (((10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5) && 86 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && 7 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 3 <= main_~m~5)) || (((main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && 75 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && 96 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && 2 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 8 <= main_~m~5)) || ((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && 30 <= main_~k~5)) || ((77 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 5 <= main_~n~5 && 59 <= main_~k~5) && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5)) || (((main_~i~5 + 9 <= main_~n~5 && 15 <= main_~k~5) && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5)) || (((main_~i~5 + 9 <= main_~n~5 && 13 <= main_~k~5) && main_~j~5 + 7 <= main_~m~5) && 10 <= main_~m~5)) || (((main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && 85 <= main_~k~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 63 <= main_~k~5) - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((((((70 <= main_~k~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) || ((main_~i~5 + 10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 7 <= main_~n~5 && 10 <= main_~m~5) && 30 <= main_~k~5)) || (100 <= main_~k~5 && 10 <= main_~m~5)) || ((10 <= main_~m~5 && main_~i~5 + 2 <= main_~n~5) && 80 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 90 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 20 <= main_~k~5) && 10 <= main_~m~5)) || ((60 <= main_~k~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5)) || ((50 <= main_~k~5 && main_~i~5 + 5 <= main_~n~5) && 10 <= main_~m~5)) || ((40 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && 10 <= main_~m~5)) || ((10 <= main_~k~5 && main_~i~5 + 9 <= main_~n~5) && 10 <= main_~m~5) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((((((70 <= main_~k~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) || ((main_~i~5 + 10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 7 <= main_~n~5 && 10 <= main_~m~5) && 30 <= main_~k~5)) || (100 <= main_~k~5 && 10 <= main_~m~5)) || ((10 <= main_~m~5 && main_~i~5 + 2 <= main_~n~5) && 80 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 90 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 20 <= main_~k~5) && 10 <= main_~m~5)) || ((60 <= main_~k~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5)) || ((50 <= main_~k~5 && main_~i~5 + 5 <= main_~n~5) && 10 <= main_~m~5)) || ((40 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && 10 <= main_~m~5)) || ((10 <= main_~k~5 && main_~i~5 + 9 <= main_~n~5) && 10 <= main_~m~5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. SAFE Result, 129.4s OverallTime, 21 OverallIterations, 110 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 120.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 497 SDtfs, 552 SDslu, 771 SDs, 0 SdLazy, 542 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 297 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=245occurred 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.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 178 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10239 NumberOfFragments, 4061 HoareAnnotationTreeSize, 7 FomulaSimplifications, 4073768 FormulaSimplificationTreeSizeReduction, 106.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 652974 FormulaSimplificationTreeSizeReductionInter, 13.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1534 NumberOfCodeBlocks, 1534 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1513 ConstructedInterpolants, 0 QuantifiedInterpolants, 1037761 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 17070/46770 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/nested.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-19-29-008.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-19-29-008.csv Received shutdown request...