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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 23:37:33,759 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 23:37:33,761 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 23:37:33,773 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 23:37:33,773 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 23:37:33,775 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 23:37:33,776 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 23:37:33,778 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 23:37:33,779 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 23:37:33,780 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 23:37:33,781 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 23:37:33,781 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 23:37:33,782 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 23:37:33,783 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 23:37:33,784 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 23:37:33,785 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 23:37:33,785 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 23:37:33,787 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 23:37:33,789 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 23:37:33,791 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 23:37:33,792 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 23:37:33,793 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 23:37:33,795 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 23:37:33,796 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 23:37:33,796 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 23:37:33,797 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 23:37:33,798 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 23:37:33,799 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 23:37:33,799 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 23:37:33,801 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 23:37:33,801 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 23:37:33,801 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 23:37:33,802 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 23:37:33,802 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 23:37:33,803 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 23:37:33,804 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 23:37:33,804 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 23:37:33,820 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 23:37:33,821 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 23:37:33,821 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 23:37:33,822 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 23:37:33,822 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 23:37:33,822 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 23:37:33,823 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 23:37:33,823 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 23:37:33,823 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 23:37:33,823 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 23:37:33,823 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 23:37:33,824 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 23:37:33,824 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 23:37:33,824 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 23:37:33,824 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 23:37:33,824 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 23:37:33,825 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 23:37:33,825 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 23:37:33,825 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 23:37:33,825 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 23:37:33,825 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 23:37:33,826 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 23:37:33,826 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:37:33,826 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 23:37:33,826 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 23:37:33,826 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 23:37:33,827 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 23:37:33,827 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 23:37:33,827 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 23:37:33,827 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 23:37:33,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 23:37:33,894 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 23:37:33,899 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 23:37:33,901 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 23:37:33,901 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 23:37:33,902 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-30 23:37:33,902 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested.i_4.bpl' [2018-09-30 23:37:33,949 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 23:37:33,952 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 23:37:33,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 23:37:33,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 23:37:33,953 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 23:37:33,974 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 30.09 11:37:33" (1/1) ... [2018-09-30 23:37:33,983 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 30.09 11:37:33" (1/1) ... [2018-09-30 23:37:33,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 23:37:33,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 23:37:33,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 23:37:33,990 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 23:37:33,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:37:33" (1/1) ... [2018-09-30 23:37:33,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:37:33" (1/1) ... [2018-09-30 23:37:34,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:37:33" (1/1) ... [2018-09-30 23:37:34,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:37:33" (1/1) ... [2018-09-30 23:37:34,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:37:33" (1/1) ... [2018-09-30 23:37:34,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:37:33" (1/1) ... [2018-09-30 23:37:34,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:37:33" (1/1) ... [2018-09-30 23:37:34,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 23:37:34,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 23:37:34,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 23:37:34,008 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 23:37:34,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:37:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:37:34,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 23:37:34,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 23:37:34,275 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 23:37:34,276 INFO L202 PluginConnector]: Adding new model nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:37:34 BoogieIcfgContainer [2018-09-30 23:37:34,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 23:37:34,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 23:37:34,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 23:37:34,281 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 23:37:34,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:37:33" (1/2) ... [2018-09-30 23:37:34,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab54df1 and model type nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 11:37:34, skipping insertion in model container [2018-09-30 23:37:34,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:37:34" (2/2) ... [2018-09-30 23:37:34,284 INFO L112 eAbstractionObserver]: Analyzing ICFG nested.i_4.bpl [2018-09-30 23:37:34,294 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 23:37:34,302 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 23:37:34,352 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 23:37:34,353 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 23:37:34,354 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 23:37:34,354 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 23:37:34,354 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 23:37:34,354 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 23:37:34,354 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 23:37:34,355 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 23:37:34,355 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 23:37:34,370 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-09-30 23:37:34,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 23:37:34,376 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:34,377 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-30 23:37:34,378 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:34,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-09-30 23:37:34,387 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:34,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:34,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:34,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:37:34,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:34,592 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-30 23:37:34,595 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:37:34,595 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:37:34,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:37:34,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:37:34,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:37:34,620 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-09-30 23:37:34,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:34,711 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2018-09-30 23:37:34,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:37:34,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-30 23:37:34,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:34,724 INFO L225 Difference]: With dead ends: 17 [2018-09-30 23:37:34,724 INFO L226 Difference]: Without dead ends: 11 [2018-09-30 23:37:34,728 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-30 23:37:34,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-30 23:37:34,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-09-30 23:37:34,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-30 23:37:34,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-09-30 23:37:34,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 4 [2018-09-30 23:37:34,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:34,784 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-09-30 23:37:34,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:37:34,785 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-09-30 23:37:34,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:37:34,785 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:34,785 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-30 23:37:34,786 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:34,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:34,786 INFO L82 PathProgramCache]: Analyzing trace with hash 209100445, now seen corresponding path program 1 times [2018-09-30 23:37:34,787 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:34,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:34,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:34,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:37:34,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:34,957 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-30 23:37:34,958 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:37:34,958 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:37:34,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 23:37:34,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 23:37:34,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 23:37:34,961 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2018-09-30 23:37:35,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:35,064 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-09-30 23:37:35,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 23:37:35,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-09-30 23:37:35,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:35,065 INFO L225 Difference]: With dead ends: 17 [2018-09-30 23:37:35,066 INFO L226 Difference]: Without dead ends: 11 [2018-09-30 23:37:35,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:37:35,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-30 23:37:35,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-30 23:37:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-30 23:37:35,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-09-30 23:37:35,071 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-09-30 23:37:35,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:35,071 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-09-30 23:37:35,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 23:37:35,072 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-09-30 23:37:35,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 23:37:35,072 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:35,072 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 23:37:35,073 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:35,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:35,073 INFO L82 PathProgramCache]: Analyzing trace with hash -850198025, now seen corresponding path program 1 times [2018-09-30 23:37:35,073 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:35,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:35,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:35,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:37:35,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:35,178 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-30 23:37:35,178 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:37:35,178 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:37:35,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:37:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:35,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:35,308 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-30 23:37:35,331 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:35,332 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-30 23:37:35,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:37:35,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:37:35,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:37:35,333 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 7 states. [2018-09-30 23:37:35,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:35,403 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-09-30 23:37:35,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 23:37:35,404 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-09-30 23:37:35,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:35,405 INFO L225 Difference]: With dead ends: 21 [2018-09-30 23:37:35,405 INFO L226 Difference]: Without dead ends: 13 [2018-09-30 23:37:35,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:37:35,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-30 23:37:35,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-30 23:37:35,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-30 23:37:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-09-30 23:37:35,413 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-09-30 23:37:35,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:35,414 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-09-30 23:37:35,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:37:35,414 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-09-30 23:37:35,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:37:35,415 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:35,415 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 23:37:35,416 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:35,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:35,416 INFO L82 PathProgramCache]: Analyzing trace with hash -928778543, now seen corresponding path program 2 times [2018-09-30 23:37:35,416 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:35,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:35,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:35,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:37:35,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:35,615 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-30 23:37:35,615 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:37:35,616 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:37:35,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 23:37:35,660 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 23:37:35,661 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:37:35,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-30 23:37:35,752 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:35,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2018-09-30 23:37:35,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:37:35,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:37:35,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:37:35,754 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 8 states. [2018-09-30 23:37:35,926 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-30 23:37:36,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:36,396 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-09-30 23:37:36,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 23:37:36,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 23:37:36,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:36,399 INFO L225 Difference]: With dead ends: 43 [2018-09-30 23:37:36,399 INFO L226 Difference]: Without dead ends: 33 [2018-09-30 23:37:36,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:37:36,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-30 23:37:36,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-09-30 23:37:36,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-30 23:37:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-09-30 23:37:36,411 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2018-09-30 23:37:36,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:36,411 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-09-30 23:37:36,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:37:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-09-30 23:37:36,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 23:37:36,413 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:36,413 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 3, 2, 2, 1, 1, 1] [2018-09-30 23:37:36,413 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:36,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:36,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1778757007, now seen corresponding path program 3 times [2018-09-30 23:37:36,414 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:36,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:36,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:36,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:37:36,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-30 23:37:36,590 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:37:36,590 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:37:36,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 23:37:36,635 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-30 23:37:36,635 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:37:36,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-09-30 23:37:36,967 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:36,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-09-30 23:37:36,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:37:36,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:37:36,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:37:36,969 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 10 states. [2018-09-30 23:37:37,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:37,570 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-09-30 23:37:37,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 23:37:37,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-09-30 23:37:37,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:37,576 INFO L225 Difference]: With dead ends: 65 [2018-09-30 23:37:37,576 INFO L226 Difference]: Without dead ends: 51 [2018-09-30 23:37:37,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2018-09-30 23:37:37,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-30 23:37:37,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2018-09-30 23:37:37,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-30 23:37:37,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-09-30 23:37:37,588 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 24 [2018-09-30 23:37:37,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:37,589 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-09-30 23:37:37,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:37:37,589 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-09-30 23:37:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-30 23:37:37,590 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:37,590 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 4, 3, 3, 1, 1, 1] [2018-09-30 23:37:37,591 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:37,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:37,591 INFO L82 PathProgramCache]: Analyzing trace with hash 209827969, now seen corresponding path program 4 times [2018-09-30 23:37:37,591 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:37,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:37,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:37,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:37:37,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:37,832 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 106 proven. 20 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-09-30 23:37:37,833 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:37:37,833 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:37:37,843 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 23:37:37,873 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 23:37:37,874 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:37:37,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 106 proven. 20 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-09-30 23:37:37,977 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:37,977 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-09-30 23:37:37,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 23:37:37,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 23:37:37,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-09-30 23:37:37,979 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 13 states. [2018-09-30 23:37:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:38,029 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-09-30 23:37:38,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 23:37:38,030 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-09-30 23:37:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:38,031 INFO L225 Difference]: With dead ends: 75 [2018-09-30 23:37:38,031 INFO L226 Difference]: Without dead ends: 47 [2018-09-30 23:37:38,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-09-30 23:37:38,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-30 23:37:38,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-30 23:37:38,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-30 23:37:38,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-09-30 23:37:38,045 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 40 [2018-09-30 23:37:38,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:38,046 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-09-30 23:37:38,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 23:37:38,046 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-09-30 23:37:38,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-30 23:37:38,047 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:38,047 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 4, 3, 3, 1, 1, 1] [2018-09-30 23:37:38,048 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:38,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:38,048 INFO L82 PathProgramCache]: Analyzing trace with hash -254509681, now seen corresponding path program 5 times [2018-09-30 23:37:38,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:38,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:38,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:38,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:37:38,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 150 proven. 30 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-09-30 23:37:38,182 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:37:38,183 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:37:38,200 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 23:37:38,257 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-09-30 23:37:38,257 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:37:38,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:38,506 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 150 proven. 30 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-09-30 23:37:38,529 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:38,530 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-09-30 23:37:38,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 23:37:38,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 23:37:38,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-09-30 23:37:38,531 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 15 states. [2018-09-30 23:37:38,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:38,584 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-09-30 23:37:38,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 23:37:38,586 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-09-30 23:37:38,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:38,587 INFO L225 Difference]: With dead ends: 85 [2018-09-30 23:37:38,587 INFO L226 Difference]: Without dead ends: 53 [2018-09-30 23:37:38,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-09-30 23:37:38,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-30 23:37:38,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-30 23:37:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-30 23:37:38,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-09-30 23:37:38,603 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 46 [2018-09-30 23:37:38,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:38,603 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-09-30 23:37:38,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 23:37:38,603 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-09-30 23:37:38,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-30 23:37:38,605 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:38,605 INFO L375 BasicCegarLoop]: trace histogram [21, 18, 4, 3, 3, 1, 1, 1] [2018-09-30 23:37:38,605 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:38,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:38,606 INFO L82 PathProgramCache]: Analyzing trace with hash -996261859, now seen corresponding path program 6 times [2018-09-30 23:37:38,606 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:38,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:38,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:38,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:37:38,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 202 proven. 42 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-09-30 23:37:38,760 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:37:38,760 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:37:38,770 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 23:37:38,789 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-09-30 23:37:38,789 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:37:38,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-09-30 23:37:38,911 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:38,911 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2018-09-30 23:37:38,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 23:37:38,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 23:37:38,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:37:38,914 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 14 states. [2018-09-30 23:37:39,379 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-30 23:37:39,673 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-30 23:37:39,952 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-30 23:37:40,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:40,833 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2018-09-30 23:37:40,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-30 23:37:40,834 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2018-09-30 23:37:40,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:40,835 INFO L225 Difference]: With dead ends: 129 [2018-09-30 23:37:40,835 INFO L226 Difference]: Without dead ends: 93 [2018-09-30 23:37:40,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=850, Invalid=1906, Unknown=0, NotChecked=0, Total=2756 [2018-09-30 23:37:40,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-30 23:37:40,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2018-09-30 23:37:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-30 23:37:40,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-09-30 23:37:40,858 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 52 [2018-09-30 23:37:40,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:40,858 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-09-30 23:37:40,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 23:37:40,858 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-09-30 23:37:40,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-30 23:37:40,861 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:40,861 INFO L375 BasicCegarLoop]: trace histogram [32, 28, 5, 4, 4, 1, 1, 1] [2018-09-30 23:37:40,861 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:40,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:40,862 INFO L82 PathProgramCache]: Analyzing trace with hash -252111625, now seen corresponding path program 7 times [2018-09-30 23:37:40,862 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:40,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:40,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:40,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:37:40,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 392 proven. 56 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2018-09-30 23:37:41,157 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:37:41,157 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:37:41,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:37:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:41,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:41,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 392 proven. 56 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2018-09-30 23:37:41,349 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:41,349 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-09-30 23:37:41,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 23:37:41,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 23:37:41,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:37:41,351 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 19 states. [2018-09-30 23:37:41,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:41,691 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2018-09-30 23:37:41,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 23:37:41,691 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2018-09-30 23:37:41,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:41,692 INFO L225 Difference]: With dead ends: 143 [2018-09-30 23:37:41,693 INFO L226 Difference]: Without dead ends: 85 [2018-09-30 23:37:41,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:37:41,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-30 23:37:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-30 23:37:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-30 23:37:41,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-09-30 23:37:41,721 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 76 [2018-09-30 23:37:41,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:41,725 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-09-30 23:37:41,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 23:37:41,726 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-09-30 23:37:41,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-30 23:37:41,729 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:41,729 INFO L375 BasicCegarLoop]: trace histogram [36, 32, 5, 4, 4, 1, 1, 1] [2018-09-30 23:37:41,729 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:41,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:41,730 INFO L82 PathProgramCache]: Analyzing trace with hash 771511391, now seen corresponding path program 8 times [2018-09-30 23:37:41,730 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:41,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:41,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:41,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:37:41,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:41,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 494 proven. 72 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2018-09-30 23:37:41,950 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:37:41,950 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:37:41,960 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 23:37:42,020 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 23:37:42,020 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:37:42,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 494 proven. 72 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2018-09-30 23:37:42,517 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:42,517 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-09-30 23:37:42,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-30 23:37:42,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-30 23:37:42,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2018-09-30 23:37:42,519 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 21 states. [2018-09-30 23:37:42,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:42,571 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2018-09-30 23:37:42,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 23:37:42,576 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 84 [2018-09-30 23:37:42,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:42,577 INFO L225 Difference]: With dead ends: 157 [2018-09-30 23:37:42,577 INFO L226 Difference]: Without dead ends: 93 [2018-09-30 23:37:42,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2018-09-30 23:37:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-30 23:37:42,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-30 23:37:42,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-30 23:37:42,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-09-30 23:37:42,598 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 84 [2018-09-30 23:37:42,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:42,598 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-09-30 23:37:42,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-30 23:37:42,598 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-09-30 23:37:42,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-30 23:37:42,600 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:42,600 INFO L375 BasicCegarLoop]: trace histogram [40, 36, 5, 4, 4, 1, 1, 1] [2018-09-30 23:37:42,600 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:42,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:42,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1630563271, now seen corresponding path program 9 times [2018-09-30 23:37:42,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:42,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:42,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:42,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:37:42,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:42,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 608 proven. 90 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-09-30 23:37:42,776 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:37:42,776 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:37:42,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 23:37:42,877 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-09-30 23:37:42,878 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:37:42,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 608 proven. 90 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-09-30 23:37:43,174 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:43,174 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-09-30 23:37:43,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-30 23:37:43,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-30 23:37:43,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-09-30 23:37:43,175 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 23 states. [2018-09-30 23:37:43,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:43,241 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2018-09-30 23:37:43,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 23:37:43,248 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 92 [2018-09-30 23:37:43,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:43,249 INFO L225 Difference]: With dead ends: 171 [2018-09-30 23:37:43,249 INFO L226 Difference]: Without dead ends: 101 [2018-09-30 23:37:43,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-09-30 23:37:43,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-30 23:37:43,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-30 23:37:43,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-30 23:37:43,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-09-30 23:37:43,267 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 92 [2018-09-30 23:37:43,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:43,267 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-09-30 23:37:43,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-30 23:37:43,267 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-09-30 23:37:43,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-30 23:37:43,269 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:43,269 INFO L375 BasicCegarLoop]: trace histogram [44, 40, 5, 4, 4, 1, 1, 1] [2018-09-30 23:37:43,269 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:43,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:43,270 INFO L82 PathProgramCache]: Analyzing trace with hash -220374225, now seen corresponding path program 10 times [2018-09-30 23:37:43,270 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:43,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:43,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:43,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:37:43,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:43,694 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-30 23:37:43,694 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:37:43,694 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:37:43,703 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 23:37:43,761 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 23:37:43,761 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:37:43,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:43,879 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-30 23:37:43,899 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:43,900 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-09-30 23:37:43,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 23:37:43,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 23:37:43,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-30 23:37:43,901 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 12 states. [2018-09-30 23:37:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:44,049 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-09-30 23:37:44,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 23:37:44,051 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2018-09-30 23:37:44,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:44,052 INFO L225 Difference]: With dead ends: 149 [2018-09-30 23:37:44,052 INFO L226 Difference]: Without dead ends: 147 [2018-09-30 23:37:44,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-30 23:37:44,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-30 23:37:44,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 125. [2018-09-30 23:37:44,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-30 23:37:44,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-09-30 23:37:44,087 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 100 [2018-09-30 23:37:44,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:44,087 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-09-30 23:37:44,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 23:37:44,091 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-09-30 23:37:44,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-30 23:37:44,096 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:44,096 INFO L375 BasicCegarLoop]: trace histogram [55, 50, 6, 5, 5, 1, 1, 1] [2018-09-30 23:37:44,097 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:44,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:44,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1446024969, now seen corresponding path program 11 times [2018-09-30 23:37:44,097 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:44,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:44,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:44,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:37:44,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:44,528 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-30 23:37:44,528 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:37:44,529 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:37:44,536 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 23:37:44,618 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-30 23:37:44,619 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:37:44,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:44,793 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-30 23:37:44,814 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:44,815 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-30 23:37:44,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 23:37:44,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 23:37:44,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:37:44,816 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 14 states. [2018-09-30 23:37:44,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:44,924 INFO L93 Difference]: Finished difference Result 173 states and 180 transitions. [2018-09-30 23:37:44,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 23:37:44,924 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 124 [2018-09-30 23:37:44,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:44,926 INFO L225 Difference]: With dead ends: 173 [2018-09-30 23:37:44,926 INFO L226 Difference]: Without dead ends: 171 [2018-09-30 23:37:44,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:37:44,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-30 23:37:44,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 149. [2018-09-30 23:37:44,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-30 23:37:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 155 transitions. [2018-09-30 23:37:44,955 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 155 transitions. Word has length 124 [2018-09-30 23:37:44,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:44,955 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 155 transitions. [2018-09-30 23:37:44,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 23:37:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2018-09-30 23:37:44,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-30 23:37:44,957 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:44,957 INFO L375 BasicCegarLoop]: trace histogram [66, 60, 7, 6, 6, 1, 1, 1] [2018-09-30 23:37:44,958 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:44,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:44,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1667523811, now seen corresponding path program 12 times [2018-09-30 23:37:44,958 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:44,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:44,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:44,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:37:44,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:45,211 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-30 23:37:45,211 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:37:45,212 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:37:45,221 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 23:37:45,339 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2018-09-30 23:37:45,339 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:37:45,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:45,519 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-30 23:37:45,540 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:45,540 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-09-30 23:37:45,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 23:37:45,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 23:37:45,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-09-30 23:37:45,541 INFO L87 Difference]: Start difference. First operand 149 states and 155 transitions. Second operand 16 states. [2018-09-30 23:37:45,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:45,640 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2018-09-30 23:37:45,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 23:37:45,640 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 148 [2018-09-30 23:37:45,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:45,642 INFO L225 Difference]: With dead ends: 197 [2018-09-30 23:37:45,642 INFO L226 Difference]: Without dead ends: 195 [2018-09-30 23:37:45,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-09-30 23:37:45,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-30 23:37:45,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2018-09-30 23:37:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-30 23:37:45,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 180 transitions. [2018-09-30 23:37:45,675 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 180 transitions. Word has length 148 [2018-09-30 23:37:45,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:45,676 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 180 transitions. [2018-09-30 23:37:45,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 23:37:45,676 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 180 transitions. [2018-09-30 23:37:45,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-30 23:37:45,677 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:45,678 INFO L375 BasicCegarLoop]: trace histogram [77, 70, 8, 7, 7, 1, 1, 1] [2018-09-30 23:37:45,678 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:45,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:45,678 INFO L82 PathProgramCache]: Analyzing trace with hash 107136189, now seen corresponding path program 13 times [2018-09-30 23:37:45,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:45,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:45,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:45,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:37:45,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:45,968 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-30 23:37:45,969 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:37:45,969 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:37:45,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:37:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:46,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:46,262 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-30 23:37:46,283 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:46,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-09-30 23:37:46,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 23:37:46,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 23:37:46,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-09-30 23:37:46,284 INFO L87 Difference]: Start difference. First operand 173 states and 180 transitions. Second operand 18 states. [2018-09-30 23:37:46,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:46,375 INFO L93 Difference]: Finished difference Result 221 states and 230 transitions. [2018-09-30 23:37:46,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 23:37:46,375 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 172 [2018-09-30 23:37:46,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:46,376 INFO L225 Difference]: With dead ends: 221 [2018-09-30 23:37:46,377 INFO L226 Difference]: Without dead ends: 219 [2018-09-30 23:37:46,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-09-30 23:37:46,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-30 23:37:46,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 197. [2018-09-30 23:37:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-30 23:37:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 205 transitions. [2018-09-30 23:37:46,412 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 205 transitions. Word has length 172 [2018-09-30 23:37:46,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:46,413 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 205 transitions. [2018-09-30 23:37:46,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 23:37:46,413 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 205 transitions. [2018-09-30 23:37:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-30 23:37:46,415 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:46,415 INFO L375 BasicCegarLoop]: trace histogram [88, 80, 9, 8, 8, 1, 1, 1] [2018-09-30 23:37:46,415 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:46,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:46,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1927956841, now seen corresponding path program 14 times [2018-09-30 23:37:46,416 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:46,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:46,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:46,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:37:46,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:46,742 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-30 23:37:46,742 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:37:46,742 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:37:46,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 23:37:46,856 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 23:37:46,856 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:37:46,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:47,043 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-30 23:37:47,064 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:47,064 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-09-30 23:37:47,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 23:37:47,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 23:37:47,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-09-30 23:37:47,065 INFO L87 Difference]: Start difference. First operand 197 states and 205 transitions. Second operand 20 states. [2018-09-30 23:37:47,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:47,194 INFO L93 Difference]: Finished difference Result 245 states and 255 transitions. [2018-09-30 23:37:47,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 23:37:47,195 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 196 [2018-09-30 23:37:47,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:47,196 INFO L225 Difference]: With dead ends: 245 [2018-09-30 23:37:47,197 INFO L226 Difference]: Without dead ends: 243 [2018-09-30 23:37:47,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-09-30 23:37:47,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-09-30 23:37:47,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 221. [2018-09-30 23:37:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-30 23:37:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 230 transitions. [2018-09-30 23:37:47,237 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 230 transitions. Word has length 196 [2018-09-30 23:37:47,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:47,238 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 230 transitions. [2018-09-30 23:37:47,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 23:37:47,238 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 230 transitions. [2018-09-30 23:37:47,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-30 23:37:47,240 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:47,240 INFO L375 BasicCegarLoop]: trace histogram [99, 90, 10, 9, 9, 1, 1, 1] [2018-09-30 23:37:47,241 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:47,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:47,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1486407055, now seen corresponding path program 15 times [2018-09-30 23:37:47,241 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:47,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:47,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:47,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:37:47,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:48,472 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-30 23:37:48,472 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:37:48,473 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:37:48,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 23:37:48,627 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-09-30 23:37:48,627 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:37:48,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:37:48,863 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-30 23:37:48,883 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:37:48,883 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-09-30 23:37:48,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-30 23:37:48,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-30 23:37:48,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-30 23:37:48,885 INFO L87 Difference]: Start difference. First operand 221 states and 230 transitions. Second operand 22 states. [2018-09-30 23:37:49,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:49,211 INFO L93 Difference]: Finished difference Result 269 states and 280 transitions. [2018-09-30 23:37:49,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 23:37:49,211 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 220 [2018-09-30 23:37:49,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:49,213 INFO L225 Difference]: With dead ends: 269 [2018-09-30 23:37:49,213 INFO L226 Difference]: Without dead ends: 267 [2018-09-30 23:37:49,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-30 23:37:49,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-09-30 23:37:49,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 245. [2018-09-30 23:37:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-30 23:37:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 255 transitions. [2018-09-30 23:37:49,262 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 255 transitions. Word has length 220 [2018-09-30 23:37:49,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:49,263 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 255 transitions. [2018-09-30 23:37:49,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-30 23:37:49,263 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 255 transitions. [2018-09-30 23:37:49,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-30 23:37:49,264 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:37:49,264 INFO L375 BasicCegarLoop]: trace histogram [110, 100, 11, 10, 10, 1, 1, 1] [2018-09-30 23:37:49,265 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:37:49,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:37:49,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1732333643, now seen corresponding path program 16 times [2018-09-30 23:37:49,265 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:37:49,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:37:49,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:49,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:37:49,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:37:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:37:55,188 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-30 23:37:55,188 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:37:55,189 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-09-30 23:37:55,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-30 23:37:55,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-30 23:37:55,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-30 23:37:55,193 INFO L87 Difference]: Start difference. First operand 245 states and 255 transitions. Second operand 103 states. [2018-09-30 23:37:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:37:58,087 INFO L93 Difference]: Finished difference Result 10235 states and 10695 transitions. [2018-09-30 23:37:58,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-30 23:37:58,088 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 244 [2018-09-30 23:37:58,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:37:58,088 INFO L225 Difference]: With dead ends: 10235 [2018-09-30 23:37:58,088 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 23:37:58,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-30 23:37:58,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 23:37:58,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 23:37:58,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 23:37:58,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 23:37:58,105 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 244 [2018-09-30 23:37:58,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:37:58,106 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 23:37:58,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-30 23:37:58,106 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 23:37:58,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 23:37:58,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 23:38:05,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:05,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:05,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:05,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:05,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:05,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:05,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:05,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:05,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:05,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:05,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:05,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:06,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:06,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:06,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:06,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:07,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:07,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:07,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:07,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:07,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:08,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:08,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:08,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:08,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:09,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:09,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:10,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:10,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:10,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:11,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:11,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:12,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:12,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:12,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:12,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:13,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:13,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:13,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:14,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:14,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:14,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:14,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:15,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:15,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:15,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:15,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:16,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:16,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:16,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:17,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:17,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:18,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:19,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:19,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:20,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:20,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:23,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:25,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:25,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:26,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:26,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:29,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:31,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:31,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:32,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:33,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:36,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:38,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:41,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:43,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:48,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:48,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:38:56,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:22,438 WARN L178 SmtUtils]: Spent 1.41 m on a formula simplification. DAG size of input: 5105 DAG size of output: 1935 [2018-09-30 23:39:27,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:27,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:27,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:27,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:27,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:27,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:27,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:28,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:28,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:28,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:28,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:28,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:28,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:28,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:28,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:28,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:28,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:29,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:29,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:29,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:29,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:30,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:30,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:30,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:30,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:33,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:33,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:34,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:34,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:35,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:35,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:35,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:35,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:36,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:36,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:36,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:36,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:37,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:37,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:37,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:37,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:37,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:37,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:38,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:38,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:39,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:40,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:40,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:41,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:41,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:43,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:46,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:46,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:47,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:47,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:50,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:51,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:51,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:52,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:53,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:56,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:58,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:01,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:08,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:08,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:16,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:42,403 WARN L178 SmtUtils]: Spent 1.33 m on a formula simplification. DAG size of input: 5105 DAG size of output: 1935 [2018-09-30 23:40:43,391 WARN L178 SmtUtils]: Spent 984.00 ms on a formula simplification. DAG size of input: 673 DAG size of output: 664 [2018-09-30 23:40:44,464 WARN L178 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 673 DAG size of output: 664 [2018-09-30 23:41:59,586 WARN L178 SmtUtils]: Spent 1.25 m on a formula simplification. DAG size of input: 1932 DAG size of output: 362 [2018-09-30 23:43:13,139 WARN L178 SmtUtils]: Spent 1.23 m on a formula simplification. DAG size of input: 1932 DAG size of output: 362 [2018-09-30 23:43:19,649 WARN L178 SmtUtils]: Spent 6.50 s on a formula simplification. DAG size of input: 664 DAG size of output: 59 [2018-09-30 23:43:26,081 WARN L178 SmtUtils]: Spent 6.43 s on a formula simplification. DAG size of input: 664 DAG size of output: 59 [2018-09-30 23:43:26,084 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 71) no Hoare annotation was computed. [2018-09-30 23:43:26,084 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 71) no Hoare annotation was computed. [2018-09-30 23:43:26,085 INFO L422 ceAbstractionStarter]: At program point L61(lines 31 61) the Hoare annotation is: (let ((.cse0 (<= 10 ULTIMATE.start_main_~n~5)) (.cse1 (<= 10 ULTIMATE.start_main_~m~5))) (or (and .cse0 (<= 0 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 0)) (and .cse0 (<= 60 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 6)) (and .cse0 (<= 50 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 5) .cse1) (and (<= 100 ULTIMATE.start_main_~k~5) .cse1) (and .cse0 (<= 20 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 2) .cse1) (and .cse0 (<= 90 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 9) .cse1) (and .cse0 (<= ULTIMATE.start_main_~i~5 8) .cse1 (<= 80 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 40 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 4) .cse1) (and .cse0 (<= 70 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 7)) (and .cse0 (<= ULTIMATE.start_main_~i~5 3) .cse1 (<= 30 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 10 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 1)))) [2018-09-30 23:43:26,085 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 71) no Hoare annotation was computed. [2018-09-30 23:43:26,087 INFO L422 ceAbstractionStarter]: At program point L53(lines 53 62) the Hoare annotation is: (let ((.cse17 (<= ULTIMATE.start_main_~j~5 5)) (.cse10 (<= ULTIMATE.start_main_~j~5 9)) (.cse20 (<= ULTIMATE.start_main_~j~5 7)) (.cse33 (<= ULTIMATE.start_main_~j~5 8)) (.cse19 (<= ULTIMATE.start_main_~j~5 3)) (.cse25 (<= ULTIMATE.start_main_~j~5 6)) (.cse21 (<= ULTIMATE.start_main_~j~5 2)) (.cse8 (<= ULTIMATE.start_main_~j~5 4)) (.cse11 (<= ULTIMATE.start_main_~j~5 1)) (.cse4 (<= 10 ULTIMATE.start_main_~m~5)) (.cse32 (<= ULTIMATE.start_main_~j~5 0))) (let ((.cse28 (<= 90 ULTIMATE.start_main_~k~5)) (.cse36 (<= 50 ULTIMATE.start_main_~k~5)) (.cse3 (<= 20 ULTIMATE.start_main_~k~5)) (.cse14 (<= 80 ULTIMATE.start_main_~k~5)) (.cse31 (<= 40 ULTIMATE.start_main_~k~5)) (.cse6 (<= 70 ULTIMATE.start_main_~k~5)) (.cse29 (and .cse4 .cse32)) (.cse24 (and .cse11 .cse4)) (.cse34 (<= 60 ULTIMATE.start_main_~k~5)) (.cse35 (<= 30 ULTIMATE.start_main_~k~5)) (.cse18 (<= ULTIMATE.start_main_~i~5 4)) (.cse26 (<= ULTIMATE.start_main_~i~5 8)) (.cse22 (and .cse8 .cse4)) (.cse37 (and .cse4 .cse21)) (.cse5 (<= ULTIMATE.start_main_~i~5 1)) (.cse9 (<= ULTIMATE.start_main_~i~5 2)) (.cse39 (and .cse25 .cse4)) (.cse1 (and .cse19 .cse4)) (.cse15 (<= ULTIMATE.start_main_~i~5 7)) (.cse23 (<= ULTIMATE.start_main_~i~5 5)) (.cse16 (and .cse33 .cse4)) (.cse30 (and .cse20 .cse4)) (.cse40 (<= 10 ULTIMATE.start_main_~k~5)) (.cse12 (<= ULTIMATE.start_main_~i~5 0)) (.cse38 (and .cse4 .cse10)) (.cse0 (<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5)) (.cse27 (and .cse17 .cse4)) (.cse7 (<= ULTIMATE.start_main_~i~5 6)) (.cse2 (<= 10 ULTIMATE.start_main_~n~5)) (.cse13 (<= ULTIMATE.start_main_~i~5 3))) (or (and (and .cse0 .cse1) (<= 93 ULTIMATE.start_main_~k~5)) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse4 .cse6 .cse7) (and .cse2 .cse8 .cse9 (<= 24 ULTIMATE.start_main_~k~5) .cse4) (and .cse2 (<= 19 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse10) (and .cse2 (<= 1 ULTIMATE.start_main_~k~5) .cse11 .cse4 .cse12) (and .cse2 .cse13 .cse4 .cse10 (<= 39 ULTIMATE.start_main_~k~5)) (and .cse2 .cse4 .cse14 .cse15) (and .cse2 .cse16 (<= 78 ULTIMATE.start_main_~k~5) .cse15) (and .cse2 .cse17 .cse13 .cse4 (<= 35 ULTIMATE.start_main_~k~5)) (and .cse2 .cse4 .cse18 .cse10 (<= 49 ULTIMATE.start_main_~k~5)) (and .cse2 .cse19 .cse13 .cse4 (<= 33 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 7 ULTIMATE.start_main_~k~5) .cse20 .cse4 .cse12) (and .cse2 (<= 32 ULTIMATE.start_main_~k~5) .cse13 .cse4 .cse21) (and .cse2 .cse4 .cse10 (<= 9 ULTIMATE.start_main_~k~5) .cse12) (and (and .cse0 .cse22) (<= 94 ULTIMATE.start_main_~k~5)) (and .cse2 .cse23 (<= 51 ULTIMATE.start_main_~k~5) .cse24) (and .cse2 .cse8 .cse4 (<= 4 ULTIMATE.start_main_~k~5) .cse12) (and .cse2 (<= 3 ULTIMATE.start_main_~k~5) .cse19 .cse4 .cse12) (and .cse2 .cse25 (<= 6 ULTIMATE.start_main_~k~5) .cse4 .cse12) (and .cse2 (<= 41 ULTIMATE.start_main_~k~5) .cse11 .cse4 .cse18) (and .cse2 .cse20 .cse4 (<= 17 ULTIMATE.start_main_~k~5) .cse5) (and .cse2 .cse26 (<= 88 ULTIMATE.start_main_~k~5) .cse16) (and .cse2 (<= 2 ULTIMATE.start_main_~k~5) .cse4 .cse21 .cse12) (and .cse2 .cse9 .cse4 (<= 22 ULTIMATE.start_main_~k~5) .cse21) (and .cse2 .cse27 .cse15 (<= 75 ULTIMATE.start_main_~k~5)) (and .cse2 .cse23 .cse27 (<= 55 ULTIMATE.start_main_~k~5)) (and .cse28 (and .cse0 .cse29)) (and (and .cse0 .cse24) (<= 91 ULTIMATE.start_main_~k~5)) (and .cse2 .cse26 .cse30 (<= 87 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 29 ULTIMATE.start_main_~k~5) .cse9 .cse4 .cse10) (and .cse2 (<= 54 ULTIMATE.start_main_~k~5) .cse23 .cse22) (and .cse2 .cse9 (<= 25 ULTIMATE.start_main_~k~5) .cse17 .cse4) (and .cse2 (<= 12 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse21) (and .cse2 (<= 45 ULTIMATE.start_main_~k~5) .cse17 .cse4 .cse18) (and .cse2 .cse22 (<= 64 ULTIMATE.start_main_~k~5) .cse7) (and .cse2 .cse19 (<= 13 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse2 (<= 71 ULTIMATE.start_main_~k~5) .cse24 .cse15) (and .cse2 .cse25 .cse9 (<= 26 ULTIMATE.start_main_~k~5) .cse4) (and (<= 74 ULTIMATE.start_main_~k~5) .cse2 .cse22 .cse15) (and .cse2 .cse8 .cse18 .cse4 (<= 44 ULTIMATE.start_main_~k~5)) (and .cse2 .cse31 .cse18 .cse4 .cse32) (and .cse2 .cse33 (<= 48 ULTIMATE.start_main_~k~5) .cse4 .cse18) (and .cse2 .cse20 (<= 47 ULTIMATE.start_main_~k~5) .cse18 .cse4) (and .cse2 .cse34 .cse29 .cse7) (and .cse2 .cse9 .cse4 .cse35) (and .cse2 .cse16 .cse7 (<= 68 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 42 ULTIMATE.start_main_~k~5) .cse18 .cse4 .cse21) (and .cse2 .cse26 (<= 81 ULTIMATE.start_main_~k~5) .cse24) (and (and .cse0 .cse30) (<= 97 ULTIMATE.start_main_~k~5)) (and (<= 95 ULTIMATE.start_main_~k~5) (and .cse0 .cse27)) (and .cse2 (<= 18 ULTIMATE.start_main_~k~5) .cse33 .cse4 .cse5) (and .cse2 .cse7 .cse1 (<= 63 ULTIMATE.start_main_~k~5)) (and .cse2 .cse36 .cse18 .cse4) (and .cse2 .cse8 (<= 14 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse2 (<= 77 ULTIMATE.start_main_~k~5) .cse30 .cse15) (and .cse2 .cse9 (<= 21 ULTIMATE.start_main_~k~5) .cse11 .cse4) (and .cse2 (<= 11 ULTIMATE.start_main_~k~5) .cse11 .cse4 .cse5) (and .cse2 .cse26 .cse28 .cse4) (and (and .cse0 .cse37) (<= 92 ULTIMATE.start_main_~k~5)) (and .cse2 .cse29 .cse36 .cse23) (and .cse2 .cse17 .cse4 (<= 5 ULTIMATE.start_main_~k~5) .cse12) (and .cse2 .cse26 (<= 89 ULTIMATE.start_main_~k~5) .cse38) (and .cse2 .cse26 .cse37 (<= 82 ULTIMATE.start_main_~k~5)) (and .cse2 .cse3 .cse9 .cse4 .cse32) (and .cse2 .cse26 .cse29 .cse14) (and .cse2 (<= 72 ULTIMATE.start_main_~k~5) .cse37 .cse15) (and .cse2 .cse33 .cse4 (<= 8 ULTIMATE.start_main_~k~5) .cse12) (and .cse2 .cse25 (<= 16 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse2 .cse26 .cse39 (<= 86 ULTIMATE.start_main_~k~5)) (and .cse2 .cse31 .cse13 .cse4) (and (<= 98 ULTIMATE.start_main_~k~5) (and .cse0 .cse16)) (and .cse2 (<= 79 ULTIMATE.start_main_~k~5) .cse38 .cse15) (and .cse2 .cse23 .cse37 (<= 52 ULTIMATE.start_main_~k~5)) (and .cse2 .cse26 .cse27 (<= 85 ULTIMATE.start_main_~k~5)) (and (and .cse0 .cse38) (<= 99 ULTIMATE.start_main_~k~5)) (and .cse2 .cse17 (<= 15 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse2 .cse9 (<= 27 ULTIMATE.start_main_~k~5) .cse20 .cse4) (and .cse2 (<= 46 ULTIMATE.start_main_~k~5) .cse25 .cse4 .cse18) (and .cse2 (<= 0 ULTIMATE.start_main_~k~5) .cse4 .cse32 .cse12) (and .cse2 .cse6 .cse29 .cse15) (and .cse2 .cse9 .cse33 (<= 28 ULTIMATE.start_main_~k~5) .cse4) (and .cse2 (<= 61 ULTIMATE.start_main_~k~5) .cse24 .cse7) (and .cse2 .cse39 (<= 66 ULTIMATE.start_main_~k~5) .cse7) (and .cse2 .cse13 .cse20 .cse4 (<= 37 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 53 ULTIMATE.start_main_~k~5) .cse23 .cse1) (and .cse2 .cse4 .cse23 .cse34) (and .cse2 .cse33 (<= 38 ULTIMATE.start_main_~k~5) .cse13 .cse4) (and .cse2 .cse13 .cse4 .cse32 .cse35) (and .cse2 .cse19 (<= 43 ULTIMATE.start_main_~k~5) .cse4 .cse18) (and .cse2 .cse8 (<= 34 ULTIMATE.start_main_~k~5) .cse13 .cse4) (and .cse2 .cse26 .cse1 (<= 83 ULTIMATE.start_main_~k~5)) (and .cse2 .cse23 (<= 59 ULTIMATE.start_main_~k~5) .cse38) (and .cse2 .cse25 .cse13 (<= 36 ULTIMATE.start_main_~k~5) .cse4) (and .cse2 .cse23 (<= 57 ULTIMATE.start_main_~k~5) .cse30) (and .cse2 .cse26 (<= 84 ULTIMATE.start_main_~k~5) .cse22) (and .cse2 .cse37 .cse7 (<= 62 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 56 ULTIMATE.start_main_~k~5) .cse23 .cse39) (and .cse2 .cse40 .cse4 .cse32 .cse5) (and .cse2 .cse9 .cse19 (<= 23 ULTIMATE.start_main_~k~5) .cse4) (and .cse2 .cse39 (<= 76 ULTIMATE.start_main_~k~5) .cse15) (and (and .cse0 .cse39) (<= 96 ULTIMATE.start_main_~k~5)) (and .cse2 .cse1 (<= 73 ULTIMATE.start_main_~k~5) .cse15) (and .cse2 .cse23 .cse16 (<= 58 ULTIMATE.start_main_~k~5)) (and .cse2 .cse30 .cse7 (<= 67 ULTIMATE.start_main_~k~5)) (and .cse2 .cse40 .cse4 .cse12) (and .cse2 (<= 69 ULTIMATE.start_main_~k~5) .cse38 .cse7) (and (<= 100 ULTIMATE.start_main_~k~5) (and .cse0 .cse4)) (and .cse2 (<= 65 ULTIMATE.start_main_~k~5) .cse27 .cse7) (and .cse2 .cse13 .cse11 .cse4 (<= 31 ULTIMATE.start_main_~k~5))))) [2018-09-30 23:43:26,087 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 50) no Hoare annotation was computed. [2018-09-30 23:43:26,087 INFO L422 ceAbstractionStarter]: At program point L44(lines 44 49) the Hoare annotation is: false [2018-09-30 23:43:26,088 INFO L422 ceAbstractionStarter]: At program point L70(lines 48 70) the Hoare annotation is: (let ((.cse17 (<= ULTIMATE.start_main_~j~5 5)) (.cse10 (<= ULTIMATE.start_main_~j~5 9)) (.cse20 (<= ULTIMATE.start_main_~j~5 7)) (.cse33 (<= ULTIMATE.start_main_~j~5 8)) (.cse19 (<= ULTIMATE.start_main_~j~5 3)) (.cse25 (<= ULTIMATE.start_main_~j~5 6)) (.cse21 (<= ULTIMATE.start_main_~j~5 2)) (.cse8 (<= ULTIMATE.start_main_~j~5 4)) (.cse11 (<= ULTIMATE.start_main_~j~5 1)) (.cse4 (<= 10 ULTIMATE.start_main_~m~5)) (.cse32 (<= ULTIMATE.start_main_~j~5 0))) (let ((.cse28 (<= 90 ULTIMATE.start_main_~k~5)) (.cse36 (<= 50 ULTIMATE.start_main_~k~5)) (.cse3 (<= 20 ULTIMATE.start_main_~k~5)) (.cse14 (<= 80 ULTIMATE.start_main_~k~5)) (.cse31 (<= 40 ULTIMATE.start_main_~k~5)) (.cse6 (<= 70 ULTIMATE.start_main_~k~5)) (.cse29 (and .cse4 .cse32)) (.cse24 (and .cse11 .cse4)) (.cse34 (<= 60 ULTIMATE.start_main_~k~5)) (.cse35 (<= 30 ULTIMATE.start_main_~k~5)) (.cse18 (<= ULTIMATE.start_main_~i~5 4)) (.cse26 (<= ULTIMATE.start_main_~i~5 8)) (.cse22 (and .cse8 .cse4)) (.cse37 (and .cse4 .cse21)) (.cse5 (<= ULTIMATE.start_main_~i~5 1)) (.cse9 (<= ULTIMATE.start_main_~i~5 2)) (.cse39 (and .cse25 .cse4)) (.cse1 (and .cse19 .cse4)) (.cse15 (<= ULTIMATE.start_main_~i~5 7)) (.cse23 (<= ULTIMATE.start_main_~i~5 5)) (.cse16 (and .cse33 .cse4)) (.cse30 (and .cse20 .cse4)) (.cse40 (<= 10 ULTIMATE.start_main_~k~5)) (.cse12 (<= ULTIMATE.start_main_~i~5 0)) (.cse38 (and .cse4 .cse10)) (.cse0 (<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5)) (.cse27 (and .cse17 .cse4)) (.cse7 (<= ULTIMATE.start_main_~i~5 6)) (.cse2 (<= 10 ULTIMATE.start_main_~n~5)) (.cse13 (<= ULTIMATE.start_main_~i~5 3))) (or (and (and .cse0 .cse1) (<= 93 ULTIMATE.start_main_~k~5)) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse4 .cse6 .cse7) (and .cse2 .cse8 .cse9 (<= 24 ULTIMATE.start_main_~k~5) .cse4) (and .cse2 (<= 19 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse10) (and .cse2 (<= 1 ULTIMATE.start_main_~k~5) .cse11 .cse4 .cse12) (and .cse2 .cse13 .cse4 .cse10 (<= 39 ULTIMATE.start_main_~k~5)) (and .cse2 .cse4 .cse14 .cse15) (and .cse2 .cse16 (<= 78 ULTIMATE.start_main_~k~5) .cse15) (and .cse2 .cse17 .cse13 .cse4 (<= 35 ULTIMATE.start_main_~k~5)) (and .cse2 .cse4 .cse18 .cse10 (<= 49 ULTIMATE.start_main_~k~5)) (and .cse2 .cse19 .cse13 .cse4 (<= 33 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 7 ULTIMATE.start_main_~k~5) .cse20 .cse4 .cse12) (and .cse2 (<= 32 ULTIMATE.start_main_~k~5) .cse13 .cse4 .cse21) (and .cse2 .cse4 .cse10 (<= 9 ULTIMATE.start_main_~k~5) .cse12) (and (and .cse0 .cse22) (<= 94 ULTIMATE.start_main_~k~5)) (and .cse2 .cse23 (<= 51 ULTIMATE.start_main_~k~5) .cse24) (and .cse2 .cse8 .cse4 (<= 4 ULTIMATE.start_main_~k~5) .cse12) (and .cse2 (<= 3 ULTIMATE.start_main_~k~5) .cse19 .cse4 .cse12) (and .cse2 .cse25 (<= 6 ULTIMATE.start_main_~k~5) .cse4 .cse12) (and .cse2 (<= 41 ULTIMATE.start_main_~k~5) .cse11 .cse4 .cse18) (and .cse2 .cse20 .cse4 (<= 17 ULTIMATE.start_main_~k~5) .cse5) (and .cse2 .cse26 (<= 88 ULTIMATE.start_main_~k~5) .cse16) (and .cse2 (<= 2 ULTIMATE.start_main_~k~5) .cse4 .cse21 .cse12) (and .cse2 .cse9 .cse4 (<= 22 ULTIMATE.start_main_~k~5) .cse21) (and .cse2 .cse27 .cse15 (<= 75 ULTIMATE.start_main_~k~5)) (and .cse2 .cse23 .cse27 (<= 55 ULTIMATE.start_main_~k~5)) (and .cse28 (and .cse0 .cse29)) (and (and .cse0 .cse24) (<= 91 ULTIMATE.start_main_~k~5)) (and .cse2 .cse26 .cse30 (<= 87 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 29 ULTIMATE.start_main_~k~5) .cse9 .cse4 .cse10) (and .cse2 (<= 54 ULTIMATE.start_main_~k~5) .cse23 .cse22) (and .cse2 .cse9 (<= 25 ULTIMATE.start_main_~k~5) .cse17 .cse4) (and .cse2 (<= 12 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse21) (and .cse2 (<= 45 ULTIMATE.start_main_~k~5) .cse17 .cse4 .cse18) (and .cse2 .cse22 (<= 64 ULTIMATE.start_main_~k~5) .cse7) (and .cse2 .cse19 (<= 13 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse2 (<= 71 ULTIMATE.start_main_~k~5) .cse24 .cse15) (and .cse2 .cse25 .cse9 (<= 26 ULTIMATE.start_main_~k~5) .cse4) (and (<= 74 ULTIMATE.start_main_~k~5) .cse2 .cse22 .cse15) (and .cse2 .cse8 .cse18 .cse4 (<= 44 ULTIMATE.start_main_~k~5)) (and .cse2 .cse31 .cse18 .cse4 .cse32) (and .cse2 .cse33 (<= 48 ULTIMATE.start_main_~k~5) .cse4 .cse18) (and .cse2 .cse20 (<= 47 ULTIMATE.start_main_~k~5) .cse18 .cse4) (and .cse2 .cse34 .cse29 .cse7) (and .cse2 .cse9 .cse4 .cse35) (and .cse2 .cse16 .cse7 (<= 68 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 42 ULTIMATE.start_main_~k~5) .cse18 .cse4 .cse21) (and .cse2 .cse26 (<= 81 ULTIMATE.start_main_~k~5) .cse24) (and (and .cse0 .cse30) (<= 97 ULTIMATE.start_main_~k~5)) (and (<= 95 ULTIMATE.start_main_~k~5) (and .cse0 .cse27)) (and .cse2 (<= 18 ULTIMATE.start_main_~k~5) .cse33 .cse4 .cse5) (and .cse2 .cse7 .cse1 (<= 63 ULTIMATE.start_main_~k~5)) (and .cse2 .cse36 .cse18 .cse4) (and .cse2 .cse8 (<= 14 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse2 (<= 77 ULTIMATE.start_main_~k~5) .cse30 .cse15) (and .cse2 .cse9 (<= 21 ULTIMATE.start_main_~k~5) .cse11 .cse4) (and .cse2 (<= 11 ULTIMATE.start_main_~k~5) .cse11 .cse4 .cse5) (and .cse2 .cse26 .cse28 .cse4) (and (and .cse0 .cse37) (<= 92 ULTIMATE.start_main_~k~5)) (and .cse2 .cse29 .cse36 .cse23) (and .cse2 .cse17 .cse4 (<= 5 ULTIMATE.start_main_~k~5) .cse12) (and .cse2 .cse26 (<= 89 ULTIMATE.start_main_~k~5) .cse38) (and .cse2 .cse26 .cse37 (<= 82 ULTIMATE.start_main_~k~5)) (and .cse2 .cse3 .cse9 .cse4 .cse32) (and .cse2 .cse26 .cse29 .cse14) (and .cse2 (<= 72 ULTIMATE.start_main_~k~5) .cse37 .cse15) (and .cse2 .cse33 .cse4 (<= 8 ULTIMATE.start_main_~k~5) .cse12) (and .cse2 .cse25 (<= 16 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse2 .cse26 .cse39 (<= 86 ULTIMATE.start_main_~k~5)) (and .cse2 .cse31 .cse13 .cse4) (and (<= 98 ULTIMATE.start_main_~k~5) (and .cse0 .cse16)) (and .cse2 (<= 79 ULTIMATE.start_main_~k~5) .cse38 .cse15) (and .cse2 .cse23 .cse37 (<= 52 ULTIMATE.start_main_~k~5)) (and .cse2 .cse26 .cse27 (<= 85 ULTIMATE.start_main_~k~5)) (and (and .cse0 .cse38) (<= 99 ULTIMATE.start_main_~k~5)) (and .cse2 .cse17 (<= 15 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse2 .cse9 (<= 27 ULTIMATE.start_main_~k~5) .cse20 .cse4) (and .cse2 (<= 46 ULTIMATE.start_main_~k~5) .cse25 .cse4 .cse18) (and .cse2 (<= 0 ULTIMATE.start_main_~k~5) .cse4 .cse32 .cse12) (and .cse2 .cse6 .cse29 .cse15) (and .cse2 .cse9 .cse33 (<= 28 ULTIMATE.start_main_~k~5) .cse4) (and .cse2 (<= 61 ULTIMATE.start_main_~k~5) .cse24 .cse7) (and .cse2 .cse39 (<= 66 ULTIMATE.start_main_~k~5) .cse7) (and .cse2 .cse13 .cse20 .cse4 (<= 37 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 53 ULTIMATE.start_main_~k~5) .cse23 .cse1) (and .cse2 .cse4 .cse23 .cse34) (and .cse2 .cse33 (<= 38 ULTIMATE.start_main_~k~5) .cse13 .cse4) (and .cse2 .cse13 .cse4 .cse32 .cse35) (and .cse2 .cse19 (<= 43 ULTIMATE.start_main_~k~5) .cse4 .cse18) (and .cse2 .cse8 (<= 34 ULTIMATE.start_main_~k~5) .cse13 .cse4) (and .cse2 .cse26 .cse1 (<= 83 ULTIMATE.start_main_~k~5)) (and .cse2 .cse23 (<= 59 ULTIMATE.start_main_~k~5) .cse38) (and .cse2 .cse25 .cse13 (<= 36 ULTIMATE.start_main_~k~5) .cse4) (and .cse2 .cse23 (<= 57 ULTIMATE.start_main_~k~5) .cse30) (and .cse2 .cse26 (<= 84 ULTIMATE.start_main_~k~5) .cse22) (and .cse2 .cse37 .cse7 (<= 62 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 56 ULTIMATE.start_main_~k~5) .cse23 .cse39) (and .cse2 .cse40 .cse4 .cse32 .cse5) (and .cse2 .cse9 .cse19 (<= 23 ULTIMATE.start_main_~k~5) .cse4) (and .cse2 .cse39 (<= 76 ULTIMATE.start_main_~k~5) .cse15) (and (and .cse0 .cse39) (<= 96 ULTIMATE.start_main_~k~5)) (and .cse2 .cse1 (<= 73 ULTIMATE.start_main_~k~5) .cse15) (and .cse2 .cse23 .cse16 (<= 58 ULTIMATE.start_main_~k~5)) (and .cse2 .cse30 .cse7 (<= 67 ULTIMATE.start_main_~k~5)) (and .cse2 .cse40 .cse4 .cse12) (and .cse2 (<= 69 ULTIMATE.start_main_~k~5) .cse38 .cse7) (and (<= 100 ULTIMATE.start_main_~k~5) (and .cse0 .cse4)) (and .cse2 (<= 65 ULTIMATE.start_main_~k~5) .cse27 .cse7) (and .cse2 .cse13 .cse11 .cse4 (<= 31 ULTIMATE.start_main_~k~5))))) [2018-09-30 23:43:26,088 INFO L422 ceAbstractionStarter]: At program point L34(lines 34 45) the Hoare annotation is: (let ((.cse0 (<= 10 ULTIMATE.start_main_~n~5)) (.cse1 (<= 10 ULTIMATE.start_main_~m~5))) (or (and .cse0 (<= 0 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 0)) (and .cse0 (<= 60 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 6)) (and .cse0 (<= 50 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 5) .cse1) (and (<= 100 ULTIMATE.start_main_~k~5) .cse1) (and .cse0 (<= 20 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 2) .cse1) (and .cse0 (<= 90 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 9) .cse1) (and .cse0 (<= ULTIMATE.start_main_~i~5 8) .cse1 (<= 80 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 40 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 4) .cse1) (and .cse0 (<= 70 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 7)) (and .cse0 (<= ULTIMATE.start_main_~i~5 3) .cse1 (<= 30 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 10 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 1)))) [2018-09-30 23:43:26,133 INFO L202 PluginConnector]: Adding new model nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 11:43:26 BoogieIcfgContainer [2018-09-30 23:43:26,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 23:43:26,134 INFO L168 Benchmark]: Toolchain (without parser) took 352184.43 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -184.2 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2018-09-30 23:43:26,135 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-30 23:43:26,136 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.87 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-30 23:43:26,136 INFO L168 Benchmark]: Boogie Preprocessor took 18.26 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-30 23:43:26,137 INFO L168 Benchmark]: RCFGBuilder took 268.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 23:43:26,137 INFO L168 Benchmark]: TraceAbstraction took 351856.11 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -205.3 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2018-09-30 23:43:26,141 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 35.87 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 18.26 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 268.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 351856.11 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -205.3 MB). Peak memory consumption was 3.1 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 && main_~j~5 <= 3 && 10 <= main_~m~5) && 93 <= main_~k~5) || (((10 <= main_~n~5 && 20 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && 70 <= main_~k~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && main_~i~5 <= 2) && 24 <= main_~k~5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 19 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 9)) || ((((10 <= main_~n~5 && 1 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && main_~j~5 <= 9) && 39 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && 80 <= main_~k~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5) && 78 <= main_~k~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && main_~i~5 <= 3) && 10 <= main_~m~5) && 35 <= main_~k~5)) || ((((10 <= main_~n~5 && 10 <= main_~m~5) && main_~i~5 <= 4) && main_~j~5 <= 9) && 49 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && main_~i~5 <= 3) && 10 <= main_~m~5) && 33 <= main_~k~5)) || ((((10 <= main_~n~5 && 7 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && 32 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5) && main_~j~5 <= 2)) || ((((10 <= main_~n~5 && 10 <= main_~m~5) && main_~j~5 <= 9) && 9 <= main_~k~5) && main_~i~5 <= 0)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 94 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 51 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 10 <= main_~m~5) && 4 <= main_~k~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && 3 <= main_~k~5) && main_~j~5 <= 3) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 6 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && 41 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && main_~j~5 <= 7) && 10 <= main_~m~5) && 17 <= main_~k~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 88 <= main_~k~5) && main_~j~5 <= 8 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 2 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 2) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && 22 <= main_~k~5) && main_~j~5 <= 2)) || (((10 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 7) && 75 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && main_~j~5 <= 5 && 10 <= main_~m~5) && 55 <= main_~k~5)) || (90 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 0)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 1 && 10 <= main_~m~5) && 91 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 7 && 10 <= main_~m~5) && 87 <= main_~k~5)) || ((((10 <= main_~n~5 && 29 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 9)) || (((10 <= main_~n~5 && 54 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 4 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 25 <= main_~k~5) && main_~j~5 <= 5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 12 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 2)) || ((((10 <= main_~n~5 && 45 <= main_~k~5) && main_~j~5 <= 5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 64 <= main_~k~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && 13 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 71 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && main_~i~5 <= 2) && 26 <= main_~k~5) && 10 <= main_~m~5)) || (((74 <= main_~k~5 && 10 <= main_~n~5) && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && main_~i~5 <= 4) && 10 <= main_~m~5) && 44 <= main_~k~5)) || ((((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5) && main_~j~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 48 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && main_~j~5 <= 7) && 47 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && 30 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5) && main_~i~5 <= 6) && 68 <= main_~k~5)) || ((((10 <= main_~n~5 && 42 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5) && main_~j~5 <= 2)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 81 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && 97 <= main_~k~5)) || (95 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 18 <= main_~k~5) && main_~j~5 <= 8) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 6) && main_~j~5 <= 3 && 10 <= main_~m~5) && 63 <= main_~k~5)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 14 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 77 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 21 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 11 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 90 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && 92 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 0) && 50 <= main_~k~5) && main_~i~5 <= 5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 10 <= main_~m~5) && 5 <= main_~k~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 89 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5 && main_~j~5 <= 2) && 82 <= main_~k~5)) || ((((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5 && main_~j~5 <= 0) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 72 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 10 <= main_~m~5) && 8 <= main_~k~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 16 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 6 && 10 <= main_~m~5) && 86 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || (98 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 79 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 2) && 52 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 5 && 10 <= main_~m~5) && 85 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && 99 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 15 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 27 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 46 <= main_~k~5) && main_~j~5 <= 6) && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 8) && 28 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 61 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 66 <= main_~k~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 7) && 10 <= main_~m~5) && 37 <= main_~k~5)) || (((10 <= main_~n~5 && 53 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 3 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && main_~i~5 <= 5) && 60 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 38 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && main_~j~5 <= 0) && 30 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && 43 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 34 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 3 && 10 <= main_~m~5) && 83 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 59 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && main_~i~5 <= 3) && 36 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 57 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 84 <= main_~k~5) && main_~j~5 <= 4 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 6) && 62 <= main_~k~5)) || (((10 <= main_~n~5 && 56 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 6 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 3) && 23 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 76 <= main_~k~5) && main_~i~5 <= 7)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 96 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && 73 <= main_~k~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && main_~j~5 <= 8 && 10 <= main_~m~5) && 58 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 6) && 67 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 69 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9) && main_~i~5 <= 6)) || (100 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 65 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 1) && 10 <= main_~m~5) && 31 <= main_~k~5) - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && 93 <= main_~k~5) || (((10 <= main_~n~5 && 20 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && 70 <= main_~k~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && main_~i~5 <= 2) && 24 <= main_~k~5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 19 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 9)) || ((((10 <= main_~n~5 && 1 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && main_~j~5 <= 9) && 39 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && 80 <= main_~k~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5) && 78 <= main_~k~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && main_~i~5 <= 3) && 10 <= main_~m~5) && 35 <= main_~k~5)) || ((((10 <= main_~n~5 && 10 <= main_~m~5) && main_~i~5 <= 4) && main_~j~5 <= 9) && 49 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && main_~i~5 <= 3) && 10 <= main_~m~5) && 33 <= main_~k~5)) || ((((10 <= main_~n~5 && 7 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && 32 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5) && main_~j~5 <= 2)) || ((((10 <= main_~n~5 && 10 <= main_~m~5) && main_~j~5 <= 9) && 9 <= main_~k~5) && main_~i~5 <= 0)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 94 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 51 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 10 <= main_~m~5) && 4 <= main_~k~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && 3 <= main_~k~5) && main_~j~5 <= 3) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 6 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && 41 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && main_~j~5 <= 7) && 10 <= main_~m~5) && 17 <= main_~k~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 88 <= main_~k~5) && main_~j~5 <= 8 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 2 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 2) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && 22 <= main_~k~5) && main_~j~5 <= 2)) || (((10 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 7) && 75 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && main_~j~5 <= 5 && 10 <= main_~m~5) && 55 <= main_~k~5)) || (90 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 0)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 1 && 10 <= main_~m~5) && 91 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 7 && 10 <= main_~m~5) && 87 <= main_~k~5)) || ((((10 <= main_~n~5 && 29 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 9)) || (((10 <= main_~n~5 && 54 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 4 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 25 <= main_~k~5) && main_~j~5 <= 5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 12 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 2)) || ((((10 <= main_~n~5 && 45 <= main_~k~5) && main_~j~5 <= 5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 64 <= main_~k~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && 13 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 71 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && main_~i~5 <= 2) && 26 <= main_~k~5) && 10 <= main_~m~5)) || (((74 <= main_~k~5 && 10 <= main_~n~5) && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && main_~i~5 <= 4) && 10 <= main_~m~5) && 44 <= main_~k~5)) || ((((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5) && main_~j~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 48 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && main_~j~5 <= 7) && 47 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && 30 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5) && main_~i~5 <= 6) && 68 <= main_~k~5)) || ((((10 <= main_~n~5 && 42 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5) && main_~j~5 <= 2)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 81 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && 97 <= main_~k~5)) || (95 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 18 <= main_~k~5) && main_~j~5 <= 8) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 6) && main_~j~5 <= 3 && 10 <= main_~m~5) && 63 <= main_~k~5)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 14 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 77 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 21 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 11 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 90 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && 92 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 0) && 50 <= main_~k~5) && main_~i~5 <= 5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 10 <= main_~m~5) && 5 <= main_~k~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 89 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5 && main_~j~5 <= 2) && 82 <= main_~k~5)) || ((((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5 && main_~j~5 <= 0) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 72 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 10 <= main_~m~5) && 8 <= main_~k~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 16 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 6 && 10 <= main_~m~5) && 86 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || (98 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 79 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 2) && 52 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 5 && 10 <= main_~m~5) && 85 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && 99 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 15 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 27 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 46 <= main_~k~5) && main_~j~5 <= 6) && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 8) && 28 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 61 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 66 <= main_~k~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 7) && 10 <= main_~m~5) && 37 <= main_~k~5)) || (((10 <= main_~n~5 && 53 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 3 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && main_~i~5 <= 5) && 60 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 38 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && main_~j~5 <= 0) && 30 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && 43 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 34 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 3 && 10 <= main_~m~5) && 83 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 59 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && main_~i~5 <= 3) && 36 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 57 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 84 <= main_~k~5) && main_~j~5 <= 4 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 6) && 62 <= main_~k~5)) || (((10 <= main_~n~5 && 56 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 6 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 3) && 23 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 76 <= main_~k~5) && main_~i~5 <= 7)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 96 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && 73 <= main_~k~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && main_~j~5 <= 8 && 10 <= main_~m~5) && 58 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 6) && 67 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 69 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9) && main_~i~5 <= 6)) || (100 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 65 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 1) && 10 <= main_~m~5) && 31 <= main_~k~5) - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 5) && 10 <= main_~m~5)) || (100 <= main_~k~5 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 90 <= main_~k~5) && main_~i~5 <= 9) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && 30 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((((((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 5) && 10 <= main_~m~5)) || (100 <= main_~k~5 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 90 <= main_~k~5) && main_~i~5 <= 9) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && 30 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. SAFE Result, 351.7s OverallTime, 18 OverallIterations, 110 TraceHistogramMax, 7.9s AutomataDifference, 0.0s DeadEndRemovalTime, 327.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 476 SDtfs, 755 SDslu, 870 SDs, 0 SdLazy, 629 SolverSat, 201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1681 GetRequests, 1305 SyntacticMatches, 0 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2175 ImplicationChecksByTransitivity, 14.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=245occurred in iteration=17, 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.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 168 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10237 NumberOfFragments, 3839 HoareAnnotationTreeSize, 5 FomulaSimplifications, 6668782 FormulaSimplificationTreeSizeReduction, 166.3s HoareSimplificationTime, 5 FomulaSimplificationsInter, 252714 FormulaSimplificationTreeSizeReductionInter, 161.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 3048 NumberOfCodeBlocks, 2904 NumberOfCodeBlocksAsserted, 178 NumberOfCheckSat, 3015 ConstructedInterpolants, 0 QuantifiedInterpolants, 2256565 SizeOfPredicates, 30 NumberOfNonLiveVariables, 3673 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 33 InterpolantComputations, 3 PerfectInterpolantSequences, 29572/87282 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_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_23-43-26-161.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested.i_4.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_23-43-26-161.csv Received shutdown request...